{"audit":{"book_prose_copied":false,"issues":[],"native_qa_states_are_claims":true,"projection_policy":{"omitted_fields_retained_in":"hash-bound native backend archive","reverse_whole_monolith_from_projection_claimed":false,"segment_fields":["id","unit_id","parent_id","resource_id","rights_component_id","concept_ids","prerequisite_concept_ids","locale","status","source_target_relationship","translation_state","supersedes_id","source_edition_id","source_locale","source_path","source_line_start","source_line_end","source_content_sha256","source_local_id","source_block_index","target_edition_id","target_locale","target_path","target_line_start","target_line_end","target_content_sha256","target_local_id","target_block_index"],"unit_fields":["id","parent_id","resource_id","edition_id","rights_component_id","concept_ids","prerequisite_concept_ids","locale","status","unit_type","title_source","title_target","order","supersedes_id"]},"segment_text_fields_omitted":["source_text","target_text"],"semantic_canon_review":false,"whole_native_rebuild":false},"concepts":[{"id":"concept.absolute-value-linearization","name_en":"absolute-value linearization","prerequisite_concept_ids":["concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.alternate-optima","name_en":"alternate optimal solutions","prerequisite_concept_ids":["concept.extreme-point-optimality","concept.level-curve"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.artificial-variable","name_en":"artificial variable","prerequisite_concept_ids":["concept.standard-form"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.assignment-fairness","name_en":"max-min and min-max assignment fairness","prerequisite_concept_ids":["concept.assignment-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.assignment-model","name_en":"assignment model","prerequisite_concept_ids":["concept.binary-integer-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.basic-feasible-solution","name_en":"basic feasible solution","prerequisite_concept_ids":["concept.standard-form","concept.linear-independence","concept.corner-point"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.basis-matrix","name_en":"basis matrix","prerequisite_concept_ids":["concept.matrix-rank","concept.basic-feasible-solution"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.big-m-method","name_en":"Big-M method","prerequisite_concept_ids":["concept.artificial-variable","concept.simplex-algorithm"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.big-m-modeling","name_en":"Big-M modeling","prerequisite_concept_ids":["concept.mixed-integer-linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.binary-integer-programming","name_en":"binary integer programming","prerequisite_concept_ids":["concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.bland-rule","name_en":"Bland's anti-cycling rule","prerequisite_concept_ids":["concept.cycling"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.canonical-form","name_en":"canonical form relative to a basis","prerequisite_concept_ids":["concept.standard-form","concept.basic-feasible-solution"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.capital-allocation","name_en":"capital-allocation model","prerequisite_concept_ids":["concept.knapsack-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.compact-indexed-modeling","name_en":"compact indexed modeling","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.complementary-slackness","name_en":"complementary slackness","prerequisite_concept_ids":["concept.strong-duality"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.computational-complexity","name_en":"computational complexity","prerequisite_concept_ids":[],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.conditional-formatting","name_en":"conditional formatting","prerequisite_concept_ids":["concept.spreadsheet-modeling"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.constraint","name_en":"constraint","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.convex-combination","name_en":"convex combination","prerequisite_concept_ids":["concept.linear-combination"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.convex-optimization","name_en":"convex optimization","prerequisite_concept_ids":["concept.nonlinear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.convex-set","name_en":"convex set","prerequisite_concept_ids":["concept.convex-combination"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.corner-point","name_en":"corner point","prerequisite_concept_ids":["concept.feasible-region","concept.linear-independence"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.cycling","name_en":"simplex cycling","prerequisite_concept_ids":["concept.degeneracy","concept.simplex-algorithm"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.data-validation","name_en":"spreadsheet data validation","prerequisite_concept_ids":["concept.spreadsheet-modeling"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.decision-variable","name_en":"decision variable","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.degeneracy","name_en":"simplex degeneracy","prerequisite_concept_ids":["concept.basic-feasible-solution","concept.pivot-operation"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.diet-problem","name_en":"diet problem","prerequisite_concept_ids":["concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.dijkstra-algorithm","name_en":"Dijkstra algorithm","prerequisite_concept_ids":["concept.shortest-path"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.dot-product","name_en":"dot product","prerequisite_concept_ids":["concept.vector-operations"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.dual-formulation","name_en":"dual formulation","prerequisite_concept_ids":["concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.epsilon-constraint-method","name_en":"epsilon-constraint method","prerequisite_concept_ids":["concept.pareto-optimality"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.euler-circuit","name_en":"Euler circuit","prerequisite_concept_ids":["concept.graph-theory"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.excel-solver","name_en":"Excel Solver workflow","prerequisite_concept_ids":["concept.spreadsheet-modeling","concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.expected-value-objective","name_en":"expected-value objective","prerequisite_concept_ids":["concept.objective-function","concept.stochastic-optimization"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.extreme-point-optimality","name_en":"extreme-point optimality","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.facility-location","name_en":"facility location","prerequisite_concept_ids":["concept.binary-integer-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.feasible-region","name_en":"feasible region","prerequisite_concept_ids":["concept.constraint"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.fixed-charge-model","name_en":"fixed-charge model","prerequisite_concept_ids":["concept.binary-integer-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.flow-balance-sign-convention","name_en":"flow-balance sign convention","prerequisite_concept_ids":["concept.flow-conservation"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.flow-conservation","name_en":"network flow conservation","prerequisite_concept_ids":["concept.graph-theory","concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.gaussian-elimination","name_en":"Gaussian elimination","prerequisite_concept_ids":["concept.row-operation"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.graph-coloring","name_en":"graph coloring","prerequisite_concept_ids":["concept.graph-theory","concept.binary-integer-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.graph-theory","name_en":"graph and directed-graph representation","prerequisite_concept_ids":[],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.graphical-lp-method","name_en":"graphical method for two-variable linear programming","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.halfspace","name_en":"halfspace","prerequisite_concept_ids":["concept.linear-programming","concept.convex-set"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.hamilton-circuit","name_en":"Hamilton circuit","prerequisite_concept_ids":["concept.graph-theory"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.infeasible-linear-program","name_en":"infeasible linear program","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.integer-linear-programming","name_en":"integer linear programming","prerequisite_concept_ids":["concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.inventory-balance","name_en":"inventory-balance model","prerequisite_concept_ids":["concept.decision-variable","concept.constraint"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.job-shop-scheduling","name_en":"job-shop scheduling","prerequisite_concept_ids":["concept.mixed-integer-linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.knapsack-model","name_en":"knapsack model","prerequisite_concept_ids":["concept.binary-integer-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.kruskal-algorithm","name_en":"Kruskal algorithm","prerequisite_concept_ids":["concept.minimum-spanning-tree"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.learning-outcomes","name_en":"learning outcomes","prerequisite_concept_ids":[],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.level-curve","name_en":"objective level curve","prerequisite_concept_ids":["concept.objective-function"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.lexicographic-optimization","name_en":"lexicographic optimization","prerequisite_concept_ids":["concept.multiobjective-optimization"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.linear-combination","name_en":"linear combination","prerequisite_concept_ids":["concept.vector-operations"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.linear-independence","name_en":"linear independence","prerequisite_concept_ids":["concept.linear-combination"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.linear-programming","name_en":"linear programming","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.linear-system","name_en":"system of linear equations","prerequisite_concept_ids":["concept.linear-combination"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.logical-binary-constraints","name_en":"logical binary constraints","prerequisite_concept_ids":["concept.binary-integer-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.loss-function","name_en":"loss function","prerequisite_concept_ids":[],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.lp-modeling-assumptions","name_en":"linear-programming modeling assumptions","prerequisite_concept_ids":["concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.machine-learning-optimization","name_en":"optimization in machine learning","prerequisite_concept_ids":["concept.nonlinear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.mathematical-programming","name_en":"mathematical programming","prerequisite_concept_ids":["concept.operations-research"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.matrix-arithmetic","name_en":"matrix arithmetic","prerequisite_concept_ids":["concept.vector-operations"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.matrix-inverse","name_en":"matrix inverse","prerequisite_concept_ids":["concept.matrix-arithmetic","concept.gaussian-elimination"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.matrix-rank","name_en":"matrix rank","prerequisite_concept_ids":["concept.linear-independence"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.maximum-flow","name_en":"maximum flow","prerequisite_concept_ids":["concept.flow-conservation"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.minimum-cut","name_en":"minimum cut","prerequisite_concept_ids":["concept.maximum-flow"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.minimum-spanning-tree","name_en":"minimum spanning tree","prerequisite_concept_ids":["concept.graph-theory"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.mixed-integer-linear-programming","name_en":"mixed-integer linear programming","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.mixed-integer-nonlinear-programming","name_en":"mixed-integer nonlinear programming","prerequisite_concept_ids":["concept.mixed-integer-linear-programming","concept.nonlinear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.model-development-cycle","name_en":"model development cycle","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.modeling","name_en":"modeling","prerequisite_concept_ids":[],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.multi-period-investment","name_en":"multi-period capital investment model","prerequisite_concept_ids":["concept.capital-allocation","concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.multicommodity-flow","name_en":"multicommodity flow","prerequisite_concept_ids":["concept.network-flow","concept.flow-conservation"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.multiobjective-optimization","name_en":"multiobjective optimization","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.network-flow","name_en":"minimum-cost network flow","prerequisite_concept_ids":["concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.nonconvex-optimization","name_en":"nonconvex optimization","prerequisite_concept_ids":["concept.nonlinear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.nonlinear-programming","name_en":"nonlinear programming","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.objective-function","name_en":"objective function","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.open-source-solver","name_en":"open-source optimization solver workflow","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.operations-research","name_en":"operations research","prerequisite_concept_ids":[],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.optimization","name_en":"optimization","prerequisite_concept_ids":[],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.optimization-model","name_en":"optimization model","prerequisite_concept_ids":["concept.mathematical-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.pareto-optimality","name_en":"Pareto optimality","prerequisite_concept_ids":["concept.multiobjective-optimization"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.partitioned-variables","name_en":"basic and nonbasic variable partition","prerequisite_concept_ids":["concept.basis-matrix"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.phase-one","name_en":"simplex Phase I","prerequisite_concept_ids":["concept.simplex-algorithm","concept.artificial-variable"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.pivot-operation","name_en":"simplex pivot operation","prerequisite_concept_ids":["concept.canonical-form","concept.basic-feasible-solution"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.polyhedron","name_en":"polyhedron","prerequisite_concept_ids":["concept.halfspace","concept.feasible-region"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.prim-algorithm","name_en":"Prim algorithm","prerequisite_concept_ids":["concept.minimum-spanning-tree"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.production-planning","name_en":"production-planning model","prerequisite_concept_ids":["concept.linear-programming","concept.inventory-balance"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.pyomo-modeling","name_en":"Pyomo modeling","prerequisite_concept_ids":["concept.python-optimization-workflow"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.python-optimization-workflow","name_en":"Python optimization workflow","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.recession-direction","name_en":"recession direction","prerequisite_concept_ids":["concept.feasible-region","concept.unbounded-linear-program"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.recession-ray","name_en":"recession ray","prerequisite_concept_ids":["concept.polyhedron","concept.recession-direction"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.reduced-cost","name_en":"reduced cost","prerequisite_concept_ids":["concept.sensitivity-analysis"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.reduced-row-echelon-form","name_en":"reduced row echelon form","prerequisite_concept_ids":["concept.gaussian-elimination"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.representation-theorem","name_en":"polyhedral representation theorem","prerequisite_concept_ids":["concept.polyhedron","concept.convex-combination","concept.recession-ray"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.reproducible-computation","name_en":"reproducible computation","prerequisite_concept_ids":[],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.robust-optimization","name_en":"robust optimization","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.row-operation","name_en":"elementary row operation","prerequisite_concept_ids":["concept.linear-system"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.sensitivity-analysis","name_en":"linear-programming sensitivity analysis","prerequisite_concept_ids":["concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.set-cover","name_en":"set cover","prerequisite_concept_ids":["concept.binary-integer-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.shadow-price","name_en":"shadow price","prerequisite_concept_ids":["concept.sensitivity-analysis"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.short-selling","name_en":"short selling","prerequisite_concept_ids":["concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.shortest-path","name_en":"shortest path","prerequisite_concept_ids":["concept.graph-theory"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.simplex-algorithm","name_en":"simplex algorithm","prerequisite_concept_ids":["concept.pivot-operation","concept.extreme-point-optimality"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.simplex-optimality-condition","name_en":"simplex reduced-cost optimality condition","prerequisite_concept_ids":["concept.reduced-cost","concept.basic-feasible-solution"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.simplex-tableau","name_en":"simplex tableau","prerequisite_concept_ids":["concept.simplex-algorithm","concept.canonical-form"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.solver","name_en":"solver","prerequisite_concept_ids":["concept.optimization"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.spreadsheet-formula","name_en":"spreadsheet formula","prerequisite_concept_ids":["concept.spreadsheet-modeling"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.spreadsheet-modeling","name_en":"spreadsheet modeling","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.standard-form","name_en":"linear-program standard form","prerequisite_concept_ids":["concept.linear-programming","concept.linear-combination"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.stochastic-optimization","name_en":"stochastic optimization","prerequisite_concept_ids":["concept.optimization-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.strong-duality","name_en":"strong duality","prerequisite_concept_ids":["concept.weak-duality"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.summation-notation","name_en":"summation notation","prerequisite_concept_ids":[],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.total-unimodularity","name_en":"total unimodularity and integral network polyhedra","prerequisite_concept_ids":["concept.linear-programming","concept.assignment-model"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.transportation-model","name_en":"transportation model","prerequisite_concept_ids":["concept.linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.transshipment","name_en":"transshipment model","prerequisite_concept_ids":["concept.network-flow","concept.flow-conservation"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.traveling-salesperson","name_en":"traveling salesperson problem","prerequisite_concept_ids":["concept.hamilton-circuit"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.unbounded-linear-program","name_en":"unbounded linear program","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region","concept.objective-function"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.unbounded-simplex","name_en":"simplex unboundedness certificate","prerequisite_concept_ids":["concept.simplex-algorithm","concept.recession-direction"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.vector-norm","name_en":"vector norm","prerequisite_concept_ids":["concept.vector-operations"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.vector-operations","name_en":"vector operations","prerequisite_concept_ids":[],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.weak-duality","name_en":"weak duality","prerequisite_concept_ids":["concept.dual-formulation"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.weighted-sum-method","name_en":"weighted-sum method","prerequisite_concept_ids":["concept.pareto-optimality"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null},{"id":"concept.workforce-scheduling","name_en":"workforce-scheduling model","prerequisite_concept_ids":["concept.integer-linear-programming"],"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.concept","schema_version":"0.1.0","status":"active","supersedes_id":null}],"corrections":[{"affected_unit_ids":["unit.o018.lab.ch10"],"correction_type":"source_math_correction","evidence":{"certificate":"Untuk basis [x,y,s2], A_B^{-1}A_N=[[2,-1],[-1,1],[-3,1]], sehingga x_B=b'-A_N'x_N tepat mereproduksi kamus akhir.","id":"CORR-CH10-MATRIX-AN-SIGNS","source_location":"authority chapter lines 509-515","target_location":"translated chapter lines 501-522","type":"source_math_correction"},"id":"correction.o018.ch10.corr-ch10-matrix-an-signs","rationale":"Untuk basis [x,y,s2], A_B^{-1}A_N=[[2,-1],[-1,1],[-3,1]], sehingga x_B=b'-A_N'x_N tepat mereproduksi kamus akhir.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Untuk basis [x,y,s2], A_B^{-1}A_N=[[2,-1],[-1,1],[-3,1]], sehingga x_B=b'-A_N'x_N tepat mereproduksi kamus akhir.","status":"recorded","supersedes_id":null,"target_action":"preserved explicitly in the Indonesian edition or lab evidence","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch10"],"correction_type":"source_math_correction","evidence":{"certificate":"Dengan slack baru s1' pada Ax+s1'=b1+Delta, slack lama memenuhi s1=s1'-Delta; substitusi ini menghasilkan x=4+2Delta, y=5-Delta, s2=3-3Delta.","id":"CORR-CH10-RHS-B1-SLACK","source_location":"authority chapter lines 214-215","target_location":"translated chapter line 218","type":"source_math_correction"},"id":"correction.o018.ch10.corr-ch10-rhs-b1-slack","rationale":"Dengan slack baru s1' pada Ax+s1'=b1+Delta, slack lama memenuhi s1=s1'-Delta; substitusi ini menghasilkan x=4+2Delta, y=5-Delta, s2=3-3Delta.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Dengan slack baru s1' pada Ax+s1'=b1+Delta, slack lama memenuhi s1=s1'-Delta; substitusi ini menghasilkan x=4+2Delta, y=5-Delta, s2=3-3Delta.","status":"recorded","supersedes_id":null,"target_action":"preserved explicitly in the Indonesian edition or lab evidence","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch10"],"correction_type":"source_math_correction","evidence":{"certificate":"Dengan slack baru s3' pada Ax+s3'=b3+Delta, slack lama memenuhi s3=s3'-Delta; substitusi ini menghasilkan x=4-Delta, y=5+Delta, s2=3+Delta.","id":"CORR-CH10-RHS-B3-SLACK","source_location":"authority chapter line 283","target_location":"translated chapter line 286","type":"source_math_correction"},"id":"correction.o018.ch10.corr-ch10-rhs-b3-slack","rationale":"Dengan slack baru s3' pada Ax+s3'=b3+Delta, slack lama memenuhi s3=s3'-Delta; substitusi ini menghasilkan x=4-Delta, y=5+Delta, s2=3+Delta.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Dengan slack baru s3' pada Ax+s3'=b3+Delta, slack lama memenuhi s3=s3'-Delta; substitusi ini menghasilkan x=4-Delta, y=5+Delta, s2=3+Delta.","status":"recorded","supersedes_id":null,"target_action":"preserved explicitly in the Indonesian edition or lab evidence","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch11"],"correction_type":"source_math_correction","evidence":{"certificate":"Kasus minimisasi simetris yang sah adalah min b^T x dengan Ax>=c dan x>=0, berdual max c^T y dengan A^T y<=b dan y>=0; contoh satu variabel terkoreksi memberi 3=3, sedangkan bentuk lama memberi klaim 3<=0 yang salah.","id":"CORR-CH11-CASE2-GEQ","solver_checks":[{"case":"case2_corrected","maximum_violation":0,"objective":3,"point":{"x1":3},"purpose":"independent_lp_corroboration","side":"primal","solver":"appsi_highs","status":"ok","termination_condition":"optimal","variant":"nominal"},{"case":"case2_corrected","maximum_violation":0,"objective":3,"point":{"y1":1},"purpose":"independent_lp_corroboration","side":"dual","solver":"appsi_highs","status":"ok","termination_condition":"optimal","variant":"nominal"}],"source_location":"translated duality.tex lines 556-584; translated manual ch11.tex line 16","type":"source_math_correction","verification":{"corrected_dual_value":3,"corrected_primal_value":3,"old_form_weak_duality_counterexample":"dual 3 tidak <= primal 0"}},"id":"correction.o018.ch11.corr-ch11-case2-geq","rationale":"Kasus minimisasi simetris yang sah adalah min b^T x dengan Ax>=c dan x>=0, berdual max c^T y dengan A^T y<=b dan y>=0; contoh satu variabel terkoreksi memberi 3=3, sedangkan bentuk lama memberi klaim 3<=0 yang salah.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Kasus minimisasi simetris yang sah adalah min b^T x dengan Ax>=c dan x>=0, berdual max c^T y dengan A^T y<=b dan y>=0; contoh satu variabel terkoreksi memberi 3=3, sedangkan bentuk lama memberi klaim 3<=0 yang salah.","status":"recorded","supersedes_id":null,"target_action":"preserved explicitly in the Indonesian edition or lab evidence","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch11"],"correction_type":"source_wording_correction","evidence":{"certificate":"Titik (1,1) hanya kandidat: 2(1)+1=3<5, sehingga tidak layak dual; pasangan optimum adalah x=(3,2), y=(11/5,3/5), bernilai 23.","id":"CORR-CH11-EX11-13-CANDIDATE","solver_checks":[],"source_location":"translated complimentary-slackness.tex line 360; translated manual ch11.tex line 18","type":"source_wording_correction","verification":{"candidate_first_constraint_lhs":3,"candidate_first_constraint_rhs":5,"candidate_is_dual_feasible":false,"correct_optimum":23}},"id":"correction.o018.ch11.corr-ch11-ex11-13-candidate","rationale":"Titik (1,1) hanya kandidat: 2(1)+1=3<5, sehingga tidak layak dual; pasangan optimum adalah x=(3,2), y=(11/5,3/5), bernilai 23.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Titik (1,1) hanya kandidat: 2(1)+1=3<5, sehingga tidak layak dual; pasangan optimum adalah x=(3,2), y=(11/5,3/5), bernilai 23.","status":"recorded","supersedes_id":null,"target_action":"preserved explicitly in the Indonesian edition or lab evidence","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch11"],"correction_type":"source_math_correction","evidence":{"certificate":"Pada maksimisasi campuran, kendala >= memberi pengali <=0, kendala <= memberi pengali >=0, dan variabel bebas memberi persamaan dual; contoh terkoreksi memiliki primal taklayak dan dual takterbatas.","id":"CORR-CH11-MIXED-SIGNS-FREE","solver_checks":[{"case":"complicated_corrected","maximum_violation":null,"objective":null,"point":null,"purpose":"independent_lp_corroboration","side":"primal","solver":"appsi_highs","status":"error","termination_condition":"infeasible","variant":"corrected_signs"},{"case":"complicated_corrected","maximum_violation":null,"objective":null,"point":null,"purpose":"independent_lp_corroboration","side":"dual","solver":"appsi_highs","status":"error","termination_condition":"unbounded","variant":"corrected_signs"}],"source_location":"translated duality.tex lines 902-1038; translated manual ch11.tex line 17","type":"source_math_correction","verification":{"dual_feasible_base_point":["3/2",0,"1/2"],"dual_unbounded_ray":[1,-2,3],"primal_x1_lower_bound":"5/3","primal_x1_upper_bound":"3/2","ray_objective_change":-1}},"id":"correction.o018.ch11.corr-ch11-mixed-signs-free","rationale":"Pada maksimisasi campuran, kendala >= memberi pengali <=0, kendala <= memberi pengali >=0, dan variabel bebas memberi persamaan dual; contoh terkoreksi memiliki primal taklayak dan dual takterbatas.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Pada maksimisasi campuran, kendala >= memberi pengali <=0, kendala <= memberi pengali >=0, dan variabel bebas memberi persamaan dual; contoh terkoreksi memiliki primal taklayak dan dual takterbatas.","status":"recorded","supersedes_id":null,"target_action":"preserved explicitly in the Indonesian edition or lab evidence","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch11"],"correction_type":"upstream_modeling_redundancy_defect","evidence":{"certificate":"Dari 4x1+6x2+4x3=240 dan x3>=0 diperoleh 6x1+9x2+8x3=(3/2)(240)+2x3=360+2x3>=360, sehingga kendala retail >=80 selalu redundan.","confidence":"high","id":"UPSTREAM-DEFECT-CH11-EX11-17-RETAIL-REDUNDANT","source_location":"translated complimentary-slackness.tex lines 539-570; translated manual ch11.tex lines 316-346","status":"reported_not_modified","type":"upstream_modeling_redundancy_defect"},"id":"correction.o018.ch11.upstream-defect-ch11-ex11-17-retail-redundant","rationale":"Dari 4x1+6x2+4x3=240 dan x3>=0 diperoleh 6x1+9x2+8x3=(3/2)(240)+2x3=360+2x3>=360, sehingga kendala retail >=80 selalu redundan.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Dari 4x1+6x2+4x3=240 dan x3>=0 diperoleh 6x1+9x2+8x3=(3/2)(240)+2x3=360+2x3>=360, sehingga kendala retail >=80 selalu redundan.","status":"recorded","supersedes_id":null,"target_action":"preserved without source modification and recorded in local evidence only; not communicated upstream","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch11"],"correction_type":"upstream_theorem_completeness_defect","evidence":{"certificate":"Latihan 11.8 memberi primal dan dual yang sama-sama taklayak: penjumlahan kendala primal memaksa 0<=-2 dan penjumlahan kendala dual memaksa 0>=2.","confidence":"high","id":"UPSTREAM-DEFECT-CH11-STRONG-DUALITY-OMITS-BOTH-INFEASIBLE","source_location":"translated duality.tex lines 219-243; translated manual ch11.tex lines 156-158","status":"reported_not_modified","type":"upstream_theorem_completeness_defect"},"id":"correction.o018.ch11.upstream-defect-ch11-strong-duality-omits-both-infeasible","rationale":"Latihan 11.8 memberi primal dan dual yang sama-sama taklayak: penjumlahan kendala primal memaksa 0<=-2 dan penjumlahan kendala dual memaksa 0>=2.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Latihan 11.8 memberi primal dan dual yang sama-sama taklayak: penjumlahan kendala primal memaksa 0<=-2 dan penjumlahan kendala dual memaksa 0>=2.","status":"recorded","supersedes_id":null,"target_action":"preserved without source modification and recorded in local evidence only; not communicated upstream","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch13"],"correction_type":"source_figure_data","evidence":{"certificate":"Titik poligon (8.5,0) dan (5,14) memenuhi pendapatan 68000, sedangkan 70% dari 96000 adalah 67200; perpotongan tepatnya (8.4,0) dan (34/7,496/35).","id":"DEF-CH13-70PCT-FIGURE","source_location":"bab otoritas baris 143--151 dan 179--185","type":"source_figure_data"},"id":"correction.o018.ch13.def-ch13-70pct-figure","rationale":"Titik poligon (8.5,0) dan (5,14) memenuhi pendapatan 68000, sedangkan 70% dari 96000 adalah 67200; perpotongan tepatnya (8.4,0) dan (34/7,496/35).","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Titik poligon (8.5,0) dan (5,14) memenuhi pendapatan 68000, sedangkan 70% dari 96000 adalah 67200; perpotongan tepatnya (8.4,0) dan (34/7,496/35).","status":"recorded","supersedes_id":null,"target_action":"preserved explicitly in the Indonesian edition or lab evidence","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch13"],"correction_type":"source_manual_alignment","evidence":{"certificate":"Buku memuat 11 latihan; manual memuat 10 dan melewatkan ex:lex-vs-weighted. Entri manual 13.10 menjawab ex:furniture-weights, yaitu latihan buku 13.11.","id":"DEF-CH13-MANUAL-OMISSION","source_location":"urutan latihan bab otoritas dibandingkan inventaris exsol manual otoritas","type":"source_manual_alignment"},"id":"correction.o018.ch13.def-ch13-manual-omission","rationale":"Buku memuat 11 latihan; manual memuat 10 dan melewatkan ex:lex-vs-weighted. Entri manual 13.10 menjawab ex:furniture-weights, yaitu latihan buku 13.11.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Buku memuat 11 latihan; manual memuat 10 dan melewatkan ex:lex-vs-weighted. Entri manual 13.10 menjawab ex:furniture-weights, yaitu latihan buku 13.11.","status":"recorded","supersedes_id":null,"target_action":"preserved explicitly in the Indonesian edition or lab evidence","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch13"],"correction_type":"source_terminology","evidence":{"certificate":"Fungsi 8000x+2000y diperkenalkan sebagai pendapatan tetapi kemudian disebut laba tanpa suku biaya.","id":"DEF-CH13-REVENUE-PROFIT-TERMS","source_location":"bab otoritas baris 127--148","type":"source_terminology"},"id":"correction.o018.ch13.def-ch13-revenue-profit-terms","rationale":"Fungsi 8000x+2000y diperkenalkan sebagai pendapatan tetapi kemudian disebut laba tanpa suku biaya.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Fungsi 8000x+2000y diperkenalkan sebagai pendapatan tetapi kemudian disebut laba tanpa suku biaya.","status":"recorded","supersedes_id":null,"target_action":"preserved explicitly in the Indonesian edition or lab evidence","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch14"],"correction_type":"source_note","evidence":{"id":"NOTE-CH14-BERN-TIME","status":"corrected_in_id_source","text":"Saksi hulu menampilkan Bern--Frankfurt sebagai 3.55; edisi id-ID memakai 3:55 sesuai solusi terpilih."},"id":"correction.o018.ch14.note-ch14-bern-time","rationale":"Saksi hulu menampilkan Bern--Frankfurt sebagai 3.55; edisi id-ID memakai 3:55 sesuai solusi terpilih.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Saksi hulu menampilkan Bern--Frankfurt sebagai 3.55; edisi id-ID memakai 3:55 sesuai solusi terpilih.","status":"recorded","supersedes_id":null,"target_action":"corrected_in_id_source","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch14"],"correction_type":"source_note","evidence":{"id":"NOTE-CH14-HARDCODED-REFS","status":"recorded","text":"Keterampilan 11 dan 14 merujuk nomor soal secara manual, sehingga rentan terhadap penyisipan atau pengurutan ulang."},"id":"correction.o018.ch14.note-ch14-hardcoded-refs","rationale":"Keterampilan 11 dan 14 merujuk nomor soal secara manual, sehingga rentan terhadap penyisipan atau pengurutan ulang.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Keterampilan 11 dan 14 merujuk nomor soal secara manual, sehingga rentan terhadap penyisipan atau pengurutan ulang.","status":"recorded","supersedes_id":null,"target_action":"recorded","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch14"],"correction_type":"source_note","evidence":{"id":"NOTE-CH14-LOWRES-EXERCISES","status":"preserved_with_rubric","text":"Keterampilan 1--2 bergantung pada raster beresolusi rendah; rincian konstruksi tidak dipaksakan melampaui yang terlihat."},"id":"correction.o018.ch14.note-ch14-lowres-exercises","rationale":"Keterampilan 1--2 bergantung pada raster beresolusi rendah; rincian konstruksi tidak dipaksakan melampaui yang terlihat.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Keterampilan 1--2 bergantung pada raster beresolusi rendah; rincian konstruksi tidak dipaksakan melampaui yang terlihat.","status":"recorded","supersedes_id":null,"target_action":"preserved_with_rubric","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch14"],"correction_type":"source_note","evidence":{"id":"NOTE-CH14-PRIM-FLOAT","status":"preserved_and_disambiguated","text":"Gambar Prim tujuh simpul setelah Latihan 14.3 bukan graf latihan enam simpul; lab memakai data latihan yang eksplisit."},"id":"correction.o018.ch14.note-ch14-prim-float","rationale":"Gambar Prim tujuh simpul setelah Latihan 14.3 bukan graf latihan enam simpul; lab memakai data latihan yang eksplisit.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Gambar Prim tujuh simpul setelah Latihan 14.3 bukan graf latihan enam simpul; lab memakai data latihan yang eksplisit.","status":"recorded","supersedes_id":null,"target_action":"preserved_and_disambiguated","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch15"],"correction_type":"source_model_semantics","evidence":{"certificate":"Frasa 'tepat satu kendala berlaku' tidak ekuivalen dengan formulasi Big-M standar: titik asal memenuhi kedua kendala namun tetap layak untuk kedua nilai pemilih. Manual memberi qaflag yang sama.","id":"DEF-CH15-EITHER-OR-SEMANTICS","source_location":"Latihan ex:either-or-modes dan manual 15.10","type":"source_model_semantics"},"id":"correction.o018.ch15.def-ch15-either-or-semantics","rationale":"Frasa 'tepat satu kendala berlaku' tidak ekuivalen dengan formulasi Big-M standar: titik asal memenuhi kedua kendala namun tetap layak untuk kedua nilai pemilih. Manual memberi qaflag yang sama.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Frasa 'tepat satu kendala berlaku' tidak ekuivalen dengan formulasi Big-M standar: titik asal memenuhi kedua kendala namun tetap layak untuk kedua nilai pemilih. Manual memberi qaflag yang sama.","status":"recorded","supersedes_id":null,"target_action":"preserved explicitly in the Indonesian edition or lab evidence","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch15"],"correction_type":"source_solution_completeness_history","evidence":{"certificate":"Pencacahan semua 15 pasangan distrik menghasilkan tepat tiga optimum: {2,5}, {3,4}, dan {1,6}. Saksi yang dibekukan sudah mencatat bahwa solusi terpilih dahulu melewatkan pasangan {1,6}.","id":"DEF-CH15-FIRE-PLACEMENTS","source_location":"Latihan ex:fire-warmup, Solusi Terpilih, dan manual 15.3","type":"source_solution_completeness_history"},"id":"correction.o018.ch15.def-ch15-fire-placements","rationale":"Pencacahan semua 15 pasangan distrik menghasilkan tepat tiga optimum: {2,5}, {3,4}, dan {1,6}. Saksi yang dibekukan sudah mencatat bahwa solusi terpilih dahulu melewatkan pasangan {1,6}.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Pencacahan semua 15 pasangan distrik menghasilkan tepat tiga optimum: {2,5}, {3,4}, dan {1,6}. Saksi yang dibekukan sudah mencatat bahwa solusi terpilih dahulu melewatkan pasangan {1,6}.","status":"recorded","supersedes_id":null,"target_action":"preserved explicitly in the Indonesian edition or lab evidence","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.o018.lab.ch01-shirt-ordering","unit.o018.lab.ch01-shirt-ordering.lp","unit.o018.lab.ch01-shirt-ordering.integer"],"correction_type":"output_semantics","evidence":"source/o018-open-solver-lab/ch01-shirt-ordering/data.json and results.json SHA-256 072e0e4fea8dd76a931dae1d2190605be6b015db7d19765a84d775d77fc82dbf, together with Chapter 1 exercise ex:shirt-full-lp.","id":"correction.o018.result-order-chronology","rationale":"Explicit labels plus a separate ordered period array remove positional ambiguity without misrepresenting lexically sorted JSON object keys as chronological order.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Order decisions need stable named day IDs rather than an unlabeled positional vector or reliance on JSON object order.","status":"applied_in_target","supersedes_id":null,"target_action":"Serialize every decision under its named order_day_id; define physical chronology through data.json periods[].order_day_id. The admitted values are Thursday 22, Friday 0, and Saturday 0 for both LP and integer modes; JSON key order is intentionally non-semantic.","upstream_report_disposition":"not_upstream; local_adaptation_correction"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"mathematics","evidence":"Chapter 2 screen-printing model and independent feasibility reasoning.","id":"correction.r017.ch02-assumptions","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The correction restores internal consistency and removes an unsafe modeling prescription.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The assumptions discussion contradicts the screen-printing example's profit, press-time, and second-product data and says a fractional LP plan may simply be rounded without a feasibility check.","status":"applied_in_target","supersedes_id":null,"target_action":"Align the illustration with USD 10 and two press-hours per shirt plus tote bags, and state that the LP relaxation is a bound/guide whose rounded plan must be checked or replaced by an integer model.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"model_classification","evidence":"Chapter 2 bakery display.","id":"correction.r017.ch02-bakery-relaxation","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The model-class boundary is explicit without changing coefficients or constraints.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The bakery display is titled as a linear program while including an integer domain as though both domain statements applied simultaneously.","status":"applied_in_target","supersedes_id":null,"target_action":"Present the continuous display as the LP relaxation and state outside it that whole-item production adds integrality and yields an integer program.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"mathematics","evidence":"Chapter 2 two-machine model coefficients.","id":"correction.r017.ch02-cabinet-dominance","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The dominance argument is now numerically correct.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"A selected solution says a cabinet uses more resources than one bookcase plus one desk, but the coefficients are exactly equal in both resources.","status":"applied_in_target","supersedes_id":null,"target_action":"State the exact equalities 3=1+2 and 4=2+2 and compare revenue 55 against 65.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"model_classification","evidence":"Chapter 2 capital-allocation statement and solution.","id":"correction.r017.ch02-capital-model-class","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The name now matches the displayed binary domains.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The capital-allocation prompt calls its binary 0-1 knapsack formulation a linear program.","status":"applied_in_target","supersedes_id":null,"target_action":"Identify it as a binary integer program and 0-1 knapsack model.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"external_reference","evidence":"Pinned notebook names and examplewithallcode argument contract.","id":"correction.r017.ch02-code-link-order","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Each reader control now identifies its actual solver implementation.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The camping example passes the Gurobi notebook in the PuLP button position and the PuLP notebook in the Gurobi position.","status":"applied_in_target","supersedes_id":null,"target_action":"Swap the two exact URLs into their correct macro argument positions.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"mathematics","evidence":"Independent HiGHS replay of the displayed diet LP.","id":"correction.r017.ch02-diet-metadata","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The parameter inventory and verified LP optimum now match the displayed model.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The second diet model uses calorie coefficients without listing calories as a parameter, and a stale source comment misstates the first diet optimum's cost/color.","status":"applied_in_target","supersedes_id":null,"target_action":"Add calories to the parameter list and correct the nonrendered optimum witness to x_1=4.0625, x_3=0.3125, cost 5.34375.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"mathematics","evidence":"Linearity of expectation applied to the displayed objective.","id":"correction.r017.ch02-expected-cost-direction","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The optimization direction now matches the stated coefficient semantics.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Exercise 2.12 calls c_i costs while its manual maximizes expected cost.","status":"applied_in_target","supersedes_id":null,"target_action":"State that the deterministic plan minimizes expected cost and change the manual objective from max to min.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"mathematics","evidence":"Pinned and translated Chapter 2 generic LP displays and independent mathematical replay.","id":"correction.r017.ch02-generic-index-ranges","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The symbols now agree with every displayed coefficient matrix row and right-hand side.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The generic and three-variable LP parameter lists reverse row/column index ranges and name the right-hand side b_j even though the displayed models use m constraint rows and n variables.","status":"applied_in_target","supersedes_id":null,"target_action":"Use a_ij with i=1,...,m and j=1,...,n and b_i for i=1,...,m; use i=1,...,4 and j=1,...,3 in the concrete example.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"layout","evidence":"Final Chapter 2 source and 87-page cumulative build; the final log has zero overfull-box hits and PDF geometry places the last line within the MediaBox.","id":"correction.r017.ch02-id-layout-reflow","rationale":"The localized reflow eliminates frame/media overflow and the sparse spill/blank verso while preserving every coefficient, domain, feasible-direction calculation, optimum, label, and exercise relation.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Indonesian reflow split the opening production-planning frame mid-sentence, pushed two indexed model qualifiers beyond the frame/media boundary, and left five lines of the final selected solution alone before an automatic blank verso.","status":"applied_in_target","supersedes_id":null,"target_action":"Add one Needspace guard before the production-planning example; express the same indexed scopes compactly as 'untuk tiap j', 'untuk tiap a', and i,j in {1,2,3}; and use a two-baseline page allowance plus a concise, mathematically equivalent Indonesian rendering of the rented-labor solution.","upstream_report_disposition":"not_upstream; locale_specific_reflow"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"mathematics","evidence":"Chapter 2 production-planning statement, parameter list, and balance equations.","id":"correction.r017.ch02-initial-inventory","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Treating initial inventory as a free decision can trivialize the model.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The production-planning prose defines s_0 as given initial inventory, but the model places it in the decision-variable nonnegativity line.","status":"applied_in_target","supersedes_id":null,"target_action":"Declare fixed parameter s_0>=0 and remove it from the decision-variable domain.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"terminology","evidence":"Chapter 2 Exercise 2.11 and both selected/manual solutions.","id":"correction.r017.ch02-linear-constraint-wording","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The classification now matches the displayed relation signs.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Exercise 2.11 asks which expressions are linear inequalities even though item 4 is an equality, and its answer calls both items 4 and 5 inequalities.","status":"applied_in_target","supersedes_id":null,"target_action":"Ask for linear constraints and identify item 4 as a linear equality and item 5 as a linear inequality.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02.solutions-manual"],"correction_type":"rights_provenance","evidence":"Pinned Chapter 2 exercise footnote and solutions-manual header/qaflags.","id":"correction.r017.ch02-manual-provenance","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The derivative does not manufacture rights conclusions that the pinned authority cannot prove.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The source manual makes unsupported per-exercise origin and closed-license claims and retains a stale correction-history note.","status":"applied_in_target","supersedes_id":null,"target_action":"Preserve the source's section-level Sekhon--Bloom attribution while explicitly declining unsupported item-level provenance inferences.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"mathematics","evidence":"Direct substitution and independent LP optimum (0,22,72,30), net profit 2448.","id":"correction.r017.ch02-rented-labor-proof","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The conclusion that all 30 hours are rented is now justified within the full feasible system.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The rented-labor explanation compares product C's gross profit per labor-hour with rent while ignoring the binding machine constraint.","status":"applied_in_target","supersedes_id":null,"target_action":"Use feasible direction delta x_2=-0.2, delta x_3=0.8: it preserves machine use, consumes one extra labor-hour, raises gross profit by 10.20, and therefore nets 1.20 after rent.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"mathematics","evidence":"Independent LP replay and direct substitution into all three nutrient constraints.","id":"correction.r017.ch02-smoothie-optima","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The revised solution describes the actual optimal face rather than a single solver vertex.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The exercise and manual imply that (2,2,2) is the unique smoothie optimum.","status":"applied_in_target","supersedes_id":null,"target_action":"Ask whether the optimum is unique and give the full optimal family c=2, 3a+2b=10, 2<=b<=5, including (0,5,2), all at cost 5.20.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"mathematics","evidence":"Independent LP/MIP replay gives base objectives 7.333... and 8; pinned notebook inventory.","id":"correction.r017.ch02-staffing-integrality","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The mathematical model, narrative, and exact bundled notebook now agree.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Both staffing examples count employees but declare only continuous nonnegative variables; the base prose calls an independently solved integer plan a rounding, the extended objective is unstated, and its Gurobi link points to the base notebook.","status":"applied_in_target","supersedes_id":null,"target_action":"Declare integer nonnegative variables, distinguish LP relaxation from integer solution, state the extended employee-day objective, and point to work_scheduling_extended_gurobi.ipynb.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"terminology","evidence":"Chapter 2 welding statement and model.","id":"correction.r017.ch02-welding-semantics","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"No unmodeled costs are introduced and all units match the statement.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The welding solution calls sales revenue a purchase price, describes TAA units as hours, and labels a revenue-only objective as profit.","status":"applied_in_target","supersedes_id":null,"target_action":"Use sales revenue, distinguish TAA units from joining/cutting hours, and label the objective revenue.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch03.text"],"correction_type":"accessibility","evidence":"Eight pinned and translated Chapter 3 figure commands.","id":"correction.r017.ch03-caption-closure","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Reader captions now identify each Solver interface state without changing the images.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"All eight source figure captions are truncated fragments ending with ellipses.","status":"applied_in_target","supersedes_id":null,"target_action":"Supply complete Indonesian captions consistent with the retained screenshots and detailed alt text.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch03.solutions-manual"],"correction_type":"mathematics","evidence":"Independent replay of the displayed linear system and objective.","id":"correction.r017.ch03-diet-exact-value","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Exact and rounded values are no longer conflated.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The source manual describes the displayed diet cost as exactly USD 3.1677 even though the solution is not exact at four decimals.","status":"applied_in_target","supersedes_id":null,"target_action":"Give the exact rational 2407651/760055 and decimal approximation 3.1677326, while retaining 3.17 as the worksheet display value.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch03.text"],"correction_type":"build_localization","evidence":"References to ex:production-10period, ex:min-cost-flow-warehouses, and sec:transportation-problem in Chapter 3.","id":"correction.r017.ch03-forward-reference-build","rationale":"The admitted partial reader remains truthful and free of unresolved references without importing untranslated material.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"A bounded through-Chapter-3 build cannot resolve three semantic references whose targets first appear in untranslated Chapter 4.","status":"applied_in_target","supersedes_id":null,"target_action":"Use controller-defined semantic reference macros for the bounded reader while preserving the original labels in the eventual complete-book build.","upstream_report_disposition":"not_upstream; bounded_build"},{"affected_unit_ids":["unit.r017.book1","unit.r017.book1.ch03.text","unit.r017.book1.ch03.solutions-manual"],"correction_type":"localization_layout","evidence":"Final source plus physical pages 86--88, 101--102, and 105 of the hash-bound cumulative reader.","id":"correction.r017.ch03-generated-language-reflow","rationale":"The 105-page Indonesian reader should be linguistically complete and readable without changing any equation, model, or solution relationship.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The initial localized build retained English mathematical qualifiers and bibliography labels, rendered URL access dates in month/day/year order, joined the generated phrase 'dengan syarat' directly to the first variable, and stranded the final lines of two solutions on near-empty pages.","status":"applied_in_target","supersedes_id":null,"target_action":"Localize the qualifiers and biblatex strings, render compact access dates in Indonesian day/month/year order through the biblatex language-extras hook, give the subject-to macro explicit math spacing, and add bounded Needspace guards before the two final Exercise 3.9 solutions.","upstream_report_disposition":"not_upstream; locale_specific_localization_and_reflow"},{"affected_unit_ids":["unit.r017.book1.ch03.text"],"correction_type":"accessibility","evidence":"Eight descriptions in four Chapter 3 form-XObject streams; Tagged=no remains explicit.","id":"correction.r017.ch03-image-actualtext","rationale":"ActualText exposes image meaning to extraction and assistive tooling without falsely claiming a PDF/UA structure tree.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The untagged cumulative PDF initially carried the eight detailed screenshot descriptions only in LaTeX source, with no machine-readable image description in the PDF content.","status":"applied_in_target","supersedes_id":null,"target_action":"Wrap localized alt-image calls with accsupp ActualText marked content while retaining the exact JPEG bytes and captions.","upstream_report_disposition":"not_upstream; localized_pdf_accessibility"},{"affected_unit_ids":["unit.r017.book1.ch03.text"],"correction_type":"software_instruction","evidence":"Pinned Chapter 3 source, Solver method semantics, and translated tutorial.","id":"correction.r017.ch03-integer-solver-method","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Solver method selection now matches model structure and the book's own integer-programming explanation.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The source assigns integer-constrained linear models to the Evolutionary method.","status":"applied_in_target","supersedes_id":null,"target_action":"Use Simplex LP for linear models with int/bin constraints and explain Solver's branch-and-bound handling; reserve Evolutionary for nonsmooth or discontinuous models.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch03.interactive"],"correction_type":"mathematics","evidence":"Independent enumeration of every binary selection in the interactive data.","id":"correction.r017.ch03-interactive-knapsack","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Exhaustive enumeration verifies this feasible optimum.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The interactive knapsack panel reports an incorrect selected set and objective.","status":"applied_in_target","supersedes_id":null,"target_action":"Use items 1, 2, 5, and 6, binary vector (1,1,0,0,1,1), total weight 50, and total value 240.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch03.interactive"],"correction_type":"mathematics","evidence":"Multi-start replay gives a=5.042918318, b=0.421541759, c=0.064088222, SSE=0.002146810472, RMSE=0.020721054.","id":"correction.r017.ch03-interactive-nlp-sheet","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The worksheet formulas, Solver target, and verified least-squares solution now agree.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The nonlinear least-squares interactive shifts prediction and residual formulas to the wrong rows or columns and therefore reports inconsistent fit statistics.","status":"applied_in_target","supersedes_id":null,"target_action":"Use B7:B11 in predictions, (C-D)^2 in E7:E11, SUM(E7:E11) in E12, and target E12; display the independently verified parameters and SSE/RMSE.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch03.solutions-manual"],"correction_type":"mathematics","evidence":"Independent LP sensitivity replay of Exercise 3.6.","id":"correction.r017.ch03-shadow-price-range","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"A sensitivity coefficient is valid only within its allowable interval.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The source applies the USD 5 finishing shadow price without stating its allowable right-hand-side range.","status":"applied_in_target","supersedes_id":null,"target_action":"Qualify the USD 5 marginal value to the first 20 additional finishing hours and require re-solving beyond that range.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch03.text"],"correction_type":"mathematics_units","evidence":"Chapter 3 Exercise 3.9 and its selected/manual solutions.","id":"correction.r017.ch03-short-sale-units","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The numerical decision and financial amount must use the same declared scale.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The selected solution states that x_A=-40 is a USD 40 short position even though the exercise defines every amount in thousands of dollars.","status":"applied_in_target","supersedes_id":null,"target_action":"Render the position as USD 40,000, agreeing with x_A=-40, the exercise unit, and the complete manual.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch03.text"],"correction_type":"software_instruction","evidence":"Pinned Chapter 3 source and Excel formula semantics.","id":"correction.r017.ch03-solver-constraint-formula","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The spreadsheet now exposes a numeric constraint expression and uses Solver for the relation.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The source presents =SUMPRODUCT(...) <= Capacity as a worksheet formula, which evaluates to a Boolean instead of furnishing the numeric left-hand side required by Solver.","status":"applied_in_target","supersedes_id":null,"target_action":"Put only =SUMPRODUCT(Production,Coefficients) in the worksheet cell and add the <= relation against the Capacity cell in the Solver dialog.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch03.solutions-manual"],"correction_type":"mathematics","evidence":"Derivative domain of the square-root function.","id":"correction.r017.ch03-sqrt-domain","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The example is differentiable on the stated domain while remaining nonlinear.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The source gives sqrt(x_1)+sqrt(x_2) as a differentiable GRG example on the default nonnegative domain, including the nondifferentiable boundary at zero.","status":"applied_in_target","supersedes_id":null,"target_action":"Add explicit positive lower bounds x_1,x_2 >= epsilon > 0.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch03.text","unit.r017.book1.ch03.solutions-manual"],"correction_type":"mathematics","evidence":"Exercise 3.5 data table, selected solution, and manual solution.","id":"correction.r017.ch03-transport-capacity-wording","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The prose now matches the actual constraint set.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The transportation solution narrative implies route capacities although the displayed exercise model specifies only warehouse supply and store demand.","status":"applied_in_target","supersedes_id":null,"target_action":"Explain the optimal shipment pattern using route costs, supply, and demand, and state explicitly that this model has no per-route capacities.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-b","unit.r017.book1.ch04.interactive"],"correction_type":"mathematics","evidence":"Independent maximum-flow replay, localized TikZ topology, interactive example, and Chapter 4 workbook receipt.","id":"correction.r017.ch04-airline-maxflow-topology","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The reader must be internally coherent without silently rewriting frozen operational witnesses.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The airline worked example's prose and topology intend an arc d->t of capacity 7 and maximum flow 12, but the source set, workbook, and notebooks encode d->e and yield 9.","status":"applied_in_target_with_witness_divergence","supersedes_id":null,"target_action":"Make the localized chapter and interactive use d->t, capacity 7, and maximum flow 12 while retaining the workbook/notebook divergence as an explicit authority witness.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-a"],"correction_type":"source_data_consistency","evidence":"Chapter 4 workbook localization receipt, assignment-problem-excel-id-ID.xlsx, and O018 deterministic results.","id":"correction.r017.ch04-assignment-workbook-divergence","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Recomputing a historical Solver report during localization would erase provenance; silently treating 129 as the selected assignment's cost would be false.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The assignment workbook's retained Solver Answer Report gives final objective 129, while its selected cells assign Person 1->Task 2, Person 2->Task 3, and Person 3->Task 1, whose costs 38+33+27 and SUMPRODUCT cell both equal 98.","status":"recorded_authority_divergence","supersedes_id":null,"target_action":"Preserve both historical workbook witnesses, disclose the divergence, and use 98 only for the explicitly selected assignment in O018.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-b","unit.r017.book1.ch04.interactive"],"correction_type":"mathematics","evidence":"Chapter 4 network-flow displays and localized interactive sign-convention panel.","id":"correction.r017.ch04-balance-sign-conventions","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The conventions are both valid but must never be mixed inside one model.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The chapter uses both positive-supply with out-minus-in=d and positive-demand with in-minus-out=d without an explicit comparison, which can make equivalent balance equations appear contradictory.","status":"applied_in_target","supersedes_id":null,"target_action":"Preserve both formulations and add a direct comparison that names each sign convention.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-a","unit.r017.book1.ch04.text-b"],"correction_type":"accessibility","evidence":"Localized caption text compared node-for-node and arc-for-arc with each TikZ source.","id":"correction.r017.ch04-caption-completion","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"A caption must convey the whole instructional figure, including for nonvisual reading.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Five source figure captions are truncated and do not describe the complete drawn topology.","status":"applied_in_target","supersedes_id":null,"target_action":"Complete the five captions from the exact TikZ nodes, arcs, directions, labels, and roles without altering the diagrams.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-b","unit.r017.book1.ch04.solutions-manual"],"correction_type":"mathematics","evidence":"Direct capacity and conservation replay of Exercise 4.5.","id":"correction.r017.ch04-ex05-flow-roles","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Requiring every warehouse to ship its full inventory makes the stated network infeasible.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Exercise 4.5 ambiguously describes where inventory may remain, encouraging equality constraints at warehouses although conservation belongs at distribution centers and warehouse shipment is bounded above by inventory.","status":"applied_in_target","supersedes_id":null,"target_action":"Use conservation equalities at distribution centers and inventory upper bounds at warehouses in both selected and manual solutions.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-b","unit.r017.book1.ch04.solutions-manual"],"correction_type":"mathematics","evidence":"Independent scipy/LP replay and exact 67-cost flow recorded in the localized manual.","id":"correction.r017.ch04-ex07-capacity","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Capacity 4 is the minimal topology-consistent repair that makes the displayed data feasible and realizes the intended check value.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Exercise 4.7 gives arc (v2,v1) capacity 1, making the instance infeasible because v1 demands 6 but can receive at most 2+1=3; the intended check value cannot then be attained.","status":"applied_in_target","supersedes_id":null,"target_action":"Set that single capacity to 4, explain the net-demand convention, and add the independently verified minimum cost 67 in the exercise and manual.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-a","unit.r017.book1.ch04.text-b","unit.r017.book1.ch04.solutions-manual"],"correction_type":"mathematics","evidence":"Worked assignment table, Exercise 4.14, selected solution, and manual solution.","id":"correction.r017.ch04-fairness-conventions","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Fairness direction depends on whether larger or smaller scores are preferred.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The worked rank table uses lower-is-better scores and therefore a min--max objective, while Exercise 4.14 asks for a max--min objective with the opposite inequality direction; the source presentation risks conflating the two conventions.","status":"applied_in_target","supersedes_id":null,"target_action":"Name both conventions explicitly and preserve the correct inequality direction for each.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-a"],"correction_type":"mathematics","evidence":"Chapter 4 fairness derivation and independent index replay.","id":"correction.r017.ch04-fairness-minmax-indices","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The index topology must match the displayed agent-by-project table and the stated fairness criterion.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The min--max assignment-fairness model sums scores over agents for each project, reversing the project and agent indices required by the stated worst-agent objective.","status":"applied_in_target","supersedes_id":null,"target_action":"Sum project scores for each agent and minimize the maximum resulting agent score.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-a"],"correction_type":"mathematics","evidence":"Direct substitution into the displayed assignment constraints.","id":"correction.r017.ch04-fractional-assignment","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Both variable indices must keep the first index fixed at Team 1.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The fractional Team 1 illustration identifies x_11=x_21=0.5, which assigns two agents to one project rather than splitting Team 1 across the two projects.","status":"applied_in_target","supersedes_id":null,"target_action":"Use x_11=x_12=0.5 for Team 1.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.interactive"],"correction_type":"interactive_code","evidence":"Target JSX SHA-256 110af1e063e78a0cb26b8abd3f9df2e3201ad8b361756a38314f33d9de6a3c4b and final independent JSX audit.","id":"correction.r017.ch04-interactive-semantics","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Executable examples and explanatory prose must agree with the chapter's mathematics and library return semantics.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The coupled network-flow JSX contains incorrect maximum-flow, minimum-cut, and minimum-cost values; undefined ARCS snippets; a balance-sign mismatch; overbroad integrality and single-commodity claims; and a Floyd--Warshall tuple whose variable names invert predecessor and distance semantics.","status":"applied_in_target","supersedes_id":null,"target_action":"Localize the interactive; correct all values and snippets; state qualified integrality and commodity claims; distinguish balance conventions; and bind predecessors before distances in the Floyd--Warshall example.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-b","unit.o018.lab.ch04.investment-multi-period"],"correction_type":"model_completeness","evidence":"Pinned example, localized qaflag, and O018 Chapter 4 results/receipt.","id":"correction.r017.ch04-investment-model-unresolved","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Changing domains or inventing cash-flow semantics would silently create a different model.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The multi-period investment example asks for an LP while declaring binary choices, omits an idle-cash state, and retains an upstream TODO, leaving its intended inter-period semantics underdetermined.","status":"recorded_unresolved","supersedes_id":null,"target_action":"Preserve and disclose the unresolved design; mark the O018 case design_unresolved and do not fabricate an optimum or replacement data.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-b"],"correction_type":"mathematics","evidence":"Direct flow-balance feasibility replay against the labeled TikZ graph.","id":"correction.r017.ch04-mincost-db-arc","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The corrected direction restores the intended feasible network without changing any other datum.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The minimum-cost-flow data list arc (b,d), while the drawing and node balances require (d,b); using (b,d) makes the displayed instance infeasible.","status":"applied_in_target","supersedes_id":null,"target_action":"Use the directed arc d->b consistently in the text, formulation, and topology.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-b","unit.r017.book1.ch04.interactive"],"correction_type":"mathematics","evidence":"Direct two-commodity balance and cost replay.","id":"correction.r017.ch04-multicommodity-topology-solution","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Every displayed commodity balance and shared capacity must be feasible.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The multicommodity figures reverse arc 1->3 and show infeasible flow [5,5], while the stated capacities and demands admit the cheaper feasible routing of total cost 45.","status":"applied_in_target","supersedes_id":null,"target_action":"Orient 1->3 correctly and show 1->2 [10,0], 1->3 [0,5], 2->4 [10,0], and 3->4 [0,5], with cost 45.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch04.text-a","unit.o018.lab.ch04.production-overtime"],"correction_type":"model_completeness","evidence":"Displayed objective and balances plus O018 Chapter 4 results/receipt.","id":"correction.r017.ch04-overtime-missing-capacity","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"An open-solver adaptation cannot recover absent business parameters honestly.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The overtime-production extension omits regular and overtime capacity constraints, so the more expensive overtime variable is never used and no intended numerical optimum is determined.","status":"recorded_unresolved","supersedes_id":null,"target_action":"State the omission explicitly; preserve the source model but mark the O018 case parameter_required instead of inventing capacity data.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch05.text"],"correction_type":"source_consistency","evidence":"Pinned Chapter 5 example exa:FurnitureWorkshopAltOpt compared with ex:FurnitureWorkshop and the localized target.","id":"correction.r017.ch05-alternate-objective-bound","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The prose must disclose the one changed constraint that makes the displayed vertices and edge possible.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The alternate-objective Furniture Workshop example says the constraints remain unchanged while changing the chair-demand bound from 32 to 35.","status":"applied_in_target","supersedes_id":null,"target_action":"State explicitly that the chair-demand bound is raised from 32 to 35, while preserving every displayed coefficient and the intended optimal edge.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch05.text"],"correction_type":"translation_terminology","evidence":"segment.r017.book1.ch05.text.block-020; qa/terminology-evidence/INDONESIAN-FIELD-TERMINOLOGY-QA.md at SHA-256 ca650f605b757a9ca3f0265555ee0bb0914f9def90012115658395f33e793a7b; field fallback Desi Analisa Nababan, UNY, 2015.","id":"correction.r017.ch05-basic-feasible-solution-word-order","rationale":"The corrected term preserves the mathematical head 'basis' and matches the edition's Chapter 7--9 simplex terminology without imposing an unsupported corpus-wide spelling rewrite.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"One localized Chapter 5 sentence used the malformed word order 'solusi layak dasar', inconsistent with the edition's approved translation of basic feasible solution.","status":"applied_in_target","supersedes_id":null,"target_action":"Replace that single occurrence with 'solusi basis layak' and retain the field-attested historical phrase only as a retrieval variant in the glossary.","upstream_report_disposition":"not_upstream; derivative_translation_correction"},{"affected_unit_ids":["unit.r017.book1.ch05.text","unit.r017.book1.ch05.solutions-manual","unit.o018.lab.ch05.ex10"],"correction_type":"mathematics","evidence":"Pinned exercise statement, manual qaflag, localized selected solution, and independently solved O018 case.","id":"correction.r017.ch05-diet-rhs","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The formulation must match the exercise table and stated daily requirements.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The selected Diet solution had the two nutrient right-hand sides swapped relative to the exercise data: nutrient M requires 0.40 mg and nutrient N requires 0.30 mg.","status":"applied_in_target","supersedes_id":null,"target_action":"Use >=0.40 for the M row and >=0.30 for the N row in both displayed formulations and the open-solver case.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch05.text","unit.r017.book1.ch05.solutions-manual","unit.o018.lab.ch05.ex09"],"correction_type":"exercise_semantics","evidence":"Pinned Exercise 5.9, its manual qaflag, and O018 deterministic classification.","id":"correction.r017.ch05-ex09-title-objective","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Retitling removes a false answer cue without changing the mathematical task.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Exercise 5.9 is titled as a bounded solution on an unbounded region, but max(-2x_1+x_2) is unbounded along the feasible ray (0,2+t).","status":"applied_in_target","supersedes_id":null,"target_action":"Keep the objective and constraints unchanged, use the neutral title 'Berhingga atau Tak Berbatas?', and prove unboundedness explicitly.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch05.solutions-manual","unit.o018.lab.ch05.ex16"],"correction_type":"mathematics","evidence":"Pinned manual qaflag, direct substitution, and O018 ray verification.","id":"correction.r017.ch05-ex16-ray","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The claimed unbounded ray must remain feasible.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Exercise 5.16(c) used direction (1,2) from (0,6), but that ray violates -x+2y<=12 for every positive parameter value.","status":"applied_in_target","supersedes_id":null,"target_action":"Use direction (2,1), so (2t,6+t) preserves -x+2y=12 and makes z=12+6t diverge.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch05.text"],"correction_type":"mathematics","evidence":"Pinned and localized solution to exa:FurnitureWorkshopAltOpt; direct dot-product and level-set geometry.","id":"correction.r017.ch05-gradient-normal","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"A linear objective gradient is normal to its level sets, not parallel to them.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The alternate-optimum solution calls gradient (2,1) parallel to the constraint line 2x_1+x_2=80; it is normal to that line, while the objective level curves are parallel to it.","status":"applied_in_target","supersedes_id":null,"target_action":"Describe the gradient as perpendicular to the constraint line and the objective level curves as parallel to it.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch05.text"],"correction_type":"localization_layout","evidence":"Rendered physical pages 138, 142, 145--147, and 156 of the final Chapter 5 cumulative reader.","id":"correction.r017.ch05-id-reflow-figures","rationale":"The localized reader must fill the page legibly without changing the underlying diagrams or mathematics.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Indonesian expansion made several dense TikZ labels collide or extend outside their plot frames and could orphan exercise-group headings or split the recession-direction figure sequence.","status":"applied_in_target","supersedes_id":null,"target_action":"Reposition labels, clip only plotted constraint lines, complete localized captions, and add bounded Needspace guards while preserving equations, vertices, labels, captions' mathematical claims, and instructional order.","upstream_report_disposition":"not_upstream; locale_specific_reflow"},{"affected_unit_ids":["unit.r017.book1.ch05"],"correction_type":"localized_pdf_navigation","evidence":"Final PDF catalog/outline inspection and zero mutool bad-or-missing-last-pointer diagnostics.","id":"correction.r017.ch05-pdf-navigation","rationale":"Reader navigation must be structurally valid as well as visually correct.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The bounded localized controller initially produced duplicate exercise outline furniture and a malformed final outline /Last pointer after Chapter 5 admission.","status":"applied_in_target","supersedes_id":null,"target_action":"Remove the duplicate localized outline insertion and rebuild until the outline tree, named destinations, and final /Last pointer validate.","upstream_report_disposition":"not_upstream; bounded_localized_build"},{"affected_unit_ids":["unit.r017.book1.ch05.text","unit.r017.book1.ch05.solutions-manual"],"correction_type":"mathematics","evidence":"Pinned selected solution lines 1088--1109, localized correction, and direct substitution.","id":"correction.r017.ch05-selected-solution-envelope","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Both lower bounds on z apply simultaneously.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The selected solution for Exercise 5.7 writes the minimum of two affine lower bounds, whereas minimizing z subject to both inequalities requires minimizing their pointwise maximum.","status":"applied_in_target","supersedes_id":null,"target_action":"Write min_y max{2+y/2, 1-2y}; retain the intersection y=-2/5 and optimum 9/5, and verify it with the nonnegative multiplier certificate.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch05.text"],"correction_type":"mathematics","evidence":"Direct substitution into the pinned unbounded-region model.","id":"correction.r017.ch05-unbounded-ray-domain","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Every point in a feasibility witness must satisfy all displayed constraints.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The unboundedness witness claims (n,0) is feasible for every positive integer n, although x_1+3x_2>=6 requires n>=6.","status":"applied_in_target","supersedes_id":null,"target_action":"Use every integer n>=6 and the corresponding objective sequence 30,35,40,... as the unbounded ray witness.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch06.text"],"correction_type":"accessibility","evidence":"Pinned formalize-LP.tex line 685 and the localized figure caption at the same source position.","id":"correction.r017.ch06-incomplete-caption","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"A visible and nonvisual caption must describe the complete instructional figure rather than preserve an unfinished placeholder.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The final Chapter 6 TikZ figure caption ends with the unfinished fragment 'basic...'.","status":"applied_in_target","supersedes_id":null,"target_action":"Complete the Indonesian caption by identifying the feasible region, the three zero-slack lines, and the marked basic solutions, without changing the TikZ geometry or mathematical labels.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch07.text"],"correction_type":"layout_reflow","evidence":"Pinned TikZ block near authority lines 1903--1911; final target physical page 202 and exact-byte visual audit.","id":"correction.r017.ch07-big-m-graph-label-collisions","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The mathematical graph remains complete while labels become readable without overlap.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Inline constraint and vertex labels in the Big-M feasible-region TikZ graph collide with axis ticks and extend below the plotting area at normal reader size.","status":"applied_in_target","supersedes_id":null,"target_action":"Move constraint and vertex labels into an adjacent in-flow legend, reduce redundant tick labels, and retain every boundary, vertex, infeasible wedge, and origin marker.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch07.text"],"correction_type":"layout_reflow","evidence":"Pinned overlay block near authority lines 1359--1379; final target physical page 194 and exact-byte visual audit.","id":"correction.r017.ch07-final-dictionary-overlay","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"All annotations remain readable and structurally associated with the displayed dictionary at normal page width.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Overlay arrows and callout labels in the final-dictionary remark escape the remark box and collide with prose, the border, and the following subsection in the rendered reader.","status":"applied_in_target","supersedes_id":null,"target_action":"Replace the overlay with an in-flow three-row legend that preserves the objective, basis, and nonbasis annotations.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch07.text"],"correction_type":"incomplete_caption","evidence":"Pinned simplex-basis-driven.tex authority line 1751; localized target line 1764; final page audit.","id":"correction.r017.ch07-incomplete-pivot-caption","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"A publication caption must be a complete, informative sentence and identify the endpoint already shown in the figure.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The pinned Figure 7.5 caption ends with the unfinished phrase 'the simplex path leads to...'.","status":"applied_in_target","supersedes_id":null,"target_action":"Complete the caption by stating that the shown pivot paths lead to the optimal point (4,5), without changing the graph or mathematical content.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch08.text"],"correction_type":"mathematics_prose","evidence":"Pinned simplex-matrix-version.tex near authority line 1084 and independent basis/reduced-cost replay.","id":"correction.r017.ch08-nonoptimal-basis","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The prose conclusion must match the displayed certificate.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The follow-up prose calls the basic solution (6,5) 'not necessarily optimal' even though its computed positive reduced cost supplies a strict improving move and proves it nonoptimal.","status":"applied_in_target","supersedes_id":null,"target_action":"State that (6,5) is not optimal, without changing any point, matrix, reduced cost, or objective value.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch08.text"],"correction_type":"exercise_semantics","evidence":"Pinned simplex-matrix-version.tex near authority line 855 and independent reduced-cost replay.","id":"correction.r017.ch08-two-candidate-optimality","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The prompt must not assert the false conclusion it asks the student to determine.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The matrix-simplex exercise prose says the reader will verify that both candidate basic solutions (6,5) and (0,8) are optimal, although the exercise's purpose and reduced-cost calculation distinguish their optimality.","status":"applied_in_target","supersedes_id":null,"target_action":"Ask whether each candidate is optimal while preserving both points, all matrices, and the requested calculation.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch13.text"],"correction_type":"source_figure_metadata","evidence":"Pinned multi-objective source figure geometry compared with the localized figure labels and alternative text during the final high-resolution page audit.","id":"correction.r017.ch13.pareto-curve-axis-semantics","rationale":"Accessible text and visible labels must describe the mathematical geometry actually plotted; reversing the axes changes the meaning of every displayed point.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The Pareto-curve source geometry places maximum risk cost on the horizontal axis and total cost on the vertical axis, but upstream metadata and the former image ActualText described those axes in the opposite order.","status":"applied_in_target","supersedes_id":null,"target_action":"Localize the visible axis labels according to the plotted geometry and replace the Indonesian ActualText with the same correct horizontal/vertical semantics.","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.r017.book1.ch15.text"],"correction_type":"missing_build_asset","evidence":"Pinned 00_METADATA.bib entry, absence of the authority image path, localized chapter figure reference, and successful final build file-use witness.","id":"correction.r017.ch15.knapsack-static-asset-closure","rationale":"The figure is required for deterministic Book 1 compilation and its third-party rights must remain narrower than the repository-level content license.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The pinned authority carries the wiki-File-knapsack metadata and an active figure reference but omits the corresponding static image file from the frozen figure directory.","status":"applied_in_target","supersedes_id":null,"target_action":"Admit wiki-File-knapsack.png as an explicitly inventoried target-only static asset and retain its upstream CC BY-SA 2.5 attribution metadata.","upstream_report_disposition":"not_opened; no author contact during production"},{"affected_unit_ids":["unit.r017.book1.ch01"],"correction_type":"build","evidence":"preamble/id-ID-source-corrections.bib and localized preamble0-biblatex.tex.","id":"correction.r017.chapter1-citation-closure","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The explicit additive file closes the first-unit bibliography without mutating or misrepresenting the pinned bibliography submodule.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Four citation keys used by pinned Chapter 1 are absent from every pinned upstream bibliography file.","status":"applied_in_target","supersedes_id":null,"target_action":"Add a separately named derivative bibliography containing source-backed records for informs2026edelman, holland2017ups, smith1992yield, and kroon2009dutch, and register it in the localized biblatex preamble.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch01"],"correction_type":"source_fact","evidence":"INFORMS Franz Edelman Award page, accessed 2026-08-21; citation key informs2026edelman in preamble/id-ID-source-corrections.bib.","id":"correction.r017.edelman-benefit-total","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The localized edition follows the cited primary source rather than silently reproducing the inconsistent number.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Pinned Chapter 1 states that Franz Edelman Award finalists documented benefits exceeding USD 446 billion; the cited official INFORMS source reports USD 419 billion.","status":"applied_in_target","supersedes_id":null,"target_action":"Render USD 419 billion in the Indonesian text and preserve the correction as an explicit delta.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch02"],"correction_type":"external_reference","evidence":"Pinned Book 1 tree plus artifact.external.ooor-examples-authority-manifest at examples commit b924d2fe61ee0ba925903aba615db4f46e65b4be.","id":"correction.r017.examples-screen-printing-links","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The reader must not present dead controls as executable laboratories while the source defect remains auditable for later consolidated reporting.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Three active screen-printing targets return 404 at the pinned examples tree and current master; three same-repository solar-shipping targets are absent from the pinned Book 1 tree.","status":"applied_in_target","supersedes_id":null,"target_action":"Disable the two broken code-button groups in the Indonesian Chapter 2 reader, preserve the mathematical examples, and render an explicit edition note instead of fabricated placeholders.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.introduction.text","unit.r017.book1.ch01"],"correction_type":"topology","evidence":"Introduction exercise-ladder prose and Chapter 1 exercise environments at pinned source commit.","id":"correction.r017.exercise-ladder-metadata","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Avoid silently manufacturing pedagogy while preserving the observed mismatch.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The Introduction promises a graded exercise ladder, but Chapter 1 exposes no machine-readable level metadata.","status":"open","supersedes_id":null,"target_action":"Record exercises without invented levels; add explicit level tags only after source-backed editorial review.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch01"],"correction_type":"accessibility","evidence":"Official HTML reader and pinned Chapter 1 TeX.","id":"correction.r017.figure-1-4-alt","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The correction aligns nonvisual and visual meaning.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The official HTML alt text for Figure 1.4 does not match the optimization-model tree shown.","status":"applied_in_target","supersedes_id":null,"target_action":"Preserve and localize the more accurate source-TeX description.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1.ch01"],"correction_type":"accessibility","evidence":"Official HTML reader and pinned Chapter 1 TeX.","id":"correction.r017.figure-1-6-alt","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The correction adds accessibility metadata without changing mathematical content.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The official HTML reader exposes the generic alt string 'PIC' for Figure 1.6.","status":"applied_in_target","supersedes_id":null,"target_action":"Use a content-bearing Indonesian alt description in the derivative.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1","unit.r017.book1.ch02"],"correction_type":"localization","evidence":"Final controller/shared-package sources plus PDF text, TOC, part page, box headings, and outline inspection.","id":"correction.r017.generated-label-localization","rationale":"These are reader-facing structural strings rather than protected titles or code tokens.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The cumulative Indonesian reader retained three active English structural labels generated by the shared LaTeX layer: 'Linear Programming', 'Try it out visually!', and 'Case Study:'.","status":"applied_in_target","supersedes_id":null,"target_action":"Localize the part title as 'Pemrograman Linear' and the shared reader labels as 'Cobalah secara visual!' and 'Studi Kasus:'.","upstream_report_disposition":"not_upstream; locale_localization"},{"affected_unit_ids":["unit.r017.book1.ch01"],"correction_type":"layout","evidence":"Seven explicit Needspace commands plus one wrapfigure-to-figure container delta in the frozen localized Chapter 1 source, with the deterministic replay PDF/build log and all-page visual inspection.","id":"correction.r017.id-reflow-anchor-guards","rationale":"The guards keep each anchor with enough following content, while the normal float lets the unchanged diagram use a readable width in the Indonesian layout.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Indonesian reflow can strand a section or structured-box anchor at the foot of a page, and the source's narrow right-wrapped tree diagram becomes unreadable at the localized measure, even though the mathematical sequence is intact.","status":"applied_in_target","supersedes_id":null,"target_action":"Add seven localized Needspace guards before the problem-types, LP, MILP, NLP, MINLP, convex-MINLP, and robust-optimization anchors, and change the tree diagram container from wrapfigure{r}{0.34\\textwidth} to a normal figure[htbp] while preserving the exact TikZ, caption, and label; change no mathematical or translatable prose content.","upstream_report_disposition":"not_upstream; locale_specific_reflow"},{"affected_unit_ids":["unit.r017.book1.ch01"],"correction_type":"accessibility","evidence":"Exact p43 font/CMap diagnosis on the predecessor PDF and zero U+0000/U+0001 in both rebuilt localized PDFs.","id":"correction.r017.least-squares-delimiter-extraction","rationale":"The delimiter size is not mathematically significant; correct copy/extraction semantics are.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The large delimiter glyphs around the Chapter 1 least-squares residual use CMEX10 character codes without ToUnicode mappings, yielding U+0000/U+0001 during PDF extraction although the parentheses look correct.","status":"applied_in_target","supersedes_id":null,"target_action":"Render the same single-line squared residual with ordinary parentheses, preserving the exact expression while restoring clean Unicode extraction.","upstream_report_disposition":"not_upstream; localized_pdf_accessibility"},{"affected_unit_ids":["unit.r017.book1"],"correction_type":"build","evidence":"qa/baseline-build/book1-main.log, software-excel.tex line 65.","id":"correction.r017.missing-excel-solver-layout","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"The source baseline must remain reproducible and the derivative must not mask a missing upstream asset.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"A clean full-book LaTeX baseline stops because Figures/excel-solver-layout is referenced but absent from the pinned closure.","status":"open","supersedes_id":null,"target_action":"Do not invent the missing figure; preserve the failure receipt and exclude it from the first-unit closure.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1"],"correction_type":"accessibility","evidence":"Final pdfinfo and XMP readback of the 47-page and 87-page localized PDFs.","id":"correction.r017.pdf-info-metadata","rationale":"Common reader and catalog tools inspect either metadata surface; both should identify the work consistently.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The localized XMP stream carried the creator, but the classic PDF Info dictionary omitted Author and Keywords.","status":"applied_in_target","supersedes_id":null,"target_action":"Emit Robert Hildebrand as Author and an Indonesian keyword set in both hyperref/XMP metadata and the PDF Info dictionary.","upstream_report_disposition":"not_upstream; localized_metadata"},{"affected_unit_ids":["unit.r017.book1"],"correction_type":"accessibility","evidence":"Pinned accessibility preamble.","id":"correction.r017.pdf-tagging","prior_upstream_report_disposition":"hold_until_corpus_complete","rationale":"Do not claim an accessible tagged PDF when the upstream build disables it.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"Tagged-PDF metadata is disabled because the source notes a tagpdf/amsmath conflict.","status":"open","supersedes_id":null,"target_action":"Retain honest build disclosure and track tagged-PDF restoration separately.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"},{"affected_unit_ids":["unit.r017.book1"],"correction_type":"build_reproducibility","evidence":"Two independent fresh Chapter 3 build directories and one fresh Chapter 4 directory match their canonical PDF hashes byte-for-byte after the bounded primitive was added.","id":"correction.r017.pdf-trailer-id","rationale":"Clean builds from distinct output directories must reproduce the complete PDF bytes, not merely all semantic bytes before the trailer.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"pdfTeX seeded the PDF trailer /ID from the input filename and build start time, so two isolated clean builds differed only in the 64 hexadecimal trailer-ID digits.","status":"applied_in_target","supersedes_id":null,"target_action":"Set pdfTeX's trailer-ID seed explicitly to the frozen corpus, locale, draft date, and upstream authority commit before document-class loading.","upstream_report_disposition":"not_upstream; derivative_build_reproducibility"},{"affected_unit_ids":["unit.r017.book1"],"correction_type":"build_reproducibility","evidence":"Chapter 6 object-by-object replay isolated one XMP InstanceID plus three PTEX.FileName objects; canonical rebuild and clean replay then matched at SHA-256 63a97aaa....","id":"correction.r017.pdf-xmp-path-determinism","rationale":"Independent builds must reproduce XMP UUIDs, imported-XObject metadata, compressed streams, xref offsets, and final bytes exactly.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"SOURCE_DATE_EPOCH alone does not freeze hyperxmp's InstanceID because MiKTeX still exposes live date/time primitives, and relative TEXINPUTS spellings change PTEX.FileName metadata for imported PDF XObjects.","status":"applied_in_target","supersedes_id":null,"target_action":"Set FORCE_SOURCE_DATE=1 together with SOURCE_DATE_EPOCH and use the normalized absolute baseText TEXINPUTS path in deterministic build scripts.","upstream_report_disposition":"not_upstream; derivative_build_reproducibility"},{"affected_unit_ids":["unit.r017.book1.preface"],"correction_type":"rights_provenance","evidence":"Pinned and translated frontmatter/preface.tex line 28; the TODO and generic rendered acknowledgment are both preserved.","id":"correction.r017.preface-grant-attribution","prior_upstream_report_disposition":"hold_until_corpus_complete; do_not_contact_during_production","rationale":"The missing private wording cannot be reconstructed from the frozen public source and prevents a claim that publication attribution is fully closed.","recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.correction","schema_version":"0.1.0","source_defect":"The pinned preface contains an author TODO requiring an exact grant-attribution statement from a private 2026-08 email, but the statement is absent from the public authority; the rendered text contains only a generic Open Education Initiative Faculty Grant acknowledgment.","status":"open","supersedes_id":null,"target_action":"Preserve and translate the available public acknowledgment, disclose the unresolved required wording, and do not invent it or contact authors during production.","upstream_report_disposition":"not_opened; user instructed no author contact; retained for local provenance only"}],"course_id":"C130","native_snapshot_at":"2026-08-23T00:00:00+02:00","rights":[{"attribution_required":true,"changes_disclosed":true,"compatibility_note":"The pinned examples tree has no repository-local license or grant. The frozen primary project-policy authority assigns code and Excel models to MIT and expressive content/data to CC BY-SA 4.0; mixed notebooks retain both notices. Publication must preserve this provenance caveat.","component_scope":"pinned Open Optimization example notebooks, Excel models, and data linked from active Book 1 source","evidence_artifact_id":"artifact.external.ooor-examples-authority-manifest","id":"rights.external.ooor-examples-policy","license_expression":"MIT AND CC-BY-SA-4.0","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":true,"status":"verified_with_caveat","supersedes_id":null,"third_party_status":"project_policy_without_repository_local_license"},{"attribution_required":true,"changes_disclosed":false,"compatibility_note":"The exact build input is hash-bound and bibliographic attribution is preserved entry-by-entry; no repository-local license file was present, so the backend records this bounded caveat rather than inferring a license.","component_scope":"external open-optimization-bibliography references.bib build dependency","id":"rights.external.open-optimization-bibliography-caveat","license_expression":"LicenseRef-No-Repository-License-Found","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":null,"status":"verified_with_caveat","supersedes_id":null,"third_party_status":"included_external_bibliographic_metadata_without_repository_local_license"},{"attribution_required":null,"changes_disclosed":true,"component_scope":"external proprietary runtime; not redistributed","id":"rights.external.proprietary","license_expression":"LicenseRef-Proprietary-External","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","redistributed":false,"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":null,"status":"external_dependency","supersedes_id":null,"third_party_status":"external_not_redistributed"},{"attribution_required":true,"changes_disclosed":false,"component_scope":"pinned Pyomo Gallery transport notebook and its direct companion closure","evidence_artifact_id":"artifact.external.pyomo-gallery-authority-manifest","id":"rights.external.pyomo-gallery","license_expression":"BSD-3-Clause","license_file":"authority/external/pyomo-gallery-0c00b58439b6465cb30b9bf806519b1ade228ecc/LICENSE.md","license_file_sha256":"a213fcc752f2a8d2d63b275198522b7423126670914a4001756e1589869fc279","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":false,"status":"verified","supersedes_id":null,"third_party_status":"third_party_external_source"},{"additional_notice_file":"authority/runtime-licenses/highspy-1.15.1/THIRD_PARTY_NOTICES.md","additional_notice_sha256":"52979632c5d3cc026f36730eae2b112ace72eb2f0792feb0591036e9c16e4aee","attribution_required":true,"changes_disclosed":false,"compatibility_note":"The standard highspy wheel excludes HiPO extras. Preserve the full notice for CLI11 (BSD-3-Clause-like), pdqsort (Zlib), and zstr (MIT); amd, metis, and rcm notices concern expressly avoidable HIPO=OFF components. Do not describe the complete closure as MIT-only.","component_scope":"highspy/HiGHS 1.15.1 standard wheel and bundled third-party notices","id":"rights.highspy.runtime","license_expression":"MIT AND LicenseRef-HiGHS-Third-Party-Notices","license_file":"authority/runtime-licenses/highspy-1.15.1/LICENSE.txt","license_file_sha256":"dd4cdc98726c5657e39129be5bc4c1c452e8e242325807f99aeaa38605af1ca4","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":false,"status":"verified","supersedes_id":null,"third_party_status":"third_party_runtime"},{"attribution_required":true,"changes_disclosed":false,"compatibility_note":"The manifest freezes the primary license and all 16 additional packaged license files; preserve the full set.","component_scope":"NumPy 2.5.2 frozen runtime wheel and its complete packaged license set","id":"rights.numpy.runtime","license_expression":"BSD-3-Clause AND 0BSD AND MIT AND Zlib AND CC0-1.0","license_file":"authority/runtime-licenses/numpy-2.5.2/LICENSE.txt","license_file_sha256":"a804dff0ead9fadc5293456410bcbfc32bf024be9c4513459663fb7b442d2341","license_manifest":"authority/runtime-licenses/MANIFEST.csv","license_manifest_sha256":"71451702ae6d014eb1e59fbd8ac950fa9f26b0bab47661817b5fe65daf41b329","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":false,"status":"verified","supersedes_id":null,"third_party_status":"third_party_runtime"},{"attribution_required":true,"changes_disclosed":true,"component_scope":"new O018 Python code, tests, runner, and dependency lock configuration","evidence_unit_id":"unit.o018.lab.attribution","id":"rights.o018.code","license_expression":"MIT","license_file":"source/o018-open-solver-lab/LICENSE-CODE.txt","license_file_sha256":"3af65c07da546f32647333f84eb682f040ed45cabfa14ce5e1650f6a67f00ceb","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":false,"status":"verified","supersedes_id":null,"third_party_status":"new_derivative_workflow_code"},{"attribution_required":true,"changes_disclosed":true,"component_scope":"O018 adapted prose, attribution, problem data, expected results, and computed result data","evidence_unit_id":"unit.o018.lab.attribution","id":"rights.o018.prose-data","license_expression":"CC-BY-SA-4.0","license_file":"authority/upstream/open-optimization-or-book-1745df89b608899f66983834fa4ec8c8910d18ff/LICENSE-Content","license_file_sha256":"5e436ff8ffbb77d8607220e9bce20c8915d860010feeb6c1ebef5a85688e9b39","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":true,"status":"verified","supersedes_id":null,"third_party_status":"separately_attributed_derivative"},{"attribution_required":true,"changes_disclosed":false,"compatibility_note":"The package metadata identifies BSD-3-Clause; the complete frozen LICENSE.md also carries additional notices and must be preserved.","component_scope":"Pyomo 6.10.1 frozen runtime wheel and bundled notices","id":"rights.pyomo.runtime","license_expression":"BSD-3-Clause AND LicenseRef-Pyomo-Additional-Notices","license_file":"authority/runtime-licenses/pyomo-6.10.1/LICENSE.md","license_file_sha256":"a57ea3ac2d2dec65238989c17c7f4839481b9810bcec159c7977eac55fc75e69","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":false,"status":"verified","supersedes_id":null,"third_party_status":"third_party_runtime"},{"attribution_required":true,"changes_disclosed":true,"component_scope":"Python, Excel model files, and build/code components","id":"rights.r017.code","license_expression":"MIT","license_file":"authority/upstream/open-optimization-or-book-1745df89b608899f66983834fa4ec8c8910d18ff/LICENSE-Code","license_file_sha256":"cf0ed20e761f6d583f137d13d803733f4a9b5362521d0d1d28a223962167819f","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":false,"status":"verified","supersedes_id":null,"third_party_status":"first_party_upstream"},{"attribution_required":true,"changes_disclosed":true,"component_scope":"original textbook prose, formulas, and original figures","id":"rights.r017.content","license_expression":"CC-BY-SA-4.0","license_file":"authority/upstream/open-optimization-or-book-1745df89b608899f66983834fa4ec8c8910d18ff/LICENSE-Content","license_file_sha256":"5e436ff8ffbb77d8607220e9bce20c8915d860010feeb6c1ebef5a85688e9b39","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":true,"status":"verified","supersedes_id":null,"third_party_status":"first_party_upstream"},{"attribution_required":true,"changes_disclosed":true,"component_scope":"adapted linear programming notes","evidence_unit_id":"unit.r017.book1.sources","id":"rights.thirdparty.bish","license_expression":"CC-BY-SA-4.0","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":true,"status":"source_notice_preserved","supersedes_id":null,"third_party_status":"third_party"},{"attribution_required":true,"changes_disclosed":true,"component_scope":"adapted Linear Inequalities and Linear Programming material","evidence_unit_id":"unit.r017.book1.sources","id":"rights.thirdparty.cheung","license_expression":"CC-BY-SA-4.0","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":true,"status":"source_notice_preserved","supersedes_id":null,"third_party_status":"third_party"},{"attribution_required":true,"changes_disclosed":true,"compatibility_note":"The pinned attribution names CC BY 3.0 US, retains the source and authors, and records the adapter's-license provision used for the CC BY-SA 4.0 edition; the exact source notice remains included.","component_scope":"adapted Foundations of Applied Mathematics material","evidence_unit_id":"unit.r017.book1.sources","id":"rights.thirdparty.foundations","license_expression":"CC-BY-3.0-US","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":false,"status":"verified_from_pinned_attribution","supersedes_id":null,"third_party_status":"third_party"},{"additional_notice_file":"authority/upstream/open-optimization-or-book-1745df89b608899f66983834fa4ec8c8910d18ff/Intro-Math-Programming/baseText/optimization/figures/figures-static/00_METADATA.bib","additional_notice_sha256":"d4aea30cb180732126f81989096b35ff938447fe6df9ae0ed408c592c9664aed","attribution_required":true,"changes_disclosed":true,"component_scope":"wiki-File-knapsack.png illustration used in the introductory integer-programming chapter","id":"rights.thirdparty.knapsack-wikimedia","license_expression":"CC-BY-SA-2.5","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":true,"status":"verified_from_upstream_metadata","supersedes_id":null,"third_party_status":"third_party_static_figure"},{"additional_notice_file":"authority/upstream/open-optimization-or-book-1745df89b608899f66983834fa4ec8c8910d18ff/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","additional_notice_sha256":"959514a382acfdce47cc3ea8ae2ca69f9744ba01da12e39a9e5396919adaaf41","attribution_required":true,"changes_disclosed":true,"component_scope":"Konigsberg_bridges.png historical map used in the graph-algorithms chapter","id":"rights.thirdparty.konigsberg-wikimedia","license_expression":"CC-BY-SA-3.0","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":true,"status":"verified_from_source_attribution","supersedes_id":null,"third_party_status":"third_party_static_figure"},{"attribution_required":true,"changes_disclosed":true,"component_scope":"adapted Math in Society graph-theory material and figures","evidence_unit_id":"unit.r017.book1.sources","id":"rights.thirdparty.lippman","license_expression":"CC-BY-SA-3.0-US","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":true,"status":"source_notice_preserved","supersedes_id":null,"third_party_status":"third_party"},{"attribution_required":true,"changes_disclosed":true,"component_scope":"Math in Society graph presentation and annotation over Sam Beebe's Pleasant View aerial photograph","evidence_unit_id":"unit.r017.book1.sources","id":"rights.thirdparty.lippman-sam-beebe","license_expression":"CC-BY-SA-3.0-US AND CC-BY-2.0","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":true,"status":"source_notice_preserved","supersedes_id":null,"third_party_status":"third_party_compound"},{"attribution_required":true,"changes_disclosed":true,"component_scope":"adapted A First Course in Linear Algebra material","evidence_unit_id":"unit.r017.book1.sources","id":"rights.thirdparty.lyryx-kuttler","license_expression":"CC-BY-4.0","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":false,"status":"source_notice_preserved","supersedes_id":null,"third_party_status":"third_party"},{"additional_notice_file":"authority/upstream/open-optimization-or-book-1745df89b608899f66983834fa4ec8c8910d18ff/Intro-Math-Programming/baseText/optimization/figures/figures-static/00_METADATA.bib","additional_notice_sha256":"d4aea30cb180732126f81989096b35ff938447fe6df9ae0ed408c592c9664aed","attribution_required":false,"changes_disclosed":true,"component_scope":"wiki-File-Petersen-graph-3-coloring.png figure used in the integer-programming chapter","id":"rights.thirdparty.petersen-public-domain","license_expression":"LicenseRef-Public-Domain","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":false,"status":"verified_from_upstream_metadata","supersedes_id":null,"third_party_status":"third_party_public_domain_static_figure"},{"attribution_required":true,"changes_disclosed":true,"component_scope":"adapted Applied Finite Mathematics material","evidence_unit_id":"unit.r017.book1.sources","id":"rights.thirdparty.sekhon-bloom","license_expression":"CC-BY-4.0","non_endorsement":true,"recorded_at":"2026-08-23T00:00:00+02:00","responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.right","schema_version":"0.1.0","share_alike_required":false,"status":"source_notice_preserved","supersedes_id":null,"third_party_status":"third_party"}],"schema":"c130-native-ledger-view/1","segments":[{"canonical_native_record_sha256":"95990c5010478869eb11f4177e03ec8ef21aa5cfcbad3a6cbe4ab1392c310139","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"03dc071d7418b1118ee89532ac9af8cea39cafb42b19638113ad47448fe2fb91","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ed1fccfe14305915ce8f862a6307e22300cf129627eedf7c35027f23a1396c64","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4030fac1fcf37351e3ce468bb00b4b6d9b5bb2f06997cf4f191ec635e33d8f91","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"790a57a561623f29a6547853ac66b978976c3ad2083aa9b2325a150b085327ff","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d643378581fca5d75168e4a67e129fd9e85685e7d5104c297c61fa4cb786d2ec","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.attribution","verification":{"source":{"archive":"labs","line_range":[5,8],"member":"source/o018-open-solver-lab/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"f62471683a1e5d34d2e2a12f1bf9ba1ae441ea9d1c2b8a157a1bfdb3c4a439b3","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fa27fef66b8b0ebf65061827bb9184f1b22e80f1cb9a56d64b4534ebf25dc909","source_edition_id":"edition.o018.id-id.draft","source_line_end":10,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.attribution","verification":{"source":{"archive":"labs","line_range":[10,10],"member":"source/o018-open-solver-lab/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"0598a5e238757f4383155a659c120c1a4a7aabec2f3645bf29b3672fd806f289","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"dbfb28c541aef254b98635201e78d256b9799d747b41fb15245d1e3c48ee3c5e","source_edition_id":"edition.o018.id-id.draft","source_line_end":15,"source_line_start":12,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.attribution","verification":{"source":{"archive":"labs","line_range":[12,15],"member":"source/o018-open-solver-lab/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"71d937113001584c5911916bf65b78398642cb192427a9c65623ad402c9cdfb6","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ed9178ff7a813fa34b92a644442c5ea5644f297800df6b927e3b2644fba71868","source_edition_id":"edition.o018.id-id.draft","source_line_end":17,"source_line_start":17,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.attribution","verification":{"source":{"archive":"labs","line_range":[17,17],"member":"source/o018-open-solver-lab/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7ea7e1493af7466d7051a2b6efecf0457934e6c39e36fd3d234b15cd863261e9","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ef77e856b6d0be12b7acdac6f13c883e1d48c2426f0054d4499785cd0fde5797","source_edition_id":"edition.o018.id-id.draft","source_line_end":21,"source_line_start":19,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.attribution","verification":{"source":{"archive":"labs","line_range":[19,21],"member":"source/o018-open-solver-lab/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"bbb4cc09d877f095f0e40e04f603b7e0cf08e37a63c1fe245b8a5b53c9839c0f","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"07ba83ec5e4ed6f60d2c29fd30b6535810da46360660082c2bb7e7ff0132e60e","source_edition_id":"edition.o018.id-id.draft","source_line_end":23,"source_line_start":23,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.attribution","verification":{"source":{"archive":"labs","line_range":[23,23],"member":"source/o018-open-solver-lab/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e4d5fd7ec8ded27df9a0985d28bcec55110acd96302744e13f286fac6ec9f3f1","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ed5719fbfc9a520256807f64eec02a9cf9f73a16adacd1493bcbf43a84c8b094","source_edition_id":"edition.o018.id-id.draft","source_line_end":31,"source_line_start":25,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.attribution","verification":{"source":{"archive":"labs","line_range":[25,31],"member":"source/o018-open-solver-lab/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"48c8b7796acc8d209d51f3cc42764ac0a6ae0fef8b0fa243bfaeddaea6c9fb27","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"89fc83c3f43ed7d09fd9fc59fabd1a66582c384b837fdd64d5f04a8fa538c9aa","source_edition_id":"edition.o018.id-id.draft","source_line_end":38,"source_line_start":33,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.attribution","verification":{"source":{"archive":"labs","line_range":[33,38],"member":"source/o018-open-solver-lab/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2d51a444287fc0b1c3d9f5b944ef62460a42cd713f5a69fe8ae2198fc9d7e267","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"03dc071d7418b1118ee89532ac9af8cea39cafb42b19638113ad47448fe2fb91","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"46a48ff41a1fb7edfbce79677db9e4843d1df75ab9b63ed7aecc5e033beeac78","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3360c84e6b18898f47be92320248fc96657c28f355a6fd8c038d38028a13b6e4","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"3e7aad1d219b11be3d982d7cda79fc96b12a70de019915d3e7eb70c335dc0afd","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"89b19f8a187b1783871ecb055d2dae2b42f24de7cb096504a381f1ad83b421a2","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[5,8],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"60ac95a69e52f9e81bb0170d431d3866541205b6d891e4e1542d01a39cbf2fec","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0638c42ec5663f191389810968a6a795d0515371e937b35d486436c029fc6e94","source_edition_id":"edition.o018.id-id.draft","source_line_end":10,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[10,10],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"fc8716114647bea35818f45cc9f91fe093699261f67bb6d273178984c96c5bf4","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"1f700da9de668aaac8342de1c661009f3745bf00d8790fec1cbd8ce6089fc74f","source_edition_id":"edition.o018.id-id.draft","source_line_end":15,"source_line_start":12,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[12,15],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"4d85f0a25e72cb1739c7ab0dbb5ed6ee3a96f076218548850751339a13174795","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"02ad5e6407d9c3a8d03d7b71abbc49127604a17b0f04d4b19d1b356b59233fdf","source_edition_id":"edition.o018.id-id.draft","source_line_end":23,"source_line_start":17,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[17,23],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"8491d3b9414c818ce7882f12ef99a7f8a0835971860c18802f29a9783950f9a7","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ed9178ff7a813fa34b92a644442c5ea5644f297800df6b927e3b2644fba71868","source_edition_id":"edition.o018.id-id.draft","source_line_end":25,"source_line_start":25,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[25,25],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"a786f091704bcd2ec5ee216b8ce16f4dff60481739b20f73c8f8da23535c74c2","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"aba44f76223599901db2e0ac4361d826e53e6b6ed364f1c180f55e09990efe81","source_edition_id":"edition.o018.id-id.draft","source_line_end":29,"source_line_start":27,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[27,29],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"42dcd4b9f5c09871132b99b0f6a7fee95b3b63c5317b7fa60b472bc73f518196","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"cf9234ecb2547cac4648dd50fc78497f1a75f1f0c6c075dce496e0edafee8906","source_edition_id":"edition.o018.id-id.draft","source_line_end":31,"source_line_start":31,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[31,31],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"126f123d6ffd45ed6209989378ac0a49b39eff3275431669509a5bfba7aff6e8","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"1655fb270149f0d9f373a1b193d9d640ce7fb79f450dc4d1433d3a827e9bad21","source_edition_id":"edition.o018.id-id.draft","source_line_end":36,"source_line_start":33,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[33,36],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7836fa0be952fe0a23cb01ea7a3e568fbb37abb9441de2a69299a58f59d5098d","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4b673cbb4ba90257ae45663d3594acca57e61f17b2211a0c9fbc08002cd3880c","source_edition_id":"edition.o018.id-id.draft","source_line_end":38,"source_line_start":38,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[38,38],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e08ec03e939b7d641c174a6ee95b31fd05853313792165af30bcfddb1ae1c5c3","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f13a6496bf2fd4ed6a15ec8676edfc442dad2836b0d5fcc77c89556a72f1724d","source_edition_id":"edition.o018.id-id.draft","source_line_end":42,"source_line_start":40,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[40,42],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2ef648fc511fed2ec4f5798c7e1987079fba488d358804c0dd06f3c428c850d7","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch03.attribution.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch03.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"8d402569f487e136e4f9d90baa52b9aef4974b2748ff75716a34e508aa12888b","source_edition_id":"edition.o018.id-id.draft","source_line_end":48,"source_line_start":44,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.attribution","verification":{"source":{"archive":"labs","line_range":[44,48],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"37aa1b753ae1cdddd4beb70f7ced8569eae4864710ae45a0fb7effdc566c3f4d","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a420e7a7ae56d334158133a330fc6d302359749838dbc4131935def9207f6da3","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7428f3edd8cd80fa66567e0b922ee0ae2a70b66dfbe7c154e1e3f10886e891bb","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"998cf87343250c10f0d0caf32dd6c0807646af2b655af23174d1c187884104ca","source_edition_id":"edition.o018.id-id.draft","source_line_end":7,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[3,7],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"21430b3efaecea7181ea8651cec6d56e190f266cc1c25bcde90cf44b8e338161","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"63b71307503deb121c03f1b147205bbdac988bb6186548abbbcd572647da9960","source_edition_id":"edition.o018.id-id.draft","source_line_end":9,"source_line_start":9,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[9,9],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"fee3483ff610e94ebebbef4bc70b52ad06101e61549fa4907525f4bcf68dd5a9","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"8da6ced15ad170b9564d3734f9c193167740b01f797f1171d34fb290cde71ce3","source_edition_id":"edition.o018.id-id.draft","source_line_end":21,"source_line_start":11,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[11,21],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"15bace11a20c60b57b43cd2c50c84ad02afcdb7fbd6b0213fdce0f1e44a475fb","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"53333bb59afe140cb85d91d1844f75e1ea1be07751b283b706d4b357f9d23c21","source_edition_id":"edition.o018.id-id.draft","source_line_end":26,"source_line_start":23,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[23,26],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"80a951e3e18add5a0c09d514859fb0144cc405cc7523372dbb883374f20b10c4","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"8f52b9518edaea0da22dd00d2f685183d9d2c79f1fd5952bc7d09aa7d0f43462","source_edition_id":"edition.o018.id-id.draft","source_line_end":28,"source_line_start":28,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[28,28],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"3b095d90fb3f4729d024b6243acc4355aaba3ca896235b22919673470c29f9e8","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"110dfe0dfceef823b4b2fe164748133b210c522d0284415fd13d220f7d658bba","source_edition_id":"edition.o018.id-id.draft","source_line_end":47,"source_line_start":30,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[30,47],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"dbc9c401db1b89ceb55f46843ed99b5bd9f8a03d995b0df0ed8f2c7d3497b4a1","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"54d12e6a461fe073aab08f162c42f790522ed630996055e1d8daec6c229332a4","source_edition_id":"edition.o018.id-id.draft","source_line_end":49,"source_line_start":49,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[49,49],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"643ff88834f2a378cd8d83f80a12d79e911a50c230c6234d3a21bd1cc76e0af2","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"379949b1ece2c14708cc6ba439dc494915cc1350edaaaadf22ee0d1766a26109","source_edition_id":"edition.o018.id-id.draft","source_line_end":57,"source_line_start":51,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[51,57],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"22fe32899831314734e89140d9168d23a3bef64de1c08e5635c51d8f486a5b4e","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a3485717a7b62b3512c94b0eef6d5c21c6908a45029fc0e7224c24a443cf6b67","source_edition_id":"edition.o018.id-id.draft","source_line_end":62,"source_line_start":59,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[59,62],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"50b64e44bd34df712ea7dbb6be419850ee65bd9454e37dbdc5ae7259a450fc2a","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2336aac0f30d436cb0c85b59b2c010f570e954524e7ceacf683898ca856f643b","source_edition_id":"edition.o018.id-id.draft","source_line_end":64,"source_line_start":64,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[64,64],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"1842144c03422335ad441b62906e7808332405297f5090c5f62453b08222d602","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"81b9ed9edd1dbe9ad00c3505d37f74ebc91d5255af6c378a4a9d148d2f819747","source_edition_id":"edition.o018.id-id.draft","source_line_end":67,"source_line_start":66,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[66,67],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"351ad45586ca23289ef9a95df9d9afeca1b1b4457379ed7b6f0c902489c64f71","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"be01a8e2d130687234ad5eb8e9aef1ec9f9b4036be4fae73491375fc404148b8","source_edition_id":"edition.o018.id-id.draft","source_line_end":75,"source_line_start":69,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[69,75],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"62738f3a6e721e5c28d8e22da6ac3dfc582183b1842bb1aeef938493da84a773","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d029a66bb75f1d7c56b24c38dda2bec2c818933edb17241a136ee7dedd8ee8a5","source_edition_id":"edition.o018.id-id.draft","source_line_end":79,"source_line_start":77,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[77,79],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b34d1332fb7db3747d72b01beab0ec8c6bde5fe33a6b14ea0fe6ae2cd63d2188","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-015","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fff297cd3ee8c544da19eb61ea9fced4cf0e0f3e3e4d99c96a7d66d3bac5523f","source_edition_id":"edition.o018.id-id.draft","source_line_end":81,"source_line_start":81,"source_local_id":"block-015","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[81,81],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ddbad385e42b08af0fc3b13a1135ca52810e477a87dfd61cbd0a475c9b04910f","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-016","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2f1fc619b920eac6ba8a2fd3f19747c4452fcb742ba73551991231e65c32d22b","source_edition_id":"edition.o018.id-id.draft","source_line_end":85,"source_line_start":83,"source_local_id":"block-016","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[83,85],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"410ff8e24c38b2c71180ac8f89f8f1340c5bf18b81281631c906b95eaf6c7954","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-017","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"977a6b9d86eacf5b4d5aab4a22e9ec33c19fae03cdc7e984abf1357352c2e3bd","source_edition_id":"edition.o018.id-id.draft","source_line_end":95,"source_line_start":87,"source_local_id":"block-017","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[87,95],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"80c7ce8ff5fd8391d32ac9bfac54300049eb45bf0bead6da54798221e5a277ff","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"id":"segment.o018.lab.ch03.readme.block-018","locale":"id-ID","parent_id":"unit.o018.lab.ch03.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"42e2475e2083d10f4a7e932f115c7de4c6629e8ae7e1969ea3d37846a3147af2","source_edition_id":"edition.o018.id-id.draft","source_line_end":100,"source_line_start":97,"source_local_id":"block-018","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch03.readme","verification":{"source":{"archive":"labs","line_range":[97,100],"member":"source/o018-open-solver-lab/ch03-spreadsheet-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ea7d66f7ba57d59852c3936491cf1a4200ed58d570c8d472fada12d5ccfc871d","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"03dc071d7418b1118ee89532ac9af8cea39cafb42b19638113ad47448fe2fb91","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"008c4b0bbb0fb4abc374ff8c441a652f0275e1a8fa266c730cac8e3ee94f9830","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3360c84e6b18898f47be92320248fc96657c28f355a6fd8c038d38028a13b6e4","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"96cdd3f4866867f80977219136144457342df7be67f4c22e9073bd5b7c840393","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"bf3b4622c2b2ca417e2d3b565718e91d938d915e3f7b0e1c3fab0bbaf8d4ce5f","source_edition_id":"edition.o018.id-id.draft","source_line_end":9,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[5,9],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"5689936ea2eafcad7f4fa684d30c5a612042d81db8a42a9c17be93e939eca4db","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b49d88d6e1f7652ca44f1cfcb1de27793fb7e655c7c6da4d9ee1ac3b00adc64d","source_edition_id":"edition.o018.id-id.draft","source_line_end":11,"source_line_start":11,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[11,11],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"1c80018194d2b7c0e7c5f90b691f5bbf462345e2706fd3df704076a366dc2a54","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"cb1fe3c470bbd5ca8efb20798e579322b173971b85e2e25926ce86c0e650d139","source_edition_id":"edition.o018.id-id.draft","source_line_end":16,"source_line_start":13,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[13,16],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"23a92a99989e1c0016b947249a763f1fc8683a918f334b662f9b3d93c8e951ce","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4366642e467283e63feab0f435b9bcd0a6f784ce3960c1e1f40b23556a37873f","source_edition_id":"edition.o018.id-id.draft","source_line_end":24,"source_line_start":18,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[18,24],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"abf73c3d77d723c7e3d2e793ac78e441fafa836fb38952341a137332b080053c","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3f29a8050a8c4892e70becd4c57a95ae66a7a1603d31baf73126c895b96d6311","source_edition_id":"edition.o018.id-id.draft","source_line_end":30,"source_line_start":26,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[26,30],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"744f2a53052f7c255463cffcb24a0117df55b3cc4f9e711906a08ea6a77d9ee0","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fd2395fb30798caa7a74e44cfc93e8d4c2d39eaaa4f3ec5b144bf24633935ecc","source_edition_id":"edition.o018.id-id.draft","source_line_end":36,"source_line_start":32,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[32,36],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"eeb0073992642b984c0f9a1b394a8fa8ff5a8e1094f1ed65417eb3363357a59a","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"56ac10d3bb47683f79913bb636377322e130a65b317444117ac9b51d7a471f28","source_edition_id":"edition.o018.id-id.draft","source_line_end":39,"source_line_start":38,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[38,39],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"a24d3ef9e22e6488ca4b2398d5e64b9c4e6fdc84a08d4caa466663176935ccf3","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ed9178ff7a813fa34b92a644442c5ea5644f297800df6b927e3b2644fba71868","source_edition_id":"edition.o018.id-id.draft","source_line_end":41,"source_line_start":41,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[41,41],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"c89cf4059f9276b959566fad624b9431d1b8f79b9122fa3e78a630422b93841a","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0f1471641a424616e01ef88bc7e023dd9ade2ff26e2472659e94952038a9cf8c","source_edition_id":"edition.o018.id-id.draft","source_line_end":46,"source_line_start":43,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[43,46],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"68ede93da55c78a6c5cb953bc6256aeff32785753d6357b1a717e59000a85a63","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"023bdd58994f1c92a5de7f55f0976d362e5065fec3981230b63cb67d3fceedb7","source_edition_id":"edition.o018.id-id.draft","source_line_end":48,"source_line_start":48,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[48,48],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"a0f54ef140e5f77d8492af1594a4f212e28e6feb411cd9dc9587d9c98f63f238","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"27280734cae44b85a0bbada6f4f38c9377a1e7e8a200a3f1eb5bc1fbe0436b4b","source_edition_id":"edition.o018.id-id.draft","source_line_end":53,"source_line_start":50,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[50,53],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"d098268789c9533740dc53e61035699bbb227820db738998d0934e8f1fab9102","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4b673cbb4ba90257ae45663d3594acca57e61f17b2211a0c9fbc08002cd3880c","source_edition_id":"edition.o018.id-id.draft","source_line_end":55,"source_line_start":55,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[55,55],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"1b61ce7d7703dc4a554c8092a90ec569475efc91a2d57df893bf68c78f9ab1be","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-015","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f13a6496bf2fd4ed6a15ec8676edfc442dad2836b0d5fcc77c89556a72f1724d","source_edition_id":"edition.o018.id-id.draft","source_line_end":59,"source_line_start":57,"source_local_id":"block-015","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[57,59],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"71fb551062630dba6e253ff891e85499f0e8fe05260a9e30285b5ae67523693c","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-016","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d9462549a464f620bd11d5c2df364efa7b2f258efaa220f73077901db73f06f3","source_edition_id":"edition.o018.id-id.draft","source_line_end":65,"source_line_start":61,"source_local_id":"block-016","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[61,65],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"02b1fe0edad6edfab65146ceb8e33aa096e623495a304635761c66884e83cd8d","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-017","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"80e100e6891a08acb5b4b7d2e0a45adbbfc0063bcf21e79ddd8d422ea7d08a40","source_edition_id":"edition.o018.id-id.draft","source_line_end":67,"source_line_start":67,"source_local_id":"block-017","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[67,67],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"8575cce91a0da61862e0dd924838d882140db4ff6401c15f4fa50960bfa62d98","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch04.attribution.block-018","locale":"id-ID","parent_id":"unit.o018.lab.ch04.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0f0529188b22178d68f8e1167db5b71f7ae83ea4a0ae03c7a4562cedaca9ced6","source_edition_id":"edition.o018.id-id.draft","source_line_end":75,"source_line_start":69,"source_local_id":"block-018","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.attribution","verification":{"source":{"archive":"labs","line_range":[69,75],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"9625744308f0938f38f533a24df2573a41cfb1ee06d8afd04bb7ecc60bb7544a","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f2b71cb3b9cde23c69b9ec939fb8d5bcb70f9e692daa84d9aafb3f199bc53ad3","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"555c50ee676daa3969f9b80f56647db99f99e570788ce265993c1626ae831685","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"bcd73df80ea4f604e812191c05ea89d0e719cfa44b071bbb9f4fa2ded6adaeb8","source_edition_id":"edition.o018.id-id.draft","source_line_end":6,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[3,6],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"0ff172f49b9a590f0652cf14fe89e66537009497070d3bc23086fcd790a95a62","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"63b71307503deb121c03f1b147205bbdac988bb6186548abbbcd572647da9960","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":8,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[8,8],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"08e350e575957717c57f238e18e0eae4a157c586cb65307a46dab795348d4f58","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"645feaa12d24954bfc3f02a7742add99c9b0f41716af28df874f91b3db330803","source_edition_id":"edition.o018.id-id.draft","source_line_end":22,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[10,22],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"1a19b3e6f4b761d5e7d7dbbf85d12d80507baa5a5edb01ff76fe9ce94fce9625","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fe0e89a71dd28937c0724a72ec182f1349d99b8a4e2330de7df81fd50df68d5e","source_edition_id":"edition.o018.id-id.draft","source_line_end":28,"source_line_start":24,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[24,28],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b49a055a59dbc3d62e9a93118e6634c88bdaf3127f820d04370d749b529b05c3","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a9ad0ae0814949d4ea3cab21ef119bf6b74ed5c7b4f9c494dd6339f308cbcd3c","source_edition_id":"edition.o018.id-id.draft","source_line_end":34,"source_line_start":30,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[30,34],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"103ac727bba861c9da0e1383537d5bbc143fdceb5a4a5ca40d8741ff08b18ded","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b380688ef63a4d37235abafe6ca8bc7a5bc8d2ae69d360e7e321b41644454b27","source_edition_id":"edition.o018.id-id.draft","source_line_end":36,"source_line_start":36,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[36,36],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"81951d2d899ef563d225c2ea29db84c928c36f3c42823a01668b2a24d103660f","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"cb742be9597bc7cd50be904f912fcb9f7179928aeeac7265eb378c5b434c1c74","source_edition_id":"edition.o018.id-id.draft","source_line_end":39,"source_line_start":38,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[38,39],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"f390c7fb5bb57ccf668a1cda3cc2dca25e03a8bbbf2505d9c23cec91f47d2f55","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"c769a0c3f69a3514c24a79f01c1c84cd855f3c8e9cf7aec96973ad7b7013a59b","source_edition_id":"edition.o018.id-id.draft","source_line_end":42,"source_line_start":41,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[41,42],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"84bb50c7cd6405a1395b17fdd406a8813f1338c224c8d2f93d54747adfa69d7b","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9544c2c2adb8194405aaa4fb7eddb952c51c7adafae1af3b317b39b3601f27d8","source_edition_id":"edition.o018.id-id.draft","source_line_end":47,"source_line_start":44,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[44,47],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"937c5dcddae40978333460cdaffe3c47aae1f12f648a54717208ea7078302268","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2de1d8b31e6706173b602d4349a415f2308291bf1855b52e9d9ae9fe99ffa2e5","source_edition_id":"edition.o018.id-id.draft","source_line_end":49,"source_line_start":49,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[49,49],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"4714edbeb1984da0407f284c66663125266e77bea8cc654f71fb6d8c263cdfa5","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"1ea3a7914ff5e4880ab9ffff0e7c48bef1da7ec3d7edeffde210550bcb5d0cde","source_edition_id":"edition.o018.id-id.draft","source_line_end":51,"source_line_start":51,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[51,51],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"87dc329f844bf1d73c61767ecb767533d1c2e443f15198f0f4efcacd406699e3","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"217c14f5ed208ad54647d1cff614a475d127e058e2931bc1f3995a9082a6ff89","source_edition_id":"edition.o018.id-id.draft","source_line_end":58,"source_line_start":53,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[53,58],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"4ab15e1e5816977d76eecad8337404e960198b20f6dc9d56946c499cfaa0fcaa","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"c278e3cea4de3175cfb9270b935b77c5190349dcf35431bee8d5ffcdb9548fef","source_edition_id":"edition.o018.id-id.draft","source_line_end":60,"source_line_start":60,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[60,60],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"427e25772be1afdb1a07f774f217aaaa22e75554b03a52f0fcf002da119f0598","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-015","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"503f1934c495a130bb0425d735d88310a22bd22f38de5eb957f68cef20f0076b","source_edition_id":"edition.o018.id-id.draft","source_line_end":68,"source_line_start":62,"source_local_id":"block-015","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[62,68],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"cbe890c801d412339e118e937dea8935c0e985157e4b5f34d019ada341c61ae1","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-016","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f9edca6da6cbc8587cb01e4705c2cbbd5f7f6603b99e15098f5455d6826532ae","source_edition_id":"edition.o018.id-id.draft","source_line_end":70,"source_line_start":70,"source_local_id":"block-016","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[70,70],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"99ae2c98d94b474d9dac918511f133a7d8442c55292d651c0641ca38de1fb7aa","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-017","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"6f59cb56a9bdb84f19e1e5f94320fd4e1b8912e137854f59474f652841cce2a8","source_edition_id":"edition.o018.id-id.draft","source_line_end":73,"source_line_start":72,"source_local_id":"block-017","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[72,73],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"49da076b08f89a8539565afea10b1396c03976aabca2c213d377a571304f033f","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-018","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b1569a30f9cfd65a43fbc524fb83acc35b28f58becd8c244f255a0dc6ebe5951","source_edition_id":"edition.o018.id-id.draft","source_line_end":82,"source_line_start":75,"source_local_id":"block-018","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[75,82],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"74f22b8221f2d6a782fe25ee36519930009e0771174dcf61bcdac2fbef8b7a93","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-019","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b5e0b06fad28a36de52205c9933a5c4bf7435fe2ce0ec5cd46746e525f3ecad6","source_edition_id":"edition.o018.id-id.draft","source_line_end":85,"source_line_start":84,"source_local_id":"block-019","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[84,85],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"050eeefaff30165c965e05bfcea19113b0da3be7aef1637f09ed9e0519b91321","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-020","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"eb8db6815606b0551ca0ce33c14aeca699e02f8a87f270fc85e466edb13caf6d","source_edition_id":"edition.o018.id-id.draft","source_line_end":87,"source_line_start":87,"source_local_id":"block-020","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[87,87],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"31e170814cda1e8c1854d0950af63327ce7f0bc1ca7c619ccebca5d7fbbd666f","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-021","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f1f1db6ea6c4260414727953b58fa1fa8251492be16c3a2ba3c3023e10c189b1","source_edition_id":"edition.o018.id-id.draft","source_line_end":94,"source_line_start":89,"source_local_id":"block-021","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[89,94],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"334201f4b839cd74e12faf5b2d6afc64d8b8f2e4b7bf3ccf35baee3db11d251e","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-022","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2336aac0f30d436cb0c85b59b2c010f570e954524e7ceacf683898ca856f643b","source_edition_id":"edition.o018.id-id.draft","source_line_end":96,"source_line_start":96,"source_local_id":"block-022","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[96,96],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ecf9e4ac04f2dddb854fa03e0a9daeb450d6cdf074565bfb1e367e1505b59722","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-023","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"bfbc7c30fe0ca3fb4440d60551a545284968256172983361300ba4157581b97e","source_edition_id":"edition.o018.id-id.draft","source_line_end":99,"source_line_start":98,"source_local_id":"block-023","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[98,99],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"8ae19da627dcb2053b1dd9cba7accbd5ca56e0bf89f4fcc192ec00474c7afc8d","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-024","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"e38a71283e46e7b43067be030f70bfcc0d120ad5b62c9831684ddaff90076804","source_edition_id":"edition.o018.id-id.draft","source_line_end":107,"source_line_start":101,"source_local_id":"block-024","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[101,107],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"4261240aa97eaabfc945e8be74f06f2eadc123dd56c66e39cf7c68b641f35cbc","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-025","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"7d9004f019d8d030b8b87243290288e3ef652268ed28d12aed77b178dd3121ce","source_edition_id":"edition.o018.id-id.draft","source_line_end":111,"source_line_start":109,"source_local_id":"block-025","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[109,111],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"cc65ea2a9f61d8c24d868a9e6e650ae9042ced16e43334c8ff9f597e8493d099","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"id":"segment.o018.lab.ch04.readme.block-026","locale":"id-ID","parent_id":"unit.o018.lab.ch04.readme","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"42e2475e2083d10f4a7e932f115c7de4c6629e8ae7e1969ea3d37846a3147af2","source_edition_id":"edition.o018.id-id.draft","source_line_end":116,"source_line_start":113,"source_local_id":"block-026","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch04.readme","verification":{"source":{"archive":"labs","line_range":[113,116],"member":"source/o018-open-solver-lab/ch04-compact-modeling-replacements/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"34803544efede685c161137787b78f0a2206729b062a9f112d3634cf63b3216d","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"03dc071d7418b1118ee89532ac9af8cea39cafb42b19638113ad47448fe2fb91","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"8f9fd85e48ada8944f8409fe259a6acdeb6ad5d1db3a9be2f10db01d6d1ae689","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3360c84e6b18898f47be92320248fc96657c28f355a6fd8c038d38028a13b6e4","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"4bf180592e6148084fcb93add44e48d6a9fff2a474c232b3a97caf88fe546822","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"8a1b5f1de004bcfa52940ae2ec59b8a804626a3c98e9ebcd7a8f4a9470ddf9a2","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[5,8],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"d78b93f0078c633d6b0b619883b394582db9c3eb9a00297613fd411f998cc4a0","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"04de380c87910878d2b5a4ac278e70447d0b35d4bcdf9081416348fce4d88e12","source_edition_id":"edition.o018.id-id.draft","source_line_end":10,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[10,10],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"9fd02961225ac57a1cc896145fdcd782b9367562f4614d09248284ab36689aa8","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0068446820173bc10fe67e2737a0571bb41f037540374a5e9b557bfa8ee54b15","source_edition_id":"edition.o018.id-id.draft","source_line_end":15,"source_line_start":12,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[12,15],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"a27f8795fc2bb56f4fc1226f13185f5bfbffe3c4db2a63b501302d95748a08cc","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f8032a2a6c2f456ccfffd12413c7a549cbfe5a89e8eec77b4aa43adbb488e7ca","source_edition_id":"edition.o018.id-id.draft","source_line_end":17,"source_line_start":17,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[17,17],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2c39d0e4f15d86ab301d22a0697276e1bbe276f51fa33c6d1fd7fd24dd9cbe13","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"1e724361f491bfe2b385eb5cf59c0dc5cd041788b0ff2fa07720a913a2a1a8a2","source_edition_id":"edition.o018.id-id.draft","source_line_end":22,"source_line_start":19,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[19,22],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"807cbd65d242c3c2390b40735203662d842ee78e5c5c175026b11dd46d64d08b","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"88bf83b6f96dfbbd28e8555c4b31d0e53d9dcc74dd477d8018fb9cf09184f7cf","source_edition_id":"edition.o018.id-id.draft","source_line_end":29,"source_line_start":24,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[24,29],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"692d3679e4369cedc38f225e358fcdca870f88f4d68145b3d674809150708be4","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f28ebd6cdf5cb4c292f0cd0444aee0f108949613c883e52624998a4b7bd5b0d5","source_edition_id":"edition.o018.id-id.draft","source_line_end":35,"source_line_start":31,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[31,35],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"07cf816b25d066db2217c56622eb80212495965c68c1664164d00a6c10c2be20","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ed9178ff7a813fa34b92a644442c5ea5644f297800df6b927e3b2644fba71868","source_edition_id":"edition.o018.id-id.draft","source_line_end":37,"source_line_start":37,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[37,37],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"485984487757166d3daf0fd6ad5e1f5763d1872a105fa14e3d4b1d6914621370","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"35d8007a525808cd3321b83a4b61b8601d2364c89a76f32ea9cf2c09cb027fc6","source_edition_id":"edition.o018.id-id.draft","source_line_end":42,"source_line_start":39,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[39,42],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"5cfbb79050451724f913075136368bfc02b3bef8aeed4e7f6164c42bd1c77520","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"268b26ba1b85510abba1d3cabccaadae2bdabb1162cc339992a1c9edff2efded","source_edition_id":"edition.o018.id-id.draft","source_line_end":47,"source_line_start":44,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[44,47],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e76b32c9c8a51e997fd7570f48c4228a4386f3cfdd0af061db7a1c55b7419535","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4b673cbb4ba90257ae45663d3594acca57e61f17b2211a0c9fbc08002cd3880c","source_edition_id":"edition.o018.id-id.draft","source_line_end":49,"source_line_start":49,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[49,49],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"30be4f0ea1d68f436b4846bb59ad66fe473243c3dac88de2f1cdab4d3be052fa","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b4f60264bf5425739d82ce636693194319003d6bfa859f7f8b73a8eeb24d6702","source_edition_id":"edition.o018.id-id.draft","source_line_end":53,"source_line_start":51,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[51,53],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"26bcbd858e2df97dc96afac83e0501362ed2907e430f3778de527f732d71e2c6","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-015","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d9462549a464f620bd11d5c2df364efa7b2f258efaa220f73077901db73f06f3","source_edition_id":"edition.o018.id-id.draft","source_line_end":59,"source_line_start":55,"source_local_id":"block-015","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[55,59],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e208e47bf105e1d677c0caab13642fcbfb3b545e99f842094bbb1de63d6a5a02","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-016","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"c1ab2d666acaaba7352b106b2963878264de5802fc9d10e847433b784f26fac4","source_edition_id":"edition.o018.id-id.draft","source_line_end":61,"source_line_start":61,"source_local_id":"block-016","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[61,61],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"263a8c828aed3bcc732c5f8d376c354894060b2ae912f7c0d8e05cc75718e64b","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-017","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d63f22f2e2fec319f2e9857b109c065a68292f4278aa5156b83e070aa58abd57","source_edition_id":"edition.o018.id-id.draft","source_line_end":65,"source_line_start":63,"source_local_id":"block-017","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[63,65],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"53f1f039b49497ef5b463fc590b2b34a904103d954f7f552b9a55cd6df4993c6","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch05.attribution.block-018","locale":"id-ID","parent_id":"unit.o018.lab.ch05.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a66f3c4c44ee5108849bd22e6f140d721df33cf89e662e6469cfed3a9de07eb2","source_edition_id":"edition.o018.id-id.draft","source_line_end":72,"source_line_start":67,"source_local_id":"block-018","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.attribution","verification":{"source":{"archive":"labs","line_range":[67,72],"member":"source/o018-open-solver-lab/ch05-graphical-lp/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7f87c519a2513b8e31e886d481e6a3fed3939095a2f53c7e2b1c1557a341ecce","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"c47a7f86e110f88ff51f804a2ba5dc63368b449dcfe7a9988381e3f6e4619ccd","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"fcf7480c4734cabc1721ce92df0dbd4f78b4feeb032dbaf30690f52f1b38df6a","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b02f125a071ac427631704f50e4f85c70c1b7f75335286824dc625f35d95b471","source_edition_id":"edition.o018.id-id.draft","source_line_end":7,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[3,7],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ff4448cb2ed0f2b3de197f209ac6020a885e8759dff1e11d36af1d3bdc7d4cb4","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fbef42e4ad5650e50c27d23f8c0dff98db8a35e3eb820fb58b506c944f70536f","source_edition_id":"edition.o018.id-id.draft","source_line_end":9,"source_line_start":9,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[9,9],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"73df2f73cf1236e43409de118ca3023d8150a1970c8acad305fc778f14f16830","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"7fea9c11332734bdd944fddabdab0bdd65b09ba4cf5d0b890d17ca14d66f065f","source_edition_id":"edition.o018.id-id.draft","source_line_end":20,"source_line_start":11,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[11,20],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"330078c605d3574adaadb3fac699f5de5d3038c18df395fea82b5b03d8366b16","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"c3cdcce6beeb392435cda828a37796e24a1085cfd20957ea098a9828e9819d22","source_edition_id":"edition.o018.id-id.draft","source_line_end":24,"source_line_start":22,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[22,24],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e1e53900788aef74f7ff6991f3a71e26bbf93140f3a8356baada34ef2b071c4a","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"78189bfa315412b201b081a92ffbcae34f85b8f6c17ee03f377861b1330e363b","source_edition_id":"edition.o018.id-id.draft","source_line_end":26,"source_line_start":26,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[26,26],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"870424288b32447a3b4a4af6dd09b38598144fcee2fdcab79b50a90123edd2c3","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"96cb9d7d0f33d73352b6ae1dc013582e5e3c1270c083a8101287a91be02f6a25","source_edition_id":"edition.o018.id-id.draft","source_line_end":29,"source_line_start":28,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[28,29],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"30e7c1311acf25c7992430cdeea45da701b4c7c7caf22789811b15b01a3f7f3c","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0578d40284acd3246a18230f2fab6b2ff7760d3adad45ab0e0d87d1f7b0d0a03","source_edition_id":"edition.o018.id-id.draft","source_line_end":42,"source_line_start":31,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[31,42],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"fa0357c44260bb37c9e8803aa50fdef3b53a61c99488e633a0721b37dcf92855","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"751123b23c33fc1924770b9163ebd6dd508f40b4ff6bcb85d5f90484d4902e49","source_edition_id":"edition.o018.id-id.draft","source_line_end":47,"source_line_start":44,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[44,47],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"46e0d603811f6877abd9f5e4a9373bdc2e4cc064f23be4905e88564976059b67","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2336aac0f30d436cb0c85b59b2c010f570e954524e7ceacf683898ca856f643b","source_edition_id":"edition.o018.id-id.draft","source_line_end":49,"source_line_start":49,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[49,49],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"79414131eb1a769ed740a1335aa7cc1f93f9a96397b138105595df382c17d0b2","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"7c549e2461188854ed7ab006696d21b059d063ebcc2851ae6539e531b3ba7c74","source_edition_id":"edition.o018.id-id.draft","source_line_end":51,"source_line_start":51,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[51,51],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"5f588e1dca9015a3a6416d85290d40cff248c92654013d1e8111384c49a87aee","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d224be5efcd873f48b8a0c60dc84846ff9d639920c4bcd255d69ce0258c4687a","source_edition_id":"edition.o018.id-id.draft","source_line_end":59,"source_line_start":53,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[53,59],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"6b763ec7259ac7a21f777f100c72ad34555ebd039e938f48d9bb18c9366e9c0f","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3f6eb1a914a800ac4c18727fa0a8ef8b81b0fb268c3f14f4ddeca100591fa676","source_edition_id":"edition.o018.id-id.draft","source_line_end":63,"source_line_start":61,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[61,63],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2dae58502b255ed6560fb6c71f150797aa977f7ce9823879ceca246281ad5c3b","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"id":"segment.o018.lab.ch05.readme.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch05.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"56f15d0e66b402d11a7164db1614b0374931f73566e9011378b5e0f35fda3192","source_edition_id":"edition.o018.id-id.draft","source_line_end":68,"source_line_start":65,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch05-graphical-lp/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch05.readme","verification":{"source":{"archive":"labs","line_range":[65,68],"member":"source/o018-open-solver-lab/ch05-graphical-lp/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"059cd423cea4fcf0eb23052daa470156832c58222c52fc03f7900a1c5cd2f832","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"03dc071d7418b1118ee89532ac9af8cea39cafb42b19638113ad47448fe2fb91","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b2a3b6ff7eb5679e2f2d9384bfdbfc3a82e2f152ae51ac0f2b305355e6fae078","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3360c84e6b18898f47be92320248fc96657c28f355a6fd8c038d38028a13b6e4","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"9c984f9d2f400b403d7458f14a08cfb706c6df7f74d262e249a152894f33edbc","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"5e585aeaeda209a1cfdd475a48bb66245d6c3e7c5e95aaf9ea22c9e3bb265aef","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[5,8],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"1e755f18ed016f8878e529c9dbd8395ae5a56b97afb07971605da57c15408855","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f6c95855e53724ff6b94be3ecbea8ba8cfea0997465b997b993d7fa1eb22816f","source_edition_id":"edition.o018.id-id.draft","source_line_end":10,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[10,10],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"49d2541368003d12a757c2c51bf0bc1bd3dfd55e8c81427bbfe9fcc272c5e91b","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"400f1f6dd5c03a8241f3db235b052cd4121a2698a050e14a8de95fc92e2c2497","source_edition_id":"edition.o018.id-id.draft","source_line_end":19,"source_line_start":12,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[12,19],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"63c77c8aa7da8660fdba2f4e89b22c6c7e0ce38ae077cbf7f76594e666085432","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d326ddd6fa0e8ffe98e455f724cee5cacc3a50124e6c95acc01cec561eee3058","source_edition_id":"edition.o018.id-id.draft","source_line_end":23,"source_line_start":21,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[21,23],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"f5fad967d42d77ac14366957db929b615a26c0995278eedea0d07620c08664da","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2d48d276ac60c2d8b1fba841918fde65a1a7b92d351eddc29716597ded621f90","source_edition_id":"edition.o018.id-id.draft","source_line_end":31,"source_line_start":25,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[25,31],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7c5cb871d4f12096f74a14428a830bc04b4d5f18f05520bfea834d318bcd088a","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ed9178ff7a813fa34b92a644442c5ea5644f297800df6b927e3b2644fba71868","source_edition_id":"edition.o018.id-id.draft","source_line_end":33,"source_line_start":33,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[33,33],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"44e0d3079de050f52bbcef702486f7229d148e18511da37e15d9053e7e569237","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"35d8007a525808cd3321b83a4b61b8601d2364c89a76f32ea9cf2c09cb027fc6","source_edition_id":"edition.o018.id-id.draft","source_line_end":38,"source_line_start":35,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[35,38],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e90d99e18b4f8353ea0abc25fe91d2af3c5a3535b01f4b02a3c640f8627ecc54","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4b673cbb4ba90257ae45663d3594acca57e61f17b2211a0c9fbc08002cd3880c","source_edition_id":"edition.o018.id-id.draft","source_line_end":40,"source_line_start":40,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[40,40],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ded6a21482ef24b6fd78ec00c56a54519c2ec6b4c93f18bac33679b3bdf246c5","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b4f60264bf5425739d82ce636693194319003d6bfa859f7f8b73a8eeb24d6702","source_edition_id":"edition.o018.id-id.draft","source_line_end":44,"source_line_start":42,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[42,44],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"26b9d7f9c753725d2114cec9e58b7c7bf7b6f7471030fc181914c05e2ea21728","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"6616748e8cec407f50f5b941032503d2dba75505e54f811be03663b3a7cd9885","source_edition_id":"edition.o018.id-id.draft","source_line_end":51,"source_line_start":46,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[46,51],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"5a9d35c0bfa79a88a1501cd991f2283b6003479ed20dc0c3e51779e431a31b2f","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9d711758bbacd923032244c01f07337bbd672fb2d5aa3232a0e3a1d791234471","source_edition_id":"edition.o018.id-id.draft","source_line_end":55,"source_line_start":53,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[53,55],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"1afa5dfede58781465d11fc568c04293cd3b5d6802eeca150f4dc0d6326b507d","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3f8d25d513056446ee9406d5b477a6548e1fbda09b69a676e396a52c295e7915","source_edition_id":"edition.o018.id-id.draft","source_line_end":57,"source_line_start":57,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[57,57],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"3ba88678728c9090c118fca5129a0127521dcde12a45d8e9bca357c23dda3f09","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch06.attribution.block-015","locale":"id-ID","parent_id":"unit.o018.lab.ch06.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"12da0dc231f4afab3d74824b5f62dda4e5bc7f997805b5df400f4bf281f28eaf","source_edition_id":"edition.o018.id-id.draft","source_line_end":65,"source_line_start":59,"source_local_id":"block-015","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.attribution","verification":{"source":{"archive":"labs","line_range":[59,65],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ea7f08efd1d67250fb7d636efcb2f1e7f52f299b0c213cc996d94325525d75d5","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"id":"segment.o018.lab.ch06.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch06.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"5592f21c7cb4cf404618965b1d26023c46e8b441efc7837aa6a7070bf82cc66a","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"3ed42dab949c010900fd4d26863ea79fa833ac82769d78e7548d2ceaa6eb7071","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"id":"segment.o018.lab.ch06.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch06.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4f4a3f6019bfbf1c562423650be010b04e3838fafd8065eec4aa9e0213a48245","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.readme","verification":{"source":{"archive":"labs","line_range":[3,8],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"09d305da0022da469355ef04ceb3c5c0c4c576bb5894389d793536361c34c182","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"id":"segment.o018.lab.ch06.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch06.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fbef42e4ad5650e50c27d23f8c0dff98db8a35e3eb820fb58b506c944f70536f","source_edition_id":"edition.o018.id-id.draft","source_line_end":10,"source_line_start":10,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.readme","verification":{"source":{"archive":"labs","line_range":[10,10],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"a1cf5f42a77e555d33c44bf4994732afadaf6171294bda17e9857b7b50cedc3f","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"id":"segment.o018.lab.ch06.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch06.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"c19464225b3b2e4ae69262b4f017ff72725efbfff6494cb8afc7f1980d85788d","source_edition_id":"edition.o018.id-id.draft","source_line_end":22,"source_line_start":12,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.readme","verification":{"source":{"archive":"labs","line_range":[12,22],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"5f4a6997d7809f64904e6afb51011839593761f9957c59cfc54ee9b0d2e0d4f4","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"id":"segment.o018.lab.ch06.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch06.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"88dd06141664c6fd578f8e412c8fdddeed64de7dccc4bbb325a7d7b58c3ec742","source_edition_id":"edition.o018.id-id.draft","source_line_end":26,"source_line_start":24,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.readme","verification":{"source":{"archive":"labs","line_range":[24,26],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"682fe68a90eae360ecb1d6f5b68a264218c191576256352f2d20ba3cbd29dc97","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"id":"segment.o018.lab.ch06.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch06.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2336aac0f30d436cb0c85b59b2c010f570e954524e7ceacf683898ca856f643b","source_edition_id":"edition.o018.id-id.draft","source_line_end":28,"source_line_start":28,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.readme","verification":{"source":{"archive":"labs","line_range":[28,28],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"1ef279964a5d36a7ff00ae4b83884df71a9b1551fce126646986d59acb09647e","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"id":"segment.o018.lab.ch06.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch06.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"7c549e2461188854ed7ab006696d21b059d063ebcc2851ae6539e531b3ba7c74","source_edition_id":"edition.o018.id-id.draft","source_line_end":30,"source_line_start":30,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.readme","verification":{"source":{"archive":"labs","line_range":[30,30],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"523fb6a9f1a6523449fc5a3ab735a27611656ff8c694355fab44c60b27ebe8a6","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"id":"segment.o018.lab.ch06.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch06.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f6af4ce138c78d5c2073035a5fdb868abd446bb137af83d636dd3a525ab51039","source_edition_id":"edition.o018.id-id.draft","source_line_end":39,"source_line_start":32,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.readme","verification":{"source":{"archive":"labs","line_range":[32,39],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e2c78f2c41cb60e23fd8b63bc4586ac5343a60541760196f8463e74d293668c2","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"id":"segment.o018.lab.ch06.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch06.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"5451e5d985269deca9d822664e5b0d63bc29f06ce36959766fdd002dd5bb6bd1","source_edition_id":"edition.o018.id-id.draft","source_line_end":45,"source_line_start":41,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.readme","verification":{"source":{"archive":"labs","line_range":[41,45],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"aa62077a6990a7504ad90176927bb192571164d5d2246a706d81a5c0097199dd","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"id":"segment.o018.lab.ch06.readme.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch06.readme","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"64ee44212cedb5402556bc5427e0e58cb4563be7e6886dac499980647c73c225","source_edition_id":"edition.o018.id-id.draft","source_line_end":50,"source_line_start":47,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch06-formal-mathematics/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch06.readme","verification":{"source":{"archive":"labs","line_range":[47,50],"member":"source/o018-open-solver-lab/ch06-formal-mathematics/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"55403204dcb7636403ae0795ec917e7b066561053e620de076b4e46dd3b9d7a5","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"1727d44e56e3e5dcf119b3891af76d06304abe93172ea4ba7458ce2fbb98fd5c","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"25395bcd73364d5ab7d853d086c3f84abeed5e64dab6c1065652457073db9eea","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a0369a81c32f2868e2f9ff15a55cbd30f3d163f35cab5f698567fd8f50946ef0","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"c13014576a396cb76f41bf88993659cf9d0531bc26c8c5181859acbd37230312","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"82bf74cd591212609e6b174e263f7d904835b15bac09c3ed055ef79a44ea6986","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[5,8],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"9830c0cbe3ad024356e10c9e3e1e38070093da1c0e7a9a59e27851affbed4663","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"769a20251ec1e4b0a9cf46fea24bb2207076784f0d5d6f9de417370239665ce2","source_edition_id":"edition.o018.id-id.draft","source_line_end":10,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[10,10],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"dc24148f776bdc94b68d9617e23a3dc4ec8aca02c159e02fefd429cef0d6354d","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"1ec0841603320c61c6e70ef01afd38780bb026149883553b7aa0b389d585976e","source_edition_id":"edition.o018.id-id.draft","source_line_end":19,"source_line_start":12,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[12,19],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"fb2c0250a07cd2ea174010f06a6acf9273eae29a0650c3c5bfb1f7899c1bec47","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b1be6a5526c6afa83821c49bbaa2c6d962699dfb10097649fcd92fdc2bb81c5a","source_edition_id":"edition.o018.id-id.draft","source_line_end":22,"source_line_start":21,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[21,22],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"76650dcf6af2db9d53022971485758215e44b892455d0b3065874851c4f8e901","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"30d3ba955791711d4ced12f97f1b80dd23e406c3d2dcb82f6da0e0e49cfcbc5f","source_edition_id":"edition.o018.id-id.draft","source_line_end":27,"source_line_start":24,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[24,27],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"103d5cbf78eceeaca0e20e16572be0e7428bfada1012058fe04938dbc6d83f7c","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"756cb59dffe005b2f7f63ecd204964a221708ce1b7fabaecd26c513d0d46be7c","source_edition_id":"edition.o018.id-id.draft","source_line_end":29,"source_line_start":29,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[29,29],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"d79a1520a97922896ddee6d8c45eb75a0b9d2490e60c8da2e64ec70950fb2e9e","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"e02a19d3d521a26e85adbbee538a232253240a895326a88ea3d9191587a91d12","source_edition_id":"edition.o018.id-id.draft","source_line_end":32,"source_line_start":31,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[31,32],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"6fcf6c929598a748b6f26e1cba57c1ea5f083ae1dfcca4af1ef8c8bb41e05944","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"c6deb730930038211faa5de082a73682dc8ff29d516e42fb917648df55967493","source_edition_id":"edition.o018.id-id.draft","source_line_end":45,"source_line_start":34,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[34,45],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7daa7d44133dd2aa88f5ba9013680ce8588c7ba9830660c7a2558a53396bf03d","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"e32c0acf0fa2766df6dadba71b0360fe12f86ca73ec1801b6021ded76c52631e","source_edition_id":"edition.o018.id-id.draft","source_line_end":49,"source_line_start":47,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[47,49],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7da08ae38dc4898747db996d94b33fe78f802dea695b605b85e8ccc3ec38e2dd","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"e353d4b78403b60a158877425b2fc013919ce88dae579cb418a948d1c4e18b00","source_edition_id":"edition.o018.id-id.draft","source_line_end":51,"source_line_start":51,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[51,51],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"71411d8b94ac675cb152daa2e74adecf41f9dc79b71420b16a7dc49632bbf01c","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3b1db9ea8be337f330a5fc2ae5d0e4f497a687c97b219c8ece8bf964348b69ac","source_edition_id":"edition.o018.id-id.draft","source_line_end":57,"source_line_start":53,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[53,57],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"a7e6ef41222aa92a2070d093fa9e254ae989a6b466f7190484e82905f17bbefa","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9ccafe034f620494dede1fdaac0d96089b674107d631236b39321b248200ea14","source_edition_id":"edition.o018.id-id.draft","source_line_end":59,"source_line_start":59,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[59,59],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"668ef3f9e6ae678383e08bce7e2e186aa37f71987230ceecdd28a415ed79951f","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-015","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3fd66e2dd5361479b3fdce231b635e15b89f32735adaf73e9a1d246a46f0c7b9","source_edition_id":"edition.o018.id-id.draft","source_line_end":63,"source_line_start":61,"source_local_id":"block-015","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[61,63],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"bf0ffb701bc80899f0250b8d4378510194f3ccf160386534b68f0b8f8e29cc56","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-016","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b4f60264bf5425739d82ce636693194319003d6bfa859f7f8b73a8eeb24d6702","source_edition_id":"edition.o018.id-id.draft","source_line_end":67,"source_line_start":65,"source_local_id":"block-016","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[65,67],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"882cf347b035fc4d7d377021bc801886e8cd89572f2836c637713bf0127b7718","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.attribution.block-017","locale":"id-ID","parent_id":"unit.o018.lab.ch10.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4d9a9e8b8db1ce21793d91ee12d540a353137758ff2076795352902e1042262c","source_edition_id":"edition.o018.id-id.draft","source_line_end":72,"source_line_start":69,"source_local_id":"block-017","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.attribution","verification":{"source":{"archive":"labs","line_range":[69,72],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ea103cbf1d41b43d8137ddc981187afb6aa269041dda946146ed40d550b93e5d","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch10.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"46539de101e3c07b66f9ad98edd3fa146f4f919ff0fa59d192152c3851b68545","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"f3d9191c5f3712f7b1363cd3e8a8fdb3b8966ef7964a1cf337c73051b54f2a85","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch10.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3fb7f169b7e500ffec0bd8ef12819184056c566c3fe86de99c8bce6d9ecc580e","source_edition_id":"edition.o018.id-id.draft","source_line_end":7,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.readme","verification":{"source":{"archive":"labs","line_range":[3,7],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"8d048b01f46c416d8c4fd5255cbff7af3bdd3ee3684fe950d2dffd02f7f8fec4","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch10.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fbef42e4ad5650e50c27d23f8c0dff98db8a35e3eb820fb58b506c944f70536f","source_edition_id":"edition.o018.id-id.draft","source_line_end":9,"source_line_start":9,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.readme","verification":{"source":{"archive":"labs","line_range":[9,9],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"c3944020a301bad86974bd735a585c6d8ad9ae8d14f59899e9d948302a2e4d89","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch10.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"77b7fa7077659ea149cb74375e9d9dfef71e983835017151b24f8353689e09b2","source_edition_id":"edition.o018.id-id.draft","source_line_end":22,"source_line_start":11,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.readme","verification":{"source":{"archive":"labs","line_range":[11,22],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"071e97c99f31d0a46bb82514ddfbba8d7e235aecd2ec102f08f6198c03057382","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch10.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"cdfd2f6890710b151619a2735a410eece0676f53f48a83c2dcc9c0fd2e295abc","source_edition_id":"edition.o018.id-id.draft","source_line_end":26,"source_line_start":24,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.readme","verification":{"source":{"archive":"labs","line_range":[24,26],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"6a3c44e9ab971d3f9a66e4779dd168b25fe8b00821819dd78c619b51a565a430","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch10.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2336aac0f30d436cb0c85b59b2c010f570e954524e7ceacf683898ca856f643b","source_edition_id":"edition.o018.id-id.draft","source_line_end":28,"source_line_start":28,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.readme","verification":{"source":{"archive":"labs","line_range":[28,28],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ac06ba709dcf5f16dd10f908beb77ceab1bd686c47eb20866c367b0a8fa1cf02","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch10.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9fc978747e189cd83a37f822860eddd9b1fe6b158251d82024d16bc03894cf63","source_edition_id":"edition.o018.id-id.draft","source_line_end":30,"source_line_start":30,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.readme","verification":{"source":{"archive":"labs","line_range":[30,30],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2ce940f41dfafd325c22d35ea695337dda03d4c50511525ec3cac651aff19531","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch10.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3a573a2a57fc7f2e03a45358dc5b4bcb3537b072b342c17f1347c0536a36399b","source_edition_id":"edition.o018.id-id.draft","source_line_end":37,"source_line_start":32,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.readme","verification":{"source":{"archive":"labs","line_range":[32,37],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"830482bc83eb3d00d97db3d6fd34a186b9fba4095881e7a247601f469d1aa9cb","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch10.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ec10d54a8781ff52b8a8f86c34ecf6e273543a2b99e4e809937213aad46ccded","source_edition_id":"edition.o018.id-id.draft","source_line_end":41,"source_line_start":39,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.readme","verification":{"source":{"archive":"labs","line_range":[39,41],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"07b5fe7707386e2104aaab20a360fd8e1bdf9e594256b01d6e671b53e407f616","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch10.readme.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch10.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ade9f0cc6e50bd87a1788a6de4dff804773d3a15fb84d97fe3bd22ea2aeab857","source_edition_id":"edition.o018.id-id.draft","source_line_end":45,"source_line_start":43,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch10-sensitivity-analysis/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch10.readme","verification":{"source":{"archive":"labs","line_range":[43,45],"member":"source/o018-open-solver-lab/ch10-sensitivity-analysis/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"d1adfeabd51b3b4a750b3c5e4c8eeafa8351b773d56364c3fbceb4b620a42c85","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"1727d44e56e3e5dcf119b3891af76d06304abe93172ea4ba7458ce2fbb98fd5c","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2ab5e53750370097eadc6878efd279f05b38110367f784b34a9e5417ed80e336","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a0369a81c32f2868e2f9ff15a55cbd30f3d163f35cab5f698567fd8f50946ef0","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"3a220a7e65fda902ee5d1a8d9c740a405d1f6e078851abb53ae535a7e4de2bc0","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ad2e631a17bed9fac7b56bde104fd89af403f0a50b654435dae3cd835292283e","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[5,8],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"89f006551396c71900996f410c5fcd34bbd91f02843d88238148b5020a315111","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"125b7ef321dfd9f202c7fa5d5d75ff99e7d0996e75138bac4f130a6cebb0da6a","source_edition_id":"edition.o018.id-id.draft","source_line_end":10,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[10,10],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"3cd80ce159e2adf39bcf7ac04f002ff037aec959a93c65f35c5027a23952a739","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"be693eb1e19c02d45b7af934e38104f58ffdfcd9fd83dec803c17791392ccf7a","source_edition_id":"edition.o018.id-id.draft","source_line_end":23,"source_line_start":12,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[12,23],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"13a3bbd93a6f6ab6ce3f5936a827401e17480fd40574afe0eb44ce502f2fe071","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a7e50247dadc7904ca2ea265dab268cf3fe3f44b446d500cf2523114aa0ca439","source_edition_id":"edition.o018.id-id.draft","source_line_end":26,"source_line_start":25,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[25,26],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e6022bfd922e850191298381b0a114ae02a2a60a156c9a0e4e4c762d2029da3b","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"30d3ba955791711d4ced12f97f1b80dd23e406c3d2dcb82f6da0e0e49cfcbc5f","source_edition_id":"edition.o018.id-id.draft","source_line_end":31,"source_line_start":28,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[28,31],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"5655ee89201886b06d1a7d7cbe0ac7434fe9b72a0c09ad279a773e6877b80d10","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a1c47ac20f70b7b7b8225b7c656e4cde7abc9409c8f8a668144475ce09742992","source_edition_id":"edition.o018.id-id.draft","source_line_end":33,"source_line_start":33,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[33,33],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"44c32378533230e0c5e9d63908b181e1add3941d303f60d60fd0b6476bd3f406","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"e02a19d3d521a26e85adbbee538a232253240a895326a88ea3d9191587a91d12","source_edition_id":"edition.o018.id-id.draft","source_line_end":36,"source_line_start":35,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[35,36],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"61123c52b0900afcd07b7034b91991fcee636de27b215f1041207841b2f2e31d","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0058dc147708e32a35d453f97a28afbafe7617497bfb739e0af69125537722f6","source_edition_id":"edition.o018.id-id.draft","source_line_end":49,"source_line_start":38,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[38,49],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2c341c74a0e50092f6ebf06d242c2dcdbfbf201dd6686a363b84b64ab3577453","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"c5ab8ca51f147533492ebf5cca7620df079e8d6eada72ec8e2c7b1ffbf3d3421","source_edition_id":"edition.o018.id-id.draft","source_line_end":52,"source_line_start":51,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[51,52],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"05ff6a064906a22d0368f2ddd32e03e954f42f8e2987f70cfba5164319135e4e","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"880c77a36902cfe86cbb67fdbd74633d462a2530912dec7a490609f9729f0840","source_edition_id":"edition.o018.id-id.draft","source_line_end":54,"source_line_start":54,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[54,54],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"680e21fa5d95afe916b77ae15df0b6b098a6d15371e0610b1ecb3a72fb1e7e74","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"7a58271e5219ecb3c2e5e401e2bb4eed4ae579dba42b8e76a929ded126e0df47","source_edition_id":"edition.o018.id-id.draft","source_line_end":61,"source_line_start":56,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[56,61],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"54c43e99137b94aec09eeb3f614a33a157f13c010283a13ec16f34391276e1a6","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"7ae84b9c87b84ab45c186795a453360cd61de2ac145025f9e046acf337ee5ca7","source_edition_id":"edition.o018.id-id.draft","source_line_end":67,"source_line_start":63,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[63,67],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"6c4a13a60cbdfaebd5841d15eb6372d43901930ffe88f5e6efaedefe6f509b4e","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-015","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9ccafe034f620494dede1fdaac0d96089b674107d631236b39321b248200ea14","source_edition_id":"edition.o018.id-id.draft","source_line_end":69,"source_line_start":69,"source_local_id":"block-015","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[69,69],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"653c44a96d841106e9dede94b8d24dd5e46930a14be0bdd552fbef8ff73a09cc","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-016","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3fd66e2dd5361479b3fdce231b635e15b89f32735adaf73e9a1d246a46f0c7b9","source_edition_id":"edition.o018.id-id.draft","source_line_end":73,"source_line_start":71,"source_local_id":"block-016","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[71,73],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2cadb55919c310612f3699459b0af550fb6d85584c2a6d8597e066d77341b7eb","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-017","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b4f60264bf5425739d82ce636693194319003d6bfa859f7f8b73a8eeb24d6702","source_edition_id":"edition.o018.id-id.draft","source_line_end":77,"source_line_start":75,"source_local_id":"block-017","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[75,77],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"acc730c9d4ed5d6a4095aea81ad03cd03b5aba5835536c00e6f614c04cdb9797","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.attribution.block-018","locale":"id-ID","parent_id":"unit.o018.lab.ch11.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4d9a9e8b8db1ce21793d91ee12d540a353137758ff2076795352902e1042262c","source_edition_id":"edition.o018.id-id.draft","source_line_end":83,"source_line_start":79,"source_local_id":"block-018","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.attribution","verification":{"source":{"archive":"labs","line_range":[79,83],"member":"source/o018-open-solver-lab/ch11-duality/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ecf5cb81af96867694e6fe3a8f74bd76e36598e4b6340ba0b9c32fc830e3d8e7","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch11.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2e84d51602facc0e31e1037eb1a8d3c77750dae49a6f00391a7656cedd6b3646","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch11-duality/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"381c6dbf063ffd8a306cebeb1f40185ef366c994c68333dd480eee27d30b16c1","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch11.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"1cabd1346ec5b7efa2961ead88f2dfe03f309e14683eed35aac135b4bf0c8372","source_edition_id":"edition.o018.id-id.draft","source_line_end":7,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.readme","verification":{"source":{"archive":"labs","line_range":[3,7],"member":"source/o018-open-solver-lab/ch11-duality/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"92a2d9439242a183cbef0942033b7d0c8fab1d5a8958963fa42256c97a5e9b26","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch11.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fbef42e4ad5650e50c27d23f8c0dff98db8a35e3eb820fb58b506c944f70536f","source_edition_id":"edition.o018.id-id.draft","source_line_end":9,"source_line_start":9,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.readme","verification":{"source":{"archive":"labs","line_range":[9,9],"member":"source/o018-open-solver-lab/ch11-duality/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e731e70b341076f3e765c6a0095842ac4d29fb6597ce74023d4390fe2a537735","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch11.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"c578df01867beec099c01fcb274b3d04f035dbe6522bd460e640bf253831e912","source_edition_id":"edition.o018.id-id.draft","source_line_end":20,"source_line_start":11,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.readme","verification":{"source":{"archive":"labs","line_range":[11,20],"member":"source/o018-open-solver-lab/ch11-duality/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7139cbd1e3f6c32a9a2fe4e286964533332d93c5ca3c13ec06aba38fe7507244","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch11.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"94406027a6387b775d5ebd55b2258a72150ad6b2525cd1ed0ede4416b172c2cc","source_edition_id":"edition.o018.id-id.draft","source_line_end":25,"source_line_start":22,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.readme","verification":{"source":{"archive":"labs","line_range":[22,25],"member":"source/o018-open-solver-lab/ch11-duality/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"83f7920a93e1526affab8245cab4ff7b52fa78c8389a2e9fab125e51641ed803","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch11.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2336aac0f30d436cb0c85b59b2c010f570e954524e7ceacf683898ca856f643b","source_edition_id":"edition.o018.id-id.draft","source_line_end":27,"source_line_start":27,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.readme","verification":{"source":{"archive":"labs","line_range":[27,27],"member":"source/o018-open-solver-lab/ch11-duality/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"c656bd14304006518cb51b4459c81e0518e2ca4c29bfb1d833da35541b3193df","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch11.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d2a9bcddb36de0cebdcc6da45515779642104da8784cc2b7e9fa4622965146c4","source_edition_id":"edition.o018.id-id.draft","source_line_end":30,"source_line_start":29,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.readme","verification":{"source":{"archive":"labs","line_range":[29,30],"member":"source/o018-open-solver-lab/ch11-duality/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"9ea63a42ca95c6a62e16c05d2d9faff6438c7505242e34ec81336effb45f3d1f","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch11.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"6c363fac551fef4cdb5e42ef40f8c6a16da2f793cd9b28475e3bd123751b694e","source_edition_id":"edition.o018.id-id.draft","source_line_end":38,"source_line_start":32,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.readme","verification":{"source":{"archive":"labs","line_range":[32,38],"member":"source/o018-open-solver-lab/ch11-duality/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b7b706846a3dbff6ee947e034703b8e63028854d125da70d1961fdc07d75717f","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch11.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ec10d54a8781ff52b8a8f86c34ecf6e273543a2b99e4e809937213aad46ccded","source_edition_id":"edition.o018.id-id.draft","source_line_end":42,"source_line_start":40,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.readme","verification":{"source":{"archive":"labs","line_range":[40,42],"member":"source/o018-open-solver-lab/ch11-duality/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b646882b667c799a5e585ff75085aeb567d526eceee2e2ab75b522e8df3502e4","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch11.readme.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch11.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b939b2e76f9cd2e26302701e4ba8d1c1993dbb632e7b69276803ad3c967374bd","source_edition_id":"edition.o018.id-id.draft","source_line_end":46,"source_line_start":44,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch11-duality/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch11.readme","verification":{"source":{"archive":"labs","line_range":[44,46],"member":"source/o018-open-solver-lab/ch11-duality/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"42438ea05f0f7770317e950bb4e19cfc82b1954e23c250ac199ebcbe3f6a1639","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"aa034eb1d56d11cb01a2770b3368dc40b88ba51227da358c0f1d332909c540d3","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7def52c6891f92b48d9566c311017f211a7ee353425155feadc9550b38a05f60","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a0369a81c32f2868e2f9ff15a55cbd30f3d163f35cab5f698567fd8f50946ef0","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"d68ed3b198c6b3f23db013b4a962f4a0c197ebb4307523b63517e6b276617dd2","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d6e38662b5ff4d83161a170cee5ba0810e6673bdef2a3a7631eae8930c3d5774","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[5,8],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"c984ccdeae12853fbe1b410c0f0a8a11aeb482ae1928b3423692814132482c19","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"769a20251ec1e4b0a9cf46fea24bb2207076784f0d5d6f9de417370239665ce2","source_edition_id":"edition.o018.id-id.draft","source_line_end":10,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[10,10],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"eb299518ed88733b4ae148d4668f2a802326bc2e572d23d5ffeba0fae78cbb34","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f2645d7634c44b257a20afd9cdf6e6afe34e9d545f03ea1833ee0aaa216d974b","source_edition_id":"edition.o018.id-id.draft","source_line_end":19,"source_line_start":12,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[12,19],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"d522ecbe7e65fb6127abed3f2dcf324508ad3dcbde02783c55aef0f8bce7be0f","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3e0c93a33d45114409b71fad7bbb215b8be2c7bba460729231a3028368722e9a","source_edition_id":"edition.o018.id-id.draft","source_line_end":22,"source_line_start":21,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[21,22],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"481a57163d9659ee3ddce73f8bc1c2474902af2ef2fdb127ecfd732258fe1222","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9adde1a5e79302eb38430d54bd9c350c40a5b4e83b30820da8da9b3b689c84f8","source_edition_id":"edition.o018.id-id.draft","source_line_end":27,"source_line_start":24,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[24,27],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"0a13a444add8321f8405133f295f647becba68fad570d83c7c6727d12e068425","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0fa866d3b76c41fd3238052abe98cbab80c4adcf0f39e110ca0e713b8629a448","source_edition_id":"edition.o018.id-id.draft","source_line_end":29,"source_line_start":29,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[29,29],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e7f8960e32c7dc6fb36a504b6111ba350706361c1428dce5a79f4a3e24621eb3","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b4a3587f227cb1b26d64d7fd36b0e9581820b304fc171d157c61ce8517ddda25","source_edition_id":"edition.o018.id-id.draft","source_line_end":34,"source_line_start":31,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[31,34],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b0b87b5354e361d3f116db19b6ce00a7584f849a79ec1ee9572e240dc08035bb","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"58a747dc5caa62130edc6493d73d988fee030f2a4373f80bf65280d6ca9dd9b6","source_edition_id":"edition.o018.id-id.draft","source_line_end":42,"source_line_start":36,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[36,42],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"79e6a43168bed9c59f12b9dde82050e1df4c93b3e79c5f481a312a3e41eb1c1b","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9ccafe034f620494dede1fdaac0d96089b674107d631236b39321b248200ea14","source_edition_id":"edition.o018.id-id.draft","source_line_end":44,"source_line_start":44,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[44,44],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"00dc9829f61bce59ea32395e00cdce04e5afed1b2a41f9bbaea5804a1f876688","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"54197df700a7e9deb7eb8530a8463cf531fa7f1b494b3680c42ec96e1b86b0ba","source_edition_id":"edition.o018.id-id.draft","source_line_end":48,"source_line_start":46,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[46,48],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"d06519ede9681d3a8abdf669e53f96d97cf77684d278fa92b37dabef4a34da4e","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b4f60264bf5425739d82ce636693194319003d6bfa859f7f8b73a8eeb24d6702","source_edition_id":"edition.o018.id-id.draft","source_line_end":52,"source_line_start":50,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[50,52],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"58ff534b393587157666948f3e8fc54673a47672ca359addab95463c436832f1","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.attribution.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch12.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"14defc68f2845e205231cb2dfa7d8ba376d3b31d90078701fb3161b0c5327177","source_edition_id":"edition.o018.id-id.draft","source_line_end":57,"source_line_start":54,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.attribution","verification":{"source":{"archive":"labs","line_range":[54,57],"member":"source/o018-open-solver-lab/ch12-python-workflow/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"a43e6f88ec7354a17d7eedbc8336a2e0e9a263915afbccaf65921be81f136a1b","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"6e05a5cb819617dd7b2671008059c1287eb2459a1062ea58cf8a492668d7b794","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b00b171e7f08482a45985ee3174d5d098f07aac9863cbc3a1e94aaf22cd6def5","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"26980d077ad129bc18dc8da7f6aef6ea114d29e13b1100413ba9a577a50ad909","source_edition_id":"edition.o018.id-id.draft","source_line_end":7,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[3,7],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"379ca2ca86766e6704055722850029fb7e22e72ceb2aac5bca4008ec329ee415","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ea90131474b32496d0e10e771c926500d437e59bdb6253797a69d2a75ed288c5","source_edition_id":"edition.o018.id-id.draft","source_line_end":9,"source_line_start":9,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[9,9],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"1a19033580168f5e193bb5cd0ee3dfab09cba7ed4bb9fc5a2dd2115cc2f15047","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"177f6b52968448157d8dc86becfa554c7c99f6a55a8077f28305a74f7429d2f4","source_edition_id":"edition.o018.id-id.draft","source_line_end":11,"source_line_start":11,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[11,11],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"07a16965bffb1c11d184e67fb386a4443a47f45983993d50274dfc85cc7882cc","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0764c2c99af57e582aac3cef6dc6f5b592218e72542bcfc348ffb961410d3fd9","source_edition_id":"edition.o018.id-id.draft","source_line_end":19,"source_line_start":13,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[13,19],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"35ab0f68ee1f13a74baf83249b6ebd7d340c4f0b3210387990642aef72f20b32","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"300119c6a3b14fabca355e13eee270ee4ec990f9bdc8a5de64bfeb6da1c22e98","source_edition_id":"edition.o018.id-id.draft","source_line_end":25,"source_line_start":21,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[21,25],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"3a86de77982aff8345e35487bf3c95171cdf8bf216b9a798400f9d872ec0dbcb","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fbef42e4ad5650e50c27d23f8c0dff98db8a35e3eb820fb58b506c944f70536f","source_edition_id":"edition.o018.id-id.draft","source_line_end":27,"source_line_start":27,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[27,27],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"bfd106b2c8d5e55266920143d0c82cb4f163c884ea158b701014ccb4318f6b06","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"93241df57b0302bf977519753688887ac638cc8b537afff30924cb756a7dd837","source_edition_id":"edition.o018.id-id.draft","source_line_end":39,"source_line_start":29,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[29,39],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"622ec22a5d22f7378442f6a97b667719477ce1f59a6e6e3f7adc43b778d88e89","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2336aac0f30d436cb0c85b59b2c010f570e954524e7ceacf683898ca856f643b","source_edition_id":"edition.o018.id-id.draft","source_line_end":41,"source_line_start":41,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[41,41],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"9072774465e7dc0508cacf8632a3fe51511c07834141ad44377599aa1611a6fd","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9fc978747e189cd83a37f822860eddd9b1fe6b158251d82024d16bc03894cf63","source_edition_id":"edition.o018.id-id.draft","source_line_end":43,"source_line_start":43,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[43,43],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"1d3220578848a949da4d2c6162f79e6dd5bf687393194f673abf017ad9c0b123","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4f62394f20f11e63ade127f7e7ac115e50b240407c323143bb59d31f9f8eec2c","source_edition_id":"edition.o018.id-id.draft","source_line_end":50,"source_line_start":45,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[45,50],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"97577e3d7647d1bac1100c7fa3ef8ad92e2a4b9486dd8641e16bb4e3593d6374","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"dc2e106acbb72e5ff4d80d35927f32bc04efc459d4cd2ab9cff7d7db24a695c1","source_edition_id":"edition.o018.id-id.draft","source_line_end":54,"source_line_start":52,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[52,54],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"0a513b5485efa7ff322c6ff99d610b5cc36645e34dae870446bba541949a7f46","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch12.readme.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch12.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"929b34a47754bcba4cec5cb6b511497efeae397ad8adbab9e2bd7f40c73f1bd1","source_edition_id":"edition.o018.id-id.draft","source_line_end":59,"source_line_start":56,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch12-python-workflow/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch12.readme","verification":{"source":{"archive":"labs","line_range":[56,59],"member":"source/o018-open-solver-lab/ch12-python-workflow/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"33028b0be28b0dff4b79e1979e716e830ec50e26e096265c624a488dd6f58068","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"88ff2aba0cc00b6038903a1bbbb8507dc033a6fcd0f4dd8ed0c0d8e94d809588","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"d9f8107d70d3dc94e849ea5dc93eb4e8e2a099e6a1944def54e473179d45ae9f","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a0369a81c32f2868e2f9ff15a55cbd30f3d163f35cab5f698567fd8f50946ef0","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b1073e972e24c9bd5dc74797b52f15b2bc73958f9b0cbdbdff25b60fcf2e1c12","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d0ce8dd8420cfed63adeea17ea59d50c73bf8dbbc9d87a9e3882437065ef3878","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[5,8],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b9a270fae62a8eea9cf11179603ac4992eb72d9108493b81d3563df2da7f8eac","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"769a20251ec1e4b0a9cf46fea24bb2207076784f0d5d6f9de417370239665ce2","source_edition_id":"edition.o018.id-id.draft","source_line_end":10,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[10,10],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b8270b66e15880ae042668cc7b70595e8f1f73dd79c032bb9eaaa8c823f96b0c","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"5dff16680ef20393f6d711420045ff17ba880c6b0b5e7525bd1e76f949deca5a","source_edition_id":"edition.o018.id-id.draft","source_line_end":19,"source_line_start":12,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[12,19],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"4e4c09b4144e3d6427deb40193ef7708efb5ed2a77c9e82f8ed83fbbd7a37d1f","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3e0c93a33d45114409b71fad7bbb215b8be2c7bba460729231a3028368722e9a","source_edition_id":"edition.o018.id-id.draft","source_line_end":22,"source_line_start":21,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[21,22],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"074361791f2c34952da263889a44520fa916118065a4cf70d87acef853e41eca","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"8a8eae92cd9795975c08246afdd47d64583ab4fe015a8bc7600208940a51bdb0","source_edition_id":"edition.o018.id-id.draft","source_line_end":27,"source_line_start":24,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[24,27],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"380981c920ab6b7551868a87aefa2da0910f29972e660ae1fb9bc3af6575b231","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"842cb3fb575ec8180add33e990fb4c1a4e10feb59ef458b57f7f29d25e13aabe","source_edition_id":"edition.o018.id-id.draft","source_line_end":29,"source_line_start":29,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[29,29],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"c4a61077c94376da90ce0c8c9ceaa0f29d0be79e10feff4f8e7ffd4900a9cfd1","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"c10c8122baf90497def193a091be2856891926758b9552e0eff1da6f930d018c","source_edition_id":"edition.o018.id-id.draft","source_line_end":32,"source_line_start":31,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[31,32],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"0a3df252a62050b297a2604a75eb1c052bd9d39908c9f941a4b0d6d40f5915d4","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"5c8a05f8ea73d91f3ca067f0ea25e73c177f9108a1bdc18a9663beed2a8178c7","source_edition_id":"edition.o018.id-id.draft","source_line_end":37,"source_line_start":34,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[34,37],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"322b807d4bf116e58110cd9363af323cc9d6c2f9e2aaf06d3eca269254727151","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"befbb7d423fa655a871421c7a23edfcbbd938d8732dc3f1266b498db18e68c75","source_edition_id":"edition.o018.id-id.draft","source_line_end":40,"source_line_start":39,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[39,40],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b76aa7b3049e0943b4feacd30db6907260b4c7c2878eb34fb78f72fb8e856daa","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ecf7df10299edbb46fdfb4d6be205703c6e60418be8c7c9104c1ecf0446d94f3","source_edition_id":"edition.o018.id-id.draft","source_line_end":42,"source_line_start":42,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[42,42],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"4f042be8bb14e72dcd6ab803795f8a3966ff07006cc27ba7f49afb8c56a6d6bd","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b102f1b24581310782577d5b06ecd0eeb6966129ffacd76ac13d6afccb4f3408","source_edition_id":"edition.o018.id-id.draft","source_line_end":52,"source_line_start":44,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[44,52],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b3d21c8897bca3326bf5c065f00168162afddcad5d4ab5c7a46619ee115734f6","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"627e1173d836183dcf5992f8f8dbdc9a49b32d4b3869ff8111dcf9d237173244","source_edition_id":"edition.o018.id-id.draft","source_line_end":55,"source_line_start":54,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[54,55],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"fa3a4f006e8330611ae42b5babc8c09ea0511617565cbf1b55bfd621c41c6581","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-015","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9ccafe034f620494dede1fdaac0d96089b674107d631236b39321b248200ea14","source_edition_id":"edition.o018.id-id.draft","source_line_end":57,"source_line_start":57,"source_local_id":"block-015","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[57,57],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b6ef5995ba090cfca015e3d8b96f3f03e3d7ee835a49388bdfa739d59fa3a994","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-016","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"6b1689bb5cd11d14561856d1605fe21f76126d537a38b66f9d4a7057ec3a236a","source_edition_id":"edition.o018.id-id.draft","source_line_end":61,"source_line_start":59,"source_local_id":"block-016","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[59,61],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"57d443ec44062718563c55397d197fe6b2cb32abba0eec2a1339b4ea56606c3c","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-017","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b4f60264bf5425739d82ce636693194319003d6bfa859f7f8b73a8eeb24d6702","source_edition_id":"edition.o018.id-id.draft","source_line_end":65,"source_line_start":63,"source_local_id":"block-017","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[63,65],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"bb84fa3b7b34bf43d2ea8ae0a4aba9458173b9bf1d40226cca995f6a06b06af7","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.attribution.block-018","locale":"id-ID","parent_id":"unit.o018.lab.ch13.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"70eb2d5371157de5ae3c279c913319f2654fa0b991a6754c1bc65d985fb4e52e","source_edition_id":"edition.o018.id-id.draft","source_line_end":71,"source_line_start":67,"source_local_id":"block-018","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.attribution","verification":{"source":{"archive":"labs","line_range":[67,71],"member":"source/o018-open-solver-lab/ch13-multiobjective/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"dcd1ee2bb58a3e0c6389c8df0c06f0f84f66f2380632d125ab419b0dd03d33a1","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch13.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"199bcf3c59630767decbc095e00eb7bcff2abdaccc6f060fbb1235c58c46d686","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch13-multiobjective/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"35a002331f4e9d4bdd21ef479a6e6e4d954ff2d7410a69ef9c4a0c9b6c5b3354","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch13.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d62e2ea91330754a9fd27b7c3d9dbd728153e81af3926c488dd0a2af27fb6ec2","source_edition_id":"edition.o018.id-id.draft","source_line_end":6,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.readme","verification":{"source":{"archive":"labs","line_range":[3,6],"member":"source/o018-open-solver-lab/ch13-multiobjective/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"8bbcd09459bf2099f8bb9e3ead13ade53ccde0d8f8fc9d80cbae1ed1b806413d","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch13.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fbef42e4ad5650e50c27d23f8c0dff98db8a35e3eb820fb58b506c944f70536f","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":8,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.readme","verification":{"source":{"archive":"labs","line_range":[8,8],"member":"source/o018-open-solver-lab/ch13-multiobjective/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"28f387e6552137e3324a1b95f33cc28a717728fbfd494c7fad1b56549126e279","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch13.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"233f5b341b88027d0bad840796cee77ddadc4d31e43470418d4dab983e8a699d","source_edition_id":"edition.o018.id-id.draft","source_line_end":21,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.readme","verification":{"source":{"archive":"labs","line_range":[10,21],"member":"source/o018-open-solver-lab/ch13-multiobjective/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"bfeef057444c667e96fc189c88a19f741a3c9ddee42f20ed55f016671afc7360","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch13.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d16219a59bf15f7cef8b9ba5c32ef826e0b8a14f68efa572885675ddf0fa4e1a","source_edition_id":"edition.o018.id-id.draft","source_line_end":27,"source_line_start":23,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.readme","verification":{"source":{"archive":"labs","line_range":[23,27],"member":"source/o018-open-solver-lab/ch13-multiobjective/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"01fb865a6595bb76b074787c9f69ae485f1eb6c432a37459930221d7ef17289d","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch13.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2336aac0f30d436cb0c85b59b2c010f570e954524e7ceacf683898ca856f643b","source_edition_id":"edition.o018.id-id.draft","source_line_end":29,"source_line_start":29,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.readme","verification":{"source":{"archive":"labs","line_range":[29,29],"member":"source/o018-open-solver-lab/ch13-multiobjective/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b06207388438e8ed18ae2475979f7cd10231a5235a4eda8507e0739f2239c475","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch13.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9fc978747e189cd83a37f822860eddd9b1fe6b158251d82024d16bc03894cf63","source_edition_id":"edition.o018.id-id.draft","source_line_end":31,"source_line_start":31,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.readme","verification":{"source":{"archive":"labs","line_range":[31,31],"member":"source/o018-open-solver-lab/ch13-multiobjective/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"4a5d978af5473fac7c803653b4691352bc5cfdcb95e4db52cd7cc649eff1d404","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch13.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"7339e0567103b3d3343cd237e8125351d7e8ea1cb6b5a339a1eca2d3efcfaedb","source_edition_id":"edition.o018.id-id.draft","source_line_end":38,"source_line_start":33,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.readme","verification":{"source":{"archive":"labs","line_range":[33,38],"member":"source/o018-open-solver-lab/ch13-multiobjective/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b080b5f182e5ebcda8f71c75905c331abfbfe2535b4fecacf197a9109d20ee5e","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch13.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ec10d54a8781ff52b8a8f86c34ecf6e273543a2b99e4e809937213aad46ccded","source_edition_id":"edition.o018.id-id.draft","source_line_end":42,"source_line_start":40,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.readme","verification":{"source":{"archive":"labs","line_range":[40,42],"member":"source/o018-open-solver-lab/ch13-multiobjective/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"13316ce87a9956935e82b43a62f63cd27baea6f9fe525980cdda0fd75d074526","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch13.readme.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch13.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a25c971d24d35e499d6395b1290866ff6e48421f65fd70f8d17a0d8620f89710","source_edition_id":"edition.o018.id-id.draft","source_line_end":47,"source_line_start":44,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch13-multiobjective/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch13.readme","verification":{"source":{"archive":"labs","line_range":[44,47],"member":"source/o018-open-solver-lab/ch13-multiobjective/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"9451741904c4c88ad0b6f4c8bd26bb0ca0cfac62b6b1701959167777d7185faa","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"aa034eb1d56d11cb01a2770b3368dc40b88ba51227da358c0f1d332909c540d3","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"91d30fb447d1c20ab099983b6fffe2ead5f800d6b344440415aecf45fd36f9b0","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a0369a81c32f2868e2f9ff15a55cbd30f3d163f35cab5f698567fd8f50946ef0","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"424f89a644ef6fcfafbde0ddb9c4fcd2c3b18a7f8af37ded0442cbe15379cfc9","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"824ca2adde0c0a54e30dca0bdfb0877bcbb3b2cd35b580c46e184ac2ab710bee","source_edition_id":"edition.o018.id-id.draft","source_line_end":7,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[5,7],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"dbea798693201d323148075fb509e5cf368792e987485cf334c960d9017f2061","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"769a20251ec1e4b0a9cf46fea24bb2207076784f0d5d6f9de417370239665ce2","source_edition_id":"edition.o018.id-id.draft","source_line_end":9,"source_line_start":9,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[9,9],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"4da8d7a2e1916d47d093c42d3e86d2eba4cd829763afff83d87c975803d08678","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9c2989d9b2785198ee91c9741e428428f49ef263a92b53b11400a646a34dc2f8","source_edition_id":"edition.o018.id-id.draft","source_line_end":18,"source_line_start":11,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[11,18],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"77b44822a5eb6048470d45bb5f5f04c05b3736b99747783fd31eb6b23e5ae0fb","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3e0c93a33d45114409b71fad7bbb215b8be2c7bba460729231a3028368722e9a","source_edition_id":"edition.o018.id-id.draft","source_line_end":21,"source_line_start":20,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[20,21],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"706db1a795e5f241092803c5403b794725d910864efb23324f5746c5dee8dd57","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9e4a79b1b95a24134cc6524ce0a125dfc4e8698d990bf2c76b8f0a08a9264610","source_edition_id":"edition.o018.id-id.draft","source_line_end":28,"source_line_start":23,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[23,28],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e1cc5ac734e744464129f8c19d7e0204aa415d22aeebd22948073bbe70649ea0","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ebb409af0c3795c1894760ab52f21a08700d38d7b67f75466b6e964ff4824f9c","source_edition_id":"edition.o018.id-id.draft","source_line_end":31,"source_line_start":30,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[30,31],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"0d587abe627fef20f901eb9b91b17a79f7ecd26511904dcfb32a148e5ea62f1e","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0fa866d3b76c41fd3238052abe98cbab80c4adcf0f39e110ca0e713b8629a448","source_edition_id":"edition.o018.id-id.draft","source_line_end":33,"source_line_start":33,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[33,33],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b1f13dbb28b45f5cde1f51daf887b9b7c007d961436f881184b5735cc3572ce9","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a81626f01687a1b6dc5bbe883703bfb41a5c0133003660cbf35d7105ca509ab1","source_edition_id":"edition.o018.id-id.draft","source_line_end":38,"source_line_start":35,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[35,38],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b593908eba3778392be6fc0a4e11548dcfa87badcaf6f574cfbb403fef1dcacf","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9f0e0bc95f5b59ac76206ce460825bcaa5d1a57edcb3a248e53a2757632e1f61","source_edition_id":"edition.o018.id-id.draft","source_line_end":40,"source_line_start":40,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[40,40],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2d2849b17cc55e53559e658b2dc0b24f50fdac839a578806c4e93daa6521daab","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"709cc949bb6cb7f2db30dba3d28daa9bed197544cc52f7b300ec9e6df24026f2","source_edition_id":"edition.o018.id-id.draft","source_line_end":48,"source_line_start":42,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[42,48],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"cf412c405f665b11f9c5e102f1b95b6f9fcb2a38a1e43c4ed0daa55f1ccf7be5","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"55ec82dda2ff64da0b93031c214cad4b8ce13ba51cd9d88895f0173fdfee6278","source_edition_id":"edition.o018.id-id.draft","source_line_end":51,"source_line_start":50,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[50,51],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"f4c199334dc56595cf882f38879ee70a5aa0fd25a4c161c74fc79d1023896a38","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"3fd71bf0fd74ec4242d3be6fcae9bc4304ea63c7b78d9cc58b39d3da7c75725c","source_edition_id":"edition.o018.id-id.draft","source_line_end":53,"source_line_start":53,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[53,53],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"a2fdb8d5d509613d014e8767e6a2a7b8616675f0c06e690e4f348349b501bf99","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-015","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"6b1689bb5cd11d14561856d1605fe21f76126d537a38b66f9d4a7057ec3a236a","source_edition_id":"edition.o018.id-id.draft","source_line_end":57,"source_line_start":55,"source_local_id":"block-015","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[55,57],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"f4069e6dfcac83ce9c813cfc28898209908c4e5e8c56625cf4a1553ea6826fb7","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.attribution.block-016","locale":"id-ID","parent_id":"unit.o018.lab.ch14.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fca7bcde01c1e24cb2a4e341833a1f9a5523b4c2adc227708a74b46c556da64e","source_edition_id":"edition.o018.id-id.draft","source_line_end":64,"source_line_start":59,"source_local_id":"block-016","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.attribution","verification":{"source":{"archive":"labs","line_range":[59,64],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"fabee55d72a8da85deb5d9fa557e645febb8ccdc2dbf91baa3146a010ee3487c","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch14.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"6e7391f6bf2c917a225c3e498566c4b49389fa1ea549a18be3f1b39a25a51bb6","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"fd9f734c64891644326596f44d7cc27027d839afa13f4f5b9241e8439eb24d65","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch14.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d0550c3a0c737297d265abf739604a8cff6f8a1202c847126ffd5a6cb1186040","source_edition_id":"edition.o018.id-id.draft","source_line_end":6,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.readme","verification":{"source":{"archive":"labs","line_range":[3,6],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"46838241843e5d04c7b09ccb647d88657ccdbf5e86e949a539f2f3f9799c3e65","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch14.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fbef42e4ad5650e50c27d23f8c0dff98db8a35e3eb820fb58b506c944f70536f","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":8,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.readme","verification":{"source":{"archive":"labs","line_range":[8,8],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ba60bcdec913b5d65e4cc74d9ddf32790963e5226935fac6684a3a4d2a17e4d4","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch14.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"965c212929604a61d67e4533fe1a814c6733bbc0e6476eb104548e1bd71ad342","source_edition_id":"edition.o018.id-id.draft","source_line_end":22,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.readme","verification":{"source":{"archive":"labs","line_range":[10,22],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"23754dcb4d82514209c07a9cca9c9f20d78001b9a7fc10b6566620b63178006c","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch14.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"827b0888175bf9e9746a0ddd98a130eb1fd77a08f5ef1389c6e2e258b732ad5a","source_edition_id":"edition.o018.id-id.draft","source_line_end":27,"source_line_start":24,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.readme","verification":{"source":{"archive":"labs","line_range":[24,27],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"d94fceb2da2473d4d99f38eb262b52f1f6058ffddfc0146ad3d7ce6da393aabb","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch14.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"07529225222874f6a26bb0de9802d980c1841dab5190cf99db641b43eced636a","source_edition_id":"edition.o018.id-id.draft","source_line_end":31,"source_line_start":29,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.readme","verification":{"source":{"archive":"labs","line_range":[29,31],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"8b04287b03cba59e12d91841548138235bd016a8d83fd1ddd02443b310aae45c","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch14.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2336aac0f30d436cb0c85b59b2c010f570e954524e7ceacf683898ca856f643b","source_edition_id":"edition.o018.id-id.draft","source_line_end":33,"source_line_start":33,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.readme","verification":{"source":{"archive":"labs","line_range":[33,33],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"16f57f336b00ab3255c3369bb52974879089374e65327206197b33021a4a46e4","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch14.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9fc978747e189cd83a37f822860eddd9b1fe6b158251d82024d16bc03894cf63","source_edition_id":"edition.o018.id-id.draft","source_line_end":35,"source_line_start":35,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.readme","verification":{"source":{"archive":"labs","line_range":[35,35],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e5c177f76893cdbc4b39f0825e4c505a85f0a87529414c7e9e21bb0c8ec857d0","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch14.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a0eff9d4bca0af5152a81a65ffb7d77ff4f4427ece3a875f93ca39739981e5e8","source_edition_id":"edition.o018.id-id.draft","source_line_end":41,"source_line_start":37,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.readme","verification":{"source":{"archive":"labs","line_range":[37,41],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"9ed8f4e00c73624c97e3a3e1eab9051803fa8a8ea07a5cd7a17435fb65023875","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch14.readme.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch14.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4fd395be63f8e056b81a71c83ea690a797b739ffd6f7953dd6b89fa97fc0ce4e","source_edition_id":"edition.o018.id-id.draft","source_line_end":47,"source_line_start":43,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch14-graph-algorithms/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch14.readme","verification":{"source":{"archive":"labs","line_range":[43,47],"member":"source/o018-open-solver-lab/ch14-graph-algorithms/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"97e4475c81fa9162a6e0920d192a315eed60a29bae75c0041a37cc6b3b76cefb","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ad564156c2a4eeaea2886027df23d806f22c42d789e7dbe2e4084226e80aae6e","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"1a1b7a5f9c9b70b5318814b2c1f4863f82bdc2bd3bd6da855d3dd63638e9bca8","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a0369a81c32f2868e2f9ff15a55cbd30f3d163f35cab5f698567fd8f50946ef0","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"a05218153e148e6551994beba4333fe5bd89017c217a9f825bb7c5c792b12a72","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"8beaa231c26d6ceaed0ec964d525b352aab000db510f5b1bd5c12c6c7ac6d8e8","source_edition_id":"edition.o018.id-id.draft","source_line_end":8,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[5,8],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"cdf78cdd947e8020db17f56d70c2e46c7b122715bdf7e175b179fd516a8bb0a5","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"769a20251ec1e4b0a9cf46fea24bb2207076784f0d5d6f9de417370239665ce2","source_edition_id":"edition.o018.id-id.draft","source_line_end":10,"source_line_start":10,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[10,10],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"b0ba0048c5e5934f219f2648ee3225ef541e07ef416c4cb71c52fae8a8c08f66","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"6ce51780b7a6945c858e7fff568f2acf05c16d94059dccdb0c8373e738c2b4f5","source_edition_id":"edition.o018.id-id.draft","source_line_end":19,"source_line_start":12,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[12,19],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"dafdb120314e902c694aa78c2f30aa7810e9b4998f491b9a434244392ccfa763","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ecdb5653e899deb5683fed35b55d54d58b1db94876fd66547ee3e810b34c5b30","source_edition_id":"edition.o018.id-id.draft","source_line_end":22,"source_line_start":21,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[21,22],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2c8dec3688e56366895a6f99327383a7459146fc6b2ac164ce7e8cd34010b5e2","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b0dd5adc3d222c0e468eb1839d6d92650e8021deeceb7a082f1163e45fba4c53","source_edition_id":"edition.o018.id-id.draft","source_line_end":27,"source_line_start":24,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[24,27],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"70a9c58b08a70610eef621f49d7f498ab80407166085a0c7e7695a6eb3002d8a","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"7325fe5e7cc57aee0dd2d17d2609fe84e03e6ed7e199b608c931dad0cd139579","source_edition_id":"edition.o018.id-id.draft","source_line_end":29,"source_line_start":29,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[29,29],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"0f2220b9d01f3d51b7c307776d2275a12aa8dcd7ab8bc3cc60d1fa4ae789dc82","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0ff9decf070a4eb5ae33d2ef59eec5757ac6d261a14da8afc3ed703402fba585","source_edition_id":"edition.o018.id-id.draft","source_line_end":32,"source_line_start":31,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[31,32],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"632e5d793a0ce38af22442ed1a54500af0dd27c150bddfaf2be6ce58bfbc72c9","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2c27b5a6a337dbdcb0da464163a8ba3175966076ca33d2683a165b573a581d14","source_edition_id":"edition.o018.id-id.draft","source_line_end":42,"source_line_start":34,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[34,42],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"bdf38696104035e00121ae1414ef42ce1dda621c0797ed692160c51ec71e8db6","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-011","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"40545ab1d3d089bf2fd8c4e96171c952db655b475659954b9822be4d8304d340","source_edition_id":"edition.o018.id-id.draft","source_line_end":44,"source_line_start":44,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[44,44],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"a0490f7f0cc4a741e1aadad83ef1bbc2b13d1555467ef8250b159f0b96d9db90","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-012","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9ccafe034f620494dede1fdaac0d96089b674107d631236b39321b248200ea14","source_edition_id":"edition.o018.id-id.draft","source_line_end":46,"source_line_start":46,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[46,46],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"743fe06570acac44cb8adcca78b716d9bfe60392d5530c18cf2fb8d7f56b7e90","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-013","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"8b87478fadeff766d48aa2fd65af250f223b643b13be4955f724260de5da895a","source_edition_id":"edition.o018.id-id.draft","source_line_end":51,"source_line_start":48,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[48,51],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2afbfdb11ec13bac7adf23bd6d221dabbbe41417fe1dfe2de1f76e89c311212a","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-014","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"e753264033ce8b16ad5d455b4ba34d6ba46da5a991c1f548dfbc79259e55ef04","source_edition_id":"edition.o018.id-id.draft","source_line_end":55,"source_line_start":53,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[53,55],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7e9356447bc8da92dd14f52fd26f16b9eebec716853cb98ff08a9f1c4541c423","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.attribution.block-015","locale":"id-ID","parent_id":"unit.o018.lab.ch15.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f3727b4e473988add9a4dd0afbaae64c2ddbac2dd27b5a36bf4e6fcefa33b954","source_edition_id":"edition.o018.id-id.draft","source_line_end":61,"source_line_start":57,"source_local_id":"block-015","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.attribution","verification":{"source":{"archive":"labs","line_range":[57,61],"member":"source/o018-open-solver-lab/ch15-integer-programming/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ead88dd6fcad641fb711ca530c9289fbd7e42a8acfeae13bc132a7ef8c63ea83","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.ch15.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"236b6b6c446e72cbccfe31f98a2612c5f9f0b6e40fae38c4aea5c0121a5fbd9d","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch15-integer-programming/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"bfa34fe57e2fdf7b94365a0515a42e5c3b57698c396f43bedac35d2967bd0c52","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.ch15.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"8992f2f7c41a82e5943b04298ef3a470dbca456271f2e2f80f1c4efa5c023c60","source_edition_id":"edition.o018.id-id.draft","source_line_end":7,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.readme","verification":{"source":{"archive":"labs","line_range":[3,7],"member":"source/o018-open-solver-lab/ch15-integer-programming/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"93ad13579ed66a627769f38216ea297e57c5e25592d49827a96ea16f0f25ba69","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.ch15.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fbef42e4ad5650e50c27d23f8c0dff98db8a35e3eb820fb58b506c944f70536f","source_edition_id":"edition.o018.id-id.draft","source_line_end":9,"source_line_start":9,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.readme","verification":{"source":{"archive":"labs","line_range":[9,9],"member":"source/o018-open-solver-lab/ch15-integer-programming/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7b9062a982c00ae7a98a72eff4e0d5d4ae862753f967cca7ef2f4ae145e1f6ec","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.ch15.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0823d0a112fe2b1e7773960014a7144b5d525c76318ba25ac32e13e2024b9285","source_edition_id":"edition.o018.id-id.draft","source_line_end":23,"source_line_start":11,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.readme","verification":{"source":{"archive":"labs","line_range":[11,23],"member":"source/o018-open-solver-lab/ch15-integer-programming/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"d50fcb485ea2319a93f8b3a1b2889326dc83da4ecc7118c4367692704f655330","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.ch15.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"281010c5344184f9f89bd3c37136976fd96424e1cb89cc39fb0a126d61b9750a","source_edition_id":"edition.o018.id-id.draft","source_line_end":28,"source_line_start":25,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.readme","verification":{"source":{"archive":"labs","line_range":[25,28],"member":"source/o018-open-solver-lab/ch15-integer-programming/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"f21557ddf5670fda8bd45c38471ddd8f24b0e59f749e0aace91e99240a3e6054","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.ch15.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2336aac0f30d436cb0c85b59b2c010f570e954524e7ceacf683898ca856f643b","source_edition_id":"edition.o018.id-id.draft","source_line_end":30,"source_line_start":30,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.readme","verification":{"source":{"archive":"labs","line_range":[30,30],"member":"source/o018-open-solver-lab/ch15-integer-programming/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"47c469a2973352dc4ef48996d1973ef54f356f6608c17760e19eda70816308fb","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.ch15.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"9fc978747e189cd83a37f822860eddd9b1fe6b158251d82024d16bc03894cf63","source_edition_id":"edition.o018.id-id.draft","source_line_end":32,"source_line_start":32,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.readme","verification":{"source":{"archive":"labs","line_range":[32,32],"member":"source/o018-open-solver-lab/ch15-integer-programming/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"94a107c64f347e5acc81e0f79166d1fb26b0349c514e0fe5a9373303bc445b65","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.ch15.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"437aba9b43cd85cf345a78dffc6046bc3754d671e6ec3fd26baee20a6197b7fe","source_edition_id":"edition.o018.id-id.draft","source_line_end":37,"source_line_start":34,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.readme","verification":{"source":{"archive":"labs","line_range":[34,37],"member":"source/o018-open-solver-lab/ch15-integer-programming/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"8d490c214c44757eb43ff96f164db52c9e5338dc12a5edf79020813203eaba42","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.ch15.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.ch15.readme","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f48e44530c79b6cc71ed9433ac4b3d12696324b434302d1bdfb275189e69784e","source_edition_id":"edition.o018.id-id.draft","source_line_end":44,"source_line_start":39,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch15-integer-programming/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.ch15.readme","verification":{"source":{"archive":"labs","line_range":[39,44],"member":"source/o018-open-solver-lab/ch15-integer-programming/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"debce2471f010d09fa49a6b2ad84b906d9751383b88cb03dbb6b21757e403e56","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"id":"segment.o018.lab.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.readme","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b923ddb261a4c91c948180fba920e1914b2fa8e1189879262d3546bdea0dbf90","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"bcd7aa603dc2a6564624248714e0470142ac95c61b79d807b81b21289300bdd6","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"id":"segment.o018.lab.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.readme","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"587c705e533b5f2fee6d00ed6691b2c197230ff2be82c0d993b7163d70f94881","source_edition_id":"edition.o018.id-id.draft","source_line_end":7,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.readme","verification":{"source":{"archive":"labs","line_range":[3,7],"member":"source/o018-open-solver-lab/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"6dbd82b126a7d0443698b0625fa7f05599d5bd3fc4bdd55dd09215c12ce7f3aa","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"id":"segment.o018.lab.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.readme","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"f96a0d43dcb103fd482e997d6ec9bfb266f3ed07ee8a43f655db610c754c1926","source_edition_id":"edition.o018.id-id.draft","source_line_end":9,"source_line_start":9,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.readme","verification":{"source":{"archive":"labs","line_range":[9,9],"member":"source/o018-open-solver-lab/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"c75a771e9985819a4bd65d88d4e9210a7a1492ca9dc4d27c68ccaf274e2d448f","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"id":"segment.o018.lab.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.readme","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ca2a76e4feda3d70746568171c16978994042a82f15f8430a443945738311c92","source_edition_id":"edition.o018.id-id.draft","source_line_end":13,"source_line_start":11,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.readme","verification":{"source":{"archive":"labs","line_range":[11,13],"member":"source/o018-open-solver-lab/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"27641e6ee76cb5650a90884b932d6ca93dbc2a3c6a3b64369239747cf66cc165","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"id":"segment.o018.lab.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.readme","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"28cfb993724f8099796b1eb6fc7f6445f152847eaaa12dc60a08fcb6ad134e46","source_edition_id":"edition.o018.id-id.draft","source_line_end":16,"source_line_start":15,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.readme","verification":{"source":{"archive":"labs","line_range":[15,16],"member":"source/o018-open-solver-lab/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"5532785bedd1c112639ebdd711311b00378decc9277196ad9cf7fbaf74ae3f4f","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"id":"segment.o018.lab.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.readme","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ee810cabe95e3ce24eb42539297a7d44e800d326c1ab5ff1ec6b2930896ab384","source_edition_id":"edition.o018.id-id.draft","source_line_end":19,"source_line_start":18,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.readme","verification":{"source":{"archive":"labs","line_range":[18,19],"member":"source/o018-open-solver-lab/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"801adfca81fc512ca29efdac62da289aed61bd4ef21481bb5aa56868189d06fc","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"id":"segment.o018.lab.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.readme","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"23b33e385a1c7f37ac5d4c15c0e46d84d278e16088f981ad84b4d78845a73e02","source_edition_id":"edition.o018.id-id.draft","source_line_end":21,"source_line_start":21,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.readme","verification":{"source":{"archive":"labs","line_range":[21,21],"member":"source/o018-open-solver-lab/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"4303955e40a8cab9239ccc7b1c835ed8bb8e4e806671db7e8cbd202e8d702fc0","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"id":"segment.o018.lab.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.readme","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0c06dffc460debd27e1c43a324b66395cd5b6b7798916434bfc508e662987e68","source_edition_id":"edition.o018.id-id.draft","source_line_end":26,"source_line_start":23,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.readme","verification":{"source":{"archive":"labs","line_range":[23,26],"member":"source/o018-open-solver-lab/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"5a97b178ac9bd0a84e6009beffdd821b667c35b9e6df1e8f440bb326a213211a","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"id":"segment.o018.lab.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.readme","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a1e351571d21d48b4a80dd71a88b051fcc1107844b1e2bc3bcee58f794ecb8fc","source_edition_id":"edition.o018.id-id.draft","source_line_end":31,"source_line_start":28,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.readme","verification":{"source":{"archive":"labs","line_range":[28,31],"member":"source/o018-open-solver-lab/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"414bf03e6cb03b6eeea53076a67c403d3edc189d9edda45701d3a76ea91ee4b5","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"id":"segment.o018.lab.readme.block-010","locale":"id-ID","parent_id":"unit.o018.lab.readme","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4f84f84930502b577842e8e0c11b3bf4fc95c558ec5fd791dd0c2879d48eeeb1","source_edition_id":"edition.o018.id-id.draft","source_line_end":33,"source_line_start":33,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.readme","verification":{"source":{"archive":"labs","line_range":[33,33],"member":"source/o018-open-solver-lab/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7b7635610cefb1c030cb1b75fc8f341bd78507d887fda1705cc85c499020a3b6","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"id":"segment.o018.lab.readme.block-011","locale":"id-ID","parent_id":"unit.o018.lab.readme","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"da9cdb6633829d8aec892773781ff93c74ebadfb3fbbaa57dbc02f56c8cbdc9f","source_edition_id":"edition.o018.id-id.draft","source_line_end":37,"source_line_start":35,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.readme","verification":{"source":{"archive":"labs","line_range":[35,37],"member":"source/o018-open-solver-lab/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"0491016cac4150e3718d37307c21d20b9a2de67f0197be5e3800885e69699eda","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-001","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"aa034eb1d56d11cb01a2770b3368dc40b88ba51227da358c0f1d332909c540d3","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ccfdfb86c03855a9d1da18d268a294cde8361de12be4c9b46840a90c6e242a22","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-002","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"a0369a81c32f2868e2f9ff15a55cbd30f3d163f35cab5f698567fd8f50946ef0","source_edition_id":"edition.o018.id-id.draft","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[3,3],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"930c284e7169fa9f04cf23664810c61b6c4876fb8baa604f5ff0e8be1fb20faf","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-003","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"7a9ef68b378e04aced3ac637c5786442312b55d07be3f5c2f64c1134d3ccaf1a","source_edition_id":"edition.o018.id-id.draft","source_line_end":7,"source_line_start":5,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[5,7],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"065e212e2b523aef5867889da5a9b983c8c8822064ebb06500fe68f6e897783b","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-004","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4a8e6a4a8f5ca2e989ab4e91a0fe91f9d02e216548402ac30ec54b293f5cdf0d","source_edition_id":"edition.o018.id-id.draft","source_line_end":9,"source_line_start":9,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[9,9],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"ca33b9abd490b5bc6381edc9647901df6d25a7c6c319acdc96d424e3ca0c8aef","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-005","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ef3661cfa71b2f19ca1152353be81b1233bc2d863547148745ac4b146cd30b54","source_edition_id":"edition.o018.id-id.draft","source_line_end":34,"source_line_start":11,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[11,34],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"fb0ef51297c6173ca39d956016b69849b98ebfcb9c4ca603ec4f9f2e0a5a40a2","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-006","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"e309084201ca7243320946705e00f80005c199cc339c496ce0e56f1ea9e19141","source_edition_id":"edition.o018.id-id.draft","source_line_end":37,"source_line_start":36,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[36,37],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"23c7833baca49a186fafda5d33d5815f3f6c040ad4e334b4efef9889f3233291","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-007","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"17e9aedbb7b6bd56863052021a808767c3550cc281d8992f88a830cefa4e502e","source_edition_id":"edition.o018.id-id.draft","source_line_end":45,"source_line_start":39,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[39,45],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"5a14d43420b94400a1214f65edcfdda8ea0db139e2e881d67612b0d88ca023cb","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-008","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"ed9178ff7a813fa34b92a644442c5ea5644f297800df6b927e3b2644fba71868","source_edition_id":"edition.o018.id-id.draft","source_line_end":47,"source_line_start":47,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[47,47],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"92016906e1c1da2680868ff0ad953c40d5eca3a872f496f2a38f477105d22111","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-009","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"540b736cfb7436edbd043c2f0a585bf80322fe2a0f06491279cad64ec391eb52","source_edition_id":"edition.o018.id-id.draft","source_line_end":52,"source_line_start":49,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[49,52],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"8f012c3689f2af239e00343ee5c67864a04d7c60191003482e1ed70f7ee20cc1","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-010","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"4b673cbb4ba90257ae45663d3594acca57e61f17b2211a0c9fbc08002cd3880c","source_edition_id":"edition.o018.id-id.draft","source_line_end":54,"source_line_start":54,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[54,54],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"549c7ff13873b37e58bf16ef0decd85923c9b75d681029c3bae798b32b98ee6d","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-011","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b4f60264bf5425739d82ce636693194319003d6bfa859f7f8b73a8eeb24d6702","source_edition_id":"edition.o018.id-id.draft","source_line_end":58,"source_line_start":56,"source_local_id":"block-011","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[56,58],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"e49e6efdc75bba6dcf4cfa5bd022fd8dddb5a16d3a1c0a19a72fc8369553a3d4","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-012","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"142ef39ab5939e788fd5cdf1da8775bd3f92990311773e41bcd884a4e4d66bb0","source_edition_id":"edition.o018.id-id.draft","source_line_end":65,"source_line_start":60,"source_local_id":"block-012","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[60,65],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"689438ee557203fa17a9779a10469a0f0560db41ad4ccb9ef290d74bb4a2ed62","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-013","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"02f64b48ce4847047de08bf10f579db474897104fa40f31025f30a2e5a3389d4","source_edition_id":"edition.o018.id-id.draft","source_line_end":68,"source_line_start":67,"source_local_id":"block-013","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[67,68],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"c2f9a66f0f2fe2781785cea996d2ccda4bcc532b14d2663fc891ae78d234b8af","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-014","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"6fb575395fd04f6bae5232468a926a075497ad549488e39e570dd05a3b335149","source_edition_id":"edition.o018.id-id.draft","source_line_end":70,"source_line_start":70,"source_local_id":"block-014","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[70,70],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"0ce24fb4d8eedfb352481dab657e51f1ee11ea5b3f65fd1d3b6b21c89762127a","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-015","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"bbd6bce4e57302a1f2cc7016e8b5915176ae80886c3590320621119a57c56492","source_edition_id":"edition.o018.id-id.draft","source_line_end":75,"source_line_start":72,"source_local_id":"block-015","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[72,75],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"cda3ae1fd023c5107e62076bef34acd784d301a4eeecad7d1878b844e253c403","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"id":"segment.o018.lab.simplex.attribution.block-016","locale":"id-ID","parent_id":"unit.o018.lab.simplex.attribution","prerequisite_concept_ids":[],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"df6ebaba00f1cb517def9210eea4f138fe875b657ec2d846c4f40b554e1a34ea","source_edition_id":"edition.o018.id-id.draft","source_line_end":81,"source_line_start":77,"source_local_id":"block-016","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.attribution","verification":{"source":{"archive":"labs","line_range":[77,81],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/ATTRIBUTION.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"829f2f32c9d5c7870ad13b11701946536641910050a7f165a09f29a423f047dc","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"id":"segment.o018.lab.simplex.readme.block-001","locale":"id-ID","parent_id":"unit.o018.lab.simplex.readme","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"b0f3b1ef58b96dc3851bed527e497cef07094660dfa937c11382430c065cf1e1","source_edition_id":"edition.o018.id-id.draft","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.readme","verification":{"source":{"archive":"labs","line_range":[1,1],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"269db1a16f4318400e0b771c925169f1770917e46d9a86c22289bff28d02ae21","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"id":"segment.o018.lab.simplex.readme.block-002","locale":"id-ID","parent_id":"unit.o018.lab.simplex.readme","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"e52a294523c1835bcc54d262710f506fa356018acc7a99e1f84b1cf078f7d5df","source_edition_id":"edition.o018.id-id.draft","source_line_end":7,"source_line_start":3,"source_local_id":"block-002","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.readme","verification":{"source":{"archive":"labs","line_range":[3,7],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"db541f647cebb8d2e3ab5cc682544e55aabe68a9be65e235296549541a5cb156","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"id":"segment.o018.lab.simplex.readme.block-003","locale":"id-ID","parent_id":"unit.o018.lab.simplex.readme","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"fbef42e4ad5650e50c27d23f8c0dff98db8a35e3eb820fb58b506c944f70536f","source_edition_id":"edition.o018.id-id.draft","source_line_end":9,"source_line_start":9,"source_local_id":"block-003","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.readme","verification":{"source":{"archive":"labs","line_range":[9,9],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"2504289b9df98dcb9372b3d90cc87c78f7f955cec0a14bd3278c5f8ac422decd","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"id":"segment.o018.lab.simplex.readme.block-004","locale":"id-ID","parent_id":"unit.o018.lab.simplex.readme","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"0763de4075a280a91d1439708163ce4b636a40fc2be108dc98289e5b964b6b5e","source_edition_id":"edition.o018.id-id.draft","source_line_end":27,"source_line_start":11,"source_local_id":"block-004","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.readme","verification":{"source":{"archive":"labs","line_range":[11,27],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"09f6dfec20459e1d870d50ec5a8ca15505349e0061112af5362a7b27b13c0192","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"id":"segment.o018.lab.simplex.readme.block-005","locale":"id-ID","parent_id":"unit.o018.lab.simplex.readme","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"345c6ca486f379910af6948809f87206801931093945584cb72573f5ed9db643","source_edition_id":"edition.o018.id-id.draft","source_line_end":31,"source_line_start":29,"source_local_id":"block-005","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.readme","verification":{"source":{"archive":"labs","line_range":[29,31],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"db26e9a8b89a9ac8ffd19e59d4e7ffee1bf532ab8e1ca4b9687872a0ee117d20","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"id":"segment.o018.lab.simplex.readme.block-006","locale":"id-ID","parent_id":"unit.o018.lab.simplex.readme","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"2336aac0f30d436cb0c85b59b2c010f570e954524e7ceacf683898ca856f643b","source_edition_id":"edition.o018.id-id.draft","source_line_end":33,"source_line_start":33,"source_local_id":"block-006","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.readme","verification":{"source":{"archive":"labs","line_range":[33,33],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"7ff544b1b9bdffc5755e23e51aae001be10c1dc4be572d77be706766997ba265","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"id":"segment.o018.lab.simplex.readme.block-007","locale":"id-ID","parent_id":"unit.o018.lab.simplex.readme","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"15a0a26446c3490275e591b26d3646097cfeeb69462070ecf0337f333d320620","source_edition_id":"edition.o018.id-id.draft","source_line_end":35,"source_line_start":35,"source_local_id":"block-007","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.readme","verification":{"source":{"archive":"labs","line_range":[35,35],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"d62c5c31f884de92f37e52e52a83532c42b948e9d8024761d5e73d3e624db649","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"id":"segment.o018.lab.simplex.readme.block-008","locale":"id-ID","parent_id":"unit.o018.lab.simplex.readme","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"d43e9ea0ce3fb9bc0efe483737f57dfd25b2f6c31c2b64f5c6a5bd0c245c93ab","source_edition_id":"edition.o018.id-id.draft","source_line_end":44,"source_line_start":37,"source_local_id":"block-008","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.readme","verification":{"source":{"archive":"labs","line_range":[37,44],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"22c8b4f044c714052b887eeaa089fbcf9d11dd0ec4ce965d098a0a713ce41b89","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"id":"segment.o018.lab.simplex.readme.block-009","locale":"id-ID","parent_id":"unit.o018.lab.simplex.readme","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"994bae5b61ba8e7a403ec5fbc558f3d8cdd09e909a70def7a388fcc7a8564183","source_edition_id":"edition.o018.id-id.draft","source_line_end":49,"source_line_start":46,"source_local_id":"block-009","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.readme","verification":{"source":{"archive":"labs","line_range":[46,49],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"45ce697c707d995e83a1d20f48a798c15f87fdcd9872a16e81e7d1fad8c363a5","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"id":"segment.o018.lab.simplex.readme.block-010","locale":"id-ID","parent_id":"unit.o018.lab.simplex.readme","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","source_content_sha256":"5d03fde2869bd22fcca8d355c834711bb99f944d89695a97a5b408f22a71b144","source_edition_id":"edition.o018.id-id.draft","source_line_end":53,"source_line_start":51,"source_local_id":"block-010","source_locale":"id-ID","source_path":"o018-open-solver-lab/ch07-ch09-simplex/README.md","source_target_relationship":"locally_authored_adaptation","status":"source_frozen","supersedes_id":null,"target_content_sha256":null,"target_edition_id":null,"target_locale":null,"translation_state":"source_frozen","unit_id":"unit.o018.lab.simplex.readme","verification":{"source":{"archive":"labs","line_range":[51,53],"member":"source/o018-open-solver-lab/ch07-ch09-simplex/README.md","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"target":{"state":"no_native_text"}}},{"canonical_native_record_sha256":"8ffbadb381a629bca921aa421e398991ad94c0b2fcbbe809c58280a4af33486c","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-001","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"b5268b95274fa62684fda062618d162dae9423e6945c938043870927b8800a66","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"d81ff806b06d0b82bfdc60c06be29c53ec4f5f8a49db5c82e113396676aa240e","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,3],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d7cd898eb3b942358f14dc61b11fa2a8d3ccc4bf205de2e00d623a28c405dbf9","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-002","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"1125d7bc81b9fc999e84a77a1c855b0103111800d1c1f7effc0abe8d40e49d91","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":7,"source_line_start":5,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"77475b9bd31e182498041b92af89487da9a928ca565cd51b9b2abb0fa3598273","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":5,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[5,7],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ccfacb3af977f57cf4026c269fbe16275b05859f18fccfbbd59227e50ff89b7f","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-003","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"3b4944dbd88c658ec4069ac80af8cfa38bf0b36571b591377365b152cb648db4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":11,"source_line_start":9,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"6b732890ccc0edf1ab79c15bc8bb1a2888d053f859e442ae17dc4c72424fd660","target_edition_id":"edition.r017.id-id.draft","target_line_end":11,"target_line_start":9,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[9,11],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"802b740578a5b5a65f1e6affd5abd564ff051b076a201a700808be0615945593","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-004","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"af98f0aeab81341715c61665ef752b367a59f3b57bd67c5f3c786bfd31fccc62","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":18,"source_line_start":13,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"d333d4fbdcd92e40951023884e7bf5f8c48663cf32ea2b39fe5fef1d75c05d3a","target_edition_id":"edition.r017.id-id.draft","target_line_end":18,"target_line_start":13,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[13,18],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e3a2ad05a0358a8aa02cc03e3dee3d2aa184366e3bd49533fa3301e28e01323f","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-005","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"c669080f02d5892b401fe8d87a6b70f1aa51bfdcf0dfb5ddfb634cf8ca23f0dc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":22,"source_line_start":20,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"82211015edab4c5ac9c9ed389b95ace5fa69da110069bec624da0ead077796b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":25,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[25,27],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"55900c664c5c1cf3584d6a45e02f61eeb203ed74fec6232021d047858fe28927","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-006","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"b8616e5e9a4265e0b6fcea29993397f09e8f774d7b5195f2b7c83e01a90143fb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":25,"source_line_start":24,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"3443ff4c2e9a46a6d8726377b400fb891eec193c9c504d1315f50750131c6c2e","target_edition_id":"edition.r017.id-id.draft","target_line_end":30,"target_line_start":29,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[29,30],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8114863bd4bfdff16ae22245e7fcd839a03aebbcd1d6478dcd1ac4cf20af6547","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-007","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"5de693bef1c8011638cc21160ba5f2f99fe51b942b25a54b7851cad1dbfc0950","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":45,"source_line_start":27,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"f60115d65b2a0caf15177e336b136fbdd051161cadf6056640cdea4de236b755","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":32,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[32,51],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ad4e6787f7b968e3dce250c20b9912e7253978c2cb4c1cc718e4286c09896b30","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-008","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"885a463e22af2d66fd5dc5dcf6e6261d8a036184b3e8328374759d3732932a72","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":47,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"a077e41fe2ca7d8fd810a9e7c7820d9c97722c922021684be5e6497d6aaa7997","target_edition_id":"edition.r017.id-id.draft","target_line_end":55,"target_line_start":53,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[53,55],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92f5b318d1c632a719dd4ecbe139095ef23b631212d604ddfb4b67e5fbae3152","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-009","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"16ef694f467d289836ee06e9cacebaec275b8a5ee7257465deafbb722bd6dac0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":51,"source_line_start":51,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"e837d3b275bf71442f11163d031645c71f66dac5f08a5ee0050e7618d890c1d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":57,"target_line_start":57,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[57,57],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5116cf39643964e826a492e280802adbee14c2df89664a026d84c0b7382a6d61","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-010","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"a39f7e476c61a5cc2817880959fd057e0e9892c868e7ec17809dd0b4fffde01d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":63,"source_line_start":53,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"d822bbede2b22204146610fb470e9abe85d1716884c27ac334463008e03ecf0d","target_edition_id":"edition.r017.id-id.draft","target_line_end":69,"target_line_start":59,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[59,69],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2414041899eb802a1e4c71d372c5586633a3bdcbb23419af04fb2f8756ad7435","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-011","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"95a035cb545500df3b272747f681f0ec311b218daee6df06637094a3d983e6b9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":67,"source_line_start":65,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"48383954d9fe2df5e623b9aef8452a040fe55ceba99dd04440ec18c635fd6acc","target_edition_id":"edition.r017.id-id.draft","target_line_end":73,"target_line_start":71,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[71,73],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e7e109ba135d2c7b7fd7c547c7baed7ee7b87c1fffdd157e230a85160352703","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-012","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"647d7fd9c52df9deacdfcdea36149dda2757bd4e71624059f0b5e20ff8dbda34","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":71,"source_line_start":69,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"40386aeac6897b16bbbff7c656a8a385c52c07d25b7bf451179f34b12342538f","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":75,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[75,77],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9236814b6595d4ad1ae32ed84b316a306a45d4ab353f8bad723ec2f569954bb","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-013","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"8a2a4fc9d2587a6bad1a4cd7876e535bc9bb62418a96a343b3920c87095ce4bb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":86,"source_line_start":73,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"b05438729e63ae7cf9ed95bbf537ecf3fa143721b4eedf5c5062c97440025985","target_edition_id":"edition.r017.id-id.draft","target_line_end":92,"target_line_start":79,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[79,92],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"86176111460d72380fce3d2fa9706cac681d7a0a9de2dec6602b6869d419b753","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-014","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"03777a8294535418ba19fd8b4fc6a2ea17285f186b88d4eb3296bfe7456499f5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":90,"source_line_start":88,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"0b9432174307df5f9a5de6fbe540fbbb98dc127f330e10b2942b327f5b841fa1","target_edition_id":"edition.r017.id-id.draft","target_line_end":96,"target_line_start":94,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[94,96],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"50bc741cc24611eec3e0e3958810ebf04b597821e75bb44fc479a528a70ec0ff","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-015","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"93ceabea6523f8b217dbedc7041e6d71ba5ee57da55f4e684d6fecd1fcba1108","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":96,"source_line_start":92,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"cf2d07985dccb54f8074ce0f84c6286bca48a2003c45079f82a18bd789716d3c","target_edition_id":"edition.r017.id-id.draft","target_line_end":102,"target_line_start":98,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[98,102],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d861f0b8dccbe15be74895a71b3b4616e9da242c417fd405b45f22aa6cc943ef","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-016","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"d7cdc845460f58bf5d59864a0f6808389a052870554fcd3bb782b77bd792b771","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":101,"source_line_start":98,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"1a37615f9102898977acd4ea32c6ebffa2286e1b6f198095f380f382dba6564b","target_edition_id":"edition.r017.id-id.draft","target_line_end":107,"target_line_start":104,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[104,107],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a576d5dd186448bae61ef2e4722878d301bfee78000f4264b836d5dd580a8a97","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-017","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"68b75eddf6170b6cd16d856974f18a3e8d7603ab41827ecc16a2cdce796569f2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":105,"source_line_start":103,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"181b7bb88e44b25fb1209552566fd11b4a773e5478c33879efc547e9dac8eecc","target_edition_id":"edition.r017.id-id.draft","target_line_end":111,"target_line_start":109,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[109,111],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19237c6ae491c61b4444d0335fa0ca7ce05c0759b29ad56b571fa935ea0eece2","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-018","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"b0bb66f9e8e41a457f6e90039bf29048e8e1e348dcf9e85d89e02fdfdc70465f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":113,"source_line_start":107,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"4cf45e26c91b5940f899b9851af5c8e3637d059b9a4a43a82b949df9b1792843","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":113,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[113,119],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b86e7a5f07eaaaf50237daaddccef3f4fbf6aaf8f17f0a5ba3cd84145de427c2","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.block-019","locale":"mul","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"282b49e950e477e7bfed4532fb2ddd58322e35eb3322dfe3d023af63f75bfc84","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":116,"source_line_start":115,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"282b49e950e477e7bfed4532fb2ddd58322e35eb3322dfe3d023af63f75bfc84","target_edition_id":"edition.r017.id-id.draft","target_line_end":122,"target_line_start":121,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"translated","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[121,122],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"901b505b52db961d54626dbeb6fe6f6179227c1a773aef265e069f7e4a82bc25","concept_ids":[],"id":"segment.r017.book1.ai-disclosure.target-native-model-provenance","locale":"id-ID","parent_id":"unit.r017.book1.ai-disclosure","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_edition_id":null,"source_local_id":null,"source_locale":null,"source_path":null,"source_target_relationship":"target_native_correction","status":"verified","supersedes_id":null,"target_block_index":5,"target_content_sha256":"bf7b863b33f956bed33b51605b10b6bee35cb62cf2a003df191221750b252b60","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":20,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ai-disclosure","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[20,23],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/ai-usage-disclosure.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd3205edf84c58c97df00cf5a47ca586502977d5cd688534995262c72241a867","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9c29e10331536ab476d40346d3cf8aa87d21c5ae482fe8c9399040c6746aa00d","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,4],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1f9ca3a3cc986345e58041fb7da4f8c9d0c68a9f06efac5d9ef4ed04fa8f1bb8","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e36f3402d87c3a1c8639d41a6c63703348f9d0985b84d5ea772c5f20847a7b3d","target_edition_id":"edition.r017.id-id.draft","target_line_end":6,"target_line_start":6,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[6,6],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"04729c87907e7833cd4c68e4b017489b84c6385201df339483e5ec209e901823","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"991da557f179e3dc5c40677503aa64d7adcce69e8b1974916be3fe71930d7485","target_edition_id":"edition.r017.id-id.draft","target_line_end":11,"target_line_start":8,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[8,11],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c204d872925720c61fbf7201b9e5db4707ec83d89c81760eb350782cc2ecaba","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":13,"target_line_start":13,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[13,13],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec86c3211bf849f87dd7e84532a5fd8b7511bd824ca391b976aa192585d64888","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e900ca38b470cb7b36451cec5a63f654f86c4498ceb716d11bb8743d02123472","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":15,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[15,23],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8347da6b100b9fedec5ce307a8a648361101189ff4bd030643a44401acb477c7","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2d5544899523bf13067f53ae279db16ded05aeadad1a2dc2e6de5d40dfb41141","target_edition_id":"edition.r017.id-id.draft","target_line_end":30,"target_line_start":25,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[25,30],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cf8bb2ffcbffe93b90a19e931964d5906544e7b2d640ced4f3430bd196617bb5","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"20a81b33a30d4647ee569bfcc98d50054017a15a0be4e9a6ec847d76b109036c","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":32,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[32,39],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c196d1e85b2d56e29d5eb82b5715bf38362f49e66e12e0ffde52a2666e31bbce","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"00b57dbcda411b9b6dc387c2056931a3e57fe029be6db050abc0c410c5f22437","target_edition_id":"edition.r017.id-id.draft","target_line_end":44,"target_line_start":41,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[41,44],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2083c569d278d0f91fa0b263a5b0cb0c102889a8bfb003d74e821ea0ce656430","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a0f621e60137aec4701f191fda143a53804e1df7f11bb84ef8b2f288dd5fbf0e","target_edition_id":"edition.r017.id-id.draft","target_line_end":46,"target_line_start":46,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[46,46],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4833330e9471e3cf3b03416b7c8486db21bedcb0e992913bb32e6a021fe9def","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7e92f0ef22821fb325c15f6d2d54e29931b37ce3edced78ba1adaebbc710e0d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":48,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[48,49],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0281f01cc536490c5d98770441a96be17bd15cd8a759827ed2fe2f53fcc89611","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"138322b0e8db4ce3b293acc7ba3edef780529986ccaf0e71335d3f4b26fb6f3f","target_edition_id":"edition.r017.id-id.draft","target_line_end":60,"target_line_start":51,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[51,60],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"451dc4633492e639c5c9eb539171f93e66bbf4a1aaf7de9cf3f240c7d1dafba2","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4164fd6b5d183adee0c01d9b4d9b626afd643de8e96051e7c1ec6076bed186b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":68,"target_line_start":62,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[62,68],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9cf0d9f699e374b81a05a081b91de1da8c24f0f0f00bcf02b8d864dfef79e432","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b11d69560b542a754d2c44b75a6d4046751d39248b7bd22af4d82bb2ec6c492","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":70,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[70,72],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc04f9732fed06b5a69a8cb13a4495b7a3dbf8d5b55b04c76a4561ea8e3809f7","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"635bfe74c8103b7f9d7dd62c6489af5220b058b38b80e8d26ed0469c9ed3542f","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":74,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[74,77],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb4da131f630c771843649ea1713fd6d6790500719ca89dd7430c0dda6949598","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"09c29050f57615dabb829c7a0a13bdfa70d17597e877fc2af2ad94c9c90a9281","target_edition_id":"edition.r017.id-id.draft","target_line_end":82,"target_line_start":79,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[79,82],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"83976f4fc356f57dfdf57d67b34858b6174030fa1923013b7d80badc59249233","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e279c349622c85d3a57cfd3e16917e21ca62b90397c6fd78d9898360df8930c2","target_edition_id":"edition.r017.id-id.draft","target_line_end":85,"target_line_start":84,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[84,85],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"33ba690bdb6bcab81ed0509bc8048c5fe0469876ae53fceba7a496ace5692826","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f5d99ae55dfa2e50ad3520821d8bc4385f0a7eb2fe7ec8fae33873b5938b18ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":88,"target_line_start":87,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[87,88],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"44abf642a478bc62fa53b29c6d5e591e23a86f0df2c7eda0d83ff00874c32989","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7848c5ae994232f5fcbe85693ae7d3f0e1a8ac402ac49667a3a19146766ecb33","target_edition_id":"edition.r017.id-id.draft","target_line_end":91,"target_line_start":90,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[90,91],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8025c793e4de02f7406b3f30ce6d223044bdba21d7f6dcf7f4ecf92218848ccb","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"60845a8cfba7eb6b303c9bb4df28b2a8a9710c4355f423da816f95973e4c4ce5","target_edition_id":"edition.r017.id-id.draft","target_line_end":102,"target_line_start":93,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[93,102],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6dc15cbcae5893b0e4936c786545023e717e941a1c26aa4e02c1325a7fca9675","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2561d5a2902e2161a9f282d95d7143ee401cac7325ace7c53a841333df0a5b47","target_edition_id":"edition.r017.id-id.draft","target_line_end":110,"target_line_start":104,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[104,110],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"29d32dfe0ea2b2c22b4df1eef79dae56b3bb6ad6b3b1a544f6a63b60567c236a","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b11d69560b542a754d2c44b75a6d4046751d39248b7bd22af4d82bb2ec6c492","target_edition_id":"edition.r017.id-id.draft","target_line_end":114,"target_line_start":112,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[112,114],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"746c2680f5e25ddc50df2b6743b6388fd81d5d5d8f68025a1fb876be49ca800e","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"706a59568c4043df0a198798bd5afa7615d71fbc1f53da82b6406a6ceb2ac196","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":116,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[116,119],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"55ade79e420813d3c7bbc1c79eca3c41f540fd9082f266e013b61706a1a11db6","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"39115ed8bd501fd0de3168a73608a0c5c44ea985cd87badc448a0de7cfdca30e","target_edition_id":"edition.r017.id-id.draft","target_line_end":124,"target_line_start":121,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[121,124],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"324c78f7327997c998a17964f02456f7517c3a989707aec7d2ccd5ddc776bac7","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1cd45fa5dcf4b4f72b17a9332a096eeb8d048db575cfbcb5c1289e372dcd4291","target_edition_id":"edition.r017.id-id.draft","target_line_end":127,"target_line_start":126,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[126,127],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b52930e576782d5b12b50e99845c64b71b2f94a1df2a88de700bfec1732a95fd","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f5d99ae55dfa2e50ad3520821d8bc4385f0a7eb2fe7ec8fae33873b5938b18ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":129,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[129,130],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ece9dcb30d436501ccfcc14e667fd2043dd2461a1f058f09fb97d783cae23bee","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5ed38671b777105dbd9b2b7fcb7d02b9c5c61c8ea7217bb7b0d535c817a03915","target_edition_id":"edition.r017.id-id.draft","target_line_end":133,"target_line_start":132,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[132,133],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"230c116e0183634d46673bbd734df326f5cd209d458acaa6cc8f062e0d9e8b09","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7c6805333f63fd8167d5dc0b4e1c7c7bda08687a4f22945c35aa630e75aef9a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":136,"target_line_start":135,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[135,136],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"35af0d14803745e2a76721487da5bd019b2bcb2b024d960e2c45ed9921ebcafb","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-028","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0e9283732f862f3e344df2d30115db33ef8f8ba6df4db6a76610005d6686334a","target_edition_id":"edition.r017.id-id.draft","target_line_end":141,"target_line_start":138,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[138,141],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c717fbcfe0ebfb1ed128a0e7e27852f689711da0e7b5901c64d37c6431d1fb5","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-029","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8755c941d00ce573d10258c1f1811b1bb1e9844062aadf742f42ae574aa39064","target_edition_id":"edition.r017.id-id.draft","target_line_end":146,"target_line_start":143,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[143,146],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4bb3c24955ba81fdd285eb848457c127b6cf3ea3c6fb64c4d057ceb9f4bae860","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-030","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2f01a93ce0a626b26a017a3336d8a120d8081a53fa0954d7c74c34561e511535","target_edition_id":"edition.r017.id-id.draft","target_line_end":154,"target_line_start":148,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[148,154],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b691dd2e4eef760fb623a4048e3c48ad875a8d6f0315b73f8008b087913b8f3c","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-031","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b11d69560b542a754d2c44b75a6d4046751d39248b7bd22af4d82bb2ec6c492","target_edition_id":"edition.r017.id-id.draft","target_line_end":158,"target_line_start":156,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[156,158],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"32e484d9c6acc94ae90390cea29fff26e51ac1881172a055bbdffc2aec85d730","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-032","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1c84db7bdac50e4767f94d943822dc1d517d3eec608bf70f199b7762f9ff5b5e","target_edition_id":"edition.r017.id-id.draft","target_line_end":162,"target_line_start":160,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[160,162],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"576e472cf97c6304ba55ab559a9b793be8903a8b58551ac2ea6bc35e3c85c6ed","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-033","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"13e44826c67ddb0f578b891fb5c20824c04be7f0c17744bd654c2b81c4239ed7","target_edition_id":"edition.r017.id-id.draft","target_line_end":166,"target_line_start":164,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[164,166],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc86c0299f3548d2974a85b8a17aa4f44c281158b85dde31516a57d56c1fd415","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-034","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"67b64d209a78a1d01715aefcc09d8d1c52fa252b232ee256f3b08d572409a86c","target_edition_id":"edition.r017.id-id.draft","target_line_end":169,"target_line_start":168,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[168,169],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"952a1695bc7d091e305644032d4348fd492e0fc68707a13bedff06c04e8ff110","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-035","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f5d99ae55dfa2e50ad3520821d8bc4385f0a7eb2fe7ec8fae33873b5938b18ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":172,"target_line_start":171,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[171,172],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d433f06b465c2824045832714c6dc8560aefad03bc9f6f14817ffe4297159909","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-036","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4b560077bd28ba9a2050888f78bb1c6eed678c9fcdc4dcf686773266d27e17c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":175,"target_line_start":174,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[174,175],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8002146a0831ddb987e6a1a3e7ac4034d87ad69aaca1498a95c461d9a01c7a4e","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-037","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9fb5d2060ae4e759f014a38edaf1c0664a90b417f80f97268e70c6f0bb0d83de","target_edition_id":"edition.r017.id-id.draft","target_line_end":178,"target_line_start":177,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[177,178],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa737f1f83b2cea583fb517e4405b82cb4167f51603732e44887558db17a77bf","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-038","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c256dfd926f02109747d09b223a783e8f27833ab20fd0126b70b23dc4878c740","target_edition_id":"edition.r017.id-id.draft","target_line_end":183,"target_line_start":180,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[180,183],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d35ab0ba0187443c9145d26756706b962def677e9032bdb06f801676e1990906","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-039","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4164fd6b5d183adee0c01d9b4d9b626afd643de8e96051e7c1ec6076bed186b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":191,"target_line_start":185,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[185,191],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"729138257e7c30e4901c892f50a45924066d48927ddd753e124c26c28f9351c3","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-040","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b11d69560b542a754d2c44b75a6d4046751d39248b7bd22af4d82bb2ec6c492","target_edition_id":"edition.r017.id-id.draft","target_line_end":195,"target_line_start":193,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[193,195],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"027dd364aa1b7277645b65556b1bc8febc7197d314809d7bfee0913d9860f103","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-041","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a5d50de6847bbde2b0394329420c77f4625e3badd02a310452bfac886a96bab9","target_edition_id":"edition.r017.id-id.draft","target_line_end":200,"target_line_start":197,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[197,200],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"866f3aa0517c951f9797133999b161023c41ccbb4605c7309671ae6012124283","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-042","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8b9b5ea7b8f386882cbad154352d83c28743738f0f21658f57331c19812e2969","target_edition_id":"edition.r017.id-id.draft","target_line_end":205,"target_line_start":202,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[202,205],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5cdea5f09a1cf4143976e951d211c239b2fa8317e7834e0f098b5e6559a2b6e9","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-043","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fde271a1149f9bd43975bc0014fbeab4ae0f8140e9312acd96cdb721dea44832","target_edition_id":"edition.r017.id-id.draft","target_line_end":208,"target_line_start":207,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[207,208],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c8bbc769038b13d592bb2465d3f1e4441ba2160e1bc957ed441c02ad9dc88de","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-044","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f5d99ae55dfa2e50ad3520821d8bc4385f0a7eb2fe7ec8fae33873b5938b18ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":211,"target_line_start":210,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[210,211],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00b48b2d423627e712071fa562531a0b73952419ec8c8e6c99cc1edbf19b5911","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-045","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"69925413821970b7b59f16ec80ef75b89cdbf01d1884cc82ea9310d335cea23b","target_edition_id":"edition.r017.id-id.draft","target_line_end":216,"target_line_start":213,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[213,216],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"823017165d53ca70ecdba760ad9f39a7225dc54b13c5a2102d0ca3b6d5517f81","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-046","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c5b57dcfccc4112e791a8361c35256d616e400a81abd01fead85a4bb7b99b151","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":218,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[218,219],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16b45538c854cbfe44ae3022457cbf2b31d1b5925cfbc992f6acdf2f259457ca","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-047","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2ea3fda97c46a1a4c141f781b35528b282bff37389e93c1b57aa16ef93f0381c","target_edition_id":"edition.r017.id-id.draft","target_line_end":228,"target_line_start":221,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,228],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c9ec50724217e21f031cef6bd70a2b3db09c7a51dda341bfd5ac845aecd220c","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-048","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b11d69560b542a754d2c44b75a6d4046751d39248b7bd22af4d82bb2ec6c492","target_edition_id":"edition.r017.id-id.draft","target_line_end":232,"target_line_start":230,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[230,232],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"224a5e9d31f8a2ba9a56de0683a0411acdc062db37abd9b47330fec105eb87b6","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-049","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"958efa53605a9d139ca53f5f5d30030a325403ed1a53e3159aa0bc6f72362474","target_edition_id":"edition.r017.id-id.draft","target_line_end":235,"target_line_start":234,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[234,235],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c6bb54d7f9f4e93f1de8a78127eed2b882f679965fc27c8e13c5c75de77f2d7a","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-050","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e5f06321256c4f6e9e2473d195f4e7e5f18bb935fa8228c59598e8d8271ff2b","target_edition_id":"edition.r017.id-id.draft","target_line_end":238,"target_line_start":237,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[237,238],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"556c423b90709b8d4d1e6104a66ea2261555ae763be5a0d19ab069929597c1ca","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-051","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7c0351cbc62d3b830c57bb3b19c305d4f6e722ee44183090bc309ed08f603d95","target_edition_id":"edition.r017.id-id.draft","target_line_end":241,"target_line_start":240,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[240,241],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84a9895edb58fa5872c82738ecb7175ce98921ddf51bc774cbd2aacc238ae971","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-052","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3c7036369b6f2635b1baec5a15ce69623c2f2ae03790b452cb980c9be30e77da","target_edition_id":"edition.r017.id-id.draft","target_line_end":247,"target_line_start":243,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[243,247],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7132b3ddd12fbbbdb35b391b7367537b74069e66e51522ef6a11011f83b75a3","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-053","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b11d69560b542a754d2c44b75a6d4046751d39248b7bd22af4d82bb2ec6c492","target_edition_id":"edition.r017.id-id.draft","target_line_end":251,"target_line_start":249,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[249,251],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"31251ffd14f12c74483118b142df00202c68ec569643f4ccd9a7e9a0ce632f59","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-054","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7fb6aada9e90316c27fb9e2705f893b23c3a7c9c8a17826e306dc60c456a7511","target_edition_id":"edition.r017.id-id.draft","target_line_end":254,"target_line_start":253,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[253,254],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8491fbdc34e5f71248cec5c8dff2eb4e41452db36c73e97d778622dff103eb40","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-055","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f6e214b1e52c00763a263729e28503862f35201584b7bafe67713847b536ac6b","target_edition_id":"edition.r017.id-id.draft","target_line_end":257,"target_line_start":256,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[256,257],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90252460d4b0a03f7d2fde97f2744a5709da947b46aa852cc824b5ed84a7f3c6","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-056","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9b7a9ab28f2cbd3ed4eec64bbd681a34d86ef15cccb1fe1a691856bea5c6563e","target_edition_id":"edition.r017.id-id.draft","target_line_end":260,"target_line_start":259,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[259,260],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"60adf18c7e09a21a21d860dc14dc038f600226cd94b114b5c1b9d94052a70430","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-057","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f5d99ae55dfa2e50ad3520821d8bc4385f0a7eb2fe7ec8fae33873b5938b18ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":263,"target_line_start":262,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[262,263],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e83517fe6447d3ed9ffdbd68d9c4d5ab191b87acdcc1f2ffddce4bee1029d783","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-058","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"617d475357a432f3f7188b37e540e346cbf468c10df5c1720654c55ce7898125","target_edition_id":"edition.r017.id-id.draft","target_line_end":271,"target_line_start":265,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[265,271],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"89f0817346cf73283b9be5e5a405a6fdbb689938aae46383065d3e9d82c0e350","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-059","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b68b8643b51efac8494c6358634791cb64e30bdf0d0eb43785c27b44b3d66b9e","target_edition_id":"edition.r017.id-id.draft","target_line_end":276,"target_line_start":273,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[273,276],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"017843a3751e1b4c76e3e88695f0c49b8f5c4aedd411fe218ec90a0aba7cd4f9","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-060","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d00a64bc07c1cac0e9fc39b55b5603dc940cccd01c3a2f1b95e40e7f18f27969","target_edition_id":"edition.r017.id-id.draft","target_line_end":279,"target_line_start":278,"target_local_id":"block-060","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[278,279],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f2e068cca0efecaa4b1a5970f7f7d07baf76965050670de775b56ecc613cb4ec","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-061","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b69ea8b2a37b0b69c7518d70f10c7e593f5b7007e20d7ed2889fe2f24b1f7dcb","target_edition_id":"edition.r017.id-id.draft","target_line_end":284,"target_line_start":281,"target_local_id":"block-061","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[281,284],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7bc5291f61d9a437692b53053938906fc04ca163d15b772de9f4e23b07a58b14","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-062","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7930d64c034650b885c6edde699f91a5ffad897569d8c34d4a158f7b23ebe055","target_edition_id":"edition.r017.id-id.draft","target_line_end":291,"target_line_start":286,"target_local_id":"block-062","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[286,291],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39f00df7d1c7bf3374a5596a2c3b813a158a8364e7c5eeb455f10098fc6d9a2f","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-063","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"722752597aa1aa29c6a30ff491be5c563af9dbf74787424963e4b97a992f0793","target_edition_id":"edition.r017.id-id.draft","target_line_end":295,"target_line_start":293,"target_local_id":"block-063","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[293,295],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c48f7bce0a26c4974e9529e0d4769af36810da57b84e77cfbe621fa04af8bace","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-064","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f0068751f8bf058b44aed725fc3d90058b2537f32201e7382c8be388735e0ff2","target_edition_id":"edition.r017.id-id.draft","target_line_end":299,"target_line_start":297,"target_local_id":"block-064","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[297,299],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"329764f768c6097bf016f8d1bbc4b17a063c9692bc8ff5d10d4611ef705602cf","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-065","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4bb15d32e9d993d34e82eb9e5c4fe90670f17c568925a0e9829b83cb9902376b","target_edition_id":"edition.r017.id-id.draft","target_line_end":303,"target_line_start":301,"target_local_id":"block-065","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[301,303],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84cb0199f2f53ed4a4cfa9f03f6caf815a2d5a6ed70d4f861ce746f68fb21975","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-066","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"74caf22ae95f875037b1f07ea0bbe4a62ee6d0db02b9928ddb204eecfeb2395f","target_edition_id":"edition.r017.id-id.draft","target_line_end":307,"target_line_start":305,"target_local_id":"block-066","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[305,307],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c405a0736d15c6151df91d8c3a55744e00eeafde595c783aeb116956e3c3ff1b","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-067","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7382d87ed4e3115dc94e042e85a50a1e283b0048e87eb03162638b99a08608be","target_edition_id":"edition.r017.id-id.draft","target_line_end":311,"target_line_start":309,"target_local_id":"block-067","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[309,311],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"beff20c1aafe39cf689e3edb06bda910860ab7c4cf7b4801d44309f70b5eb70c","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-068","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f5d99ae55dfa2e50ad3520821d8bc4385f0a7eb2fe7ec8fae33873b5938b18ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":314,"target_line_start":313,"target_local_id":"block-068","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[313,314],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c847661d511cddd02fa79b221ae177833dc6153616cfa5cc912a101d1cf9d9c","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-069","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8feef0b3b913ea4c76fa18e8bc70ad853896db812904f2df667f07d2d5c4d9f5","target_edition_id":"edition.r017.id-id.draft","target_line_end":316,"target_line_start":316,"target_local_id":"block-069","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[316,316],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"55566779c90da32e104348c95815d919486e4bd0b997e39334d4ba324c8f8bd7","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-070","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d6134679e1ca33c7ed3a77d8ef7e445eb5e6e43de5e2b29138dbf56e11e297dc","target_edition_id":"edition.r017.id-id.draft","target_line_end":322,"target_line_start":318,"target_local_id":"block-070","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[318,322],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37715f87774f978ee3bc7bf4dc6de821f86a0c853d2840f9fd18c21ecab93156","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-071","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"16ad5bcbda094f545ae1a60a9216ef82be3336db5e8afa12823282a64252f1c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":328,"target_line_start":324,"target_local_id":"block-071","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[324,328],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a613c524580d32dc149843a2c1aaa78f225f56bad09e6b00e36b200181edd45e","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-072","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ece691493ea5d5c994a1d05cd728c52ba0f8d9492ba54a056768998ef9a9df17","target_edition_id":"edition.r017.id-id.draft","target_line_end":331,"target_line_start":330,"target_local_id":"block-072","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[330,331],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8bca3453a776570715471f03b54fa575ecac55f0a60c99554c29edd42a56ddac","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-073","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ecb58663493afa0d8fd2664a6de700c9cb55bb495cb3669387d94d2211be8b2d","target_edition_id":"edition.r017.id-id.draft","target_line_end":339,"target_line_start":333,"target_local_id":"block-073","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[333,339],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a0c1ed2faa42cceee4f9376a38618d4b9f2c814a34f3f0832bf6980bf8b4b692","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-074","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"50989fed09b45c5087f4b10ef0815b323fd711bf0984fb61bac827760cba919e","target_edition_id":"edition.r017.id-id.draft","target_line_end":343,"target_line_start":341,"target_local_id":"block-074","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[341,343],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5cf4e7dfd2f02f98b20fe00db813fd1e2eacedecea03e438f1bd6039cff97da5","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-075","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f5bc426e22da6de9d8be7f987f6516e384c6e227494bf2872eca36ab5708868","target_edition_id":"edition.r017.id-id.draft","target_line_end":347,"target_line_start":345,"target_local_id":"block-075","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[345,347],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6075363836536424ac68318661c16394ae3531a5defe81c3408c4726beb93874","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-076","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"33c764f3fba859dcc994f70a7696a737d9ea4b9fca5a1183a7f0536402f84311","target_edition_id":"edition.r017.id-id.draft","target_line_end":351,"target_line_start":349,"target_local_id":"block-076","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[349,351],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f472312f2e8e6ac68fa17c3a124c5ce905e8ee834cd8f57fc2ce56e09a28bd5d","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-077","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"820b2f7ad5c725f09f128fdbcdda1aed053dbb7a0f49cdc07e4630f781c50a5b","target_edition_id":"edition.r017.id-id.draft","target_line_end":354,"target_line_start":353,"target_local_id":"block-077","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[353,354],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"99769494e2587f6201c428edc64867857876ee6691402a1d1558a17828377f6d","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-078","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9318cd9362fc08484caa2b5efc4d96efefa96afa99ab8812cafe1af885a02ff9","target_edition_id":"edition.r017.id-id.draft","target_line_end":358,"target_line_start":356,"target_local_id":"block-078","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[356,358],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bacaaf5735d02f60b05b5f749ac9e70092d8f9eb1dca8333b6d9650ef5958bb8","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-079","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c6ee45576adcae8da80587c0e010ebe266976f6d47ae51714af11d754a34eb02","target_edition_id":"edition.r017.id-id.draft","target_line_end":363,"target_line_start":360,"target_local_id":"block-079","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[360,363],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f78337022df0e4d63490a8a0059e06ec6719c04e1cbdef9b0cfb385293c84f5d","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-080","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f5d99ae55dfa2e50ad3520821d8bc4385f0a7eb2fe7ec8fae33873b5938b18ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":366,"target_line_start":365,"target_local_id":"block-080","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[365,366],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"73a46234f7b96c55b25b293d5a0b1014891f6299ecfcf9a5035c115e20f05e24","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-081","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"40c6be788f5ac8d4c01641b395ffe593017cc173581ed545b425eb8df24a10ea","target_edition_id":"edition.r017.id-id.draft","target_line_end":368,"target_line_start":368,"target_local_id":"block-081","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[368,368],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bd3e7e00783c16a9b92c753b481bd90bef30ab910aa0242f8c911cbf156379cb","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-082","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"257eb9e195d6b50910b2093e8eb44143965fcf1fd2be035e19167238441296b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":376,"target_line_start":370,"target_local_id":"block-082","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[370,376],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6f5e9a877c1c772b0c504c494e203785989ab361f05ffa13ee2da9d819fafa5f","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-083","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c482dc467e59fd020317c302f05bf85c07df54d8931615b5bfeab7f7ab6df1b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":381,"target_line_start":378,"target_local_id":"block-083","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[378,381],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df74bddfabd1152a1ec79b74a8533876e180dc6612a6656ed04fc26c04e6c190","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-084","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"379e0fd3a58adb0619bc3fda0a30521dc2fac1016063fb339ded03b408d52050","target_edition_id":"edition.r017.id-id.draft","target_line_end":384,"target_line_start":383,"target_local_id":"block-084","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[383,384],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"27234f96ad7e8456223194c7ec3267dd7f9bbf282bf7107a61145565eb75d2a3","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-085","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"da44f389ae4c9f4e883b088dba827e9fe029c8ff05c7de93d41b867c53f53c20","target_edition_id":"edition.r017.id-id.draft","target_line_end":387,"target_line_start":386,"target_local_id":"block-085","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[386,387],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39d6169cebe20d31131426f69de502099f2d0e7b11ee0899ba0e8c105c4ed32a","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-086","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aafd5148933a4a69ef894f482bb80b5230f5d1fc50d708b439cd6f0337d212d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":390,"target_line_start":389,"target_local_id":"block-086","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[389,390],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7511dd62986afa7fcac76f62df88d2aa1e7b7944f1e79e8b531c3cd9702a8def","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-087","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b0165253d2fb4028b4c38de91e1007967d8eb00c96d461917e12e49b0ccdd259","target_edition_id":"edition.r017.id-id.draft","target_line_end":396,"target_line_start":392,"target_local_id":"block-087","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[392,396],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"66bccc374f79e868351b92b896faeaf84178edf8f2f247094d38ee8bd8395751","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-088","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"df247f2f14c6dd13fb2a37be528e2acc78bc9a90bce66bbad88f8b0c718cbc7a","target_edition_id":"edition.r017.id-id.draft","target_line_end":399,"target_line_start":398,"target_local_id":"block-088","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[398,399],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"32766d89389ec5811b2c0fe74a87453c6d2200c9c5334ba7d916b2742becd268","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-089","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ba3cd6f927b4562b39a3bb1212ac85c45d4e8a0e3b99e9e68201013c9f23042e","target_edition_id":"edition.r017.id-id.draft","target_line_end":409,"target_line_start":401,"target_local_id":"block-089","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[401,409],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"98d5c91e5d4dd13fb2586a60f2e149d62a1cd1af5ce19a0d41dbcb8904a33f17","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-090","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ac97656892659fe682f3ef8d5fc380c87647780e6cc8705812a9c0c8c4707be9","target_edition_id":"edition.r017.id-id.draft","target_line_end":412,"target_line_start":411,"target_local_id":"block-090","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[411,412],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8457989e35241cb3e120ad5fd16f3012880b5c4b66e4fbc839189c07ac292e99","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-091","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4f653b552ad51de826e333c9aadf75751b2d78ee7d25fe4f3f689f887eb48648","target_edition_id":"edition.r017.id-id.draft","target_line_end":418,"target_line_start":414,"target_local_id":"block-091","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[414,418],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c61683822de34e24f397e1c0987b6e5498e367826da967b1b52dcb3299ba0459","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-092","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e9e8180de8a850c9e0d8471499380a38d96c5b1f980345686235b7ab0329cd6e","target_edition_id":"edition.r017.id-id.draft","target_line_end":425,"target_line_start":420,"target_local_id":"block-092","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[420,425],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d2f1323c3a062cf687f83375860f1e8fdf669872878cf45db7d57d767afcba7a","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-093","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72be7b7a7c20837222a0031ca0e4e17657d2d980974445d6edd34dd7273ace00","target_edition_id":"edition.r017.id-id.draft","target_line_end":427,"target_line_start":427,"target_local_id":"block-093","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[427,427],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e40bdbfc651430204e2bd7edbf5a7391172df0b9c505d7d01f63c0d32c4f9287","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-094","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8517f81761eeca7a188a8531b83044b560b174a986cd009966401b4966cfa8c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":430,"target_line_start":429,"target_local_id":"block-094","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[429,430],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"97e893e10052e7b3484f23f20959dfc065e88bc76ead59f4f325fd566fa31578","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-095","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"208ea45d86e7c8522c48b43c57034578aac650e798926ed500bcb0b79f146394","target_edition_id":"edition.r017.id-id.draft","target_line_end":437,"target_line_start":432,"target_local_id":"block-095","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[432,437],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a15396bc9b1d6d8b26789beac5fa81227fb25d71d1aaa76d26d6ddb78f3052ae","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-096","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b5bfc68ade4b05c324d4ec141c8bb6de6c782d54003a06fbbccf04fa78773cc2","target_edition_id":"edition.r017.id-id.draft","target_line_end":440,"target_line_start":439,"target_local_id":"block-096","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[439,440],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d16fecdee1f13be2d7f9ff67bdd313a18bac51d147edea761b750b16b6b87e4","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-097","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9752fc50ee3e1c59d8c14076935b22a64a983e4a8b983ecf945e2604fe9548c7","target_edition_id":"edition.r017.id-id.draft","target_line_end":451,"target_line_start":442,"target_local_id":"block-097","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[442,451],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81b9dd73b478d8aea9f0546c396414dbff7035781a2d7cfc159d205d7a8d8964","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-098","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"27b0ae46009969cb2857b4155a652ad3a8584ff81cca21d33ba5371c5d7b4eec","target_edition_id":"edition.r017.id-id.draft","target_line_end":454,"target_line_start":453,"target_local_id":"block-098","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[453,454],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"17344268e5b79184aeb17709ed1385863bb8a05ae26a32989299ebbfc4d2321e","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-099","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2dc1e41f37a2fe87e4045e0bab873807753ab87f25dd8086b89d977cfbf6d8c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":461,"target_line_start":456,"target_local_id":"block-099","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[456,461],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a13a95d9c2cadbe1546028d32c15e8615854724f852540831c044131d8eb9327","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-100","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"80d0823014022559b721fb981a3a6d9d51a2370cf6ef26914e8231d3acfccab3","target_edition_id":"edition.r017.id-id.draft","target_line_end":470,"target_line_start":463,"target_local_id":"block-100","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[463,470],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fafe95a20f5b384ab9e6a532e345a0e8e04e1138c403d4922b55caa93c4cf80a","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-101","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1d68e69d8e8ca8dd82d435a245b4ea4bab2055ddff9f853d9a09d5d9438fce55","target_edition_id":"edition.r017.id-id.draft","target_line_end":473,"target_line_start":472,"target_local_id":"block-101","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[472,473],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b101154ba0a1cb4c7e03e6fa62cb5390edbb04038913cc6b2068c1f804d5f63d","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-102","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a7f4159d7c95e30d40a2c9318b8e05b8917b1f2064a5483745279746647ce3d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":479,"target_line_start":475,"target_local_id":"block-102","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[475,479],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c3d049dea744c85c05c18b329d197ec9274d4b0785c263d587b003db7e72c29","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-103","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fe0b31e3312cbc3213e4784a00f17ef4e3b244e55651949d9017362c213d8a65","target_edition_id":"edition.r017.id-id.draft","target_line_end":485,"target_line_start":481,"target_local_id":"block-103","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[481,485],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a85b063d334dbd0ccc9a62f5dd5adc19701d01cde06b174806b41d04e97f767","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-104","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2a356e43dec732e61c6cc1acdb7042b1c17be119073b49bdef63031770cfdf21","target_edition_id":"edition.r017.id-id.draft","target_line_end":488,"target_line_start":487,"target_local_id":"block-104","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[487,488],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9db7ecbc196780641ac0163bf4bf755f5debbf41bfd9dd6ebdadc035c418285","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-105","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"147c5439e83aa60aadcab523cd3beb597b5545fd4cfbe7b6c0bf8a2dac28b4ed","target_edition_id":"edition.r017.id-id.draft","target_line_end":491,"target_line_start":490,"target_local_id":"block-105","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[490,491],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa59b9c249a31fa59376d312bf51917c70acb87a941874bcfc4d5d34395706fe","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-106","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a5fd228a74f08db8f3bdde9e9de805f5f3fdcce34851cfa3093310cd3f6183c9","target_edition_id":"edition.r017.id-id.draft","target_line_end":494,"target_line_start":493,"target_local_id":"block-106","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[493,494],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"447236bb0de3a81c07f702801ead9ab891042283f16390bb07d09a38403e82aa","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-107","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"58a80c5685668e9b9d9d7a59384064dd66c99f4fbb95d5f43d96b367d0a1b12c","target_edition_id":"edition.r017.id-id.draft","target_line_end":500,"target_line_start":496,"target_local_id":"block-107","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[496,500],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7bd0751e5afa78be04e59c13beba83e139ffcc2356ddc9f8dbe774f37ce722bc","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-108","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"662ccaec03fd6e10bf5f72193411518a1cae98cebd666927302f4e208206a1ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":502,"target_line_start":502,"target_local_id":"block-108","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[502,502],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"27cf3f8cb64519950f66af04131ad4b6820e2b1179ef99062f7e8ea267178edc","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-109","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0be0aa9314f2a402cc2b9f75d8f3bd80f7a452b4bfdc228d73e01292106ba27e","target_edition_id":"edition.r017.id-id.draft","target_line_end":509,"target_line_start":504,"target_local_id":"block-109","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[504,509],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2adcd2683b8154a7b97e0abc5681cdeb6bf52c1f4f9e489a95fd97d86ef4dd0","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-110","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b3e1c73e5c3b0ada95f3352df1ba21f6412aa46182ce8abb07c0765b354611da","target_edition_id":"edition.r017.id-id.draft","target_line_end":512,"target_line_start":511,"target_local_id":"block-110","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[511,512],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"32fce29473194e44cd2649dea34d8a1a9d109879b831f92df7ea0b9d37391793","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-111","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d78c68b64049aa855300470c992fb61eaca59f5160c554b83e2a79c58b26c40d","target_edition_id":"edition.r017.id-id.draft","target_line_end":515,"target_line_start":514,"target_local_id":"block-111","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[514,515],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"31280efdd3a6a39bafad9158fede98af99303964b0f066ead4193bc290084b4d","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-112","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8dfe64e679d9688e52dc61e05764f955fa345846b35d6400a37014c703d46943","target_edition_id":"edition.r017.id-id.draft","target_line_end":519,"target_line_start":517,"target_local_id":"block-112","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[517,519],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"69c57a1c573a4575dcb96231069f5981aefc87393329dcca8adc33792e1212e9","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-113","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d3b62925a3c24a61023f3a731ee4d253dbbe07630261f9be5aca7505305e81c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":523,"target_line_start":521,"target_local_id":"block-113","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[521,523],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"042795aac8f79d81350d234881b7aa3b897c83856b6bd6df70e4aa7269a435e0","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-114","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ce88664535337b8ccc78c2820fa05103d4738d5a800b17af88b68551bb08b452","target_edition_id":"edition.r017.id-id.draft","target_line_end":528,"target_line_start":525,"target_local_id":"block-114","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[525,528],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6983675dd775179cfd0c1bcbebf27cca1d9c8682d2dc288ba56352cce2ab7e1","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-115","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f5d99ae55dfa2e50ad3520821d8bc4385f0a7eb2fe7ec8fae33873b5938b18ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":531,"target_line_start":530,"target_local_id":"block-115","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[530,531],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d0e3d79e03d88646e84d30e73ec8231bbd2c90f436c88b6ba4950267a331274a","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-116","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1cc991a0bd5d7d203b79f3b64803d36c656dad1e21143206eae130733176fd9b","target_edition_id":"edition.r017.id-id.draft","target_line_end":534,"target_line_start":533,"target_local_id":"block-116","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[533,534],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8146600df1f4306dd7250af7e56fb89980647c5cae1f7d90906d4fed6c74e8ea","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-117","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6c42fec78c64e6b050808e60cb756e49efd7f22f1ce6a8aac2bbdfd178b7afc4","target_edition_id":"edition.r017.id-id.draft","target_line_end":537,"target_line_start":536,"target_local_id":"block-117","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[536,537],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bbf3c557da90e53db50f9035264a86836e0f57d39169816aa4d99a1b32aca445","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-118","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"46e542c9c9aafe5d2e48e02393dd446897e1bdab1d6ad47a08ad12da594ab14f","target_edition_id":"edition.r017.id-id.draft","target_line_end":543,"target_line_start":539,"target_local_id":"block-118","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[539,543],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e1b372f60dd280bc886f00b25ba47f08e20627d338ebe66f6b8bd1242b1fc626","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-119","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2d1a5b7df15f2538eb08b0e774ac0c8b38b52796ef8b52aed0cb41acd71e37f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":547,"target_line_start":545,"target_local_id":"block-119","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[545,547],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64859affff7d57bccc96139944e9dd3fa4857e812d615f986721f4613110b5af","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-120","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ae0259da0ec22cb1f4eabb7b1b79c364951fc88d33dbf3e983dedb0fb6c6e227","target_edition_id":"edition.r017.id-id.draft","target_line_end":552,"target_line_start":549,"target_local_id":"block-120","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[549,552],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ea4282e44bce7c4970a3d52bbb8a0342eb3eec9c59ccd65aa004756495acc918","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-121","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a66dc2ceee8ef6120b08ea05ce4dacbbd8a94cf6c0b72c0f2fe9f51bd3d3245a","target_edition_id":"edition.r017.id-id.draft","target_line_end":555,"target_line_start":554,"target_local_id":"block-121","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[554,555],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1acbac0a654beb0b0dd80c5c1dedc82bba56f8e09ac57a4be3c6d2a467d52753","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-122","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a2da70f8d2b0ea534a1c18d6d909c5eb04e2391394eede056cbea1f46c220d24","target_edition_id":"edition.r017.id-id.draft","target_line_end":558,"target_line_start":557,"target_local_id":"block-122","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[557,558],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df236652158da5e3e7d48e8d03ce6e7f01649e9439b8d45a21f700d587b88393","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-123","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4c53469088b6a68285fd5cfa541ebeb074c6993c968074a372c50cbdf9d8b9a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":562,"target_line_start":560,"target_local_id":"block-123","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[560,562],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"caa1f28d9460efee35c2c3439f68ffe9eaa5450c5387fe494c31e7a1971ee2c3","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-124","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ca8151820559bda67b63d4bd56667bc5c3d9d325dcb28ea2ffe32d6333d4235a","target_edition_id":"edition.r017.id-id.draft","target_line_end":566,"target_line_start":564,"target_local_id":"block-124","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[564,566],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2ac646cfcee51fe48d5ee430c0f6a66b4d7aba2662fed29c748e4e155965cb2","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-125","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"52812c641c109d9bd9d46eb7c173ba960ada78e9116aa5a013fab87adc0c8a60","target_edition_id":"edition.r017.id-id.draft","target_line_end":571,"target_line_start":568,"target_local_id":"block-125","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[568,571],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18f82d310bddd9914f3c8ebb4527314231a3d8fb69d8f8f263583e61df08cb17","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-126","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f5d99ae55dfa2e50ad3520821d8bc4385f0a7eb2fe7ec8fae33873b5938b18ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":574,"target_line_start":573,"target_local_id":"block-126","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[573,574],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2a8c71b65e0447e16ecee2f7a4f80784b9e3f58187d96d7c4c390dbdbe1e25aa","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.equations-lines.text.block-127","locale":"id-ID","parent_id":"unit.r017.book1.appendix.equations-lines.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e17ce772d1e8e118e9a0662890b873de35a790c4b20f5014346d82ccaad95c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":578,"target_line_start":576,"target_local_id":"block-127","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.equations-lines.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[576,578],"member":"source/Intro-Math-Programming/baseText/book/appendices/equations-and-lines/equations-and-lines-new.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"daf2362b5cfeff349c076da54de58d8b39b6acb8a60678156688ab3a701e87b4","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5c7390715d679157410fefddb98a184726f18a9bf2005c9f499b15178cf9c8c9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"391cb7f20d54c7b1fd2581344e7f002d9ec65bb22f940de13aa246e3978f650a","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"586121901b08ed1d37757d0876ced56c789b14fc74d4aa4c1eb6bb33a850acdf","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,5],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f02fc7db50a1271c461e923693c63031603a6f54f69d19f120d38be5049cf9cc","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"230c000cbdf6a4a6d4118f2207f1ecf2fb41e71d680b74c4e8e89cecad79488b","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":7,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[7,7],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0aacfb0611d525d38df570d91b90199aeb31a309904bac72fa4a7d1ac7368bd3","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"11754e041d8d52dd8091343f5b623c705919a81627ef4d01ad62ece5d6f08464","target_edition_id":"edition.r017.id-id.draft","target_line_end":10,"target_line_start":9,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[9,10],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0eba0fbd4d92d41a6e7fc7121d90d85bf066cb9388096c86f551be253d72d036","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a188120a661fc45a033c69fc255e1e108dce236bbfc8def04de4a7786cb3b0bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":12,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[12,12],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f3fc0d7ecb1fcd406c1d1d06a0bc9c19a16d8bd095ea348f2537e9fdf6216f91","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7dd7be9356a9cc45cae9079e7baadb93a7674ebfe1155a56214253710be496b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":14,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[14,15],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2b3b8bf44967999abf0b9f0d397fa0899b8e10051d02965bd89c6041e21dfacb","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7f68e63f417c8f1268b4543885f5002ddb49a308d4c8136f4ec55c63c30adeed","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":17,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[17,17],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"902a48d54d091212c9b37c1480602c8acf81d765038e4a479b50709f23a75adf","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"52662a18308f34c7140a1bdb11f4c54895f9d6c0e77e25e293a19a25c573aca6","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":19,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[19,20],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d84ede67947b0e0d9c13109907d7d5950230746a2ddbdc91db256e8164d9e6f3","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"300cd98fa0ec49ba465d57d2adbb3e9454858064087737028928b3672141be2c","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":22,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[22,53],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab5121f4f360b903582a02ba571dbfa9caa0e12d6f1cbad91305f6e6fd6c84ce","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c22faebb6bf2efeb7bc803f4632e88c9238ba2567302ae13aff71f1beb052492","target_edition_id":"edition.r017.id-id.draft","target_line_end":59,"target_line_start":55,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[55,59],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"090271cf4e93faf6d9b3b9b615c5337832bcfd515a0ee6fecd4c419d864e80ec","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bb2a13271fc1da77ddf196d7d8ee810bd9a7866997b8f7b4eedc66bca289350","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":61,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[61,62],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7d1e70085b614373b190ddcc0412ee1baf47f5a3566e1fd783c2f46b890432e0","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0eefede8fad0ec0fd2457423fe927fa097b47362dd724d034d6351a0241668b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":76,"target_line_start":64,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[64,76],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37efb31b2589ef43d8bdaf60c412f45587d06468dd0723af3a7eae734e40cf70","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d5674819feb2b970045f8e7afbdf7aa4f48d54b8a64ea85f53c11f53bead1d1c","target_edition_id":"edition.r017.id-id.draft","target_line_end":82,"target_line_start":78,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[78,82],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"03bd1426bdde3feb1ecb8499c0b5e21b9c7096d665c5c62e782132db12172abb","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e0cb7b6cdc5a1ab7492bd1b447a40ab1d37d09c96cd9ae9e5ea7a662705aca1a","target_edition_id":"edition.r017.id-id.draft","target_line_end":86,"target_line_start":84,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[84,86],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"418f8682a5f1b529a5e743e64d5ebd7439fa4a0d69fd98c00728fb5344a42c69","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fa26fea95cd2f825e05930f64271a10cc16b1a7ee3133d542f0bc60929c5ba07","target_edition_id":"edition.r017.id-id.draft","target_line_end":93,"target_line_start":88,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[88,93],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa887ef2fe21dfbce0cfe2a84dd46a19b363b9f4b3ca8530da933c183fc17770","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4fd54b63f8adea97204b2f89129330a083c0c6545884b9490ab4058799854843","target_edition_id":"edition.r017.id-id.draft","target_line_end":98,"target_line_start":95,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[95,98],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a08152c5fe5c727776b7c5079f602a4d311f2a9edffaa20d79d0541cac244938","concept_ids":["concept.linear-system","concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.algebraic.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1df18afd94f27399ed054ff5912b4347a7323118f5993b99ef49ff298fbcd736","target_edition_id":"edition.r017.id-id.draft","target_line_end":102,"target_line_start":100,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.algebraic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[100,102],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProcedures.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9b16ed72e4c7ae37b5313c87073ed9da06c9d5ab8278eb20ce2a1eafc4c57c88","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.controller.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.controller","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd03e14856d826d6c128dedbce1ea3d1f872c86c785b5e10b77519ba2d0c40ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":6,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.controller","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,6],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ada6f6450e9760646823fbcc13bafe706cae107a84682c6ea063b6bd5b68a888","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.controller.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.controller","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c94758be311da7a3fb8836340272bb340eb818ca08643d02e6ab07f06dbd6519","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":8,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.controller","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[8,9],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb1edbdccc0a1ebdc14f31bab713364c9ea45c7f27040af3b91dbd21b03b7e13","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"144b288ff6c42157b2126c34086040b120cdbbf675a53d337ccf578351d0832b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"faf3ffe6b46c14f40afca1e3f501191b1fee591fbf03bbb8419281f15c8dcd70","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2488e420021af2a4478bfd5129f41078a178addececfffc42c68b8b772c79211","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,8],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f00971475f57eecb634395f2dcd90f5cdace3eb15a7317a541517d80ff7112c7","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5a1e8fafac8f9df8d3020615b3c17786f257aba3e639c1f9b938d379badf2522","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":10,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[10,27],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bf974aaa1181cc584dee084d31044b8452a83761d9ff64a5e6425a23e45a7ca0","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"994b9fede639f2ba6e7fe3b52c3f1240d13a090761017946f63b59b1f2ae1ff5","target_edition_id":"edition.r017.id-id.draft","target_line_end":50,"target_line_start":29,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[29,50],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"28e98f4af7063356d036679090933f4276529aefbddfb1cf72e03bc6b76b6aa3","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9aabfbe4b6ec927a2bf9390bbd3a30eb6bc6b3c34498ce641efdd5e06f0c7f3b","target_edition_id":"edition.r017.id-id.draft","target_line_end":59,"target_line_start":52,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[52,59],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef8a1bed0f8de3fd307bdc321d100b304fdbdeb8ef2a90b4a62ca6492887b507","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6759032df0f0fe741d64c98c1ef4345f0de04684233e75b2d37af6a3454923f","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":61,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[61,71],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae016811962601128f572addf93bec8a9e244652e6577e56f9f680e71fa0863c","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a402b2d11bcbd1635054c2b286d30456aa7ceae439e0863627e943669c0fee14","target_edition_id":"edition.r017.id-id.draft","target_line_end":73,"target_line_start":73,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[73,73],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c949e431e7b423cd085aedc82d5fa5edbcb9f6631494ab45c16c9036685786a","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3beb36da0dc8b8c2998c6a2ab6bf3a06476fb3e46eeb07265a9f31bd77296e6b","target_edition_id":"edition.r017.id-id.draft","target_line_end":95,"target_line_start":75,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[75,95],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d1430438eee6b3158201daed4276e58138730b5ff0930755d12171963a9118a3","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0408c5d7b69c2394a3f348de89110591514fb08ab6f0917aa8fa0b5ee8a35490","target_edition_id":"edition.r017.id-id.draft","target_line_end":101,"target_line_start":97,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[97,101],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"190de561b2ec697e0d2162386e33990b7f5476c62a344aa31e9267a6457ad4b6","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"de0ad912099077c9d1cb77963b0c213492bf8f6e25105f6716783d7af6d278ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":104,"target_line_start":103,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[103,104],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6261ebf86d808ffd1fba2bac811b66f5712ab228b59a36168f9b04525bbeabad","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e1489eeb74c8672ce781c98bec35e6847fe31d4138c28dcdb65b5e85dfe8cae2","target_edition_id":"edition.r017.id-id.draft","target_line_end":107,"target_line_start":106,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[106,107],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d276ff5010d6c64734737de30fa3f139b996b0e124c3bc0b069b502e7b69061b","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0e8104ba7148397e763bac694a1e70ba113760e37d383258f80245cbce65ad53","target_edition_id":"edition.r017.id-id.draft","target_line_end":109,"target_line_start":109,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[109,109],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd462851b0a1cb690435bbac00a21a4d5de1c3ee05cdb4ab0da0745eec65ad77","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a40bc993743976841c3637cae8e5d6a3f6f52f1be50c749ded516d5a577a43f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":113,"target_line_start":111,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[111,113],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"59a24f701920250a69166ee782c552f835f2edc79b51d7a5762fa48350643788","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"55ce55b846a0dd1cd57c7062455144b69b5570a2eb4e0ea75476b18b1c976a38","target_edition_id":"edition.r017.id-id.draft","target_line_end":159,"target_line_start":115,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[115,159],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e55576ccdf48da49b76a249684cd67d81a9e08c5a8b55ad2e2c1b1b9819e30af","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4ed7d1e337c6ed472d486fb86cb52692cf46c3620ce4e57d5c743b1b30ae052d","target_edition_id":"edition.r017.id-id.draft","target_line_end":163,"target_line_start":161,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[161,163],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f307e58fbf6203e9d1017382206f4e5261ae1845b522a4e349922af4ad4bcee","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4aca555858d77e5d0dea8319478b4d76fa045a880ab5f7dff6bc3465c836e6f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":169,"target_line_start":165,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[165,169],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e19cde1ad25de00d609fa101d620af5311389fe5a0c6d287ae798cc144847835","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9ca544922112db2dc8d4f7f93b8f237a8fd852d87d9a59856774905e803d9539","target_edition_id":"edition.r017.id-id.draft","target_line_end":173,"target_line_start":171,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[171,173],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"047d78d1655277cc898d9adb0122e05bff167afd0b8bc399f09cbfdd2de0b9eb","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ce2117d40b7dd00ceeea68596a6036fdeea6cfa411c8effe0601d8082aa8a5b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":176,"target_line_start":175,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[175,176],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"626dfeb92bd34c3d0db60d1193e9478042de4d3be6fa7e097844e23e512c3a64","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"edfa34a380ccd9294ce0061e38a5c389c8fde0355bd6ef3be68a1ced049e9728","target_edition_id":"edition.r017.id-id.draft","target_line_end":178,"target_line_start":178,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[178,178],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d51fe2b5b899e903a30c2b344c099d61c0f1ab6b75a851cd12e4c430cfb2f10","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"da5172f9f67f3390b79b4b42982cb07a44881d14104a55b74d89d25d1f212689","target_edition_id":"edition.r017.id-id.draft","target_line_end":180,"target_line_start":180,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[180,180],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6da99a964c4813135f04b0cce4c7c6da71df644841a97fb758a5ad245a68b7a0","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1aafc8bbc7b2d8636cd2dde228d96927047bca2116a6c509d705aa2ba78b7fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":183,"target_line_start":182,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[182,183],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3048053cde6fac9685ce1e7e770352946525b623ad78ab340f5f8515348f891b","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e36e534663eaeea4a785abcb1dbdf0fea783ba97d6ec481dea71ffcfd472baca","target_edition_id":"edition.r017.id-id.draft","target_line_end":186,"target_line_start":185,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[185,186],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d04b0882466380787730a3e3310fd6831034d6ecbe033541f709078ee08a686f","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bf71c18eed4b20b87558901d430dc407e865c5b39a189e5bf727b6a793e6ae48","target_edition_id":"edition.r017.id-id.draft","target_line_end":189,"target_line_start":188,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[188,189],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"08dfa325f119e0e2b8811d8378d31e89e0a30bd79f3464a4fb551f6031174031","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d649d00a2e5b546ea4c67b66ad76ab6e1c1022068e4e3fc62c2bc9fe876226ae","target_edition_id":"edition.r017.id-id.draft","target_line_end":192,"target_line_start":191,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[191,192],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10d6d2aa4276492c7e36294ce7ddbf6ffc5d557d921a6429a82b5b0a365bf458","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d39211665e1a520368eaf69a2352897d9f969480a80a3b6f6cc5f651e02c9bc9","target_edition_id":"edition.r017.id-id.draft","target_line_end":196,"target_line_start":194,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[194,196],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd01587850f1ab51db26c2575f2174132e45b9867110c322bd53978f428c7c80","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ce2117d40b7dd00ceeea68596a6036fdeea6cfa411c8effe0601d8082aa8a5b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":199,"target_line_start":198,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[198,199],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da73b0ac830bef029142b7069024088617aa479d34ca24c2c64278a4bee34e9f","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f85338414d65bcedb6d290197c3ff78e5b370c9c7374e93338069ac7c7432ab4","target_edition_id":"edition.r017.id-id.draft","target_line_end":202,"target_line_start":201,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[201,202],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20461aa19faacc8be996a51ebf5cff88f2cb5cf1423aabbd0424297f73a8f421","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-028","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9d1a441d8a23b5dbd351af675c2abdd835dbdbd9da6447d81ab8e2d9c692a58f","target_edition_id":"edition.r017.id-id.draft","target_line_end":204,"target_line_start":204,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[204,204],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"349b6efd0ad4f83f5a91bb2d211ac387d1fab5e327922e5479843f4b47068e69","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-029","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8d51aff3d5562f833994ec531c90d9802baed5e5bb8da3512040bd0fe4ad6ab6","target_edition_id":"edition.r017.id-id.draft","target_line_end":206,"target_line_start":206,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[206,206],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c95594e31d00b9f85e12df716fc335c69fd388841cce231bb48dcc0e543fc090","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-030","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e36e534663eaeea4a785abcb1dbdf0fea783ba97d6ec481dea71ffcfd472baca","target_edition_id":"edition.r017.id-id.draft","target_line_end":209,"target_line_start":208,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[208,209],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d7572c96e9bd366fd6ad5a0ee897ae86d347ca79217f63c9c11db51de4452bdc","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-031","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"54704fb0af20663080721ed6370dade6a0776ba338b93cf4b4af537ef623302a","target_edition_id":"edition.r017.id-id.draft","target_line_end":212,"target_line_start":211,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[211,212],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a3aa9f632267d74c2543d3e324f74339547137b414322c8b170982befce99fa5","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-032","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9ac16e2f19aa42390b84b7327f7528c8859f91a96897623a0a142a87dd211b08","target_edition_id":"edition.r017.id-id.draft","target_line_end":215,"target_line_start":214,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[214,215],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"730f6fadca292acdaca7c71186364b041cb1095db60b3728f1503cf709cdbff8","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-033","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f2ed898960aa7a29c071656926ff3e6faf2f1aaafcf2f00bd3029776bb1bc098","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":217,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[217,219],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b97f957b5d88ee59c2308af13373864cf4f5fa8b869d395c20dfadbdc5742840","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-034","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"870fe024e37a5b9ceb9c577d94a78fcff876030c9288d48dc4da22cf1eef90a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":222,"target_line_start":221,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,222],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e837ae28313db09d34737625663740b7a6ae6395c6fa83d8a04182fd4959e90a","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-035","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9c12ab6028c6266b5e45c5ba4a5cf7b254a4e795d24398d0bb6bfd0f0162d86d","target_edition_id":"edition.r017.id-id.draft","target_line_end":225,"target_line_start":224,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[224,225],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4f1eaf3fb7fe9281837ed6b7208cef8aa26182d16b78c35cf352459cdd06d02c","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-036","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d7150447aecbd52ce5774b62d6bdd1106d863642a2d2bc8e37c85777923345b2","target_edition_id":"edition.r017.id-id.draft","target_line_end":251,"target_line_start":227,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[227,251],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7d683ecb6cc2f3815b820daaef2c540cd60dd22248547ca574dc07f9c8a89c12","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-037","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"af3f4bee408b95d6be4cb208298e68eb1d9520a6e6cb536788d1682b91302522","target_edition_id":"edition.r017.id-id.draft","target_line_end":253,"target_line_start":253,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[253,253],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0c98e40482a9487c66bad00251d3643608c4c6692289d8eb3367ad43abf819ea","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-038","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6413945c47837e2c01880f4618e53c45fd3a799b4eed46bc2ff32362321aea54","target_edition_id":"edition.r017.id-id.draft","target_line_end":255,"target_line_start":255,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[255,255],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9b38a3e756cf3b4dcc3c708cb1fcd8499536cfccc40c4b4a829649cbcb0d05a","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-039","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a1cf879391a6ac39614c34965ee1977f4f00524dbb71da25595018e325b06320","target_edition_id":"edition.r017.id-id.draft","target_line_end":283,"target_line_start":257,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[257,283],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5fbe0b176710876754e9f1f64211c50c7c673610a8791442326725c22361b0d0","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-040","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e3cfc8df6e30ff09b53d88ceec7ea68f096298274bfb43889608b4ea863164e9","target_edition_id":"edition.r017.id-id.draft","target_line_end":286,"target_line_start":285,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[285,286],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2ffa46203009bb5bc78d0017fb8307bc8927a541cc39b04bba4c9aa323ca60b2","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-041","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1260c4ccf1e45ae6092de28c792cdec55709ca272f1e487db622c91ba66bbe46","target_edition_id":"edition.r017.id-id.draft","target_line_end":314,"target_line_start":288,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[288,314],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90fb73de58fb3844a18eb73133ec36bd5fb761d31e4e1e5e96728e868949fa0e","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-042","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b778c19605a3ef999058400ea1b6fdd3175a0bb55dd095fb66934ad55915a0f5","target_edition_id":"edition.r017.id-id.draft","target_line_end":316,"target_line_start":316,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[316,316],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39e7bd3154fd56025ca5e68de6ef5869f871bdd41682fd5a50196886b0c8c9eb","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-043","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5d17b1d51ec95adf537cabad3a7f66e78802f10a0b6a7e7e2925d5ee248a5e51","target_edition_id":"edition.r017.id-id.draft","target_line_end":323,"target_line_start":318,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[318,323],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"666eebe3204fb4a1c7d7bd02b19891e9d15be653c3120516b6dc051c3f1e6f31","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-044","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2ab165ab37760e296e41cd4b42d598738a317745d61bc6ca46f4ec226a4603a9","target_edition_id":"edition.r017.id-id.draft","target_line_end":325,"target_line_start":325,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[325,325],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7cac89f8839195a8b368e3beb2c36af86d0cd6f8388f537f9735eea4d8888a0f","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-045","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"652aa59019c08d56302a7c1309b83267d535c85762c15c45d683dbdd134943ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":340,"target_line_start":327,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[327,340],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce3302963c49ae06013f7eb540eea100f0b90c619834743dccef3408773f288a","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-046","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7327fbe55c59c7941676575a4b4a9eb2f7493a5df9dbe644cb11499c65ac0cc8","target_edition_id":"edition.r017.id-id.draft","target_line_end":353,"target_line_start":342,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[342,353],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7eab9730122d43969396fdac0568389a375317d123ced787683bbd7928d8a340","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-047","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5b0d13242d168a5bee325b36fe47d12a8a2eec6baae0611d33d05c5e82739332","target_edition_id":"edition.r017.id-id.draft","target_line_end":365,"target_line_start":355,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[355,365],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"936287e8e09a6038d338469b560378932d3292f6ceeb95e7d19c0eb83a433ccd","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-048","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9b44194ffeb4084892f972d644ba0caa9168a0d56e364b9e1b8721bfb412c84e","target_edition_id":"edition.r017.id-id.draft","target_line_end":367,"target_line_start":367,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[367,367],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd48e7ea49d74fae8f5311b4aa251bd01cfaf5904a6c24e012b6ed9ef36ec8c1","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-049","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ee44049b2d59d959fb82191d5802364822856c6d5281d28994f510907f3b7f67","target_edition_id":"edition.r017.id-id.draft","target_line_end":383,"target_line_start":369,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[369,383],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e17eff68b30510ca2f076af7cdf4a02a2c6a100ab6872818def4dc71166f308c","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-050","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7b6f7c9e78922c8b2f1367efaf634c14fbc66172b4e47fbfd017f26607103469","target_edition_id":"edition.r017.id-id.draft","target_line_end":386,"target_line_start":385,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[385,386],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b93c1037240bfb75912fac3a3839a2ba624ab564fceb4088b60c1572264c030a","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-051","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d0fcf6e16279a52367e6894bed81a3093774d77f209858b99032713094b19d63","target_edition_id":"edition.r017.id-id.draft","target_line_end":390,"target_line_start":388,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[388,390],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dfd7ce81a14b0a6499a445d4c47f8208c2804fd5eeb8c469e3a53ff99f497ef4","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-052","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d8e63a5049396ef9b1f8073bec97fd695d5b4fad2c227967fa25ae7066b9f9eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":394,"target_line_start":392,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[392,394],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d7929e37f9347f9ec253e1439d6e1a2f4a222609803f62790793c73816a3fd0d","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-053","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e1206e0121c3541e6d321ccc927425d9278e5afc227d1a1f29b985cb2ef38bbf","target_edition_id":"edition.r017.id-id.draft","target_line_end":400,"target_line_start":396,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[396,400],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ee4e42ba20932f32c4066da4482b0c180406c975277aabcf7ee8935516b9192","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-054","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"13b857f99ee48e5ff9945730fe7c807119358b6b30e9c47a6ee2656e46894f04","target_edition_id":"edition.r017.id-id.draft","target_line_end":403,"target_line_start":402,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[402,403],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"668f8d7238326cde25afdb895dc860616757ceb37a10315234a57976a368d2cb","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-055","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3932273a0ef8f613b32cd5a9f13e8af0df2c97a463f424d43c43193cdb7435be","target_edition_id":"edition.r017.id-id.draft","target_line_end":408,"target_line_start":405,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[405,408],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"33a3d74ae19d319dfc0acd2892f4ea4f6043eca49436e9daba4a30ca9e25521f","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-056","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"03623d7db69327dbf09eaad777bb6aabf7e9fa2fec3edf0e8631aba823f4dcc7","target_edition_id":"edition.r017.id-id.draft","target_line_end":410,"target_line_start":410,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[410,410],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b1403325f627ee5602548ccb868f9a15cb80c1ed8af71efb6f38da148c996fc","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-057","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"05e2b3151fc1f31d33d521ed13bba1f8ec3bad852fbaac637c5ffb3e1098d8f2","target_edition_id":"edition.r017.id-id.draft","target_line_end":413,"target_line_start":412,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[412,413],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"caaf3904241d7dcca31ef50b69ef1e140d1ce716625e8e7416ecf081cbecda7e","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-058","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"356a8e3245bfb68abe0f17f9609dfbc4083ffdc16c2cb5ddcc57a10540d94f25","target_edition_id":"edition.r017.id-id.draft","target_line_end":416,"target_line_start":415,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[415,416],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b8cbf77501326a2e877b74671dcfbe07b37a813047a8bc6c40f0a179cebea79b","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-059","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f85f5da27de863c53858c710bdfb975774bceaf26f0dd4fbdf97ad3735e8f822","target_edition_id":"edition.r017.id-id.draft","target_line_end":420,"target_line_start":418,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[418,420],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b3ce4ecc97447b8980eb4c9ebf5f4cac3d1e59442c2dccb06bfefbba758d1c6","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-060","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"81bf8a79e521b5be529d6375f1d612b67ddfb9ec0dc7cf4b1234f022cb04f664","target_edition_id":"edition.r017.id-id.draft","target_line_end":432,"target_line_start":422,"target_local_id":"block-060","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[422,432],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"610d1dfb620c8f5759900e990ae96119ed444dde05a14dffe63b9f869e1951b4","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-061","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"325154bcdbaffaf31edd1cf6019b0c2b27b2608c5e10c80f917fdd61a1eff016","target_edition_id":"edition.r017.id-id.draft","target_line_end":435,"target_line_start":434,"target_local_id":"block-061","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[434,435],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b9930acd807a70e8c67f5613441bd194b9fe5e50881060f5253f9173cd6fffd","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-062","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dcc140710ecad4cb89f60d28f2f6223e75cc10bf7940075fad57860218071efc","target_edition_id":"edition.r017.id-id.draft","target_line_end":437,"target_line_start":437,"target_local_id":"block-062","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[437,437],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c6ed5a27000ac8d11c35c944552abb19d71165611dde84234b10c6a5405e953","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-063","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4f884031137cd643f289873213556255c12fb28de5f58f3251023213cab9fbee","target_edition_id":"edition.r017.id-id.draft","target_line_end":452,"target_line_start":439,"target_local_id":"block-063","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[439,452],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9ec350fe84e26f7a6c9ac260836f83f1d1f9d95e10c682be1d5a2914d3029d6","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-064","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fa9b5f1a3ebb7ee1d116798efc7cb517b8da3fa09d2a75152b9f9518cbfb985c","target_edition_id":"edition.r017.id-id.draft","target_line_end":455,"target_line_start":454,"target_local_id":"block-064","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[454,455],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"818c9f3831c5e50cf6de318ba10024662e2bc2a214106d81de256e4c30934a00","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-065","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1983c9f4b487efbe97da6ae00a2e66e48288e8c13dc3dbf9fb9000525352e650","target_edition_id":"edition.r017.id-id.draft","target_line_end":468,"target_line_start":457,"target_local_id":"block-065","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[457,468],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6402e43d6c3a96beb70b4e8a8c585fb484ec364cdb5226fd6579a6138eb546ae","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-066","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0ce2feea88dd7958f791c157454166f99421f2d865935fe1682409fa9c5be949","target_edition_id":"edition.r017.id-id.draft","target_line_end":481,"target_line_start":470,"target_local_id":"block-066","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[470,481],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"234db16579812269db0af7cc74b7fcd9279cfd5d71001347d2e03fe59ffdd636","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-067","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"babc0fdbcea9613fff7d62872ea35884a76bc3f6e9d142dc1fe45f4084aa644d","target_edition_id":"edition.r017.id-id.draft","target_line_end":483,"target_line_start":483,"target_local_id":"block-067","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[483,483],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4a0f885102251e8c447ee51bd2ba5cf574a5fe8f2945b946de6006e695a9b08","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-068","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0c7774939433d7984589ca145bb68ea3f2dc94ca8268f488d2a4f9e8f5060130","target_edition_id":"edition.r017.id-id.draft","target_line_end":514,"target_line_start":485,"target_local_id":"block-068","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[485,514],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"748037bfa996e7838436c411731f707d4b9369e81f1a7a5ea26f749b5ebf90d8","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-069","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"edda732f18e60f279fb40fe3d9ba4523d0a01bc661f9e0d96619781db288940f","target_edition_id":"edition.r017.id-id.draft","target_line_end":527,"target_line_start":516,"target_local_id":"block-069","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[516,527],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"875ee2650b7eafa6ae5d73c890da81b99695b200c702dd8241c41a2ca54da1d3","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-070","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4c88f61f4c4d5bfcb620f7d7eaedd86ca8a698188ec8f76dba037e10332bc3a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":543,"target_line_start":529,"target_local_id":"block-070","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[529,543],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"458c954f32cd450bee7cdc05109fd287e8256c0137152a1b39e1bc4739a8d6f6","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-071","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"56ccca8b2666d557f4f77e3af002f610552baa1a6c196573a062164d5063d2bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":575,"target_line_start":545,"target_local_id":"block-071","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[545,575],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f2cc91d3d2395cf20654c056b03b5b736d9282cf0fa67a1cefab9d7b0a618dee","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-072","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f4d79d06b28bd5098347fd3269f04d2d18d6db6de8773d72c7e78124d870255e","target_edition_id":"edition.r017.id-id.draft","target_line_end":589,"target_line_start":577,"target_local_id":"block-072","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[577,589],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f8cb17e403d45cb7d4f13c8e887fe64790bbcfb7a3a6d927419ce574dde3ee5","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-073","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"540728732004a527778637308b6826a834787d400ad2553a3e31a56d241caaa4","target_edition_id":"edition.r017.id-id.draft","target_line_end":604,"target_line_start":591,"target_local_id":"block-073","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[591,604],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7c4aa98d3d0858eb565f5a57ac38c3c12f8b14516b80f8813afc296e1743707","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-074","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"79bd7e1dcf219fde8f0157731d7fcb93a5f30f2cc4ebcd05325523ee8686b5e7","target_edition_id":"edition.r017.id-id.draft","target_line_end":610,"target_line_start":606,"target_local_id":"block-074","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[606,610],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82121060a16eefaf86fadbd4f4d952dc098ebf17ce83c7fdc2dddadd515d7667","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-075","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1a09b5b1cbe061a48535900406f8b1a21e2e19b5c770010efbf6d67c4ba8e2c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":612,"target_line_start":612,"target_local_id":"block-075","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[612,612],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94a61d372961634cd943aa5440350fd0eacf734c989e32cf1c34b8cf1803d5a1","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-076","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ca2cd6e7bf2dc0a6c339df45ed90f79747337be9a61dfc10f8a2c74d3c0d896a","target_edition_id":"edition.r017.id-id.draft","target_line_end":623,"target_line_start":614,"target_local_id":"block-076","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[614,623],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f605821a9049e06b13cd6000cfe6d005b273fd8f4ffb7ce5a4f1f022ed80e89b","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-077","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b38960568caf3d6e726d7422127dd74eed8edeb9bb1e98b690f465eb2c9040e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":634,"target_line_start":625,"target_local_id":"block-077","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[625,634],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aff0f9104c50bcea91feab0135dd2d9cb7e32557f9fa0c20e063594649a5a78d","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-078","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd947b54da31a6babe50244cdfc759733578e963f2eaa1465d4be54e686a2e0c","target_edition_id":"edition.r017.id-id.draft","target_line_end":663,"target_line_start":636,"target_local_id":"block-078","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[636,663],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e88ffc8b30e4e261c3a4e3f35a6d847ba2d454b003bc695fa6808b319fdf52ce","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-079","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d4af61683eba8f29fcf43ccdca5ef6879824c82b0ec16ee9f6ff4ed728d93533","target_edition_id":"edition.r017.id-id.draft","target_line_end":675,"target_line_start":665,"target_local_id":"block-079","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[665,675],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"735ef39fc74a5a61139cc6cd8bc1c1245a7ea00659038f676305f39632b84beb","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-080","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d055aef2fa2c948b12ef0c37b3d6325578eac01ea155daa6e7f34902ccc854c2","target_edition_id":"edition.r017.id-id.draft","target_line_end":686,"target_line_start":677,"target_local_id":"block-080","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[677,686],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a3417d0e3d4850eaf9a1b2d496886a7efbe315267448a4e95468722d4d7517e3","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-081","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b982e4e7905f8f58a8f6019cdcdcc1cede4423ee6a27eb9584cbd9e0cb05bbc","target_edition_id":"edition.r017.id-id.draft","target_line_end":689,"target_line_start":688,"target_local_id":"block-081","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[688,689],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c441fcc7e857d1515db07f7f99aec297e255d3b7057a105aa42c72fc5b3f72dd","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-082","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f12da525cbfad5667628a99fe2f19b155e3403989a09b3f0f8c6d71f3e19a3ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":700,"target_line_start":691,"target_local_id":"block-082","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[691,700],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d20e5cce4fc7d3ddb78ca78923b638e0af915ea305c0a57040d8d98752e434d","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-083","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"03015efb629ac2f8f3ca20beb123c586ad86f5043fd7e9c7a861940931ba647b","target_edition_id":"edition.r017.id-id.draft","target_line_end":738,"target_line_start":702,"target_local_id":"block-083","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[702,738],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"87f2f43f43fd7f382887e2e794b04878b0446082a0c2afcfc4961470fac5827b","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-084","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"121df0a4c443549dc997a14b73321079c886441f79125756c271f44466c97f72","target_edition_id":"edition.r017.id-id.draft","target_line_end":750,"target_line_start":740,"target_local_id":"block-084","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[740,750],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8cba2eb851e0b097677d6a29097103767df63f153d7047d17cbaa3f3eef3c243","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-085","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"041b0535936f658089e7d03a8885d632ff82708c46895ef88c815167ac26210b","target_edition_id":"edition.r017.id-id.draft","target_line_end":752,"target_line_start":752,"target_local_id":"block-085","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[752,752],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"374ce281749a1fa96ae985892f20f975b2b8761bb0264da4c7fda1eabe112a64","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-086","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1f24b54063360fbf4b6ad84484d963a818b1b288487ab36998fd7f60e07580cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":766,"target_line_start":754,"target_local_id":"block-086","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[754,766],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f685351fc97cd5afa9b1b9246a468a05cb29f12abd0645dc6a4e478b75eece49","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-087","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4f776b0b6e431d8305a0464c8a4722b45b26afbd54ebec07516fdadef542f59d","target_edition_id":"edition.r017.id-id.draft","target_line_end":783,"target_line_start":768,"target_local_id":"block-087","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[768,783],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d36775cc0d4ff93b4e2f698448bbcb213c0c669f88c61f973b7fdd44fc0543bb","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-088","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"480349aca626c109c3c893ee38fcc1fe3cf01c25822613b4658fc34b3e7785a9","target_edition_id":"edition.r017.id-id.draft","target_line_end":799,"target_line_start":785,"target_local_id":"block-088","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[785,799],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e533078e8dcbce7024d8940f1904f54270b66df28ac7c11388ecfd774633f61b","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-089","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a8f5dd143f73e9aef841a43c2a8cb9acae873b839b964b7c0d2da438af88f56","target_edition_id":"edition.r017.id-id.draft","target_line_end":821,"target_line_start":801,"target_local_id":"block-089","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[801,821],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"487a0231cedc16c1fa35e116136f72a31ccf16976191a246b6786ae4ac9fee4b","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-090","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"afffe3a81dc886fd15b4a93ac572e5b0b7d02624224364af5728dd2991698c86","target_edition_id":"edition.r017.id-id.draft","target_line_end":824,"target_line_start":823,"target_local_id":"block-090","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[823,824],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ffb88d01dde7a83199c96b03252886b101711dac5b106c4cbc1a5c2cfac75ee","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-091","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"97aecaa0f2556c1d6989f6673f5be393923fcab9f775b67440fb6bd4836def8e","target_edition_id":"edition.r017.id-id.draft","target_line_end":835,"target_line_start":826,"target_local_id":"block-091","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[826,835],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d2e9308c2a870112fe34fdbcb4d5814c84edd0c9b15c49ec5f241baecd77045c","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-092","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"832a187af4fe23c29284aab24fc6987727770f15dcb31357cb779b49df527ed3","target_edition_id":"edition.r017.id-id.draft","target_line_end":848,"target_line_start":837,"target_local_id":"block-092","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[837,848],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9cecb16ea5cd551febaf302cc1b68d2511a7e418436346f299157b05a86aa088","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-093","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4bf073bb324a248677463d80579d61132d4c37f6210acdf2e1475b939eb68a9a","target_edition_id":"edition.r017.id-id.draft","target_line_end":860,"target_line_start":850,"target_local_id":"block-093","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[850,860],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ad69cae5716ddfd88634c36ef8b005c5558fb2bdc683143c50c98037438ae135","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-094","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ed6c9ed0bd0856ea0a12bf8df2271c1a4dc7e07d4ba3d8b8b71515884a9483fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":872,"target_line_start":862,"target_local_id":"block-094","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[862,872],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"96e2aff8105f68223dc4d0e42cb504ae5e1f525d85e9a3c55a612baad1a3b820","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-095","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"56f2fbbc7b8ef9b5e1fe5ca3abe61ba4f360d22434493cbc838504358fb88eb5","target_edition_id":"edition.r017.id-id.draft","target_line_end":884,"target_line_start":874,"target_local_id":"block-095","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[874,884],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16a6220fd5e24e1bfe8c684c36b8eb083e49b7e0e3c176e106b4515b70126849","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-096","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6ccaec6bd1995f21907598274820b555898e73a11ac1c3dda0d1f0ef43a3f8cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":918,"target_line_start":886,"target_local_id":"block-096","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[886,918],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a96ffa2412b4613707fd9da4885e0acf488a70243f84311fda38a264a1690187","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-097","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","target_edition_id":"edition.r017.id-id.draft","target_line_end":920,"target_line_start":920,"target_local_id":"block-097","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[920,920],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4556f1a37d62135308b400dc63ecf238bb29aebd4cb85bc5aa732b685e54fac9","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-098","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fde67845b50191d21209a50b92a2f239342159c34197dffd41687fa780d3721f","target_edition_id":"edition.r017.id-id.draft","target_line_end":925,"target_line_start":922,"target_local_id":"block-098","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[922,925],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"428e5c377fc392f49ad377c5db85bca0801c42475cedf65028b276e4e0e11252","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-099","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"756e6a8d5f938b2baea6165768efe4a904344d9586a671976e758e53dc1c79f7","target_edition_id":"edition.r017.id-id.draft","target_line_end":939,"target_line_start":927,"target_local_id":"block-099","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[927,939],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ae39bbca059e71db210371ff0337e32b15a38255d5588768d0a4bb77623a405","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-100","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cd45c2d1da103e5b6c2731420964a70877ee2bf8732960e04a1c7de1a41328f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":946,"target_line_start":941,"target_local_id":"block-100","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[941,946],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d9762786dbacf47af268662034bf1da8987cd6ff335d960fa6833a81d40bcc9","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-101","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b801de180a330a69515534f355eb05247d4f1c293fd11e570e6cf9df7a5c6bc9","target_edition_id":"edition.r017.id-id.draft","target_line_end":951,"target_line_start":948,"target_local_id":"block-101","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[948,951],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f8ecd8114ccfd810f5e6c17f3a96bca0bbb7ad711257fc74e46f74cad4b184d","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-102","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f6c4f275dd5d97eb72dc63db0c65f63f7084f4d223d8cbc9b921da017d2af7d9","target_edition_id":"edition.r017.id-id.draft","target_line_end":962,"target_line_start":953,"target_local_id":"block-102","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[953,962],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d6dcf28bb0c211608b39555289769e176e089ec7fa5e81db2a407b22a3dd1b62","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-103","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e7d38cb8e02b1b6138fa2d9a37528e582b71b0dec9e0d4b563189e4e090c8cf2","target_edition_id":"edition.r017.id-id.draft","target_line_end":964,"target_line_start":964,"target_local_id":"block-103","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[964,964],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b18fffc2e0210e1c9914fadd0eccd5a1a2805607bcd9104d63a396a640c8872","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-104","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0df577de0b96bff217b612a89e5602531c9ef1e865ca441cd6a2dc749128bed2","target_edition_id":"edition.r017.id-id.draft","target_line_end":978,"target_line_start":966,"target_local_id":"block-104","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[966,978],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d3f1a76b995843972b9b2f1df39e2382d24d5eb3185730292a2a0cec689d4610","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-105","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"369c24acb608d76a22a8ad978134e3fe0a8d095ebc3d00ec638a1ee40c16d484","target_edition_id":"edition.r017.id-id.draft","target_line_end":1001,"target_line_start":980,"target_local_id":"block-105","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[980,1001],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a7064a50341ebe90fc3a12b9b24807ec6b0110eafb632218141ac114023cad6","concept_ids":["concept.gaussian-elimination"],"id":"segment.r017.book1.appendix.linear-systems.gaussian.block-106","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"66cee2ed8c144550e6823664a555e23f72e607f0fc1b8e7e0da4cd22ecbe1349","target_edition_id":"edition.r017.id-id.draft","target_line_end":1004,"target_line_start":1003,"target_local_id":"block-106","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.gaussian","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1003,1004],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresGaussianElimination.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0200c9688f479073c04e9c5e66f97198fbe3a8c6372aa5ac6dcaef88fbbc0fcc","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a7ede915bcfa6df5ebf5a12b89c043c66faa9d472200e96b40c282224df3cd39","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82dc1050ffbc75c0bde83baeb70f3ffa1200b49734a3b02fb14a00573acb26cb","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fcf513f24dfaafa7693102a3abe82cc45e14949e195c9db754a7e39af8a1ead5","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,9],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"85099f9bf0f2491a33c93413e167f20ea5ccc691d9eef9102d2613b3217a3513","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"56cb6e911daa32c9569407136b8bd195ef84bf8f0475cae367c75c95140de4e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":11,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[11,24],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d929b5c76313fef5c41802401cd5c32b096d90085af2d1c7537e2b5309580c96","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5f6d934921460d3c11fe22b59d65e73877aa6a7a8d2b40a01580b477d0050b67","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":26,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[26,27],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"93609f7b81ad7d4ab78f1f4e02ab8676b7b0986e76ed5ccf73eb9792f947cae2","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"48fc638bf433316ab9a27db5b2d8f7e733d0a4089157fd68dbce78f25578061f","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":29,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[29,36],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e8a241d2e8376676c9fc003dd466e37f19d8294ddec0c09e3a711c2f4746a374","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"51d80775cd84111aa045efa85bb5d50ceeb3752144cc215bca3a60168dd6745d","target_edition_id":"edition.r017.id-id.draft","target_line_end":43,"target_line_start":38,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[38,43],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84ab7f57daabd393157d487ccafb8adbb15a8f7ef118437c6f4b7c40a010903f","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"adbbb227bf40d70119974d69338347a869d6cbb39aa7c101ee87696f76e043d5","target_edition_id":"edition.r017.id-id.draft","target_line_end":50,"target_line_start":45,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[45,50],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f5533b67ca8d115dc5aae2d7309aba217655adf7d888cea19b06dae4e96b359","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5bc00bc281820b3ecf15732d182755ff0d22ca3068c50d3af833212d562682e7","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":53,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[53,62],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d5aab60d2b53cbc64b8067020e3a72103d5b8e6fbc996b5f25b9f616d28e5d5f","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f360e5b3ff0b1cb8c4841adf9f01bc5ae5c4cff42ad78f8874e6ef3a9ecb9f3c","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":64,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[64,72],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9645102ade522d734500d49112c3d4cb30bc3ca7242f652b37184b4bb81fe5bc","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a3acd0ea7b16bc4cfb60dd877410391ffbc5ae6344bfbb988e9e12066299cb60","target_edition_id":"edition.r017.id-id.draft","target_line_end":78,"target_line_start":74,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[74,78],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"411ff0c81f8cd22b6f8043f5cbff5bc8b337b28d440662a55c285f77f9e4e018","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eb8fde8635ceca2f3ff05de16322e6ae25295eefe406f2aeb2c8fa827b8ca33d","target_edition_id":"edition.r017.id-id.draft","target_line_end":106,"target_line_start":80,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[80,106],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5ee28d89b2516a64795500dbe7a9501b3807c468f1181e4f4c77d3c3686d4a56","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"11ecd338ef9a0c69c82dd2f9dcff76aab737205214bed7f1654a9f18359675be","target_edition_id":"edition.r017.id-id.draft","target_line_end":109,"target_line_start":108,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[108,109],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"15553e01e311d61ceed2feef61f03166527ff29192c78b09992001582f6153f0","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ce6190def193bf8615ccd318213690f1b6564c86c452763fe474c959d0fd0166","target_edition_id":"edition.r017.id-id.draft","target_line_end":112,"target_line_start":111,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[111,112],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0063503cef3e4746bf1d0367fabe3079f06af15a6d054ca949d02dbdd6516b0","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"15e5f7850dab7486bc29c7321ec14aae1d637a7fca77d0e00c46238b662f4b53","target_edition_id":"edition.r017.id-id.draft","target_line_end":118,"target_line_start":114,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[114,118],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"223c69acce539ea7e39f465c38f8b4fa0fa7d8f53d290784838db43e57c630c7","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0adadc5cc735a3f9a22fac642bc015205303664824acdd8c94b96012c09b7af5","target_edition_id":"edition.r017.id-id.draft","target_line_end":128,"target_line_start":120,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[120,128],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f47f5004143129b09caf4f94e744dbdfd58c917481135deaecae3d95432c56b1","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"328d99623c3c91f2a4eeb29d3b42ba530b5259a53eeb5dd704a3c6d85e69c7c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":138,"target_line_start":130,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[130,138],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d5888005c2731b26395a8341308aa9df7e904180c58cf285e4ec1fa88a86374","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":140,"target_line_start":140,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[140,140],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d782d8d8e71e259815468a1197c0225d6678c21712cbc41ab0fb8097a4aff0c","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5a5045d6f045ce0abdf83af73da997fe3059df76e144b78e179d4d899b08dbc2","target_edition_id":"edition.r017.id-id.draft","target_line_end":147,"target_line_start":142,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[142,147],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9b15ebccbc9c992b5a1405e45b13e1c4f9bba436c78060d3f903692f351f80ae","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c2431b9dd8010af9efd0fe222487ba10eee70a6fb418fce48504cdb0f2212187","target_edition_id":"edition.r017.id-id.draft","target_line_end":149,"target_line_start":149,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[149,149],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6d4b76a8a6ac9c3e6e303339e527639672180980a21e9ad12373290c74d41b2e","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a588f315ec0a4124f933c7f6d5530a89106bf0a8bbdb69ec2d330e3c6d8be2ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":156,"target_line_start":151,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[151,156],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df38089a8c2e0058f7fc3ce94f06c8634186cfe80e6d3ae095269735b9d4ba32","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dc7a6fa7eb92799d934d73803eefdae6aec1c5747f31025500dd2f630e9ec58c","target_edition_id":"edition.r017.id-id.draft","target_line_end":168,"target_line_start":158,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[158,168],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e6457710d9fe1eb0f5178cdc16f3d8a3c10a5eee90e2722e571780c3f7cb39a5","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aaa93f4cdaf8e95a746d7289561a5e51c84ae94f0f8609d8222336eb55161593","target_edition_id":"edition.r017.id-id.draft","target_line_end":172,"target_line_start":171,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[171,172],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ebbc00da4686dc8ddb9bb2e6455a348f56dc8d2f657657990b1f7c1d315841f8","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4bed1d82a53da358c98af9dd489d14e78f801c1a678257c531f91e9ab0b8d2fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":175,"target_line_start":174,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[174,175],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"85066702bfb7c72d291a433c22ae5974492ad6ee0601627fc906fe0f58e159f4","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3b16ceb2917366a497d377e23815bb0080630b55ff05546a59e15e93c11a6077","target_edition_id":"edition.r017.id-id.draft","target_line_end":177,"target_line_start":177,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[177,177],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ea08393d6115cf2102146c2125a9579efb4bcc3063aa06927b00fa2d9504d77","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2b46483efd29c3b749da6dcf92b4f7e0cca6980070f1d76eee3b289f09bf2e68","target_edition_id":"edition.r017.id-id.draft","target_line_end":196,"target_line_start":179,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[179,196],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d23e9e2b783c96e17caa8b79e25ba88304c1c206fbd2568ba43daeb07a10453","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ca00c15d3344f12237b09b091b0790c2cec834892c546b72861311c1512f0d6a","target_edition_id":"edition.r017.id-id.draft","target_line_end":206,"target_line_start":199,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[199,206],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"732d6158b0b303b1dc579e7b64dc2936e8ab3ab6df0f75795dc7b6565f223e97","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4669c7c9092537f931942d24ed4a7110991d2151a91183d6a06a084216bb70ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":209,"target_line_start":208,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[208,209],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9c0a029acecb200405288dc37944308889434701c5c84898c76ed6acec8f5b4","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-028","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"99416ac4088c9cf5a4c07d7780147db54f84cf7370e9b5403bb6433363d3ffec","target_edition_id":"edition.r017.id-id.draft","target_line_end":240,"target_line_start":211,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[211,240],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e24b5f7da32d1ac1d34158257c5dc1bbcb9e97c04067c3b557941632f5ed15e3","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-029","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5e005c8bd1a9c021fc8ef1dd8d9fa9387a72d58e4fdb98453ab2162ba88c9416","target_edition_id":"edition.r017.id-id.draft","target_line_end":245,"target_line_start":243,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[243,245],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d4070bb2854b35cb9797abce620dc41696007a07f8cfd25709db2a9b89ee746b","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-030","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"43ceded05ed9e5602e07598efc72b21923636ecf77f4664809f05554d1e9e2ef","target_edition_id":"edition.r017.id-id.draft","target_line_end":264,"target_line_start":247,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[247,264],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0026c409d8bb41420d4b1454be7b9d34fa5aa097041fc59b1ee553c9715e775c","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-031","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"68649acc52149ceaab6a690dec772e361bb00c62736016b7076e46d5c7d40ef4","target_edition_id":"edition.r017.id-id.draft","target_line_end":268,"target_line_start":267,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[267,268],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39dfef905efa6b9a57c2919729f51817e9ded2e7650b4a95741bb9d491dfa528","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-032","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3bbe1b544c8cf849c87cab84b0580f6dcf845c3c1923ae49fed92569fbef1350","target_edition_id":"edition.r017.id-id.draft","target_line_end":272,"target_line_start":270,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[270,272],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e58cd75a1505000b4e00692ad9884d909e1c5cad85f1b0e354100f710a3ee81b","concept_ids":["concept.linear-system"],"id":"segment.r017.book1.appendix.linear-systems.geometry.block-033","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.geometry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ffe8dcb24e41ef36d83049b1780fa812df0c5c339a3ff8cb5179e890077bd37c","target_edition_id":"edition.r017.id-id.draft","target_line_end":279,"target_line_start":274,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.geometry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[274,279],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsGeometry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61d52587bfce3b79abbb3656dc8c1fabb48319024a4a9002ba67db19fb5fc7e5","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9382ba944dc2eced584d807c638b91d06c694baa412d2e79eb2056f1a98731e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5968fc9b75913a68f474a3abf142c29bf17239bfdef19a75025e2f8690fcc22","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"651a49b98c48594cd38a0be405aa6191195cd202aebee91ac8229848118b5242","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,5],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd115e650f3c484b4f7444dfdd36fe7edab70d4ca659f2727eab1a08cbb5c88d","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a402b2d11bcbd1635054c2b286d30456aa7ceae439e0863627e943669c0fee14","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":7,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[7,7],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"526df503fc8ec652876682388c7a30f05d477fecd3198cbb6127b38787756319","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"17bb42b5d8373c659919cf7185837bbe12b69ede3da687de7370aae5b28da51c","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":9,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[9,21],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c3a5a137bdee29b858996f512a385f554127f540650c92bc47ebef2f4c97906","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"17665e852ecdbddb11c1acc20ca6772460ab014651c9d7c8f912ca54b18456a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":23,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[23,27],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a243f1992b8b47b1c7117209919c2d09a0ac25d33f437663b1fcd53f17e281b5","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c24d4200c7eb91c58443d644eb1f8cb19eb3bebb6f9a0d4bcce723718e6eac12","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":29,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[29,33],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"846540f9029a7fe9e3b9def1899293a1abcfd75556e667e1d831ac05421641f9","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf29d4e328b7adcead4a45ff6f7f83f3203884eadb953f9bc8cebc4562685fca","target_edition_id":"edition.r017.id-id.draft","target_line_end":35,"target_line_start":35,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[35,35],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b05fc0b07f6434b9fe44c52e7d5887c27cf3a121120a5b1914b8b366739e9a3e","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4a40b8097fc041490fe6b84b1aaab7e8a1a898e83066e19360e4bcdb1c387bd2","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":37,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[37,45],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4506660970b5531fc7dd179fbcb6a534500fc0980ae49774970b27a633a3902a","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"541236e58b50698993f15ef10db5401d6f49e69a2d283cd2e62dfe349dbf61ae","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":47,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[47,49],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"feac7c19c7870b94834b4f3f77a4db99345ac7be18bb60163a5088dd0d0e8c48","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6f8942dd881d6360103b1bc00a8ebdd37520bbd7e58a8096b407061d0f483545","target_edition_id":"edition.r017.id-id.draft","target_line_end":89,"target_line_start":51,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[51,89],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c3c58bc41ed6e81d6fe7e0a876ab4087d26372808cc1445d22c63f32fb5829b","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3c5fae89c4486d3ffe9172ae912697a16750565aef2e0bcdae75fe015f731abb","target_edition_id":"edition.r017.id-id.draft","target_line_end":138,"target_line_start":91,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[91,138],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"05ada51f14ae628082d2ec3b3cce6d99abd8dd537c6c31c4be87666c1818cc26","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f3d5098622a56b352a9cdcd61b5b69f39219a15ff77911b8af06dfde78b257f","target_edition_id":"edition.r017.id-id.draft","target_line_end":149,"target_line_start":140,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[140,149],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f0b72cd692f04c4836d2e1de07b05a11319c0caf1ea02d92d8925db7508fbfa","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b253154e10b2db2317bde188fed3bc8a48132591d7edb7687377c41e34e5ae6e","target_edition_id":"edition.r017.id-id.draft","target_line_end":151,"target_line_start":151,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[151,151],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ca9678a0a32572f7413a84f24957953edc225c3fc28aba9803a20068b3133294","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"beaf8ad92b1445b7bf5d46778b0384198270927464557a44a9db3ecff7a5d268","target_edition_id":"edition.r017.id-id.draft","target_line_end":162,"target_line_start":153,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[153,162],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3356a8fb2ca05f6b322e8a201c898cec53ac6f1f2bdcff96de0d446e131b2b84","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9357271fd439881e9649361f4d2549490a2dc4594846f2c0c09d2d6701323666","target_edition_id":"edition.r017.id-id.draft","target_line_end":248,"target_line_start":164,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[164,248],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e1a0b4bbf1a080dd4d94a20d7f11911d087a9c0480931ecb3847f73c9c9d53e","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3e05a0753d3b4f535a0d21afa260a4105cb0efeb2077b3379e294cca282e0f53","target_edition_id":"edition.r017.id-id.draft","target_line_end":250,"target_line_start":250,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[250,250],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d629ce12d5881c0e804c87dd80dbc4561f28cd9882f66c51299ad0219667aab","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"00a544858ca54027859cd62f26ae08e8c5577770e5f353dd3c5df08f728ed101","target_edition_id":"edition.r017.id-id.draft","target_line_end":261,"target_line_start":252,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[252,261],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"95fea08393f40fdc41392b73f4994bd5afc3416eb2b74d34e41d239bc94e9f41","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2e119564d092984acf58cbf0369bc9b51890aba031f9311bb38181977188268c","target_edition_id":"edition.r017.id-id.draft","target_line_end":313,"target_line_start":263,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[263,313],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb6b2bb1502cead955a61c27b03c5108d8c33450dcf31f111594e4911315c7ed","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"50f4e662828022fef620e46a2d2f010454ef96b0e6bde5424d68aff65e62082e","target_edition_id":"edition.r017.id-id.draft","target_line_end":317,"target_line_start":315,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[315,317],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"09fc4e40810ed6cd2a06c350e13924264dc8029b374dff4787961e8ccc1f5621","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"15c1957eaad8dca61501fb9fd230e8dcc79f7a2b2532bed7e19bfce64d82a991","target_edition_id":"edition.r017.id-id.draft","target_line_end":322,"target_line_start":319,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[319,322],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ccd8cf7831ab5455bf37c49892f49d93500972e4cb75e9c514580b2e4fdf3d27","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1b54d68fd128eed4ec73c51be0fd98d85b63b22a331c391901e342fd19cda6f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":325,"target_line_start":324,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[324,325],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"42d1dc26f5e9a0865545a92967a0e4b72938dacde1f5b0979d4559d2ccd5ad63","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"00746b682de92c6338a4ebc19c6b3577a38736eeafb819490590a2ded45fd8d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":339,"target_line_start":327,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[327,339],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"000a8d27c7f495750795270c305848dd1008785134180279bdfeeb1b78a8b909","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9a50d0b046fcf55bab63edfb8413d2590f4f95d3baf4bbd8d0be2d0ff5f5b331","target_edition_id":"edition.r017.id-id.draft","target_line_end":353,"target_line_start":341,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[341,353],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"06ca4a43e361ef626fc8bee7edde110ac5c36e715f820027f78bd1dc99029cb9","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2bf743899e8cff23fd3d0f6496a7ca06fa3deec129d2e098f9e111d5a0f6d6fd","target_edition_id":"edition.r017.id-id.draft","target_line_end":355,"target_line_start":355,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[355,355],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4874cd091ed717aab1eaf1c8e061f97b32d9ddac66e0b2352036af44ff10aae","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9812df0783cdd80ccca795071d9a8e4377ae78c155f5b2f9e26d2583fccd763d","target_edition_id":"edition.r017.id-id.draft","target_line_end":360,"target_line_start":357,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[357,360],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a0d287ae33dc6a37da0684c2d8b206baa7ca494b3822ceef177f2be7fc26421","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd4fd752e2ed977cd2f0ba4f085ad01c91a804c4f4d25cfae66435bc16447623","target_edition_id":"edition.r017.id-id.draft","target_line_end":365,"target_line_start":362,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[362,365],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a88688e61ade870223c7bdca09e9fc286cd2ae98477e867e4100c48d2aabf8f","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4873c7bd6ef7e7719d6a8ff0a8302c75e7db85e73acec235337bb47395093b2d","target_edition_id":"edition.r017.id-id.draft","target_line_end":376,"target_line_start":367,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[367,376],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82f45e92e474a0bf3ed82c0a89038258b2a5783a3a7f11242b9cc1147109a64e","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-028","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5c535dc18b413b0865985d75496e33166d0704ee36c4308b330f439daef39151","target_edition_id":"edition.r017.id-id.draft","target_line_end":378,"target_line_start":378,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[378,378],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24470b1cca1b428abaf893f497df0424992170f0df79cb65a163f64f119068fb","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-029","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"350a1993f124985bf5d0a172d34ffd500ead2a56740d9750590a43db60eae3a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":384,"target_line_start":380,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[380,384],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4cefd37c206c1a702aebaef54d4c2f6739b774d16fe834afd1c0e95b70ac527d","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-030","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd22166d23847507bd4b0a706813b1e6c7318611d8996479a379f3bdc3fcdbc2","target_edition_id":"edition.r017.id-id.draft","target_line_end":393,"target_line_start":386,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[386,393],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"78a85c3fa07387bc2ad340bf97d0741a9ec40f3cdb8a169e0f9669fa4aba76ce","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-031","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"01ade6dbdac8641292411839619d1b829c06833be91c515e6bea346614115328","target_edition_id":"edition.r017.id-id.draft","target_line_end":395,"target_line_start":395,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[395,395],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"087c7917c7f6d3306c994f2ab32539ebfbab0bc36274a101573d7a1bdbe8f3fe","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-032","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e4e64497253f54b05b9fc778966e7ec9b9d8bb71a1646dc055a6521ace684920","target_edition_id":"edition.r017.id-id.draft","target_line_end":401,"target_line_start":397,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[397,401],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bda119d13ec4d8a11cbfe4fc56a284f057ce1c8b72ee104e6b253f1299b0a908","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-033","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1f314907b2179f2eba47c2e21ecde87935781efdf2b708ca391e7249459bdf23","target_edition_id":"edition.r017.id-id.draft","target_line_end":404,"target_line_start":403,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[403,404],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b1c27f6f6deba65bdfcbf6e3f567608802962464d5ae0e34ae1d163ffb563676","concept_ids":["concept.linear-system","concept.matrix-rank"],"id":"segment.r017.book1.appendix.linear-systems.rank.block-034","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rank","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8cfc9de675d99f2900766d8a746e6bc4e0e04e9697391f92e162677f2bd92ebb","target_edition_id":"edition.r017.id-id.draft","target_line_end":410,"target_line_start":406,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rank","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[406,410],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresRankHomogeneousSystems.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48095283900d65ea5c3453a23c2e05f403d87862c6376c7accb315c113b4cebd","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b175e603b7640fed737462b67dcce0812b215cbe749b4b9fcbf0ed628abae189","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a2afc3b0aa8b92df9f8874db09de5dc97ec164e87fc5cb148cf5ac733f642a52","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"81bc27f96035dc9bfee6121b8877390c21bc8c1df8d7f057d606d900ff06b79e","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,3],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dba545a7d211c20abf293f578732b8082f07e5c108f2fab1f85861aa2ac1c522","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f3433faa2d1c7561ecb27a6be1bcc4535cd7a3c39ce52fcbcfd1b54a97732ae3","target_edition_id":"edition.r017.id-id.draft","target_line_end":14,"target_line_start":5,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[5,14],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4f3a272e3442ee89182087bc1c53c4596a2bd98b12b4824259202b98e0d78398","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ecb532d605994ca904b18266266403dfb4132f5d7e758fc3a350521df1a15ea3","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":16,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[16,19],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f1b0001d308585575c901fec24908adbd969d15d96077ec3e9205f96e04acb96","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e78dd525f674171fcf2b49fdc3b63267598cfb4ef67cf9913faea2da55ee75b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":35,"target_line_start":21,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[21,35],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a9c0827924f86089e135e9b9e0d5219ba71518efdf3dd9903b1d28ed38909e9e","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f990b1ad64a8c84329fb079c087bf568e06d7121add79960478ea5dda9e8dcf7","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":37,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[37,39],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"22ea969dcf56a45ba3db270b2859d0354b0fa500ce76703853898b6306eea0b3","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eb220e4724ef0b4fd9801940ce9c51de40ccb13fa7f74c5c8af8a41c4491794b","target_edition_id":"edition.r017.id-id.draft","target_line_end":43,"target_line_start":41,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[41,43],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e2276d440263378f0b22bfbd66ceb03ee03713f7e5eb0cfbf86b9ed0c52a7c6","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72a2903d443337bd402eca3d63374f4571f96839ceb59f979fb9bed50b4f2350","target_edition_id":"edition.r017.id-id.draft","target_line_end":46,"target_line_start":45,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[45,46],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b5862c13a7369149c28a31583b3a1f8534b97ca68d23bd0e525a6d61a923c26f","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1cb811e88758d0569af8a0ef1ab08147ac7f2f483cbdac30b7c83aa8f5a79526","target_edition_id":"edition.r017.id-id.draft","target_line_end":48,"target_line_start":48,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[48,48],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bd86e2e4f68bb0a973bcfa30f3dbc4632f7268b812a009472098174cbe9c3c13","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d14858d5f2da7a13b18730056efb0d7efdf952ee4c4a21635b82cc45f23a791d","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":50,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[50,51],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f57c304fc306929af9e29c46cdeba275b66c0e32f2d436177bcefac406641ec0","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e36e534663eaeea4a785abcb1dbdf0fea783ba97d6ec481dea71ffcfd472baca","target_edition_id":"edition.r017.id-id.draft","target_line_end":54,"target_line_start":53,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[53,54],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1cc03128704aa112ef177a6c28e7bbc693911e0b8b10a980ef49138d7ca66e93","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f3381261300f8e9e83cd2f0a5b2e449b564f65e60725c93c78d95dcc80379824","target_edition_id":"edition.r017.id-id.draft","target_line_end":57,"target_line_start":56,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[56,57],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e6729d3b0b4507cff7976d962417e958aa0e358729a8f32c520fecfd6d3d261e","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf29d4e328b7adcead4a45ff6f7f83f3203884eadb953f9bc8cebc4562685fca","target_edition_id":"edition.r017.id-id.draft","target_line_end":59,"target_line_start":59,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[59,59],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c11d65cc2196cf918d9c3c0ac7a377172789af7f5be1b916de71063f8a4745d","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1f090a54771de7ccc8c48e1cd533d17a85b3969d0e8d562b438ff88faa077844","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":61,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[61,77],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f83892a8024b7162f7420e641e7cd2cea20e17b935021d37bda98ff43961e0db","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"872ee881e72e34c7a4d0aa180c324013e3bc23553a0774209723f6ee1c93ec90","target_edition_id":"edition.r017.id-id.draft","target_line_end":104,"target_line_start":79,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[79,104],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a353b5024523d86b8d20f0d0575c215717364de5420674283431abae7ec01c33","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"629d933f5bdbf26c71228c02ec7a30fb8d86365c085843fce9856c8c985ada7b","target_edition_id":"edition.r017.id-id.draft","target_line_end":111,"target_line_start":106,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[106,111],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6744534a4bf3cd8afcb5ab3a782d50c30ca2ad5a112047b3d2dde09fc60723e2","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cd3c72f640cf3e4e6b546b3b159988d6d965b22361c70a3684785a19ccfc0728","target_edition_id":"edition.r017.id-id.draft","target_line_end":114,"target_line_start":113,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[113,114],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"494197505b2f9dee5c78a92d43f234a81ca4bd8a3586eb5ac0755b0e0385576e","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf1c082b608000ca9c55ebfdbac716e139add8eebf67cdabdbf50df54b9d77dc","target_edition_id":"edition.r017.id-id.draft","target_line_end":148,"target_line_start":116,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[116,148],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1996dc26a08277c6102af968b0fbd4badebdc89680d0a3a253ac66d44e0b7534","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f39f8f19cb5a8050fad3abbd0d956ac4bec5c088f6fd0f496036646aac6f6246","target_edition_id":"edition.r017.id-id.draft","target_line_end":151,"target_line_start":150,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[150,151],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4b73edee600a895e0580a5246c32e0d8010a5a5e8c7c4a28fc922518c8554d1","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"03ab5916fb8f60902c70f27f8deaace3bfe9ae12ece5f4e3aeacc5afa52e2806","target_edition_id":"edition.r017.id-id.draft","target_line_end":177,"target_line_start":153,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[153,177],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d11d30c6d03bf221396dfe0a1f62285d34df202c1def7b35b965bfdc3e8cdfb","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"56aa590803b11063c181b7f67faee734abde30df46fee1ee452a5abbd7d089c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":181,"target_line_start":179,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[179,181],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9fcc562f0841149271b36e333c1b93fd13bb73aca9ec548121e53760bd34efc","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"912b2ee8d7c4ef318f17bc58261a17554ea1342d9dacee36a78b378836c21b15","target_edition_id":"edition.r017.id-id.draft","target_line_end":184,"target_line_start":183,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[183,184],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de2f1e8b2a498507401f08d691340f69a172f93026f48f938a5e4acac98e55ff","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5ba50a9eff58d458f088e0d6d9241039368225202d9d56d5116a143613d0a755","target_edition_id":"edition.r017.id-id.draft","target_line_end":196,"target_line_start":186,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[186,196],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"36ae9bcc66fd3411d61aba0600027c4cb512fd4c86f3c46f50b8401e0d2c6d6a","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"043664bff373244d837a74092101d75ec6d7b73285d982ca76c9a5e6538dbd3e","target_edition_id":"edition.r017.id-id.draft","target_line_end":208,"target_line_start":198,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[198,208],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1cb9ed6087af7fc74b21e1d4ea700c125d912b85cba9928ceb7ca5640295f74c","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"202625a028a72c405dd92ac5471a24825e51dc32fa984842ce42c2c97ee86453","target_edition_id":"edition.r017.id-id.draft","target_line_end":214,"target_line_start":210,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[210,214],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f76d532ed8760d8dcf3daf8b5df5fec6d26a62fe2d3be4661e09422c7e3cc934","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"79ef6ae4a3458921726f840b53c9b761497ce74debcf9e3a141e3ace60a4bed4","target_edition_id":"edition.r017.id-id.draft","target_line_end":229,"target_line_start":216,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[216,229],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00d48e84e7993f7402cc74182eb4a08cc0e028f52afdf3dc99b8cf7fb4a0b7a7","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8bcdb29a53cf8ffefb179689bb75236f568232aa9b95ff8cb90452e60e7499fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":240,"target_line_start":231,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[231,240],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d6b8cf4461d2ea88e5c48fa88fa5e05c92889aea41eaeefbb1be22fed148622a","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-028","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5b1da2ffd76ebfdedbed629365805541bc0174bb052cf7249a728d679c0d3f9c","target_edition_id":"edition.r017.id-id.draft","target_line_end":244,"target_line_start":242,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[242,244],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d6800b37edbdbd95ec153e3d030a4abe0f806b04ad8c61ff4047c6ce28dbdd2","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-029","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"836e026cb25d4467202cfea0524f3979e983f0fa870df9248ee2a51fed24a546","target_edition_id":"edition.r017.id-id.draft","target_line_end":247,"target_line_start":246,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[246,247],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a5f57b8e4e073a495bd3c5c1f217afe5b4ca008718e5c882e53f26aa00ccb9a","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-030","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"15e2994a0479740380ad89431e9d4cfe4334318f24e4093a81dadf8f67e7922b","target_edition_id":"edition.r017.id-id.draft","target_line_end":257,"target_line_start":249,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[249,257],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"266d32ff475863b46e38737809f36b23cfe40c9866c049b0b8555cf8ecec45fd","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-031","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4bb80ba2c1bc6d19331bc8e7e1c7c31a8fb8c6b723e6a14b51d3e099a1c32e86","target_edition_id":"edition.r017.id-id.draft","target_line_end":310,"target_line_start":259,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[259,310],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b877efecb3013552fb95ece83ff328779190b717a5a62680322520917816b754","concept_ids":["concept.row-operation"],"id":"segment.r017.book1.appendix.linear-systems.row-operations.block-032","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9be79dfd7c96a0a9122bb53cf9142e07c3e25a4507a62eeaa48a87cadb4b6a97","target_edition_id":"edition.r017.id-id.draft","target_line_end":336,"target_line_start":312,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.row-operations","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[312,336],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresElementaryOperations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2904b7d161a0242e7dcae04353958407b0cce9556c3eafdf1a75158f1eb49e8e","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06f6d669eeeefd9c2ee6a6ce3c3bb6185fb74b9ac8d2ded982afcb2c12de3a67","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3d98758d9d6892c6b42ab1041284e01c8658db1c4b81254c19af21dd23bb6928","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a8ecdd691d8392ba74af2a1c1cb79ead9356a114726467494dd96c03eaef5b1e","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,3],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5bcd3b540c4718025b74a55f7a1bae58bef243d02033c7b8765ccfc187386d6a","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a514a1140ffd66a9eae41dc6a76ecf35c4960fc5583e7f44d9ac1992e79b3efb","target_edition_id":"edition.r017.id-id.draft","target_line_end":11,"target_line_start":5,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[5,11],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"961452a5d819a0a09564bca16653e4eaff7d15f766a1c70520c95b33a08e7ce5","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fb2d924432f8a970fd1a29f7bcc4eeb8546d940bf336ffe116adfbdade5904ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":13,"target_line_start":13,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[13,13],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cbd4d6d2783aab4e868f7e28639964eac5ac0c0257175cbc4e2e5c82b412b275","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dca89545b486b00744e7be4b908ea4d7b0f5c4383b9c313c5bba13672fa30128","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":15,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[15,24],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d01ac3248048e7a3bd9fad61438da2d04b3a0633b5bb1160c01653a493b2381","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5f5558ee1dcc5c6a3153c457f373586cce0246d6120459ee3c665b4cdb52d5e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":37,"target_line_start":26,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[26,37],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"615ecc796289ad3a82052fe06083dcf21bd8b9c8d59e4f348cb4726b50b859c7","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"df60e85fb235238b86a26b2f416817baab3739d9ca4d6c8be7dc25666f3beea0","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":39,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[39,47],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e4f5384ea0124c4240fd7118a9547fbfe613fcb8ed76486e2996f6c7ca948f3c","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"179513b895f963a2a651c1bedd600b49b5eede11966128ff3842890c2c70ef0c","target_edition_id":"edition.r017.id-id.draft","target_line_end":50,"target_line_start":49,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[49,50],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a22c255ef955219d629894b9c13f45d1022a87447ab9e773874c911a9076845","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"694aa1317d6809e8a47053e8a387fa16e5bec614be567d671d7a22fd3b417591","target_edition_id":"edition.r017.id-id.draft","target_line_end":52,"target_line_start":52,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[52,52],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b11f6843ab57698fdd4f5aded383a244c29f8b598e312d2f78e21d55351c8cab","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c8f0632c14f0d3ad0f5e2e07b313c6ad110b65637def5ef7534788f8a9bbb2c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":56,"target_line_start":54,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[54,56],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cf7933738f2b94097e1c22287e43d46e30d096a775b512b0afeda112561cd302","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4eacede9cd2c288406dc6b72aa0f823698d2bf741db8a2dd8f5f61aafe157b1c","target_edition_id":"edition.r017.id-id.draft","target_line_end":58,"target_line_start":58,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[58,58],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"244c2b5fbf6dc452a8e2d69371400d98d41b50ae0fbb73f4652429e438b1c496","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b0e781d30589afb4af4a84486ae3a0d82b38fdd45b777fd59eb39c5d9dcc3fdb","target_edition_id":"edition.r017.id-id.draft","target_line_end":70,"target_line_start":60,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[60,70],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f22bad3d2ba816bc5df04acc0971115cec6f43d5fe33293cab1535c08655336","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"124ab08dee9e7b3e2da9f7138bcbee54d1e99fd5e4efa19bde1aa5c6379ba029","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":72,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[72,75],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"41fad67663e8832a911dd3ecf7f12446b3b258baf067514b4ab173783ce9f4e3","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cd9cd7a2e2a91451b923ddddfe243fe24dbc734ed309f6240f3fb721b53e7bf3","target_edition_id":"edition.r017.id-id.draft","target_line_end":79,"target_line_start":77,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[77,79],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f79a9e64e3a9e00ab46c2cfbf495a389f00021c3a66621b1675bebfd46913bc","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cc8b76322fa9b452223d8a21acd0a94bbb5fc82d5f5384568da69c89d77502ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":81,"target_line_start":81,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[81,81],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c20df9392db3c7378f287af894901f6bd4d6dc18db09058e32b6ab0e46bf621","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"857d205eedceb637e7dee227ad1dbb2038cb5e2e8a34ff86a5bfebff55c93546","target_edition_id":"edition.r017.id-id.draft","target_line_end":83,"target_line_start":83,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[83,83],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cfba1abcd7ccd5c326cafdb244353f178b655d7c4fdbac29961e964025467007","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6a4649b954e7e7c3ab831667b10d238a05395208b2f9d80890b27abd314abcac","target_edition_id":"edition.r017.id-id.draft","target_line_end":87,"target_line_start":85,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[85,87],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e094fa96987605986d5bec4fc596963dff6c8d69bcfc86d0005b59f7105dd937","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"09c39de0229c14a4c6f64a9cb431cfba1fd19756ca7822e39f3eb285969eac96","target_edition_id":"edition.r017.id-id.draft","target_line_end":91,"target_line_start":89,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[89,91],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c01c2e6ca6129c1c96d4e7b931e441bc7e62fc78b4f8a77ccaa38742e141bcae","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"15b5acab523e939e28017504c2cb251ec2a0e44ae5a7ae0d753d6ae609b69080","target_edition_id":"edition.r017.id-id.draft","target_line_end":94,"target_line_start":93,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[93,94],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f808af4832acd2e164042b6bb53ff44ce56fbb1f4dd1e1bbab5fda0801b50237","concept_ids":["concept.reduced-row-echelon-form"],"id":"segment.r017.book1.appendix.linear-systems.rref.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.linear-systems.rref","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a25fb2a2aecfc2ae6789ac51e1bba8fcbab905f34ba99757a874c647ae4da0d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":100,"target_line_start":96,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.linear-systems.rref","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[96,100],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/systemsofequationsAlgebraicProceduresUniquenessRREF.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c0a5c19092134fd194690d6e6e4c151c2d6e3883840cb30709021b4b83767a71","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"740e98a85a18bc66298f830f59065aad891bc49be76604604d4f1f32e8434341","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa537bc2d467465f9dce76e1ffe2cdff5410f954225aec83d930ed43a6c3d9dd","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1cd9f6498d7389fa3313c7786977653d2d7aa5c131c79d57c7321ef36d139364","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,23],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d926f8be55be1d8b3c56502beff3747a6f34a295a09829d6ce4b62ed1fb679f1","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2abdaef37c784801baaa77acf33d689621aad9164f8816d36960c4f9ea3178f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":43,"target_line_start":25,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[25,43],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"966a3dcced776248e5a3c57bf4cd3b0848e51783ce79ca89f2de595c7a600a4e","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fa662733ded9f1efbb182f074bf61056d61edf4772b7004e660129e9ba3949ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":45,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[45,45],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5bebe7085bf66bd479afb162da92a52f59532454d5ab7dfd04ea4339de3ee617","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06ffb03b17cf0910f9517a11f87ae176faab2b3be7eb88d4f1012721d20a7521","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":47,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[47,53],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb7e42a7ed81c50bdec7d46038b54bbc34914f39411dbaded0d2d0e802789ba1","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4152b050abdaa89a9c6e4cb4bab78216b6709c32cea635f2f4ecaece967efb34","target_edition_id":"edition.r017.id-id.draft","target_line_end":55,"target_line_start":55,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[55,55],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fbb344ae70020132cd5874b639943746988fe3c9dcdd5e732fbd97de20d20788","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dbfec83b5610169147810de1faaedb01a26f9f7cc0acebe5e3ee7c5105f9ac22","target_edition_id":"edition.r017.id-id.draft","target_line_end":58,"target_line_start":57,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[57,58],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"540a4c8076c17a0e0ee646ca30d2850f8b78aec0318e0f1092b0b8acb64cf8b9","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7dde59ae92c0f43aa6515b9206394a510a0206051f80a99b0116f1946239705b","target_edition_id":"edition.r017.id-id.draft","target_line_end":76,"target_line_start":60,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[60,76],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2ce7628425e42c9e39429281d745aa4d5be5a928de3954d12a4e5b3b5c8ceab1","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1ff38f9a1631a416da36b9b6057fbd8817691e9738edc3e0cfe498c6ec808488","target_edition_id":"edition.r017.id-id.draft","target_line_end":111,"target_line_start":78,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[78,111],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fef17cc1c8a3658e1213d20b11405161e6696a01f39f8910bcfeefe42ee7919d","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"04a640dfd382476896c96f1464fd7940da9eab5fc8c19e960b6394e6e10d22a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":116,"target_line_start":113,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[113,116],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"36cd04752eef9cb33ceca110399cdb6380449661a31f8b0e6c33b4e39d6218af","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"335493f0b9bb2fac9fb3758f52bbc63e9de246c80bf00769790de60be36b8ad5","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":118,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[118,119],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bdaf91b4a50f3a98bf47da27c8e9e1c86f3545acc8276046b455345bb063bcfa","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"abc20d7af9e45340697190c0ff32431c29220289b777dea0e3bb9cea6dd3a522","target_edition_id":"edition.r017.id-id.draft","target_line_end":125,"target_line_start":121,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[121,125],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e4c6a505c15c99888ba421c7cd5ff348c0f26fb2b0c25f7098b3b82f927839b3","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c099422a939819b21ea061f7eea23c520a74c90bfb93e06cdf08d921e2692e91","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":127,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[127,130],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e4be660b83a7c07e72fee8b91297fe2c1d9a867d374dcbaae5b9523d99bf6c53","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0cf7120c997292a1d42411ec3b0d2a1da0069225e535c5d79ea70f6dc59063c9","target_edition_id":"edition.r017.id-id.draft","target_line_end":138,"target_line_start":132,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[132,138],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9fd73454ea1fb211b7e7533191a9119c25933754e00b09afefaa77dd02db5436","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9bcc37b3a013bc6e94281f1d9a1d07addb4e5a3f221aa0d7a2284f2e26cb87fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":148,"target_line_start":140,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[140,148],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81a29c8db4197c7b94dcf2f8355b43bbb0b8ca2e974d1370f372667b081315a3","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2553a47b62cfd610b130c0b1e32fcfaee96cccc8a09f811096ef10ef8d70b81b","target_edition_id":"edition.r017.id-id.draft","target_line_end":163,"target_line_start":150,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[150,163],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a141ac86644f19e32a075757149564becc38f806d98195aed71a1557965f23d","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.addition.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"da80d564b4ab18c82ebe5a25efca76a5ee6131c48387ed5f34da86e0fefa67c9","target_edition_id":"edition.r017.id-id.draft","target_line_end":170,"target_line_start":165,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[165,170],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c08ad4a0eeb0be2521c2d46716042a4a1a736338c468c17427416af5373285e","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"84a2f7f847857c38a9f94a04738fdd0a6eb62eb2ac38c37abf4c03c8f098cb7d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"71797248787459e7aa53bc2978eecf907cdd200e1597b92c68e6a684ce8a1fc6","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d4561eb4d77b879aa2ec91a105dd03ae6534cd8a9e6b3738187e0dc5a0d2b885","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,8],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da10cde7ee3ec563fd688b812a3c5304bdff145734e5f8b128dbdc1d6666ed8c","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a600999a6fc90cd42678d5a0e24bcd7ce3f3aae4961e690241349954fbf4fd69","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":10,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[10,12],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c0fa37445920c77543f471aa340ab686bf9c212badf793bcdaa05f9e939b2856","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9e11d32c8194b3ed06583d2c0fefaa908a5f7aa745ec02c8004b6609017a47d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":14,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[14,15],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1319f862c85a53511584080d4304851fa0800836685a7ca79a4532c2d68cf711","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4bba4845bf05787f332089aaf78f3ffac3308847caf33c765e340b3b75bf5eeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":17,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[17,17],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d46d5db83271c0bca755a406ed2117de2c56f5ef975dcad3a44cf2757f4032f","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"944091b8987ecc4ecfba2b04e21eb18a0938f1d130a59a008be185b5976fd386","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":19,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[19,19],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24f8c239c4c6e0f9a7b0bce62edf3b655cfbc68b16d2ba964cc75ebe49386305","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d41b762bbf4840e65fdcdb3eb8cce609037d7056e5abad87f97c7b4b2720a9e9","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":21,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[21,21],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8708b27a90317fcd40992d939b2c744d80250121a085ad6d6333bc78cc2725e9","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8b43faf57b826a9d2a0944d2fbdffacb792e8a0d3e9570abae0447a3468a9728","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":23,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[23,24],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8ee1ba99cee0f6c863a306f674ab3c73fde0ff2f0201c75cbb9d03b55b51806c","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d90085b2438e40dad08f794f280587f3fe87678b25a3b9a96ba4c1002fceaf9e","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":26,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[26,28],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d2b4f74b1fa9ba39f9a695b86c5b98c04b6c1e65e0f77dabc614f6778b2b08cb","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"32874f9da038ef5e3c68fe799b37b47cae13b8778d0068998a711c2eff3b3082","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":30,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[30,47],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"65c40637900297901cb25d3856368fc33f613fc3140bf680077fd16b54f93990","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ce2524c6976d2f148508495a20b54d71e3e85b9d9a551d09170c14d882326d0d","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":49,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[49,51],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"471bed6237e63b4e4bf104fa5fcda5b0a8c1d91d48ede3f86b8aea3d837b54ec","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a402b2d11bcbd1635054c2b286d30456aa7ceae439e0863627e943669c0fee14","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":53,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[53,53],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d6f88ccc82e5c59f8acd5d5bc697f7621a63050575afd8575dd43565a018099f","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c41250798d12319dd36d189aa82ee388fadae337f5ac97836f076b8d95423998","target_edition_id":"edition.r017.id-id.draft","target_line_end":59,"target_line_start":55,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[55,59],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0abcd947400dd0e6f648368737e634b7d1f99d55c9b9fefeab65e3b245a0721","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3d770467dcbb9491e617a44722d223c01c4043fa5d4bb0d42e962eacf1a149e5","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":61,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[61,71],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2df8c02faf2cdda0b07747962555661f2b5aa920c1a5737561f8b192f5f7fc2d","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e515910faf85bb2c1e71113d95dcb75aca6f6907f80df9d8050834051e343b27","target_edition_id":"edition.r017.id-id.draft","target_line_end":76,"target_line_start":73,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[73,76],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d7ef6393be2774e7b6b733396c345ce3fa6c589792f9b2adcf4e55302241240b","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3322b2f3e900ec12e621af63346f9a20b37a122340095176412304584a34010f","target_edition_id":"edition.r017.id-id.draft","target_line_end":81,"target_line_start":78,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[78,81],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"efa75f282c7522c4a00a8f9ef9bf51be64935e89615453712776dc86b3abffbc","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5f3bb0e4dfb62d13cc8c865240f18694c9680823fdad7763e38df6a137cb99c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":86,"target_line_start":83,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[83,86],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c043299dcc8e8e9bae9f60c04e6d5b762c1e226da5ec15a8ba241c4357890891","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aef7d4cfda46b0de4eeb1ddf474a2c8479f75bafaf55f882071597bdd38787b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":91,"target_line_start":88,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[88,91],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f93d4bc0dc4784e903ea0d03ab3e05b34460a98226312c57e9b7f4db42b01de9","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fe8cd78dd6c9a6b0cfdda7951d1371084f7c787ef383723c8c4d268433b55958","target_edition_id":"edition.r017.id-id.draft","target_line_end":97,"target_line_start":93,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[93,97],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"698dffb633c3ad012371d95fc6bf8136755ded34b2fe7b9186f6da27b905b0ca","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eb0a74017a804feb7e77172e7ad68fde1588aede165a6bbba4a2277906da3c03","target_edition_id":"edition.r017.id-id.draft","target_line_end":99,"target_line_start":99,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[99,99],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d512c5b192ec32fb8041aa07bec0e7c7340c118ae522deb126ebd2fd68071bd1","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b3564b03bd559fc249e4bc060ea3fb2177ea0f8eb709cb7ff72c1b3a80e41d59","target_edition_id":"edition.r017.id-id.draft","target_line_end":108,"target_line_start":101,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[101,108],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b587bbdb5e8b434b4eccf16d7c6c04340fe24a36d580f21712e7f5cb8e4c6069","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"44001a5c15c9e6b8bf773caa001be422723a01837450c3891db145c5e120be2a","target_edition_id":"edition.r017.id-id.draft","target_line_end":111,"target_line_start":110,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[110,111],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52433c72faa9690c22796bd49c01e47ee3c9d2e3297f9425642fe8406dae2a25","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd8fa0c2e28f9d09cbaba2dc255c4001d81612af265754be3c9237f7c9b6986f","target_edition_id":"edition.r017.id-id.draft","target_line_end":118,"target_line_start":113,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[113,118],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2afa201d2d7ac199f8fb79ce604b7e99eef108ffe223f5aee23b49627fb3c788","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e45ff5ab08f795769c7611a1be2b604d81ab499fb8128bb6517a80843aba404","target_edition_id":"edition.r017.id-id.draft","target_line_end":151,"target_line_start":120,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[120,151],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c3fda95e577fed5d11bf12b122838aa8829d0fc72de0d1a1d325b61621819a9","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.arithmetic.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.arithmetic","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bc83121391f0477363a5ca3af4a38d0736250a30c5d3374238a2fb237448d7ca","target_edition_id":"edition.r017.id-id.draft","target_line_end":154,"target_line_start":153,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.arithmetic","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[153,154],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmetic.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81c0fdf8ec2737d6c32cdf078e9fea1a68c49c3bd049350c3c7d3d2b8dd8b905","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.controller.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.controller","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matrices.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b5bf6be7e35dd3f7726b15b28a1cf6c1d3f09ddc98ced68325e01850ac9287d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":2,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matrices.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.controller","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,2],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matrices.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b59c64157555aeb3fd75e692553b554738437162f8c36b41c7967292a70dcb8","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"42a9b7e28009403f9584352d732afd33f57a4b3f9544cfd707926690f8890991","target_edition_id":"edition.r017.id-id.draft","target_line_end":2,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,2],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"69dacff40cc06aba270c787e45c2af8de48e7232a5f8dfa0df0ccbf5d6ad8b9d","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"355fda843dfb48d624014f764967349a4083ce455e3894007b8976b93e43b1b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":4,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[4,5],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"53e2b02e4f283647057a0c239a7be97c5bc1f5df894c976ab8a80e9f84e42e3b","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b12cab901e8279b28e1195c254c9ba1dfdadf2270c961bfc964e452ac075faca","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":7,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[7,75],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"97a687b999f1909ee74c186e48d2ca2ad34af6c03fb2e1aa3f84709d91a7f3a9","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"85c77dc57383fa0e9fc65a0c82d0f9a2007e39b9ce7f0f97a3c84d3b13eb9a7d","target_edition_id":"edition.r017.id-id.draft","target_line_end":97,"target_line_start":77,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[77,97],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e95dc0d18780e348be2e90c5d6da20e767beea9d66240396275d90857d0eb599","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e2a4e3b95d5f6c5baf373d3aad59b56bd26462008632569f276f1ef6346d4a3a","target_edition_id":"edition.r017.id-id.draft","target_line_end":100,"target_line_start":99,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[99,100],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f3042c441e30127d7ed244c69311f118aba519cfe175e5bde7be5b4553fd3e84","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72daf03068c4d8555c4ec2e5f29db772ad7a94855029f78830cb734dc279a235","target_edition_id":"edition.r017.id-id.draft","target_line_end":120,"target_line_start":102,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[102,120],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bec80da11c76bdd06f99355043a4b38320cbf36405023a2c7b90d0611d8ea053","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d086d3ce583a2476e690c13eb68fc4a587ffac9af54c3101c2620f2c487dfbde","target_edition_id":"edition.r017.id-id.draft","target_line_end":143,"target_line_start":122,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[122,143],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"db472cc42aa8d258b6a0cf9d41ea521c1fd514dd9d5d759c776eb8b8d88bdc12","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f650385c1caa8cce362105065de096e23e07f53db0012adfe8d6a1bc3dbf690e","target_edition_id":"edition.r017.id-id.draft","target_line_end":154,"target_line_start":145,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[145,154],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"307245d2d3797cdb1f9f9b55ca8d9852e7e7d9f8ad375c44b918ca7ebc4e1680","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e401a0472530813cca293f29b3bd9eb73e54b8ab2f85cc27e3a8f91fb012b88e","target_edition_id":"edition.r017.id-id.draft","target_line_end":165,"target_line_start":156,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[156,165],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"972d38310394818901bb5c2b15bfd32f73260fb5b40f3a7cb056403782a595ce","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c6dc334947d744c8cb3735bdc237e7781ef758048612a008f64221e16696fc6f","target_edition_id":"edition.r017.id-id.draft","target_line_end":167,"target_line_start":167,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[167,167],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7bdebc9388e88529ad843edd07c01757a3fbc517d9d5a723b66096057cc6da4c","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"27822ec36564e079a24e3a43ad330820c781b75956edf53a1196540a97354d3b","target_edition_id":"edition.r017.id-id.draft","target_line_end":183,"target_line_start":169,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[169,183],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee08caf0464e55cd5b1a309d7d3b5a2325b3d00abb019b0d10d1faaa525c1d55","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"348c95b31d32d27ca3a04bfe868e0ff9c4bc77d01f9bd598103ddd313c85d038","target_edition_id":"edition.r017.id-id.draft","target_line_end":186,"target_line_start":185,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[185,186],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b6ec1750af484352c8daf0308b6423b0d9a9994eb916d262815b8fa8a9c3eea5","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf29d4e328b7adcead4a45ff6f7f83f3203884eadb953f9bc8cebc4562685fca","target_edition_id":"edition.r017.id-id.draft","target_line_end":188,"target_line_start":188,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[188,188],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"34f56f8e788a7bd3363f7271081c94b8a27aa0403f3ddd9d9bc398ffad7f4e88","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31618754eddab816d89743aa28e67dfe4e4998bc88a8460858ad279a0fbce2d1","target_edition_id":"edition.r017.id-id.draft","target_line_end":198,"target_line_start":190,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[190,198],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd0edd749ab483043e85913cb20b333f0cc06c31e3a3b0454b8108d439431ac9","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"05b44c425627009db069f6efaf86fcd7a05d6e0b26b3a895d1f04ff536411d10","target_edition_id":"edition.r017.id-id.draft","target_line_end":210,"target_line_start":200,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[200,210],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e09f2c72a8a10747c47b7309fa3fb6ac0ef29c6d7ecfad595528c8b70dfcea8b","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cbc40aae3d67340c1833f054c46260734f635b91e72374a10b3427ffebde5171","target_edition_id":"edition.r017.id-id.draft","target_line_end":282,"target_line_start":212,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[212,282],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a6a6c6383acd709d671bdeb0e17b7a688f6cf1450135ee5c64d2666f92e1b12","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6dd741c1aa84f511517c981a08f76f0bf389508181b00e38505b558293f0dd33","target_edition_id":"edition.r017.id-id.draft","target_line_end":285,"target_line_start":284,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[284,285],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6175c60e6c042078db729e90d22334696f616a1b3d252f79036ecec6d3d8afe3","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"38281179e050d3ed08b2569fd08fcc85439849a3f9508961149cab5d30faffbe","target_edition_id":"edition.r017.id-id.draft","target_line_end":295,"target_line_start":287,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[287,295],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b3c314b4127824d3a952d638f62c13c57719cd9f12c8a7052ba82039b02e513","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"59de43e08040f1fca1de8c1b99185fbc128f27d279f17f3ce26a79f42cbfba46","target_edition_id":"edition.r017.id-id.draft","target_line_end":334,"target_line_start":297,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[297,334],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9b5b9f18482d4a86effd1feae3088dc6632905253c50643c2b675816082c8e33","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a61d99ee67ec5c89a57acb064a58c844b0835274a37334d233665f3c27c44ac2","target_edition_id":"edition.r017.id-id.draft","target_line_end":338,"target_line_start":336,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[336,338],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d8255ed2e626b6a95ac49a89ed025aa6327a676c5985f8e7d5e9b5c0325b362","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e42f8558eaec9e8eefbc4d38bdd6c2aa03b053d3ef6668e5b4acbbaca8f1c80f","target_edition_id":"edition.r017.id-id.draft","target_line_end":356,"target_line_start":340,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[340,356],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bff1299af96655abaec00fe8a3a430e53f49765f03fe4c460b589ac08342caf2","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"08a20664135a258a12ff5e71eb09efec3dbf53816cdb785ee2779abb3e1ca04f","target_edition_id":"edition.r017.id-id.draft","target_line_end":358,"target_line_start":358,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[358,358],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ddd29e2927631d71a55a361265b7a1f9cc876434d5f0268b990cd6b1b3b23415","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"14fd8b581c0f5d952f4a277c32a02c0ba2b3b75dc99f65b27b28a9dc16bc03ae","target_edition_id":"edition.r017.id-id.draft","target_line_end":371,"target_line_start":360,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[360,371],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a406bfb4f224f268080dbc5719de47d66a8b4e3eee3612872290a6456c475127","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"73b3f3fec1d8fcc976d982c19ad1a10d8b6a0871a6ad352485e7817bbd9c9eb0","target_edition_id":"edition.r017.id-id.draft","target_line_end":395,"target_line_start":373,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[373,395],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88f92020847cf651aaa37bfe06bfd00300d8e2a0754a917eddf54c1659d22b9c","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"80f62b1bc242e35378691779be20f7986e9e42e2eaacd0006958a37a545316cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":416,"target_line_start":397,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[397,416],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3448c7902a2cb174af9da502a06eb5b0db396cb789a5d1290b131276f09e30f2","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b21f82925540b196f116e4aa345e94d9383c37c6729104cf4710efa92bbf9bdf","target_edition_id":"edition.r017.id-id.draft","target_line_end":418,"target_line_start":418,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[418,418],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4eeaef8705086cf6606d857cc92972587d0b569f1b6df26b33ef846c5b76809c","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9f9fce3e70f0b3a2c6f226e83bbb80800970ca275fb59169f3bf5ae94faa17d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":449,"target_line_start":420,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[420,449],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d73bcad573c3486d00df85c70a8aad5f3ec4970d7ea8e022f8a3b15303cb06dd","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.finding-inverse.block-028","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06e52a3384aaa0e4f3e894980f8ec62764e9e39a0d160b09d929d33f546e1d7b","target_edition_id":"edition.r017.id-id.draft","target_line_end":539,"target_line_start":451,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.finding-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[451,539],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticFindingInverse.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3f96545d09d931b570e412bd4fe3d5a551c7c6d1f9a9b6adfc2ae86278072e4b","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f47b9eb8e8e67bcc49b58a40ffa48e8aac8893ca525c866a88638a063b542b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3785c0a659fd4bb7fdffcfc340586f74c8bce0a00887fc22afa21faad72317ba","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"61c2a5e01b23ec97f87a40353359f8438308164058450970c4a18b83bc1d8017","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,33],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"106df05cc87a9836d64d9434d4c89be2ef07ed4ef8440f6b3e1731bcfa2bb24b","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2269f3ad35381abb67c7ff07436b04b00df53cc5284caf178617b9df5a72e5a7","target_edition_id":"edition.r017.id-id.draft","target_line_end":48,"target_line_start":35,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[35,48],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"634ad1d5119e45cf619dfd430f724f729a6959369196ade89bf7a70dec4c1239","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e5470a9e92e8e4e4c18837268556c1269e39e24f1012ebc19615bf26499a071e","target_edition_id":"edition.r017.id-id.draft","target_line_end":50,"target_line_start":50,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[50,50],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5f021acbef73563c593898cbe3467e30099af4cb16d1b3d6bde55ccd1759c517","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e3c2b13b749c8e21079bf5ce3cfed2e246ec4bf250be4fa3ffb217eca93d2f06","target_edition_id":"edition.r017.id-id.draft","target_line_end":56,"target_line_start":52,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[52,56],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90c78a646927ecd97b1b5e46c76175fe44bee756a6a48641cf9a21fafa082f6d","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fde4f4ebe47994dd48469954e45814746e2c13a8fdd8931d91593261b39b1e30","target_edition_id":"edition.r017.id-id.draft","target_line_end":67,"target_line_start":58,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[58,67],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c924afa3c481ecdfc23ac025c6cffad77d2f52f839522d45046f939fb8f8bf7","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f02db112a066de368beed4e593c61c26eb4fedc6bf23bf204c5b1c3a019b3a99","target_edition_id":"edition.r017.id-id.draft","target_line_end":78,"target_line_start":69,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[69,78],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"58115ed154c45ab3b3238665007b21645827cbecb40accaf4e8ed1fe89916d25","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"364b27a00ebce9ade6b686edb0c97c37cce62e0d0b64610c1083cf40475860f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":83,"target_line_start":80,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[80,83],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"389b8fcb59ca89c584c1a88708319279725d2b2c096c7fdc1b1c715f9b96c900","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4bd3a2230324c3253fc94878c68cfd78de8af11ddf693a8b0f8de5bf91b995a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":89,"target_line_start":85,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[85,89],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"190f75854fa7b36f2db5003700bcfdd14d8ea3600a9ee9b993ca52f0d514740b","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"84f614d70769a942ae0440fdfe00eda965f3f52cf377d00b50baea64c95b3889","target_edition_id":"edition.r017.id-id.draft","target_line_end":102,"target_line_start":91,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[91,102],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cf7a0c910f22e8183c844d151811d06d27dd0af25272b7ff7ea4023d97202bdc","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e34f639435af414cebb7676fabcc81f70429a4000a0077b3f9de785b20d024a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":116,"target_line_start":104,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[104,116],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"44e302853994e89ffe2a7f24db3712553f68aeed9ce0bac9885e6b6a5db389ca","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5ae5179762843bf4a3e6654464336c1d226b48bb46ceb65d2dabb964f102433e","target_edition_id":"edition.r017.id-id.draft","target_line_end":157,"target_line_start":118,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[118,157],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6c53c0686efd1a64d38ccee7ca7225dabb289ca32881451d304e624ca6d91054","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"07bd30164ac073a72f7d0d00eb13dd62451931f564038b63dbc070a870f3972c","target_edition_id":"edition.r017.id-id.draft","target_line_end":160,"target_line_start":159,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[159,160],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"46a5709c1e26fcaee79026a20e724d373923368a815fec4e0cec83d831662b93","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8bf6883b1adf49a13b87bc75acf5748469cb015df6d99f2083cf4d4c3a227da6","target_edition_id":"edition.r017.id-id.draft","target_line_end":169,"target_line_start":162,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[162,169],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7417ada021a0d4f20d0a9f34c3552134332681e221e75ea6780a4be81d438459","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b57b42123fe1939ff770c56e20572adfbfdab1b7372cf78334ed44127651fd71","target_edition_id":"edition.r017.id-id.draft","target_line_end":246,"target_line_start":171,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[171,246],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e754acd44090af94a8bdd1912fedb1fd7d773b776cdfe50e310aeb12090d66f4","concept_ids":["concept.matrix-inverse"],"id":"segment.r017.book1.appendix.matrices.identity-inverse.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"97e97b53cac186e644b70599d1b32a7dbaeda3b0e7e58e57dffbe56ee15ac756","target_edition_id":"edition.r017.id-id.draft","target_line_end":249,"target_line_start":248,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.identity-inverse","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[248,249],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticIdentityInverses.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52b2dad0e092a2fa013853853984cb693f90c046c01c24bbb5fcfefddbbf81a7","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b8d9e075affb97377f3846294d918e70b9ccb784abe07074ac8f0ae24b7b543","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81e4577b9bf45ab09f19726731a7afe366e7e8df798d6c5af1a59b3ee6945c84","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f4865bc73d94cdfac214212813bca98297914a8fdfd0aeef874aae4f259199aa","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,8],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f1ed6a26f0a8c58076128c04c193f87b141927599138941a4873ca3213bf04f7","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a6f2b6ad77eda6975d4614e4fd94bd457f69749d1e2a3f2c391cf1a41430a016","target_edition_id":"edition.r017.id-id.draft","target_line_end":10,"target_line_start":10,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[10,10],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"28655eda93b914cd3db6409042ae7f41d57e7154e1b660e730480d6eb3b907e3","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4fcc3b2fbce1bd8ed7a7b61d2cf5a202415b8c19d155e207a3d71a76f4c137d9","target_edition_id":"edition.r017.id-id.draft","target_line_end":16,"target_line_start":12,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[12,16],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c5ed09241f85e260f13634b74bdbf37d092022a07df418132f8ac8e7d0d9a20","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6d9e1ebbf592f9c4da932e7640a98b6306bdaa5c68145ffc87e70d836daed624","target_edition_id":"edition.r017.id-id.draft","target_line_end":38,"target_line_start":18,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[18,38],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b2994c4e34dee3381a8d02baa8874f1111f06331b036837ad0d27344820d9193","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4c0df9ee25843081e9060474a787b047037d90b9efde56af12a261250575adb2","target_edition_id":"edition.r017.id-id.draft","target_line_end":41,"target_line_start":40,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[40,41],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10ee046261c88b46826169ce58cf250d923cca3a168b8dadd6d2ee3c9fd65789","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dd756845404f66c60c37a6beb6d96504c07f60f319c366bd08aaa76b2d6f8c13","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":43,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[43,71],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb097c2f9e9bd47079450ade8720e98eeaaabb3afcf3f6ada3c5ad2b0a502add","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"75570df0089507b490cc73613e98b91acc5dccabfc42750f93381a34da788bd0","target_edition_id":"edition.r017.id-id.draft","target_line_end":74,"target_line_start":73,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[73,74],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f560873379d494241d241e4d0d163682ee09f257808dd977034c57f4a4b91dd3","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a0e281f08a3db4c20a6d36e6af9b8cde82c1f9031980a6f69a9cf75fe254044e","target_edition_id":"edition.r017.id-id.draft","target_line_end":128,"target_line_start":76,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[76,128],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0bd6839583a0a603d98f32ab734b7a208989191f32a1bbd44a15895f6467b694","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72867c7e0c0b17c4e7f5571bcedc638a4181ad81812e4f24270bfe4f8d9edd9f","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":130,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[130,131],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a471ba84510c3c50ddac415d3848720c2d75921e8c346f7a92d610621c0c138e","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eb52f372a8e465dfefe36db04037abf85463d946bf7e2328df0e45ab6d221591","target_edition_id":"edition.r017.id-id.draft","target_line_end":172,"target_line_start":133,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[133,172],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d683ccb0b15c21187fbe87e620e9d637c0e5631895dce42be885f4a7b821b33f","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c244f227e0ffbc6662e484c3a6c5fb8aa132f982354b7ed99177a2484b28214c","target_edition_id":"edition.r017.id-id.draft","target_line_end":214,"target_line_start":174,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[174,214],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"13def2f29cb634e1dda32d8a0646a255810db50715294653cdb2f831e6d4215c","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d77831b62f0353d4f22efcee661051b76e97e3154081655117142a623ec78ea8","target_edition_id":"edition.r017.id-id.draft","target_line_end":217,"target_line_start":216,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[216,217],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"27f9ae48aef1f493b56b471d0f79f7a684ea8e7bb5f357736ed48f3c7e532162","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"60f68cbdba96dc5fb491be0afbd35803fdf0abdf1a55a4b5d406d14c8fe72a45","target_edition_id":"edition.r017.id-id.draft","target_line_end":230,"target_line_start":219,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[219,230],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14c2f0bae0901b7242d4c2626b448ef0c19676c23e146b548921a7a4dcf066de","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fdd0125af6b400353978f0f13bac24e9be032b143ab0068a92cf03f1c9e2e470","target_edition_id":"edition.r017.id-id.draft","target_line_end":239,"target_line_start":232,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[232,239],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a51e74d16125a5b5b592ab9e6ef4807a9a2c749dac6786d5eaa19ce86e129fd1","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7e696fea1a6073b9f6df5b207155e9686fe1a02d9e5bc71e8a33ee9aeff8f9c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":278,"target_line_start":241,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[241,278],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1dd2bac2def2d5c682e2a4f10a69e5246c88558ddcbd048d9b1219584713b1d4","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cc31cfa4b12532aabae22f35928ae8a51622c20d1f96439a892769432a604b20","target_edition_id":"edition.r017.id-id.draft","target_line_end":280,"target_line_start":280,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[280,280],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0a4311667aceee01f28018ebb8585b3c719db6a961560dfeb7258007eb62a80","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e52946b7409225a49220d28ac41efab0fe4dc9e58c5258f482951d83019d5a65","target_edition_id":"edition.r017.id-id.draft","target_line_end":282,"target_line_start":282,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[282,282],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"145b008705a0fcce428002380f630f40a55df3c1a35e5b91b43615977cb5793d","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"77202769c682842092c7abee81ab05d5aff3937dec5fd2c1909fc020fe0abf94","target_edition_id":"edition.r017.id-id.draft","target_line_end":302,"target_line_start":284,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[284,302],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c949314e086926b1d9b7576c48362e009ed57dc782d00e3245fce6ff0d5e2a71","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"18f6ff15085e29daa5d65349af7ecf69da82ec8773bb0023fb6814f583c8e4c7","target_edition_id":"edition.r017.id-id.draft","target_line_end":367,"target_line_start":304,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[304,367],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b17e69d4d05ac5ed453d8f3ee5b01d7a9c01b8dca1ebc1ff85d337dd9374c36e","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7837aad2296d7f34ecc7836b0f7f9ebdccc282305249c83a82bbb57e155fba0d","target_edition_id":"edition.r017.id-id.draft","target_line_end":370,"target_line_start":369,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[369,370],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb98c43df958118925bb5cf01528fdfd5687c2f32b1994543f37a0f2817e3529","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ac6bcf47ad7200e59565b7fd6c792bf2c41d82001a51156d432cd246a6f5f75e","target_edition_id":"edition.r017.id-id.draft","target_line_end":409,"target_line_start":372,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[372,409],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7506ae67838a8f37ed78a4b21a6bd2d0cfe776dc7838e02fbf9f18f6fa6f821f","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4152b050abdaa89a9c6e4cb4bab78216b6709c32cea635f2f4ecaece967efb34","target_edition_id":"edition.r017.id-id.draft","target_line_end":411,"target_line_start":411,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[411,411],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"312671d59d9e4fb0427fab9d3ef457b2c81c7a116d11b6979790eafc89d0c03f","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e347607b08d6bd0d8ce31e46b93cb2ff81ec7288f2f025b01c7895da48ed7da5","target_edition_id":"edition.r017.id-id.draft","target_line_end":419,"target_line_start":413,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[413,419],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"acd2491b761a1f1f7c5bf8d63ccdc35b93d793fe204acdc975971e71511602cc","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4415b826be4968563843dfe6bea605a5dbd1b21ddde880932fcd67b0dd59c6c2","target_edition_id":"edition.r017.id-id.draft","target_line_end":422,"target_line_start":421,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[421,422],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc3e635798f40c436180053c963a54918ea6f54bd96bad98064a7c70105d6700","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d3cc7581b635b12655ff7d69ce723cb0f6b98b884ce886b3e402126765201b27","target_edition_id":"edition.r017.id-id.draft","target_line_end":437,"target_line_start":424,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[424,437],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"642faba33a2f2f02825694d48856f08696d14f12f0916a0307108be0b1ef4195","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"528bd031dd57bec978d35237e290d2343fb7d178961a3abf93db154cf597851d","target_edition_id":"edition.r017.id-id.draft","target_line_end":444,"target_line_start":439,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[439,444],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df27002189f03f2a22372870aa031c479a8579af1a2560a89bda96706c51c509","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-028","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9b5455e93bf0d643e945f99771ea936e6bd29b8d14533b4cd31d4daf3b4d82fd","target_edition_id":"edition.r017.id-id.draft","target_line_end":454,"target_line_start":446,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[446,454],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e367f3e27d25690cd900cee27adb98dc70edabd62a3a1e7b45036f8dd1441bd","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-029","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b16be350738525802d69f6aa41d14964e26fa448a126053055edbe4c457dd170","target_edition_id":"edition.r017.id-id.draft","target_line_end":457,"target_line_start":456,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[456,457],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c61d3edb77dc4e5a753ff92a841f2cf4b56688a4bd0ec5b5ccd59401bc42c94","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-030","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e1ae60d4e057ef2973d0e9201843bb41988f9ebf1943dfb4bf7c0c19b5ff04a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":462,"target_line_start":459,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[459,462],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"350579a318ab63f75cc44f9c7aabd898c40e0d6ebee2f81e2f894aaf4aae013a","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-031","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"86c16d52c29b76ad285433c40489fec5fbecb4c62231314d4d19164e94ed7ba0","target_edition_id":"edition.r017.id-id.draft","target_line_end":477,"target_line_start":464,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[464,477],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6b1af16669fad241086a5784e461265518a56b316ad698bc53e3ad267a0eb2af","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-032","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf29d4e328b7adcead4a45ff6f7f83f3203884eadb953f9bc8cebc4562685fca","target_edition_id":"edition.r017.id-id.draft","target_line_end":479,"target_line_start":479,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[479,479],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef88f8f5580ce0822f25009af69cdc6f40dc434517a9d02c633be49c87b9a78a","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-033","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"404979fc2aaaaec7e72d3b53484416fbde2b6ca31f52e0d0a9bcb60523c4cb04","target_edition_id":"edition.r017.id-id.draft","target_line_end":497,"target_line_start":481,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[481,497],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"abfdb906ed0c6913f60d7b5f33a8c23dd1611df4c8351625b02bd603104e8443","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-034","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9d2899232808f998e3a081f11985d0ffd33a24ab270f5259750aaeb2a492ddae","target_edition_id":"edition.r017.id-id.draft","target_line_end":564,"target_line_start":499,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[499,564],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7535c9edc5f09eb3c3671dad008418c5e514d1153119a63ba415563cce38c88b","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-035","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"62a36b16a60a7baa775ec27d3397bf1b1ef72713875fe9f61ff1071eaddd1608","target_edition_id":"edition.r017.id-id.draft","target_line_end":567,"target_line_start":566,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[566,567],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"27edad32cff2ea37bba44666ffede893d049409c9c17e46033fbe3bebf62aa6a","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-036","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0983d4f69686a06d65c0203ad6ee0acb790a1d50911c13fe8e03f44c64ed183d","target_edition_id":"edition.r017.id-id.draft","target_line_end":581,"target_line_start":569,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[569,581],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe4f0d79ad53670e8675869a6b64471c83419a0a0120c6d0cf4ed428df63a7d7","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-037","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"071c4d81f82e9e9f09bf08c4ff4813ecda4cdefaec05672037c98a1932da2d76","target_edition_id":"edition.r017.id-id.draft","target_line_end":641,"target_line_start":583,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[583,641],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"12418707d61c32210efe05fd44531a9a3c746d54cb632d1c213b4c978f41840b","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-038","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"becf82eeaafb70a35f77a6f9e711393d1dccf5a14899e2b37bc0c203954c547c","target_edition_id":"edition.r017.id-id.draft","target_line_end":653,"target_line_start":643,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[643,653],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"876d1d9aa4c6656e7f0a2c9ef75266a873c7f1f925846a38ee29b50aac9358ea","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-039","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"827c9ac050f7376095c7d39ebc81063b1a5974cf9b9e590c52cbcbaa469bff16","target_edition_id":"edition.r017.id-id.draft","target_line_end":671,"target_line_start":655,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[655,671],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9f9410a1f93a0920ac4f6819313d9fdfccca497266f026e439bfc2ee12800ff","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-040","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bcb30517ad06bc0b63721298667a7f70daa5289e2cf686a10fe624daa6016a85","target_edition_id":"edition.r017.id-id.draft","target_line_end":676,"target_line_start":673,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[673,676],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"89bde001a36081c9cacd2e0f98342a3a215253e0ece37f7a07428102ec03c435","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-041","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8a284108e73b87fb52e360ffc5a909e56d3581d6b84394d57e81b0e784077e0e","target_edition_id":"edition.r017.id-id.draft","target_line_end":683,"target_line_start":678,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[678,683],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d57d5977c216d22468e0ea5d7d03c6afd4200affe709cdda5798c08ca23b1ff2","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-042","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5a51bb09680b94f75c324033fb6e5fca743583e0876a90872f81f93c61866d4e","target_edition_id":"edition.r017.id-id.draft","target_line_end":687,"target_line_start":685,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[685,687],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c265e6b838098d0c68655e2b7fe6193455886b9e6fa80f7d8e85007408aa732","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-043","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0c013bbdee98a5bb28bb7d466de2cb29b28ee749809d170618e566bf10b377a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":710,"target_line_start":689,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[689,710],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7b68f118de9c62eeebc76450458a08d5c31f74189ad7ae4c92f21f034654d5c","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-044","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f379f6b9ed0acb7312a5d2a559b5dbe1fa94cb3e1fd788bf9c89284e2972fb10","target_edition_id":"edition.r017.id-id.draft","target_line_end":734,"target_line_start":712,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[712,734],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7cd686d7a1c196ad8e98c229a346bb2d384f79acce83bf8fa7ca4757e803d424","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-045","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9f0f9c6f7c155ecb348816b30e691e698ef0407c2d0dbccd329c94c64ef79e83","target_edition_id":"edition.r017.id-id.draft","target_line_end":737,"target_line_start":736,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[736,737],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"46580f2545348807618f757846d220a1e2fb4d2f25acd27854015478e962609c","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.multiplication.block-046","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.multiplication","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d1994d1d139fb5e5601b0554690c89866848bb2634b882b12295ae99796692d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":747,"target_line_start":739,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.multiplication","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[739,747],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"68b0c3ff8ab1a7a91351b14be1b051097555f13b7adee09209a625c2bc3a8e25","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a52b78820f9e82cf1d0c91c3f9853658b8822d87e3d540360322f6e1d2901a87","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bafc76250628f3624c321de5738ca7dff8f5d9afe62bb263b165d94c3c89be54","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9e19607ad406a0f1e766f3b49007bfc2caa3eb5d7e5eba6baa36de6f4199aec7","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,4],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80b86720267e3e526b8a7aa6907a0ade6879cdfac131a27658d7b71738d54fdd","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2eaa38fe16e66e927da81f8931bf4a0510840d6abb3f9e841c7e04eb5f431c1b","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":6,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[6,7],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c221ef1362a15e662cebaca0f28111d4588bc42fb99e2032d0136b9b6ed885d","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e227ece21f0d9af62945dd16b3a348cf11ee608ce5e403099734e00670ad170e","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":9,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[9,26],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aca1149ac5a2131b7d5dbb930e8446e396828aac4815d204e89ac5375fc0f01e","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"93852d85683d8e9525bd1ddef687959c8a55015d2769c9ec6b4e540705c69ec1","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":28,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[28,71],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a33ba96148b824e553b3f9b51f202cd600c069612045635123f27cc3916df20f","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9188fcbd6303065a173b9d2fc9fc37e42e4aa1f6268b74ae1ee0d9b6715ab239","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":73,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[73,77],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c938768732cc1cf6711512c06fe1be4de150991d03a1aee9528a7e340b402ee0","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8a5ebe2cb5bc1fbc574624a5c05fdf78bb45693d4ef778c87dbfe772218570b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":79,"target_line_start":79,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[79,79],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"560af5638897ce154da193675d06d485c01ed3af5ca99a7be4637a012d1dcd5a","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7569f82c0b9b9ba469965a5f5bf7bf9abeaf29e51258603128596f263126a4e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":106,"target_line_start":81,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[81,106],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5405e696b4f6f9273f4eeab8c20a7394ba43a0107b7a74c898583dabdcafba5","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"df41d71cb3c20c03c63f3dcc39ed6615569cded82768aded80bd7d450d3f50bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":110,"target_line_start":108,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[108,110],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1bb0ebaee4bc8b761def6bff850ea39bb219521fa94afad7ec4e727669168767","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf29d4e328b7adcead4a45ff6f7f83f3203884eadb953f9bc8cebc4562685fca","target_edition_id":"edition.r017.id-id.draft","target_line_end":112,"target_line_start":112,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[112,112],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5ba747fc344bf05f789041d07186b83f1fc3b785febfdd90748217a2324ead8","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d9742ba08f349aa97a48dca592155a04b8fad8411adbef83d201ef204ed9b4b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":114,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[114,130],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"245c7ba7b50fffdba752af3719d9dc20c3c0858912bec132d00c5cf2640885e0","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0c8555fee3c1aa04dd26d2696b7836e9b8d5bf067d6aa5772dc9bf0561e8c558","target_edition_id":"edition.r017.id-id.draft","target_line_end":182,"target_line_start":132,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[132,182],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"054ee82e8e72002066b71d0c93c03fe00dec2ade70a8450e5aef256f74b5adc7","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"95ea567a3111ec14c8b08c19e53aee462f4d13dc47bd81f3fc59d79ccc43fff9","target_edition_id":"edition.r017.id-id.draft","target_line_end":190,"target_line_start":184,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[184,190],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4952100de2d9583ab76facfb64d7a294bc9ed5de884ed8b96e52b330911adb88","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"90718a82bebae4dbbf8a081637e8987ecc9e6217f3333ea830486316b5f177dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":193,"target_line_start":192,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[192,193],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"794e96e2e43aca9603a17b84b3f27dab0b8608e38c3198bf083fac399bb9420d","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"da217b7a40c4b181ac2f3aab93e4cc522719e33e1d5d5f6da688a8a724c818b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":195,"target_line_start":195,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[195,195],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f38dc1196567321ecd7ab017312ed9de8b9ef9e7fb4b46c10a8d0d3970915414","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4d28babb4e4a2daf563de3af01b9b34b8dae470ea8a1330ebe8b8170fd03de65","target_edition_id":"edition.r017.id-id.draft","target_line_end":215,"target_line_start":197,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[197,215],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9adf252a30d4b417950aff00e356aba41f226392ef19991cc3086b4e0dedba9","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cd242e1b1f0de913db176d3dd615c228e7baa99f6fb08e8cf79bf21f9be8608d","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":217,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[217,219],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e06d9e936a436f126ac3facee921751486e798f62af3e95781e73e51c19e4733","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ec2175a3e8dda2b28610d90c96e9f0293bda3f8b842cda68635fcf3f2da03bd5","target_edition_id":"edition.r017.id-id.draft","target_line_end":270,"target_line_start":221,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,270],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ecf06437dbf6f1ddb26770f895ee275e508adbca324fe8321115dd4e4dcf407d","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"39aaeb738930a561553d90f3e58b8928040d9eebd46c1f68971db3e35815499c","target_edition_id":"edition.r017.id-id.draft","target_line_end":272,"target_line_start":272,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[272,272],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"01f3d312f2d3dde9a0d8fe1441b7624505b4674dfccf77df620fe7a11ed330dd","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.product-entry.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.product-entry","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8b5e2a8d9d43f4939e6d03c5b78e9e79ba7ee07946b359d100bf90de03b0bd72","target_edition_id":"edition.r017.id-id.draft","target_line_end":286,"target_line_start":274,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.product-entry","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[274,286],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticProductEntry.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"889908c7ead064135d59a2191f0e03fe9d7d8f8c41e87c9d3893b10e9478a02c","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f5dae4af60f7fb3ed9a663c25cf828d7f63e9b05c19674e9ab9e195d3f4d748","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0c4597fe12075dd380a0ad234b1967794f1f154f7cb7a469dbf7b679d631eb6","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"44ddaa85881536f976df4623f17766a57ba9d9b509e08c67afbd3a0d76563a6b","target_edition_id":"edition.r017.id-id.draft","target_line_end":6,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,6],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c2c08e589d43ae134d8eaba96cefa19cd803d86751a28944e6fc6bcab6e694c","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6fec3017c6d5dd08060a48f9848a8f09967031723f62152c9a27340020a75787","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":8,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[8,20],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3576b4985e2d994a45c76b15e863aa80e6729f8338eb1d33838d1b9d18187c29","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"63c2f2736388bb542cd964fa40f4a6ec03df1ac088b1875412ff6f362fa6f0a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":64,"target_line_start":22,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[22,64],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"34bfc9ecb509f86869075e00047ab53f56b2691014d11c0e2586a64a6675881a","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a3f7e834fdb36a05f427f2e75d9d68c43d1e4436422dfab71e3589c510f786e7","target_edition_id":"edition.r017.id-id.draft","target_line_end":69,"target_line_start":66,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[66,69],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec1f669d87857720c21a72f9ce92cfd3f95bfae1d43001de94a04f3aa24d2424","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eaa3b248f219f7fd1dec4ba18cd17845addb14ef2d2ab27f33fe29c7cdea59be","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":71,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[71,72],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c941db7993d1198a0b793c0144cc755e66f1c9d64cf3bd4b1725ff680c5d8a01","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9d178d4682d1a1b4b7a0d102c6e141788bed219467bfc9c10d248fa9b1d5290c","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":74,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[74,75],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84be0792b9aac5c009b48f11725278d96becb2609dcb101d9bc9c80a91694c65","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9a8434034cb5c88c4cfad872f48779485195f85540daedc826d2d21d26212edd","target_edition_id":"edition.r017.id-id.draft","target_line_end":79,"target_line_start":77,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[77,79],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5a4fca348ff7a83c9fd19a31753c374aa0e825384596cee6e40c5518951bffa","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"952bd5290426aa9b305a66622d00636dc42ae5d2a03792f53df8252ce9e5ea0c","target_edition_id":"edition.r017.id-id.draft","target_line_end":83,"target_line_start":81,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[81,83],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab72a474025890c2d9d15fa69c8323bf2826873c3001a79321414ab73b445074","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"110ab61a5606012b42a51964888f2bcd70804a274c13ddd58479af7ca1dfcb3b","target_edition_id":"edition.r017.id-id.draft","target_line_end":88,"target_line_start":85,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[85,88],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16bea10cd4f6dbca6ac4cbeced9c337d3d0271a7754294b05a60dc86b3694b2d","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"975a84e9aa7b5d696279a93e3d993a050020ed04be17837c51eabcd2545220dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":106,"target_line_start":90,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[90,106],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b13f504ba385320d1c5737e7d17fa8de7b6bec3be13f6e5b879f94f39aed3778","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4fbeaefaa74689e7843f1b2afe9506aaa3dfaaa92ffec58267d832bcdb2436c7","target_edition_id":"edition.r017.id-id.draft","target_line_end":108,"target_line_start":108,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[108,108],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8265537968777f61193f2f71aac53cdfb2c90b95e6d23217a42ba7195f48dff5","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.properties.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.properties","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1b9dc981ab41ed2ef4f865ee1d0dd12c62f05f65f7af36230684e5d07458758e","target_edition_id":"edition.r017.id-id.draft","target_line_end":122,"target_line_start":110,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.properties","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[110,122],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticMultiplicationProperties.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3cdc2b47ab045d4dfe8584ade74ad08cea6088284acdd71a2e0451a43ce32e79","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8c8fd155848f95eb70ba8ad9576948a45291a4e1b4c7d92b8d6803232b66a084","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0351d03dadb3e39e6e8a6bc7360bad86e35cc03b7296b018ffad223393a475e8","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6a5f8875dec3627a07ee98934f93576f7f64d3c13b6b0f2933ef66a102adb12","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,20],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d76074e6cd1b16387f272ff4f03917731739745d599d5a5814296cc14fa764b","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"130b5a974dc8e734092afb02b866d974226f362646a253500eecbc884192f1e9","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":22,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[22,23],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"029ee176300cb50c863f62d9cd03022581860cd1c4a6a45e3146395b2828cdf4","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bc81ade4b2d1e55f59d55e4fc85184492ab131401cc46f30bdc195692a328b55","target_edition_id":"edition.r017.id-id.draft","target_line_end":25,"target_line_start":25,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[25,25],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"347a7af6a73c21b663b07d708625efc2d7c66a0d2df17ba555de878157ece2d6","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"75fb93e7cbbc96f04fadfa433a43ce3f8928d086f79d3a9146a7617d617fd2d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":30,"target_line_start":27,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[27,30],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c1d4886b9bd5a31ee9a4b3609c2543e57067c8cbffd8458e1898809877908107","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf29d4e328b7adcead4a45ff6f7f83f3203884eadb953f9bc8cebc4562685fca","target_edition_id":"edition.r017.id-id.draft","target_line_end":32,"target_line_start":32,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[32,32],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"68ed08bf71413be0baddafbb9c2f82701173f854f19244ca4d4302918bbf1d20","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a493bd8fb1d0e932382130753077c072c38552d0e4223e309dc3879485ade15","target_edition_id":"edition.r017.id-id.draft","target_line_end":44,"target_line_start":34,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[34,44],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7d7bfaea474c99ce98f04b77590df285dc5ed8e5a2002f8293b2d2b85e291560","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"94d9b59e4d38a508e1de908bc9f3df1fd499860bbf9a9c5c7035928cb61d842f","target_edition_id":"edition.r017.id-id.draft","target_line_end":70,"target_line_start":46,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[46,70],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a3de861987d93c0ab0f2d56ee2fbdfee734d04628ffe2ffa414ec346e672a364","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b64f5fd3492747b868940abeecc2da3ec9a2389ef5aaf8979694943d8aa62e6b","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":72,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[72,72],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ad0aec18cb86f0cebd4efabbdccc3f2931c089640c8280a102aa41a8e9db4266","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"01211696286158594a26b424943e9f58d3a413292f17f285f78aa19fbbf5de8e","target_edition_id":"edition.r017.id-id.draft","target_line_end":80,"target_line_start":74,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[74,80],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57fdcfb2c21dc7e0455d72e6cabab3be025d3fc12dfa88fa38d667eebb094306","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9f46c8cdeeee4f1264332ce95401d4ee7dd9c8aaff7aa4da224e8b05dfaaf7d2","target_edition_id":"edition.r017.id-id.draft","target_line_end":85,"target_line_start":82,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[82,85],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b91309b7cb0fff56e1565cc580c0c35ef651d6e889408fde48e172c77d324f81","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f7db4f01a38295fdf7a9444cbf9114b69861ea65b4024e8ff93a015ef64083f","target_edition_id":"edition.r017.id-id.draft","target_line_end":90,"target_line_start":87,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[87,90],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f368ebe321d8610e901996c7fb65dc26836d9bbce804dd5d87c0b9ee0f2bddd3","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"130f2b503091b2a3c8d63fce61e7d264c5d86ddb3f300be09b11a2fb3aed41da","target_edition_id":"edition.r017.id-id.draft","target_line_end":96,"target_line_start":92,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[92,96],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"747a562813cd5cf0c0ba7fdab48f25d882bcdc9f0d973f0f94c357f0fe43df43","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4264cda86e857f7690cd83dd0e7ad1741aed0140904d6c0114784b541ed74228","target_edition_id":"edition.r017.id-id.draft","target_line_end":98,"target_line_start":98,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[98,98],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fdbde320f0e53a39ecff70a8bb645014dd86228567d10e56d222136ab3737f16","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.scalar.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2fdacbdc00a9e79d8ea1753d9de08a96bb0257737677262b5ff76c92371de0f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":101,"target_line_start":100,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[100,101],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticScalarMultiplication.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6c0572dd57a1eb373381066e823782fb37eb7f44cd685bcde33165503875c49","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fa719d6474aeb7112f7d2000b37ba994ee7d6fce2a4a64e39fd5100b4aa743f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"717010e93907c65832071e943379ccd82085fc15b49012486707f9af80856431","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bc78379e7d56188408f4a682cf90080283f6c97bb6514b88dcc29a3534f43159","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,19],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9a19b025bba6a9e41167e671a441cfcf0b6cde2582050c761f9f7cc2515a9b5","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"063326230a3eb3ee341a12a4b990246feba3705290768f4ebda3e6b92eb8d387","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":21,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[21,24],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d334f76371dc10d87d8c2a1872e4c53b6794891f134e3a5b5bdc084e1f6b22c","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"17370fc8fb21642c3bb3e9cfc2b7e740840f0861bd55799ca891014e44b3c326","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":26,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[26,26],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"932316a6e2f90f6384dcd2487c373163eb63c6fbae143951372e837032f3b777","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"48dc3e2fb293c9fd106253ccbc54ce237838876c46dda38f4d107b6dc0fcb8b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":34,"target_line_start":28,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[28,34],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d32d200b3e9c9df4583bbf0344101a3cbc27789f35a336d570ba4b81b46cbdec","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f59906fecdbe1c2baaaaac8ccf516afeb25b8d25c8e8e96362ab11a9833c1d44","target_edition_id":"edition.r017.id-id.draft","target_line_end":37,"target_line_start":36,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[36,37],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3bc820d0c4a41928d456b2535efc3be2f3354865c58ee3b03a13e108dfec6176","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf29d4e328b7adcead4a45ff6f7f83f3203884eadb953f9bc8cebc4562685fca","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":39,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[39,39],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"600f0de135a90df45f804b0fbc42b2d7430701aedc2d06c3cca9086c0265559d","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b1f730f929ef4e0747dc9e02e9889255b72e238372cfc0e306b88a517200bed9","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":41,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[41,51],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b72901eed36137adaaefc6b3dff2f87aee8a08be494a6b6482e8ebbd5708e437","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bead0c3d2e45945df1e1dc6dabae0270bd0dac6e8566dea19b78c4c55188065b","target_edition_id":"edition.r017.id-id.draft","target_line_end":56,"target_line_start":53,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[53,56],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2599f4c2eeb915273ea69a18f446f0763ed1d40ab8ac3b308023327d54b5eefa","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"01b61d6a786f3c1696f298d74b1cd34ea15b616c4d05720a5d6e606b4bef46e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":68,"target_line_start":58,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[58,68],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3fab01120902a5ebd7286357781936ebcb0c83c1a9ea7f14105c7c1bce33bd2e","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"abaa3482b93ea0f27852e862afda675d031e7271cf5b19e920a1c5e1f94797b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":70,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[70,71],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"113f8bc5559fd51be77cc3616b694ab21189765d77e2aada4fa5a415cb5e1b03","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0af3d49131cdd45d3c792edb01dca9dacff09acf01427faea312d662f1ed02c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":73,"target_line_start":73,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[73,73],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1fb78422f45fcac53e24fd2c4cabb2e03595a7ea2361ac7f8e19f8515234f827","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"de7ec1db9759da5e06b7063cdf58c45983afd0287d638fc853f8ae3ac44bed21","target_edition_id":"edition.r017.id-id.draft","target_line_end":85,"target_line_start":75,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[75,85],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a113d727cc8c19ed870c6268c6c35ce2a145d5a6ff889d3b92899e0c177e5760","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dd96d563867371ea55ecd9c9f42a67cb3b146015da07a867793d721e25e65a91","target_edition_id":"edition.r017.id-id.draft","target_line_end":100,"target_line_start":87,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[87,100],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a43a2b53226831e25d7272367239d52cb25750598ec1c74e50314de42954b91e","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"70bd5c8b77b09dea78f5aeffb8a05b06a31bda5e0bd87a9313951c2fbcf1d9b0","target_edition_id":"edition.r017.id-id.draft","target_line_end":106,"target_line_start":102,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[102,106],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"89d3151fab8b7d82ffc5688c86d5cce26f9a3370dec495729669ccbf920d13ea","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"af42717537b3fe5506dae904277f66fb37095f3ef58e3d4aac10326d4bbfe277","target_edition_id":"edition.r017.id-id.draft","target_line_end":108,"target_line_start":108,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[108,108],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"802667e9a90ae4561db99ce849844b549ca0bf16a22bdb7aa69c0b8797ce83e4","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4fc8743cfbd5ba44c3631f6cc1fd3051be7118421731c4dfca6a1924285085f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":122,"target_line_start":110,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[110,122],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0beae5920c094410b2ffe09430152d094bc06457c61863b4aaee9f3bac527c58","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c17df630616f8b1adb956d344ce0f315a8739a68d5954ec0262d1fa9ef284fed","target_edition_id":"edition.r017.id-id.draft","target_line_end":137,"target_line_start":124,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[124,137],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39e15cae7451578509013f211efe83eb7d52142c4c98b279e5e5f434ced3105c","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0fba6a8389dd855300879f9e2a1027b9a31727deb01593de326fa6b163c4e557","target_edition_id":"edition.r017.id-id.draft","target_line_end":151,"target_line_start":139,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[139,151],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc0565907d11bfcc4bdb715ace0b32b0008568e786f62e9d5deaa7020d98f2d6","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f974eed59ddad10dbf331a6870c281337c92427f7b192ac220ca5484a7e66ff9","target_edition_id":"edition.r017.id-id.draft","target_line_end":162,"target_line_start":153,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[153,162],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2800d71abcbdea6d9f4ca99cf3163d2e0232f9f7b9cbfc6e0eb7c7eb1b971ad3","concept_ids":["concept.matrix-arithmetic"],"id":"segment.r017.book1.appendix.matrices.transpose.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.matrices.transpose","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"50b740af4fdfb57d9a6700c581f24ca95862abfa224730701460d5962fcfd61c","target_edition_id":"edition.r017.id-id.draft","target_line_end":167,"target_line_start":164,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.matrices.transpose","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[164,167],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/matricesMatrixArithmeticTranspose.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"160427ca69c96ade8218df6ffca98f927cee82381c7240dd5a2059833eeb147c","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"01a9252d7d5960c6e0b8f0277b5eebdfa2ad20540dfe091922950a22a1406cf1","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ab9577f5760dcdb78124b361e21a77e72f07b61b4398d130fda0b3c173f640a","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a50cf26eba9de5f177d8c21f6b7d967eedd57643cfaf65a6525608d2a006440","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,3],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7dc3c093a1de032f08d1a0b41705041ae58be9db6f79829ad9cdf74e0d2c3a8","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"71d3ab383fa822bba532587950565297cd42430c0e32065ec5ff8cd1eff4a5cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":5,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[5,8],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e68c372ebf313b5c53dab7696db56e5d716233a06d0c838b516ecb6c8cb8f1b","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0f045f0041fdca6eb6b98f1a59d48be0a59b57590f756eb7da9ca478c05c8fb0","target_edition_id":"edition.r017.id-id.draft","target_line_end":13,"target_line_start":10,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[10,13],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5526d4469aa579ecdeb33e425a34efeb69f53362462efd2405cb480626663bf","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"771ab18f4c78ab333eb4a4ec622b22b088f070f9d34e7680f0505729377c697f","target_edition_id":"edition.r017.id-id.draft","target_line_end":18,"target_line_start":15,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[15,18],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61a80681d6bb36c522d5d6c843cdb118c6352f7f347478f8fbcb80de5b4c90ed","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b9c3a83a1cf232600ebb1fe45059e196156a0d91fe53f5ff6f3eeae3e24534f","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":20,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[20,28],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64229dbe14bb7735ae7129fc0b5f1c8da64392ed54d11cc2fa41c89f2e3c6e69","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9a5a8de861a8dd441653f9e85cc4e1b78bdfb00c7d2c76485b9fc0989fad6b1c","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":30,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[30,31],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9aa253ad560fa6e182ed5742516ce1d6b1089bfa7b0b035f8ab6413345959664","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"58c33cbb3ab9e6a3ea20e03c2273e1be96e233124a4708a3d7b18550fc9534ed","target_edition_id":"edition.r017.id-id.draft","target_line_end":37,"target_line_start":33,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[33,37],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8af5a7ce59a02c20371b36796f04c50ebd6ae0b9f34a8fa551b4ba28c91f0c15","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cbbad8d7fede4b9a02f3dc605c3fd2a40f5c05a0a01fb1c0e4a030e433d905f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":39,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[39,47],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"28cf1af50dc7e3873fc69e81b017bcd9a643fc90cc1cc9bd264c1175afa7ff7c","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c23b815967af047e1e18b664c8cdc3a62096371561ca5d6da0df7cc63418177e","target_edition_id":"edition.r017.id-id.draft","target_line_end":50,"target_line_start":49,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[49,50],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aca33385e801ba7bb8e1428f4d35c027a64297edcc01a7b8618dfe3a4d49ac1c","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8853ed0c8a64018750bdec4a255038bef682a1345206be6ab82cbaece965fdca","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":52,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[52,53],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"207e91cce3ab544bb342d6acac7319db583042440c53a29ce0a131bd10710e8b","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d3285888bf7019b9249db87011e2fa0a3cc8f9c33de931b638731690f56ed81a","target_edition_id":"edition.r017.id-id.draft","target_line_end":80,"target_line_start":55,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[55,80],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9519c578d18a0b086f2f9451fa13c5dea018e3a9e74b3aa3d3b2839197c1968","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"63bd506b6082ac36a3302c49ede8a503eda0defcc07c754ccedb773d82e00e0a","target_edition_id":"edition.r017.id-id.draft","target_line_end":86,"target_line_start":83,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[83,86],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c66f0ba2f2ad60029ccfc480d13c8a68cf0d30f24eeffd1100ce964c8b7c8b6c","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4fb95e3d782b0d0b35843638ec8f15bbe36525dec691451e18398531f377ced5","target_edition_id":"edition.r017.id-id.draft","target_line_end":91,"target_line_start":88,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[88,91],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd83a51822f5dc99bbdfbe77ec4db21a8e339e222ca577cfd60d7c214163eaf8","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c386c347c4f5e3ad6ffe64663a6c230f1142667d93ab00d4d30b8460cad2bd73","target_edition_id":"edition.r017.id-id.draft","target_line_end":94,"target_line_start":93,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[93,94],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70586ced730ed7d8f96763583f2f579ada29785de1b42351247bce040e335919","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"119080f03191d067e9aeaeb4f85ac4437c52f088bdfe9d9ab83637b0b8bfde12","target_edition_id":"edition.r017.id-id.draft","target_line_end":102,"target_line_start":96,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[96,102],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e555207ee473f5d8940eceeadcebed4969b399e9005c1a907f3b71b958f541e0","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":104,"target_line_start":104,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[104,104],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d3f3844fe9ae2cb26c5a9968c9ffe633c0c5c611f13e13bb0474e52fdbca7d1","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"20d4f867526e778f21d9efa8e6cbed9a7e835537147f3d032b63b2faf2c77ba2","target_edition_id":"edition.r017.id-id.draft","target_line_end":107,"target_line_start":106,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[106,107],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e4c0a66ba2d8320542858b9aef41c6ed687fcd1b478b7b130d4b0fc99bbc6a05","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"51972524fbfe17d693d53d7f5d1ea715d70a7f488bd573c26d3592aa49cd402b","target_edition_id":"edition.r017.id-id.draft","target_line_end":113,"target_line_start":109,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[109,113],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"306b904ad587b733057042feb8079375093fe55f0b134f7acd78a258de13d18b","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cc0669e42a1bc0c952c94b96f45997a0081af0e4d04aa4453e8517cb0b9cd522","target_edition_id":"edition.r017.id-id.draft","target_line_end":123,"target_line_start":115,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[115,123],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cf5621ddbbfe254db54195d344232c746613bda96af16051841c8f055ccf1928","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":125,"target_line_start":125,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[125,125],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb6e8a3f429b83b049c357c54ea5f4fe19b091602f3f833b6f87cd3522d0a886","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e024b3fd9bfcc50f6bae6a2ec12aca453880418601ee5146bbbe0c6c36455ceb","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":127,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[127,130],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d08e408da38187a47446d514493498d7818010182db9cb697ae397df56f50a4","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3b9d263807e8f281e846fe30a62beeef1e8168c63a3c2355cf8a306d30b56a3f","target_edition_id":"edition.r017.id-id.draft","target_line_end":140,"target_line_start":132,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[132,140],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"728dfb95f4a43fafacc90683e5267e3c1a77eff9f23ce1970291848c4d33b8a2","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition-meaning.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"11ecd338ef9a0c69c82dd2f9dcff76aab737205214bed7f1654a9f18359675be","target_edition_id":"edition.r017.id-id.draft","target_line_end":144,"target_line_start":142,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[142,144],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAdditionMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6289fbc0a42b7a911c52c3ac37b9bab11f3691beed5efdfa40aa16f101fe8b28","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2b3d96d38923ae0f1535280e01ea6d4ac669c13ead3ce1f6384926b77463d597","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c9818198699ec67ac2302dc3530b99c292db05fef4f55e6e4620fa65539d414","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"08e23d62b21adb3e958db45f2be1ee536d133f6113f0591222ae3a675869cf31","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,3],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e760136ad9b2b54b178e9bd882ad650ab01f015633b7e2841477093a4f2774f","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1d18abb269b036ce57dfc6f842ed78b6457d9228d5618e1767a8106a2451ee93","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":5,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[5,36],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ccf8c6f09454f93ee2ac4b7f5b89e03a63a5f626ca6daba3046edfb7748e2c7a","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1d2d7712bbb903f9236da4b90afa0ba30bd835424a3a8b3fc251708dbbf35b72","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":38,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[38,39],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8440c26f35689291dd768183f4649363e1d6cf308cf10b30af4e172bf174e02","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cca615e4b5b48d2f345a4afe8466b37c3fdf8c07d021d766b4272ea89777d038","target_edition_id":"edition.r017.id-id.draft","target_line_end":41,"target_line_start":41,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[41,41],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3cef1688be047aff70da5bf557219507592b72ee7e2f6bd8dc6238189be9c370","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b7b0728576abca61894ba762de744f693e2a9ebdda806bf6530b597525aa9efc","target_edition_id":"edition.r017.id-id.draft","target_line_end":64,"target_line_start":43,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[43,64],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c8e909fc74aa3e42926b09932c702d00933baa5e29e4e75c3403a2854a830a7","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.addition.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.addition","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a683c7b060decabd79ab9ed0279a0f99c807cfa93ab5e0152453b9bb817882d2","target_edition_id":"edition.r017.id-id.draft","target_line_end":74,"target_line_start":66,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.addition","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[66,74],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraAddition.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b9361ab07ad781fd3f58fb365e6abe6834beed7e97b96040a9b634f2885e0b7","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.algebra.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.algebra","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebra.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7a1021acd5e0f352d7ab2ba3ac490ef8547e9342fa13c0f4a8563e4de271791c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebra.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.algebra","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebra.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6bfd4f9b3969a255f032866f16fc24ce25e009a0c634c49b7aa65100e9cdd202","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.algebra.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.algebra","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebra.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b22905b2195f8a57cbc41cbb93764c5f58ffd604a4c546dd75290280206e7207","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebra.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.algebra","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,8],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebra.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d7175ae3ab853137b92a80c7ad63c7a0d98077eaf806d1a77fd79cad7ff85512","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.algebra.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.algebra","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebra.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3c035edee9e91d230aedc4ce01f86671b84d02e926c35897878ce75d51177831","target_edition_id":"edition.r017.id-id.draft","target_line_end":13,"target_line_start":10,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebra.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.algebra","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[10,13],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebra.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64cd311c5f31638e26a16e2de3a8f3a2a56f1acb8808f413b2c5c85c1797d315","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.controller.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.controller","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectors.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5f0ebf5fa2fa9f2a65ba249b35f3db09ae36ca1ea690fc5cc66c5d8cd9290658","target_edition_id":"edition.r017.id-id.draft","target_line_end":2,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectors.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.controller","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,2],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectors.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c71250f0cfa5040d2ecf73cb55b839cee7e3f13361ee1c485f8f9c3daea8910d","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-controller.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-controller","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProduct.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b12c050fd589283406970d69c9e6b0720395c3ba06935def4c66abec4da233b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProduct.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-controller","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProduct.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a9910fbe8697b9a5598e380ae95a16bf0220620e0ac1d6a3accca1108188ce1","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-controller.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-controller","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProduct.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a50cf26eba9de5f177d8c21f6b7d967eedd57643cfaf65a6525608d2a006440","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProduct.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-controller","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,3],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProduct.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"30603669472a2c507b791047d6273c3d68b8c6e1b1744a6c3723def6a8e06afb","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-controller.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-controller","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProduct.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d490b3b48b5e19279a752fe0701246c053fcdf8dd17442f2aa7a781bca3a58a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":5,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProduct.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-controller","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[5,9],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProduct.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"21efaa6fa72c53b44373a2ae5ed86d9d2261c55bfa95d2690efcb785339f4c02","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c16e5ca10988916b6411c2049305964187dfc4c03932b62ab67d54ccea334f5e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8090da0d91437088668b7dc9a3f6213fcba9cd7566c242181bac81c1bdf3d44e","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fb4d1189f766d3870531c2b4f1dc319d6fdc3665ef6c7bbac96f58e1da8dfdce","target_edition_id":"edition.r017.id-id.draft","target_line_end":6,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,6],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ddb514cb56591bae38bfd34d874bd5f3fae6924d4f97f05cb7c271829237bf4","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0ce8107e128c62215256e86cff5b462cbb9f1d73159f39ee51bd5a3e45f47b8a","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":8,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[8,15],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d4752730c6ca8516928c50712903ae5fe3254da780d7aa8de22b0081a3074b4b","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":17,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[17,17],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b69145e3085e7a346423bbc03778bac9c1ace64b26577b4d3ae66979038932b3","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d09ff83d84b26c2d66a77f281262bf7d99160b730209d5b356e884fd5c84d7b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":19,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[19,26],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f3752573971bd9641c848832235526e0b9af76d61965d564cda11715c6c03a07","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ebf779a431eca12a1d8dd4e3bbf12cdffec390f29f3825eece2ebc15e863ae9e","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":28,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[28,31],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"54feb37e069c336cc1987c1e583bc694c1c502b028a0accf9cf29cfb978ba590","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf29d4e328b7adcead4a45ff6f7f83f3203884eadb953f9bc8cebc4562685fca","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":33,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[33,33],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"89f1fe8f06d9eaa804eeac358256ecfde57224c8a78bb9403cac7641b571dbe4","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ceb19a633ea5485652f04e9cef613445de50409540c4d83a6bbd64893ba4ab62","target_edition_id":"edition.r017.id-id.draft","target_line_end":57,"target_line_start":35,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[35,57],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ad9d75a88533810d663f482ed63e89a36aa3b12e9abe4be479c792601de8924c","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"14b53218f77b66a5de3c51f97731352fc393cd7ed895202ed07594fcb1effa5e","target_edition_id":"edition.r017.id-id.draft","target_line_end":69,"target_line_start":59,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[59,69],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"475d24bb68c993fba2e84a2e39e9846b338e1cb39c16f65a4960d1e37187fd03","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fc8e1a0639a2315c4300aebcd381509115f33ecf1d1eb2e87361d380ebc5569e","target_edition_id":"edition.r017.id-id.draft","target_line_end":76,"target_line_start":71,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[71,76],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dbe5f49ac128412bf1db3aa5f65a76ce708b8727e7903e7fef4e21abaaa644c0","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6d3c65f73024a9077e6dc5eb6ac7b3e984eddf0c491c7c352d956ae00dc308cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":92,"target_line_start":78,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[78,92],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c93fdaf21f79a49b587f41c13a1725a47739fab315195b8fbe4fb51c59fda0ae","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9d104bae2da09cbd0495a53289046eb237077be7e74a6ce49f9e3ba1742e37a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":96,"target_line_start":94,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[94,96],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19178c7183a7ce7bcfd457c469e6279f2e811d17fe4135244683da51d070d64f","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e3158d61cbfd014199c96219dee0619ed0cf1114e463b83ce3c9b722c9301b8","target_edition_id":"edition.r017.id-id.draft","target_line_end":107,"target_line_start":98,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[98,107],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc60c6792a391b0aa38e280aeebdc5ef93b96d602dcd3a7efdd246863fa57650","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9926c1d1dbac261f836605e3e8602e5c6cae7739ffb1d1d3374462faf692d6a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":161,"target_line_start":109,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[109,161],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"510ad628873c18649a22637f8bf75f5a2fcea15fc0f5627104a173509dab140f","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e15830c9c4f1aadf808e180a9d810e7385efa4a7bfe0253f11ddf80cfca257dc","target_edition_id":"edition.r017.id-id.draft","target_line_end":166,"target_line_start":163,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[163,166],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2cb0606d8446a50708755834e99344d25542dc533a785bb40db4a1ab95a2465","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1266ff139834acbe86ce18a6dfc284ee511aabaed3ef09fb65f3481896a43010","target_edition_id":"edition.r017.id-id.draft","target_line_end":185,"target_line_start":168,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[168,185],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f6b592fe79fb79f343724554dff6bc6824119993d02c91938589465804b2a902","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0f04033b05316b221877b9f8e3b994183c9b87e97c73284439dff52c2e4f9581","target_edition_id":"edition.r017.id-id.draft","target_line_end":193,"target_line_start":187,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[187,193],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4729a89d6f0fd0773d848cdf30454968fcf55469161da7482f87c12cbae2df2c","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8725531bf0ec32a5b2ceb0178784181d3d81507db4dffe15487120e7daf0207d","target_edition_id":"edition.r017.id-id.draft","target_line_end":198,"target_line_start":195,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[195,198],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4460530b16c7cb7e173595712b72e272628febfffb5902295b6378ab8f1a7aab","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7cb63b68eddaab60fcdfe770434fc6f04bf5b23af5615cacd0c702472a04782c","target_edition_id":"edition.r017.id-id.draft","target_line_end":200,"target_line_start":200,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[200,200],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"542e74f14beb0d1ac59db838ace0e1ced2fcebe4d876429cca4a080c31410c6b","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9a7cfd89fc2bc1a1754ebe44fd351a4386a7b42fd4aa5b5d3013c9a79077ea12","target_edition_id":"edition.r017.id-id.draft","target_line_end":205,"target_line_start":202,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[202,205],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d7f5955b2e85e842a510491f4b3c43064c32a316c3d2ab69e1b811688c0bf806","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"32ac7d903253b8033599f0a6e809ded2a767833e69289c177126876068a81c22","target_edition_id":"edition.r017.id-id.draft","target_line_end":213,"target_line_start":207,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[207,213],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"77086cfd6f9227eb98862ec32ee32b7e9d260eccfd38317681799cf0cfacb01b","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"85be18eec9a97b0c5a98652e4138944922d533d3e65fbb79ab1f9fd776ae7a63","target_edition_id":"edition.r017.id-id.draft","target_line_end":217,"target_line_start":215,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[215,217],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"223bffdb8bd363d41e1cd8cf1dbc1913c83705b93991b497b9f1ee465384f0da","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3ffc65ce698bac7621a832136a0568a9d7cbf76dede6716ef04be780ad4e3ea9","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":219,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[219,219],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a86eb7d2dc3346fae212a676e07073826e884b8e31b8b2d783675c97502b14fd","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"71c8b39c8585d793acd3359ef3c70c37c8fc6134f2af27d66f8b2342402cb64f","target_edition_id":"edition.r017.id-id.draft","target_line_end":231,"target_line_start":221,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,231],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"17332db7d092e302da73c9a7baf68f2fa3bd219ce1c907e81bfe2dfe498e002f","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2a4c197dceb7918c1c8495d3cb27829e4b95f8c8cc169ee01541bab9614a003c","target_edition_id":"edition.r017.id-id.draft","target_line_end":238,"target_line_start":233,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[233,238],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0adbb8b17e5212d09b5873b5d164d49487316adf125f4ffdd9adb2c081424368","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"634491f46a61a0ca0b4a2819ef9f8392b2b81d4805325181cfdc1ef81944f72b","target_edition_id":"edition.r017.id-id.draft","target_line_end":245,"target_line_start":240,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[240,245],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e87d4eae6b44a5d4c2fc223b2d7c328b32182fe9ca46efdc47a35d748ce0f79","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"33e00f00cfadf39ef3521120ff5422fb3b303ec1da7586d72ca46557422f3791","target_edition_id":"edition.r017.id-id.draft","target_line_end":269,"target_line_start":247,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[247,269],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e467d9063509840255a158579fb01c23797559f7eac0ea9da37f5cb26f7e955a","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot-significance.block-028","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot-significance","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b7b42e0426a891568722b896d56993f3d1f8fbfa7b5dbdeea7014161a6439643","target_edition_id":"edition.r017.id-id.draft","target_line_end":283,"target_line_start":271,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot-significance","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[271,283],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductSignificance.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c4e86f66878e98be75f944e4face662f95cc48cf4e9ec454412167c8817b08f","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1af23e7e32c20a16d78d628ca5e119c10b9554e09a3ef4b186a01dd3b0594f11","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0cba3eb193deed304a7d33a4fd77099b167b542a905a0aa408fced7c76749d5","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"80860af7a470de569125a37bd64352621b9f90ca5a43c9d339fbb3b0ab677eeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,9],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5581040684f9e91169f453eca20cec2c95d2289cc36b208cadf7f7c048917c04","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5aae17f50190eb553892c92fabd4a4af02b3405027df9145e2527171aad8809a","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":11,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[11,17],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2b8ae4bc77042e09df993f19edeb16ae44a0c17750d3fd3d9478f28fe4aac4c","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a14ae39b823577f729eb4625242029a4ddfc12acf718ac911e564307676b7f74","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":19,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[19,21],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5fa3441f24887162a61ad03b90ed0aca774b4e789bc9fbf20e16b3a01682c802","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf29d4e328b7adcead4a45ff6f7f83f3203884eadb953f9bc8cebc4562685fca","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":23,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[23,23],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20611c0745da2cb922da943664913f15021388b1805447843ab97a48ed41b676","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e0328628d36e43591380e50645bf7a0b999c19aa24fda5298a19df7b15f70b83","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":25,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[25,45],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82022bbcac5447a8df8ceef9bbe9ae491369218e989f568ca5181158286019aa","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bd4e0501828b1cdb1ba8167167f4e0af3ae3a2ac57e1c95618fb57e6ade6145","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":47,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[47,51],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"583cf782fbaa9a4423b35a9c8b69fa6c3aee5bd114f902c0621b2c0a5ea9c599","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7688a07e372fb21c886f3181a336298b3f392ad69b82e9586553d77304076b86","target_edition_id":"edition.r017.id-id.draft","target_line_end":63,"target_line_start":53,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[53,63],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7e5efdb94c2f2c6d9f24ce9d0600943fbf4aeee5367e017e7bcd9c4dc3287428","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7c2e61ba03e7b4f252921b9780ab28406f54173dafe0bdb7798c0c88c75787cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":67,"target_line_start":65,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[65,67],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5edfdc69fada8063e05f8f0df517d3d9dcc69f785f16427e4a9ca9b3990133f","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ebc97c5464f37247d01495d4cb15aa420aea991f96b8949b0bd50862bb9f60de","target_edition_id":"edition.r017.id-id.draft","target_line_end":85,"target_line_start":69,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[69,85],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"defde3c7b1d747bfad5c6ef608148de1cceb9cdc1d5bcd35b8f48efb40e6104e","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ca1560138f32cc6393ae360870864687e7dde5927b87c1a6860e00c009e5eba5","target_edition_id":"edition.r017.id-id.draft","target_line_end":87,"target_line_start":87,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[87,87],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f98cfbc017c89f7677c0c4022c57dbcbda8a906ae0dd76b84d1c56983e1e4606","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"212ff5a87bab483e537daa224ae605bf8531a7f4e1dca6758a4718b2178c8752","target_edition_id":"edition.r017.id-id.draft","target_line_end":104,"target_line_start":89,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[89,104],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"283d681204c406e124d946eb9d93e822f20633ae6577cd975ef67762201e9977","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9c3da56566b7f686fb3341c28172e3b6fc0679c0340cd762f3c4aed785cca0dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":109,"target_line_start":106,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[106,109],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"215110647a47b6f9d2eed5cfd7a48fb676bb939a79ec951cec154a9f6c11de04","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4819a4290e0754985680dc50586d0127fd123877819ac969bc5749be3b2fa0bb","target_edition_id":"edition.r017.id-id.draft","target_line_end":120,"target_line_start":111,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[111,120],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18f4acb411758435ecd81eaa2fc6cb95e492bccf75df7bf250f16e3ffd6c843f","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"35958dc4c61367b43d4d82c37682da32058b4dce9a0286dd96c5dfd9bc5bdccb","target_edition_id":"edition.r017.id-id.draft","target_line_end":129,"target_line_start":122,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[122,129],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b41ac743d7f142f081cac294c472cd3ee8f204e218c1a7f848020d1926bf58c7","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"102fadb4aaf7dd461edbc187284b4cae8b317f7bec6d7b1a710e206cbfc90aae","target_edition_id":"edition.r017.id-id.draft","target_line_end":132,"target_line_start":131,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[131,132],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f00976038a1699cca43e5145f3cbf39e3ed5efae6d8f44db8ce4d66bb2c60c08","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"015aa7fe4613a3a39565ada109ffe375dcdc5715fe3b9410cc77e5526277a060","target_edition_id":"edition.r017.id-id.draft","target_line_end":135,"target_line_start":134,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[134,135],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c53b881f6d050c961053104c2dad1ba9f21d0c1d0cb23643a63f14c7531ba30","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5adf9e2d795fd8cafd39924547d0befc71841b1dfad6bb20ebd67fb576c63cc9","target_edition_id":"edition.r017.id-id.draft","target_line_end":143,"target_line_start":137,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[137,143],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00c4fdd03ce55ebc08dce6afd2214b65204d421f02f3f16d006afdfe90a88e52","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3e6c9bd5b6d360cce262a3e4b694280b9236bb80f21b9ce520c645971c2f167a","target_edition_id":"edition.r017.id-id.draft","target_line_end":149,"target_line_start":145,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[145,149],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"615206e2c9870a769196ae219b3432fae092b34c1db70c2b012864cd917d4584","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"35b214da200fade25f980021228cb10d500be382ae1b0505c7cd56fd55bef6d0","target_edition_id":"edition.r017.id-id.draft","target_line_end":165,"target_line_start":151,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[151,165],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"711d4a9a4ec0cebe7497a92dbf1b40ac3e86ccb430d7dde02c76fdd9c2355f7c","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2843c5c5367ca633690cdfd2b0a31788e82eedc9eded8793291184cb6ed688de","target_edition_id":"edition.r017.id-id.draft","target_line_end":187,"target_line_start":167,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[167,187],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"69a042e8fdb5922ba92f2cad08e79c2ef5618e52d96874d0dced2c748cd85ff0","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5c9b6452e350dfefe1f833e2d1817405362899cd7dd737aec65401d540e9aceb","target_edition_id":"edition.r017.id-id.draft","target_line_end":191,"target_line_start":189,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[189,191],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0362903a8271a46d73708efb1ebc27c73b1a4c934eb2e5c88b909ad8c47de3b","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"281eeba9396245d60c3c97ca3ada668c4cbf063090aff7316b923b0cd7934781","target_edition_id":"edition.r017.id-id.draft","target_line_end":199,"target_line_start":193,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[193,199],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b9fcfe88a3bb669cf3b7d58a3727387c80a82aed8acef8d07182bd3877ceca6","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6cca50aa59d2876ca851dfff940bcdf126554898b434c0dd9be44e8356f9c0cf","target_edition_id":"edition.r017.id-id.draft","target_line_end":206,"target_line_start":201,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[201,206],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"68cb1cc57f19488826d27ad166176315df06530df2d8e5904fc975b9faee0252","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0f178e27757c2e204decc7f4419e93866e0924567f9a3986a07e8cf4eb53856b","target_edition_id":"edition.r017.id-id.draft","target_line_end":222,"target_line_start":208,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[208,222],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82a9a3aed7fdf151fca6c68d08b29ba65a7ce8a4863ec5e62a14f35620dec608","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"11d189f7da59d3b0634a7cb1480a4ba9c037e2ba8dfaa8469bd7bf58bab3e70e","target_edition_id":"edition.r017.id-id.draft","target_line_end":236,"target_line_start":224,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[224,236],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"070eb80547ed19ebe4bbc147130206c99d2ddcf9a75433fa83740d7d7890259e","concept_ids":["concept.dot-product"],"id":"segment.r017.book1.appendix.vectors.dot.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.dot","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"68d3ae9436d60ea4bfc4fc945f13d930167ca903dd42ed4bbb4bd663236f6629","target_edition_id":"edition.r017.id-id.draft","target_line_end":264,"target_line_start":238,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.dot","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[238,264],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsDotProductDot.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ab862d88cea36199cf2b105f357388558c860ff75b6b67ed2cc231b70a1d0e0","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1eb26fd39cfa12de70b5a776c251e5fb1b4936a86156aba67c22231eb98e19bb","target_edition_id":"edition.r017.id-id.draft","target_line_end":2,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,2],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"71e88b5ffca4da0a78ca16be02a9df0f60ea75bb7991ac9b913d57a3e0035487","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a50cf26eba9de5f177d8c21f6b7d967eedd57643cfaf65a6525608d2a006440","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":4,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[4,4],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"68cb615b8e0402d5865d9bd5f5466e168a626bca0d378bc560f2d2b88775a1c2","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7cb58e5ee5a66a81f3cf7ae34d8179abdf3dae10f22e04c8d468ef38d0397ee6","target_edition_id":"edition.r017.id-id.draft","target_line_end":6,"target_line_start":6,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[6,6],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3892fbe40ed8230b06a34aa4e92514d563f670ac1cd602a4800e17337b8d62b8","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fabaffa6ea112c02461fb9b0d59a2be0cec420f9749032a7bf171ae665bc262e","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":8,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[8,8],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"78d9ef43323f276bd20287c177335d1f8e79e022470df0c885cd6627f3c059a8","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f9303652a7b3865aa15a0232b429fcc1db124e63d96f9c0c5775b2fb6a511361","target_edition_id":"edition.r017.id-id.draft","target_line_end":10,"target_line_start":10,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[10,10],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a0faec9568d264c715f5f27ef2fb6641ef8c6073862fbd0c4e7737f7aa9a339","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8b43faf57b826a9d2a0944d2fbdffacb792e8a0d3e9570abae0447a3468a9728","target_edition_id":"edition.r017.id-id.draft","target_line_end":13,"target_line_start":12,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[12,13],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de805f28211fc5dd32a1532c2f7d9f9f252f165e75384c43a972a623152dbdc9","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7c017e814816a614d2b774c506c29fd08dba989d78f0a2d49936ef5303f8ee11","target_edition_id":"edition.r017.id-id.draft","target_line_end":16,"target_line_start":15,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[15,16],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c63d74b5abd1fff0c6684e91a911b5b9685671784a7458af147b983c5e4b3851","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fba12705204b66cb8246f9080dc8ce581d8fc19b169d2f4cd960d3d66f323316","target_edition_id":"edition.r017.id-id.draft","target_line_end":25,"target_line_start":18,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[18,25],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e15b3adb639f915f2aa666227a1a6c5c178f85d4f975fbc17a025a0a82a15a7b","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"63acfe320ceef0198f9dc88b228419e62a526255987bf0bd889de9b318d97008","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":27,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[27,27],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d7e7add45276a6c5064c59da7681fbbda2ba73a2ea485beec3e08f92c6fd6ef","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c7390afe199d74530c9c374fa6cfadea6c9800642488b1a4b66a4f85892d972b","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":29,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[29,45],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9b86ae303812ca109ab2f78e5c255ebf99e675768ef8fef2fac0ea48d440477b","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"913e881289f28e5c45c2dc4a1cf7a8afe7551a10065192bbe10fe8c55dda3fc1","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":48,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[48,62],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9075aaa950d56d48c4d8fcbd776804b632f1b3eb1e6e17b3f77f9245634f68d","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2af2744a08de246f36c9164bec8d91275b552bfaeed168492531aa5b9e2b3ea4","target_edition_id":"edition.r017.id-id.draft","target_line_end":68,"target_line_start":64,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[64,68],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4827c6a89cce7268f7cd7ea3b93ff9d97fb3ac1c66e3805f64f9e47dddaa4860","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd9252c79812bd3e7b1788ff94d146762be9f3fc3f91003e2ff788023199c0fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":96,"target_line_start":70,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[70,96],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"770101550263d9e2caef88ed958a0ed28949cf80f5d9ac2519abcc215469e01e","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"824e56d01711170bb2b680233bd1c6b98dd2dd3beae06442cac82e7a073b0942","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":99,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[99,119],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f09535474a103a16c3c12808844d031ca8f5cfd58195378be0473d2033ab9f4","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"316ce239e6716468a5be82142fb0977b458e6843ad46ede9b9a2e8f75811c763","target_edition_id":"edition.r017.id-id.draft","target_line_end":121,"target_line_start":121,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[121,121],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6d361d121b9c152b271ba2b1e226b3d98b17517fbbf6e2bd69f56a8c84b28ef9","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a759266dfe08b8154afe38d10469ef7a0b4fb683446fe8e4ba69a89596310e8b","target_edition_id":"edition.r017.id-id.draft","target_line_end":135,"target_line_start":123,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[123,135],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c69ba33d1ace1584834950a4a31f4f8255dbea5288c55cae5170e6113f7e85b","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a130ab4755a91cdcad987fdd531985068ca4f5eeba83985cc55be81bc64d30a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":140,"target_line_start":137,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[137,140],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"36f901c6ae7ed18443708b0559e80e9a95bd8677f4feb7fe2fa98590416fbd76","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"50624347385770b2fa5d3f24b3f9a3dd2b33c43be96c2d1efc29ad2fbe8b8d16","target_edition_id":"edition.r017.id-id.draft","target_line_end":152,"target_line_start":142,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[142,152],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"969a3e289a4259f5b3b4811a7ba02fab4998a22ed0f70d379bce8c1c5ed855c5","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ea68b0e9c139823679c4558005f11efe354676618f7faaadf7bd526f44664d98","target_edition_id":"edition.r017.id-id.draft","target_line_end":161,"target_line_start":154,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[154,161],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b65f2d2b5cd4ea7ee27ffb5280e51fe50b4f1713ddc6fd48a657f222bef078e9","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd1e4fe65fb776a8464e33df196d2b1c696d6b691c485483f6d8652ed4dd516c","target_edition_id":"edition.r017.id-id.draft","target_line_end":164,"target_line_start":163,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[163,164],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3095effebef6d4a8bfc26b64890bbcc6f41e02738bef9d108b6443c201ad41c3","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","target_edition_id":"edition.r017.id-id.draft","target_line_end":166,"target_line_start":166,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[166,166],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"483104b654783985eedab3b7a98be90e7f7f53c8049a39415a4c332a8474831e","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bde49e74a2f5d24d649b9f902738e0af498d02c2a0ba935c1bb2b1875b865cb0","target_edition_id":"edition.r017.id-id.draft","target_line_end":169,"target_line_start":168,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[168,169],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"be96b3ac9c04f9dea132bedb69d2c1171d7e0899ed4b3548d7dac0a6a04eb270","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9186c48cd0fa00b8e4484d94f709f78081aaf66b23f208748d3c0cdd226124c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":179,"target_line_start":171,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[171,179],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"925ba828fd036523b2816c69399601af7e1ed523cf79f4e1d11cebf39a814077","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3dedd927dce371701a29e86ce2810756698e571e2769587c4365607a32503738","target_edition_id":"edition.r017.id-id.draft","target_line_end":184,"target_line_start":181,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[181,184],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2989ad7b5228ef2cb028f039828f1adc45f05c401cdcdcc43646a7df4f8c8073","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"be2eabb2e80cc352ee465549c7370347441aa71aa4ba5d06cf1ceee09db8a0bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":189,"target_line_start":186,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[186,189],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"63644da482cf83e981137cbfe47e209e1d75d5d78bbfcfda1d23a3f1e4b3b25a","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0cfd63cdde59c26efd944f94a8db790331c63ed7ea7613fe136d39b9e196376e","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":191,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[191,219],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"12c0ac7307f7f73b9f2eb46e5eb198b0597eb5873d872239c68106ed668c701e","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"16a198712d5eeef79ea1c288fd451fd3414be5741e63a9e539a17c58581fd9be","target_edition_id":"edition.r017.id-id.draft","target_line_end":222,"target_line_start":221,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,222],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d43a02f6687100d762caf32e3fc3f73a8af751fad5fb3e20e2bcafc7b64956f9","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-028","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d62d9e748ed3bc75aa18b99c60b6efd2b70685aa402f32988084e42699e51509","target_edition_id":"edition.r017.id-id.draft","target_line_end":233,"target_line_start":224,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[224,233],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"43434e0d38f6253a5d9daa23e77cdb71b3317797ce2c89985398644700704a45","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-029","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"19c3a32c462ac9328f49a6426acd0b7a97a28c002d2aeb8fd78757b71fe3a367","target_edition_id":"edition.r017.id-id.draft","target_line_end":239,"target_line_start":235,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[235,239],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6a8c41e20e154e492cc542418572e4d18b09d52bad4747237071682ecf21dc66","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-030","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4aaa6ee2733a4c376598bedbc0314e42886cb382197c645193e94b7d7873dd70","target_edition_id":"edition.r017.id-id.draft","target_line_end":244,"target_line_start":241,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[241,244],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"73d2e5a9fff5e9e4858942dcfbc76ff1e3a57a546f2f2faf3fe4b3893aa08c10","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-031","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c90bec0d6018c2369d4570b51550f0b2d53de2cc3219cea8c3ab544fb9167551","target_edition_id":"edition.r017.id-id.draft","target_line_end":247,"target_line_start":246,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[246,247],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce22189ec6724424379309b6aa9f3e5842cee8d54e797d863989c4edb4a86eb9","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-032","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b87298defb945ba27db07c8f9e914a0b55fe15ae29248e75bf0ee9f6d4ea9965","target_edition_id":"edition.r017.id-id.draft","target_line_end":257,"target_line_start":249,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[249,257],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0fa341016bc0629de48f29e9e0c248f8af422836af56f7e46a3c56069f5c08f6","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-033","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b8831e97bfd5257341b29e06d80d70eaa994f3e6ef43b090ae96fd0237df63f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":267,"target_line_start":259,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[259,267],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dba75c28598f3c1357374727a975ee4f25047f01e7a3bc639fc6ced084b1a581","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-034","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2dfd4092937b159b31348b07b856b0b2b1739512b0c70613f844d0d9586dfaf5","target_edition_id":"edition.r017.id-id.draft","target_line_end":270,"target_line_start":269,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[269,270],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8dcfcdd70711a91f831e5f987f1f416a450915fa5576f565620b8c9f0a3e2a10","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-035","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fa5e2b9392ed54d5e54884d481a6b2231ccb7c673fac8b3ff0083693f5d2a292","target_edition_id":"edition.r017.id-id.draft","target_line_end":284,"target_line_start":272,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[272,284],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5bf2dcfc0b0a271d8a5b1b69ce46dbb86fc8b55ea618a663a72b06030fa112f2","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-036","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"536f5d625b0c8f4008d683e42113943ca9ba599b3e84632b29c823e6169bac27","target_edition_id":"edition.r017.id-id.draft","target_line_end":325,"target_line_start":286,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[286,325],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d7a6d0c2fa3b7a5fc3433858cd5aca4b40555318f687f69e5737fdfe0727e0e","concept_ids":["concept.vector-norm"],"id":"segment.r017.book1.appendix.vectors.length.block-037","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.length","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c20ca8dae582e0743698a8070d687ad5b1b079e484946fac25580649d9c4c322","target_edition_id":"edition.r017.id-id.draft","target_line_end":329,"target_line_start":327,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.length","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[327,329],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsLength.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0b2e2c1df228039b62afcc77c5823d1f796bbde3479362ddc9e5e4e7096a4601","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7ee5073bbce1c92c2e07a0c8740d2fdfe513a4a34bc70fd5c5948648906325f7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae0454206d1843c202a92739d677911965f40531c2f4bcd650b50b25bf49cc5f","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a50cf26eba9de5f177d8c21f6b7d967eedd57643cfaf65a6525608d2a006440","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,3],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14a0c680f838d98e2ee6dd953717ad06b2295945332802a1cea66d1f4142f75c","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fbcb7a5934f0824601add665c0819fb48dcfcff2f598ddf7b85c4df53004814d","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":5,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[5,8],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8f69b08811b275cb28d7f2a547b2337808b93b2ad5ac2f41636c6d8dd41c5cd6","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e3695428b5362ec4dc2cda2da9742e2b281b7244bd18d5d08507643c29a101cf","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":10,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[10,17],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d6718d44eefdeec01ede92e2d17566111ac05a5019fd3554028381113cb0963","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1855c403c41740a94b69b1325c16a085ee9aec0a1afd004a6bc8de86b107b9d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":19,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[19,26],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0717ce7b81695a83f21074f6a4e8540756efd6d8bbdb67eac0b7f416c43ba1ff","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f0a74734179f5a4d36fb4b5cc6c43496fd2982ccfc346a9f61e8acea05b42dd9","target_edition_id":"edition.r017.id-id.draft","target_line_end":37,"target_line_start":28,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[28,37],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c6f7bd0b6c7a985755780d46b44223a108c52611c40cbe444522b9bc9b7d167","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"42553abb01f13a1f43b1c453db9371bea6647dea5e46b79b2775eccdded43938","target_edition_id":"edition.r017.id-id.draft","target_line_end":59,"target_line_start":39,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[39,59],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ddf78b2607716a0c837d081247abbbc6ebe8aa0b099bcd754e13d4b26e45049a","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":61,"target_line_start":61,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[61,61],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b493329f34f4452071aa4538b0a0f3a870911ffe5fa70c01e4f49398c2f4867","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d2cad8354b4e209cec77f439cff07fbc71cf41b540d3772c6aec2223bab8688a","target_edition_id":"edition.r017.id-id.draft","target_line_end":64,"target_line_start":63,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[63,64],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"79ae30698f61654671ff3e0d0f25a02d0f47b8e7dfa300628d754d940f9bb483","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"40444eba99c7564d6095ab94f420102bbf22abe12065bb1dd07519da749f9952","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":66,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[66,72],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"946456c288e659bf630a461560ef18ea4d5432b43f5c0892460ffd2cf4b8f74d","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8151c8303e0779a3082b9a25c9fc6eb55f198ee417aed7c30563a31d3477efc3","target_edition_id":"edition.r017.id-id.draft","target_line_end":82,"target_line_start":74,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[74,82],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"03d8f63af43bd6ae43cc5ec770190f73e5f4e73daac3ee2841e23ec903aa02f0","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31b3b99db6ee295fc7f0a7b3b4c33c6da6a40fa556f4144210db17024ab4d62c","target_edition_id":"edition.r017.id-id.draft","target_line_end":86,"target_line_start":84,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[84,86],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cad464b5ac045d941c6834b7a70638a1cd658c82394ba230710d6cfc07e52a3c","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a402b2d11bcbd1635054c2b286d30456aa7ceae439e0863627e943669c0fee14","target_edition_id":"edition.r017.id-id.draft","target_line_end":88,"target_line_start":88,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[88,88],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7aaea89213f148057eb0a631fbec69d4bac94f2e3bdb56a482385b43b26991ee","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ce57b666f52f8532f3b9bdf45ae7a0d17c16bb29e2e5d8a5e10e75300b2dbb37","target_edition_id":"edition.r017.id-id.draft","target_line_end":105,"target_line_start":90,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[90,105],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"493e9502f21a59b9266775087a7e3a97f1d22cb249478ad2341056d313372967","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"02d17dbc6de80ab202cf1951c76cbaa716908655637da6b05a31ad3952f53a2f","target_edition_id":"edition.r017.id-id.draft","target_line_end":108,"target_line_start":107,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[107,108],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b1f747323b101ae74c39e1e485eaeb79fa182fd2d8f536ff5e63d516dca725e","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e63e4324f098f201605e81d497a653940f90dd168b992da31f1166b7acbc17ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":111,"target_line_start":110,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[110,111],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fab89e1597a1ded1d6f6b6dd3488424201fa9808b61e160708a7629de9997b00","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cb08af9cfed4c5daaf48002c5432729b5d38a8002e8638c77c56708dd4e95ca0","target_edition_id":"edition.r017.id-id.draft","target_line_end":123,"target_line_start":113,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[113,123],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ac3afc69b9bd796c7097408a661496ca4aa9fede6d38832c46f3171c7a7f935d","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":125,"target_line_start":125,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[125,125],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2180ee55a03c9e38faf12c043c0d44f11e7baaed242d5963be9e5e595fda37bd","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"524cc3e71110b919f7d20c3cab27bf7130e63b5f31e15bda8e38d376e195acdd","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":127,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[127,130],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1751ed7cfe857c2fb1b04b5e0d0c768a08c161539e6c0fabfef09cfbdd717ff0","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"81dfee515c96f5a5331ed9209196574ffa985f5a92c13e9efca281a38dcd40ec","target_edition_id":"edition.r017.id-id.draft","target_line_end":143,"target_line_start":132,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[132,143],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a38cf127e75671214e03f161bbeb5414796b9dba261f59786d19299e9c3709e5","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b7de6f83b7cccfacf243631f3c3e2c309cfb4256586d2d3a35a6fe9acd1c175d","target_edition_id":"edition.r017.id-id.draft","target_line_end":146,"target_line_start":145,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[145,146],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"373b5a2a458f9568a1ab4bd998b4814ef1893adf065d19bc40662804ed9eb1d1","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aebd85aca253086f4673e2bfd7be327c47fe0e882a46d74959763f95a96bee47","target_edition_id":"edition.r017.id-id.draft","target_line_end":158,"target_line_start":148,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[148,158],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"360d5a0abb9845e1aed6b4ae652b1143cbde6c9c464caa34538dcb57b2efe597","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":160,"target_line_start":160,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[160,160],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"782710aed3951598e8a713bb9658a719451ff3f0568e58007fc5a09fd70ac85d","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"94dfac0c28ca94124ea662077981e5e35dbf7cf4418ddbda74d8c49745cdbd39","target_edition_id":"edition.r017.id-id.draft","target_line_end":162,"target_line_start":162,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[162,162],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"34a57f3ccb0924a43ad4c762b6dd87e257cf05eb0ca81f393b932f439521ac1a","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f392ce7308fe5f306205e60c55e90b5b3df9330900e98cda3258103b2ae6a5d","target_edition_id":"edition.r017.id-id.draft","target_line_end":164,"target_line_start":164,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[164,164],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d0c47d2bf397caa4a280ef26d017a067e5731b5be9b2e603b27678c9ae341b5","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ed38d2a27b0ea201cf5b7fad1cc153dd6cde08acda8aa2684f65e37c877e3fd8","target_edition_id":"edition.r017.id-id.draft","target_line_end":183,"target_line_start":166,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[166,183],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0fcb9f46bb7e7166340e7f40eb1dca27f7562df54121e2847d2985f5a433fbba","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1e58548630eead537b8021737b8ddcd64460577251a0ae2ae1c7ebf88cfc54a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":185,"target_line_start":185,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[185,185],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f20cad3a8d4fff29994107d28ca5fb66c1a6aba7650eb1208424d99db6c0375","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-028","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fdd1079087ba8ad0b43e3b92e8beb485a4b2dc7c2cdd34ad8de63e41a46f2dc1","target_edition_id":"edition.r017.id-id.draft","target_line_end":204,"target_line_start":187,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[187,204],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9544696abe65a3f47be2f92ef201df356e9ce6c22fb92471b92a6c399f5357cf","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-029","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c6d3587e43558716dba6fd4d8d081303c3c151ae2f381579b590deffde078997","target_edition_id":"edition.r017.id-id.draft","target_line_end":218,"target_line_start":206,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[206,218],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cfee34ffe1fadc832acacf46a60a8aa52b79f6cc3586b3b0710f2421144e1124","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-030","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0755f6d459880ccf8bc61295de10428134af65ba7927f2c02d2bc3091fa69e1b","target_edition_id":"edition.r017.id-id.draft","target_line_end":248,"target_line_start":220,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[220,248],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3da10e8296e56c666f3d05c473d2d87dc2c8d6d25b7f7ad15a9abbe5803588c6","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.rn.block-031","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.rn","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7403336864d472ebcdb9e6fcc771e31fad03491b0f7402791bc988f1aa2dadfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":284,"target_line_start":250,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.rn","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[250,284],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsRn.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"514588cfc5373ad4eb549239d9a6550bcec19bf6ee05ff912c0b47d8926f4235","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f27669b231480d2f2366cb35722fe6153239fcaf2242cc10fda0bef9f8398c97","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02e6c02436e8d1a5ec8cff4f3bda4fbc65974c2403d3e5e48bdb99c6ae201716","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a50cf26eba9de5f177d8c21f6b7d967eedd57643cfaf65a6525608d2a006440","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,3],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2115894b66c886014f8c73f158f231906c47e83f0a448626eb3dbedcaa95143e","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7cb58e5ee5a66a81f3cf7ae34d8179abdf3dae10f22e04c8d468ef38d0397ee6","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":5,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[5,5],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8542a0153d117b81f5143844afeb034bb98bafe6f80e28a174a98fd4376818ec","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"424f66e76e1e6ce8a714de3e71dc0322d0cfa1f085888def7c918dab804df1e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":7,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[7,7],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df13d08cc661de1aa1ea6f0cc27aea07b91bafadb6380e39e474a8cd1fbd7b80","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8b43faf57b826a9d2a0944d2fbdffacb792e8a0d3e9570abae0447a3468a9728","target_edition_id":"edition.r017.id-id.draft","target_line_end":10,"target_line_start":9,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[9,10],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"715ffe52d598b1fac764a2d819bd1f917e219a85c36eb8ea1f375a57ca2e1e51","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a9043a576e1de2eb9cdbd9aadcdc5b244e9662a995cc356cee0adf4195a2e00c","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":12,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[12,15],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7bd76ddc123dcd18219c8e344e5a9fe5e529634726dc850b0784c4fc56b0175a","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f593f173cd8c7e6307a51ae854e5f50a29623d64bdfd5558b3af7da8133f7e39","target_edition_id":"edition.r017.id-id.draft","target_line_end":42,"target_line_start":17,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[17,42],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f3b503eb20c8d633ddfafec6b36cb287642b56429cd8b0994a2683452a8b9249","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"474f321cf684b312b24ec89e6bb75bd976b9cb66546e62e5d4600410b0c04d6f","target_edition_id":"edition.r017.id-id.draft","target_line_end":48,"target_line_start":44,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[44,48],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f849b296bad184e37e1b72fcdb783d5b11756c53db14b59bfa4f6768e5e58706","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-009","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf29d4e328b7adcead4a45ff6f7f83f3203884eadb953f9bc8cebc4562685fca","target_edition_id":"edition.r017.id-id.draft","target_line_end":50,"target_line_start":50,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[50,50],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b89f1271920b0c594dff2eff7789364fba63167580b55808a9db4c33b6cc5dd","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-010","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5e9834021d37c8a10f9749d7990062d7922483cb3b387c595f8098aaf6dc91e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":52,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[52,53],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b982009aaf2dde57d51ed684859aee12a518c4d704a5722b1a0e343cbac76a2","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-011","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bfa5d40d59a942ee70887ce87b67c146ae3ec9d5fe3ae98d904f9030cf3d2816","target_edition_id":"edition.r017.id-id.draft","target_line_end":61,"target_line_start":55,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[55,61],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa7a2b254587bb700f4ca7ecaf1d1b2fae33eb7bbe15fde152c2c7d00d08c804","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-012","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":63,"target_line_start":63,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[63,63],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a91625848085a6de2afd6ec6a0b5a79359cb733d70f29ae5dd6546b18b3430b","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-013","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd3eaf0e9f637533539bf980e36ea8e6ada8052158342eb7d66ff9e2179aecec","target_edition_id":"edition.r017.id-id.draft","target_line_end":66,"target_line_start":65,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[65,66],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5410ac111097c60261d5e5310a32da6d9bb6f905e8a7a37ecf8cabbb9c1854a6","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-014","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bdaa4fbddc95f6ae8de127e12b2b19e392a99a332ff6a49fe1e80162bde527bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":68,"target_line_start":68,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[68,68],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0290d8f273edbb21abfa44046d08a0172b1455cc564ab705180383044192810","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-015","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a8e43170e0c8824c3682a52e1e82433a71034fac9d49dcc3b8bd782115c96867","target_edition_id":"edition.r017.id-id.draft","target_line_end":73,"target_line_start":70,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[70,73],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"40a471ca8f75cf2a349891ef0832c1756ae07613b4d9b5fb2be67177d6533e2f","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-016","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9ec9387714c1c71fee4e567738d8c04f39ca013e021d188c74c7d9dd7bc3e4c5","target_edition_id":"edition.r017.id-id.draft","target_line_end":87,"target_line_start":75,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[75,87],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3bda851ce6182aeb51f21c707eed4f49c134aadf595ec9c704d041319dd486ec","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-017","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":89,"target_line_start":89,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[89,89],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"31ae59f9bc9f561b7e133c5b9ab8a76eb46eda2156f9dadb543c2e73658240d7","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-018","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","target_edition_id":"edition.r017.id-id.draft","target_line_end":91,"target_line_start":91,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[91,91],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e4144852b1bf479447c3e28bb930ace55852fa11ae244d24fed1fddce5e4da25","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-019","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f3ac10ccf44e58673bf9a9e8f218be1618e1d72d6a4354e92acbcf0e919a2bb4","target_edition_id":"edition.r017.id-id.draft","target_line_end":95,"target_line_start":93,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[93,95],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0254e43b27696430481efdb2d1255c9a2167d68e4fc5e9a10df6bde2da66e73d","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-020","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bc0157ef8232dbbac61a105757e79d4b70428e8410c64cf75bcf8d8b1bbd3d40","target_edition_id":"edition.r017.id-id.draft","target_line_end":97,"target_line_start":97,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[97,97],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"03a9946fc80edac2dba8ad2b5b17606cd9e17dcbc92f05e2d789e5f01585760a","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-021","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8ce67fd3103a034e386003c672f03dfae370727be61543201ab7c15478d3b8ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":100,"target_line_start":99,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[99,100],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d30bbacd626e3f5a7d311a93b43783447c81b740384162700e619891a9f1c9fb","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-022","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8d4f33d8f0d80b17cba14176c529eaab9492124143fe78fb765975311e496c82","target_edition_id":"edition.r017.id-id.draft","target_line_end":108,"target_line_start":102,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[102,108],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c3385c259cbf52b188c30383653f4608a98ed3ae86a319382ae2083c2ab220e8","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-023","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":110,"target_line_start":110,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[110,110],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4bdad74408fe6055e246248533901ce71ac310e2530fbfb7d7f6abbf23e185bc","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-024","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"643e8d99e36773621cec950196770cd783d9f0c42e909e3392269edf6665105d","target_edition_id":"edition.r017.id-id.draft","target_line_end":113,"target_line_start":112,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[112,113],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bbd9ef9c1c2dd5fda04a296c3ba4c3164a772efaee0f5b36225a46bcb0652ba6","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-025","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6794218c4dcae360b1059217e19aefe9bcb663f74c461daa1f230d81269e7a48","target_edition_id":"edition.r017.id-id.draft","target_line_end":116,"target_line_start":115,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[115,116],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"38c8c0e14990a5251f983c2191ff9644ae9d0a8d25386d02ba56765d6ff2b6b3","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-026","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aca7241d6e66b13c6c1c0f4af246e321e55c4c302c4233222c17cf05accffb43","target_edition_id":"edition.r017.id-id.draft","target_line_end":126,"target_line_start":118,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[118,126],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae88371f82ae0ce1f3bf73db9e8678c5f468111f3fbe9867e7e55bd9f17d4c3e","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-027","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"64b5856bad87234035f36a5ed2dad40ac6ddd1d941bf521b69a5e313f48edb48","target_edition_id":"edition.r017.id-id.draft","target_line_end":137,"target_line_start":128,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[128,137],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8f17cbc1c2c943378ce43696e22dfb916976d4e9a46dcfe38a793e376c0ba18b","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar-meaning.block-028","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"11ecd338ef9a0c69c82dd2f9dcff76aab737205214bed7f1654a9f18359675be","target_edition_id":"edition.r017.id-id.draft","target_line_end":141,"target_line_start":139,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar-meaning","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[139,141],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsScalarMultMeaning.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7ad3c39d194765bd4eaf7119dc4486dc64616390b12530b2219effdddc7f853","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar.block-001","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2795881fc918c162d9512ce75cb3da63140c3989ea85b3684e8491323c4333b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c31a853f34c7402bafebe6988257de2a384a00bcf4353e7aa51ec8d9910a208d","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar.block-002","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3da076aa0e9b4ab4c2fdced0f99c808bbb9095dc94115903856bb01e2a24ae02","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":3,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3,4],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8553b71254010c22d26db98aff459b73f7c7c8db67593440967c947930c625fa","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar.block-003","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8a579ee92584d07211d6060400139397b1f193def268487480d6f6a33b7ee11a","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":6,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[6,23],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52d17093d79b7e45d50eb357a01fd69e22602f4f22fdd5611bcc725406c83b10","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar.block-004","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fb6cb42a21b68f53df359def8df3dae2ca88e7ae7da14a5c3f8dd9fef51f1666","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":25,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[25,26],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c79e2da7193a7de2aa3017cfd122df9bbf90bdf70abdf4298fe82d6f53c83bb3","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar.block-005","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"004ecc0baf1898d9404ce8230d7fb8827c411ccce806ea9d9f2192d256d49334","target_edition_id":"edition.r017.id-id.draft","target_line_end":48,"target_line_start":28,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[28,48],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6d06acf59cf320d41f7d918a1eb490937910999418a28edbd4831f66f6229c1","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar.block-006","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a676e7e525eb20384d4aeb0ca018e91fb8b204062d5a5368ca87b7c4f3b2efc2","target_edition_id":"edition.r017.id-id.draft","target_line_end":68,"target_line_start":50,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[50,68],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"25be58d57fd779c205a36c217467212e75fb2bf238aab928dc8e289ea70692f0","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar.block-007","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f28fa50524272229449a2d1060001f6881780d8004f179276053c4dc485f679e","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":70,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[70,77],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"67f61593d64cb8a054783327cd7e83e3ef79b2d5cb9eea7e5dbba794c6792425","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.appendix.vectors.scalar.block-008","locale":"id-ID","parent_id":"unit.r017.book1.appendix.vectors.scalar","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c1b40573507413e3c161e409306e65837c636c1b7c8a8de6b45e535dbc194df6","target_edition_id":"edition.r017.id-id.draft","target_line_end":136,"target_line_start":79,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.appendix.vectors.scalar","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[79,136],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/RnVectorsAlgebraScalarMult.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"779feae0f460ac62d922081d1d367562851df349adb776ff17d4ce9305ec6da0","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-001","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd638b5d845c8577cad20a0fe6698fd1236785aa6a7a318ce150ff8f1e10ad6a","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,4],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"53edbbd83d912831bfeffd9d437b80dede435f00ed49f89826b3b20319b81839","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-002","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"68d3cd85703d04aaa83591dcb50125686dc5f56fe0f527709f46efde151d2a21","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":6,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[6,7],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"beb4ed019b1f0b135060ab5332a1a1e29cb2328af9067987f1907d6a050dace8","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-003","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d7497cf4e14592cb58d7a21587872194bf005ff2a6b3d19182c27e6bb43822db","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":9,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[9,9],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"25a6675626ebafd1a18b7f7684dae6b867537a6a40d9d76219a1aa8c1ff0683a","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-004","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":11,"target_line_start":11,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[11,11],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dceca45a3c83ec1972b017165c546b2b2f396f3096189b8ed1c24433776e1a79","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-005","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1762156ed19508b70e0aeec3de31cd9ddbb76fb283132e65e9a81f3c95fd4354","target_edition_id":"edition.r017.id-id.draft","target_line_end":14,"target_line_start":13,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[13,14],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"286c971c9be48a9392de5e3106758bd3df882a16575bfd2c6ac15f8a2944b720","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-006","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":16,"target_line_start":16,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[16,16],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"338c4d2f8cdc301d90bbe8b40d7eac8c696b81bfe4ada8cc20206b5e0a79a9e4","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-007","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"af402fff57b1cc904389899c20a0a14068f53e48c305364c8b3a1b16baa0d057","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":18,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[18,19],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"03f256576af96a06de393462c28d8da543327ef7ec7a3c4e1b2adb4563bbac04","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-008","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":21,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[21,21],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c7baaa9cabd6ab9292f33e654e274651a86c017b856340a7beff0d516d33281b","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-009","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3268cc147aa96ab60687a6933cb7bce0f2950945c7f14680dd4355cf8dbbac68","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":23,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[23,26],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d2304c81cd32aef22c74aa7e809b284abd3369e4b41e870d5fd8e9d187b95352","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-010","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":28,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[28,28],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4fdd7a52f33bd7bdde78ef81fb632de3115e43ac77fb8b48e44815d73a1a074","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-011","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cadb10e25694639b0e6937859561c5307d4b61455f28a9c871e6280530f2a253","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":30,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[30,31],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9ac3589a2862998c60def581c9bc8dc18aa31efdab5cdf0b1895d4beec2b4cb","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-012","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":33,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[33,33],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9dcea09af5e5ee4b95f6f278121acd37851e9ae421207a104c4d12ab7ba7a18b","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-013","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ecb7fa291e35b27c50330212ecb6af700bbdca6a37154863e2669b0566f31991","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":35,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[35,36],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8313a242e5723cce93bdf292fd66a4cb0eab5d81e77afc425fb14cd7dcd9f2ff","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-014","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":38,"target_line_start":38,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[38,38],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"85b3954ee26357c757a25d3453e09f509c1da37bb6bed2eff335f4537b708d5b","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-015","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f7758890bbc534ceeb92fd41fe33a351c454232ccff91e821eea203917627ccc","target_edition_id":"edition.r017.id-id.draft","target_line_end":41,"target_line_start":40,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[40,41],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d60323cb64945adceae25dbc757028344bf841177caa44256c0c189d6f054782","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-016","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":43,"target_line_start":43,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[43,43],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88a512359d0a496e18e68ebd2daca46ba616b2eb696fe5cd291a3ef654503673","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-017","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0d54c9bfd56d182ca44d425d9e88c3b0cd29251977395f836f3d05c9ab79cad5","target_edition_id":"edition.r017.id-id.draft","target_line_end":46,"target_line_start":45,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[45,46],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f260fca2f1e481f8c40035c6335f4cf4a1f509e5096f7bb3924f5eb03aba9ea5","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-018","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":48,"target_line_start":48,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[48,48],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d0014f2a7c1eb1baf7ead9e173fae1a560a6f716cd3df9e2cfc1cd7d14060d79","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-019","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0992f26c3be9257dd20eac3712e7cc30d3e9d8b2f63a48f5114d96992d58d1d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":50,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[50,51],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"96cdf6d4f352e44b9ec8b9904512e7c4f5340c56bd44dd50de94aa7a6c363e22","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-020","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":53,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[53,53],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d5e24b95bae7ca0963cb65674c6412e0e68657bea810f5ad508977c56e9e640a","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-021","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2eaac5cad2b388003bf2660607ceba63d683c3abe50f73abef4ef78fdc79d703","target_edition_id":"edition.r017.id-id.draft","target_line_end":56,"target_line_start":55,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[55,56],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b376823471cb4b32bf45398090067fd91f772f636a6aa39f0626c13d2b65b465","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-022","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":58,"target_line_start":58,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[58,58],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f71efb1d4d70fd784fecaf0d437c6eee90dc89fa2a8eebc6ea2dc535cf41ff3a","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-023","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"41744c608bea175cea458cc78e7284dac439c89d5910c127c7dbbbd32ce2b6dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":61,"target_line_start":60,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[60,61],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dafecd3ca385da39e0ceb645f2107d95fa179e3419e357fa0a777b3001eae39b","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-024","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":63,"target_line_start":63,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[63,63],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7363a56271d3dbd8cad4525d90e59d3bb3353a03b745118453ea321f441d4d2","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-025","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"29032fff605271fb34956fc05e7a5708460eecb730fb53fd6e45d961f214360f","target_edition_id":"edition.r017.id-id.draft","target_line_end":66,"target_line_start":65,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[65,66],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"818a795a263733ae27cd2f57418b73e0da60d99229870811a5fc2bab3922466c","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-026","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":68,"target_line_start":68,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[68,68],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"98af7d50e1308eb964f0f59bb4d51d5f6972b2cbf427f1b31e28893079fbbeba","concept_ids":[],"id":"segment.r017.book1.backmatter.checkpoint-answers.block-027","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.checkpoint-answers","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eedf56058fb28ed4ac83a73a03376c4b7f9ccd641b043fed2f9602e2cd3fccf9","target_edition_id":"edition.r017.id-id.draft","target_line_end":76,"target_line_start":70,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.checkpoint-answers","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[70,76],"member":"source/Intro-Math-Programming/baseText/book/backmatter/checkpoint-answers.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8ec18923da6f78e0c74e6311808648afcd0e70f5cd538ce03946a7861835ce14","concept_ids":[],"id":"segment.r017.book1.backmatter.contributors.block-001","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.contributors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.foundations","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/contributors-foundations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b5140f38b3d9303c319b9d2f0637b98043197975fc1b84f0b5a78f9f974e10cf","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/contributors-foundations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.contributors","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,4],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/contributors-foundations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0345548ef1b027b6133eddfb1dbfb8a668c293db2e678c52bb73db622f4eaddb","concept_ids":[],"id":"segment.r017.book1.backmatter.contributors.block-002","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.contributors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.foundations","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/contributors-foundations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"897c26594d71a5d696c156ef4ffc9ea19e387234945beee6b8b30458bea03c30","target_edition_id":"edition.r017.id-id.draft","target_line_end":13,"target_line_start":6,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/contributors-foundations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.contributors","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[6,13],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/contributors-foundations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e8099095820c0da1ad28fe04e058f3524041d24b3ea6e0581dc16bef0f79c01d","concept_ids":[],"id":"segment.r017.book1.backmatter.contributors.block-003","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.contributors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.foundations","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/contributors-foundations.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b3270cb261afead556ce9fb94aadd510423f97229a167b03cc171aac00775d67","target_edition_id":"edition.r017.id-id.draft","target_line_end":18,"target_line_start":15,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/contributors-foundations.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.contributors","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[15,18],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/contributors-foundations.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"890556a30518064fd092816cdfac25e8340d553e44951f8b0b31abd73fee6adb","concept_ids":[],"id":"segment.r017.book1.backmatter.further-reading.block-001","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.further-reading","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"29cb204810c6a718c26c86a78ab33bced1aa3ffec685d3eca8a37e9c26ec1eb6","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.further-reading","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,5],"member":"source/Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f6fbfc5e99e36a1c98e8e73058f9e4719237ed176560f5fe0aea6626feb039b7","concept_ids":[],"id":"segment.r017.book1.backmatter.further-reading.block-002","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.further-reading","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"73e33f5df08a6bf51f50b002a7fdb08ead10328c0dd1e16df852f26930a48dbd","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":7,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.further-reading","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[7,7],"member":"source/Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"caec15608df20678e00cf4932d088fabf13f8adc22eeba0040499cc3410bf0b7","concept_ids":[],"id":"segment.r017.book1.backmatter.further-reading.block-003","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.further-reading","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7f62f4763cb5f95913018829a53f421d173281cc714f538a64d33b5d2fdd6f23","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":9,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.further-reading","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[9,9],"member":"source/Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8974190a34979c6d226885f89b9e944415f28a5926ee3a624e9f638280b2f7ad","concept_ids":[],"id":"segment.r017.book1.backmatter.further-reading.block-004","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.further-reading","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0c97a0372bbf0a193e75b146b34d737ae3ef92c719144ebc9194c5ec25d14a32","target_edition_id":"edition.r017.id-id.draft","target_line_end":18,"target_line_start":11,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.further-reading","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[11,18],"member":"source/Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d7ba6cfd155cdbb408410466a1d14f2a60860de95d3db66a04389dde4811ccf8","concept_ids":[],"id":"segment.r017.book1.backmatter.further-reading.block-005","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.further-reading","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"48cf69b13128eb43d79ecdc0dbfe855fae75a8a7c1bd1e274321955129fcef7a","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":20,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.further-reading","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[20,24],"member":"source/Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5833249c985afcd8d2cb61e2209675297c86efe61dc0997e98f3e87bc081c1ed","concept_ids":[],"id":"segment.r017.book1.backmatter.further-reading.block-006","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.further-reading","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0195d921f6358ade8ebe844d06b04caf0df9d0a83132f4ad74e489f317217826","target_edition_id":"edition.r017.id-id.draft","target_line_end":30,"target_line_start":26,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.further-reading","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[26,30],"member":"source/Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a1262088361d5a6d9cf77032f158b7349f97a4a7248cbeafc1e24246380f037","concept_ids":[],"id":"segment.r017.book1.backmatter.further-reading.block-007","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.further-reading","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0644287a34ba8f241edf210d62dddf26d85de244f876b9217806f5db43430ae8","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":32,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.further-reading","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[32,36],"member":"source/Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a29d0fe7e9c240a32d5eedecda285c8509cfe601792c317c8e9fc4d89a74c620","concept_ids":[],"id":"segment.r017.book1.backmatter.further-reading.block-008","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.further-reading","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ff6a1233d5052fe86a125f956fa902dc49d0cf4a3bf6eaf99aa3cba666a61ae0","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":38,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.further-reading","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[38,39],"member":"source/Intro-Math-Programming/baseText/book/backmatter/further-reading-and-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dfc47ae8956a3bbffa0e875b9232cec743b9b50ad9fe5b5610f7fe09ea0826f4","concept_ids":[],"id":"segment.r017.book1.backmatter.linear-algebra-license.block-001","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.linear-algebra-license","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/license.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"641fbb87e8871a20e2386e45a83b71acdc50a8c4af704a6b6bf645ecb3233acb","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/license.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.linear-algebra-license","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,4],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/license.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a8e0bf95f58066c1b3806967712cca763e27a39881517e7b05cf4be16756ab1","concept_ids":[],"id":"segment.r017.book1.backmatter.linear-algebra-license.block-002","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.linear-algebra-license","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/license.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"90394ae0dc812d94002c8a3e27c4123f31929c611b2ca504d48dbac17295d121","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":6,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/linear-algebra/license.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.linear-algebra-license","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[6,15],"member":"source/Intro-Math-Programming/baseText/book/appendices/linear-algebra/license.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b36a8399b2aaaa7822e9ce2d5eb24a509912539f04bb747c6141d5c267b2fadb","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-001","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2c01b38d7cb7b66c88caf54f3981b2fc216398e52f3126bd8e6fe2cc29da01b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":2,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,2],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"40438f86dcadd4052b8f71b978c3cf3c42346cacc13418e03af082ce515068f0","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-002","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1b450438041aaf04b9ffed57d8a67884673098e0f04c102a63e8e7570b019c16","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":4,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[4,5],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70f41a28071cb84af5864102e853cdfc3cc1d0974e71472439bd7587430aa4e6","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-003","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9ddfb9f0a6c5c1087183cd8ef602ee695df990c96d16bfeeb9972fc1b9f6523d","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":7,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[7,7],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e6284a6bb085ac4eeb6681e713dd0123f8fe85eee8e03f0d720162ae0a03207","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-004","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c2d33529bbdf5da8360e355cf85a4e4cb8097885a218bfa1b65d2a312ddd2124","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":9,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[9,9],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"56770abecab59dd61e38819843121a0a7b71db48e58d46f98c57f93fcf38ef68","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-005","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a07dfab819a906028f1ef91c4923e64b57a9844a74b48ee679af1a19d4b86b25","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":11,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[11,26],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7d6b73806d18ba8026f66fd354deb0648e881ddc2ecca77094f37b42feacc29","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-006","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"59dd1f43efaa10e9b2549f08c27d65c605c84a721fe011437b67e6afe90bfc48","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":28,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[28,28],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bbc0721dd93721dbba178e720eb8ac3d8e2125bcde51329e68bb33b776a9c11e","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-007","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ab3110bb1d79318070f8d8a62baa2fb02fe1876a9145f3bfe9e714827de62e83","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":31,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[31,31],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c6351f1d71cf37400a6447b5f1ffb2ea51f8f205205cddb74059d1a919c97f01","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-008","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"12690e07ea06b31a210055cfafc3c4a9bf3d4174c86f892d2f33d977f3dfd085","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":33,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[33,33],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"91bf31c7789e250571799902faaf70e53d2e65b760bd23cd14ea361b7145c30a","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-009","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"79b5dcf4ef8a5a670953f304a9d71a1e8d21ca09c752a813e074e13b710caed8","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":35,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[35,36],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"12361f7d8c8a10252d2e7520d01edeb465e6f7426ee740d10da01446fe3524f1","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-010","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b0cebe8e59a5c3b6cb238aad907a30952e56cf31730458d85255b0d2be306a40","target_edition_id":"edition.r017.id-id.draft","target_line_end":38,"target_line_start":38,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[38,38],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c4b73c3229e015216067a23016c1246a80365f752b1c30032ee35617b36f9da","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-011","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9b9ad1f2bede8997424a183875ed8643ed33bf39932c9af93741d6a7768d739c","target_edition_id":"edition.r017.id-id.draft","target_line_end":40,"target_line_start":40,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[40,40],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a73af166e67c1bf9dda95a34ce9d79c1c449e4c0502715bc1a7561f83d1895cb","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-012","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e28269071f2587beaae5b53e1b1bf48b9d6a9816187932c5155b41099829e0f5","target_edition_id":"edition.r017.id-id.draft","target_line_end":43,"target_line_start":42,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[42,43],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d074e9ebc2886391a3d29979d68a497e8e4cdb438799b831b50e8e11ea52d715","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-013","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c4744719ae67ed24a1a2084e05c437f5ce4f74356beffa022d4960eb83a35f77","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":45,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[45,45],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52dd09a6aa4961fbba568f8646e60c0184c727e54202b8e05c63c8f4df7e1fdf","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-014","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1e3e3d5c2ff062251cab91bad1c2b8f1f6eb73a2f9c5978ba51a101fdb6711bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":47,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[47,47],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ebb4957616ce5f1ca6168948be19b45544e48e85d89f9c3183a9c968800e268","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-015","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"abad32cf000402e4222096387005c4fab62e775d09c12d05cd9c53124d0caf30","target_edition_id":"edition.r017.id-id.draft","target_line_end":50,"target_line_start":49,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[49,50],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"66bc61cfdb922f81f589111b15bfbbdfd87d710252817a71d63acf0471b54e97","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-016","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"313ac16bcdc9affe158776bc7874dd79d8a28d37600b7c805d525b1c0b098e57","target_edition_id":"edition.r017.id-id.draft","target_line_end":52,"target_line_start":52,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[52,52],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"75e766a30ecf6d79ca62da09ec48e25a0c97b8d44c4b21eb35da5ac678442bf3","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-017","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ae2336598251677fdc4366eab9c9cd0c6bb2a87f2aad3d930ea5690ba7dfcc47","target_edition_id":"edition.r017.id-id.draft","target_line_end":54,"target_line_start":54,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[54,54],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c63cb9e682869f4e1e3655a78eb169d8e4147d1b2d65eb73a0505fd7a6dd157","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-018","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d64bedb8b88e1e412c1539916b455a3ea641486eb5db5ccf79d09d6e2a9a599d","target_edition_id":"edition.r017.id-id.draft","target_line_end":56,"target_line_start":56,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[56,56],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20eb285b6f4d553a0f5c37012cd4e0496e880d82bfc818ac6bb228f080e2bd1a","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-019","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"de1cdd0e7dafbe43b6780120462cdd44c41807bb356784b7f06a1e3c81140db1","target_edition_id":"edition.r017.id-id.draft","target_line_end":59,"target_line_start":58,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[58,59],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a3add67dda2bccf59ba0d2a53baa99dbf1be5484c059ee403b99198bd5c500bd","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-020","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fc10838ad4c49cef34b37ff87fb026545ad54e5e2ece240ae205d2b9193b3a36","target_edition_id":"edition.r017.id-id.draft","target_line_end":61,"target_line_start":61,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[61,61],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa1de2d69a5a79557e65ccb403b4ed140561df282faa3c9099b170832af3bda4","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-021","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a789d1ce4873e9c1b21b33692e91df0a3280b61866d449a352f072389cc30b91","target_edition_id":"edition.r017.id-id.draft","target_line_end":63,"target_line_start":63,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[63,63],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bbbd23debe8f4a80a1a11533bb6e3d2e47a7f41545f17c027efbb37f361791d8","concept_ids":["concept.open-source-solver"],"id":"segment.r017.book1.backmatter.software-resources.block-022","locale":"id-ID","parent_id":"unit.r017.book1.backmatter.software-resources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"65f266f61a3d2378c70e40d5e18b0bad30a0dab054145c7248238520369f3cfe","target_edition_id":"edition.r017.id-id.draft","target_line_end":74,"target_line_start":65,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/appendices/software-resources.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.backmatter.software-resources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[65,74],"member":"source/Intro-Math-Programming/baseText/book/appendices/software-resources.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94cf1c0fab8be0d6b1f8da4999f7d66ec270acd1242f0f32a9a303217a142e01","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-001","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"c8981522a0536b7cbc4baa701f4ff862cb0c37fdeb536481c8e3a3b40d6ffdce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":5,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"c8981522a0536b7cbc4baa701f4ff862cb0c37fdeb536481c8e3a3b40d6ffdce","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,5],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7aee2636ec95ec0af5975af7600384b838161fedba78332b569caea48e9e4b93","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-002","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"0ef193f81892e5b41000168b69797226adf3ea7ad08082b3654fac76bbf3badc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":8,"source_line_start":7,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"0ef193f81892e5b41000168b69797226adf3ea7ad08082b3654fac76bbf3badc","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":7,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[7,8],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4ae73522e142b71c504294d3d56085032c7843c39af75713fa71908aaac8ece","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-003","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"2e6c31e2cd939097f95bc65298ca3d2acd7bd7c2e74c2042e8c4a5980e0a2efe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":10,"source_line_start":10,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"f61fb413b64c6befc0de2a0e3a6924e7e4e5be8b8cf2ad6a92f226247153958e","target_edition_id":"edition.r017.id-id.draft","target_line_end":10,"target_line_start":10,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[10,10],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6cf17807ede99e028ee07ef06f8f39ae4d07e12d534a2ca138d23d98fb6b443d","concept_ids":["concept.constraint","concept.decision-variable","concept.model-development-cycle","concept.objective-function","concept.optimization-model"],"id":"segment.r017.book1.ch01.text.block-004","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.mathematical-programming","concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"2c9fa2dab053172687f0c1bbe8761e3521bd0c51a967eb7aec3ff0a50f274bd6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":22,"source_line_start":12,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"125131fcb0a110dc6777842f4d98064d5a1f68e1dc0a46fc85dedb8f2218af99","target_edition_id":"edition.r017.id-id.draft","target_line_end":22,"target_line_start":12,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[12,22],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b29dc6767aa0fa3e320325c1c7070b393a04e9eb3ed3391c4b0459d15132774a","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-005","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"a2d859138a17e94c7f5235733b46734774ebf0a0faaf2dd44ccb737ac5786412","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":24,"source_line_start":24,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"e6492343da02bb960585962422887f981d01ae223ba78539c96199fb6144f89f","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":24,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[24,24],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3568985a074e7c2142175c9892d327bfc19e2095c5c4207e6361764c04982ed9","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-006","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"a8f61387d8260ce4d1d3e9e19c8833967a9b4eb6d484805f26a9b3a8d8e64c16","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":30,"source_line_start":26,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"514eb6f9870e2f0319c5e72d529bcba25b06ad6e4c7732a73fc02546fcceab62","target_edition_id":"edition.r017.id-id.draft","target_line_end":30,"target_line_start":26,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[26,30],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9b470dc8916e66163441b97773cb2ec3875ac7b6e62a56c3906b08cb6c9dbc9c","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-007","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"e96c3f3bf9a19287434712d0d7770cb0bbbdbdabb621609680e03aa7172279df","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":32,"source_line_start":32,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"8b1129693958a8e33a5cfc6a31d5f8bd8f040076025d3583c41b816a93d7d3a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":32,"target_line_start":32,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[32,32],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0d8ce7063292489996244ba0919a3d53b8d539bd79c6021ef274d755e0e6e22","concept_ids":["concept.model-development-cycle"],"id":"segment.r017.book1.ch01.text.block-008","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"8222ca69f7d755f36b39ec3d5598148754821dcaad0f2ac173db3e7794a14367","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":53,"source_line_start":34,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"b00db1ceac9ea80a12bf3bf003af7792163e7135fd8a26978307b54f5048d097","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":34,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[34,53],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8fbe83a2efd121722ca5804f4cbc217820b416e1ec461ee410c8cc5b6b4d1b8e","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-009","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"1bbb0b1ba505a08363cd968e3dd25cf74177cbd6d6c6a88aafddb4e8ebd8274b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":55,"source_line_start":55,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"50b1a911dce9ad2790531315dd2046fdf72fac00fa467a92f5130c4094c91c13","target_edition_id":"edition.r017.id-id.draft","target_line_end":55,"target_line_start":55,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[55,55],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e07a06c1dd629508545d533994a0500ad8bfa5f7b380605f7be8ac61e51508c5","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-010","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"cdc88a16a06879f56792e2f8b401fb2af314e651eedece0601f618df7a11ce36","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":57,"source_line_start":57,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"850eec1dc2bc7bdbfa5c7fad62870606752bb49554ef725855c6c2fb627e9846","target_edition_id":"edition.r017.id-id.draft","target_line_end":57,"target_line_start":57,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[57,57],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8ff0fb2c43efa5db6708cf16b65de3655083c51309e7c97fa5c894b5c5fd7573","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-011","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"d678646a7229f8072cde518b8bf4dc5335b6f0edbc837e777ead67b052dc7e0a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":62,"source_line_start":59,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"0dcc0406ecb156900a47d008addd09e64ab75e0688c40e838cae4b0245e3dffc","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":59,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[59,62],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5eba137c93cd50740804c1c1ce363c0ddf2bcf6eca012aba80b9358d69202cd6","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-012","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"135da84864063188cd543675821d9b5390a5b32e35ed9dd4f49ea0ae876b7412","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":68,"source_line_start":64,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"8d52677395fee506a2990deb46573f2a8806db259b2cc9afa394bdeacb9b39a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":68,"target_line_start":64,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[64,68],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c54c6fb4b9e8813fba70343c623de53bb1f4db0c9fd31e16491e5cda57f16c95","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-013","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"99e3c4f2b5e4878ddb2b6a5a6895be686c8bc613e2875fb5665323057351c479","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":75,"source_line_start":70,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"c492915adcbab99a96fbfb1ead47fdaa093d37726092a034dc31f8fea9b0b6f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":70,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[70,75],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6c1bdab0108e96aa68a67fc0ddac6de8a0966308b387cabbbf91bec7eb355ed0","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-014","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"e8e3001bd515fbeceb331cd8106ca7d4bc69fb958e0eaad6b15be73c0b214842","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":77,"source_line_start":77,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"ce21133894663571c4e463cdfe3a2da502475422dc99ef7c6d20705cec1231d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":77,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[77,77],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0c44b610fb3379ebd1e90f8c4cf004db989473062fa4c301ca59cbafefb98005","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-015","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"4e7f9467e479d304eda749a1d8b93c82e1d4d243429be60a39a4e7405d0bfa63","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":85,"source_line_start":79,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"1705430582d7b294235135088845e9c516a88f0efc563b7c79d0708333627b62","target_edition_id":"edition.r017.id-id.draft","target_line_end":85,"target_line_start":79,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[79,85],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce142ed6e2b8e8523d3e3e049d67284fd5d3c462d90fd09d9171a691f57c217f","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-016","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"e9fed7e25fd91bbf0a3ab4c9c0b7300ad82eb0a11be3d794852f342bf5d50069","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":87,"source_line_start":87,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"5c0eaa7a5372f6f7a30667d758f8ef2491769dae6ee11a9a54c6ce317e34db9c","target_edition_id":"edition.r017.id-id.draft","target_line_end":87,"target_line_start":87,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[87,87],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d98414cee5df371df45af1c53965cf1e05d81be542342291e1a8f8dcca5db41f","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-017","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"71f00ccac8582fc1fa47c27c21c1335e95516d0b9f3a172362b50640502720e6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":89,"source_line_start":89,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"9c776d767ef89fad4f6ebb6631aee5345f90a013b3b3127ee9a8e292da5b22d9","target_edition_id":"edition.r017.id-id.draft","target_line_end":89,"target_line_start":89,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[89,89],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fcd4dc624ea40e44154c4a234ac9dcc790737bf02c9afad4daf59a7c127b5b7e","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-018","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"e102ea891012babc36fe346d63043e8a4dac35f63fe3e8fede2028dbdaa3d06c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":91,"source_line_start":91,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"934d23ec3b4d09ca382477cc0333cc506b033cae18482dbcad9b57f394d734f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":91,"target_line_start":91,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[91,91],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"efc14486a64d53be54bdef49114821f8351421561af7494511d66a22ad097a9c","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-019","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"b7af428d95363d0b63f62135bc1be55d460e9b63079cbe149a9d6d09565499ce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":99,"source_line_start":93,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"6e558af717d8cec8ee0258e07368c3b21fa174551c170bd49cc2d0bf2b7c4a58","target_edition_id":"edition.r017.id-id.draft","target_line_end":99,"target_line_start":93,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[93,99],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"482ce7556f300ac79097849becca39e0f67eac9d804dfc672e78b47efca42f63","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-020","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"4c58e86cc0d3ee619b75b72b85530ad210b6fd509104619969127dc4307d0908","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":101,"source_line_start":101,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"16b646179109f71fe4385d68ae999bce050a9306057c5e2ac13466ba5fcd1a15","target_edition_id":"edition.r017.id-id.draft","target_line_end":101,"target_line_start":101,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[101,101],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cdbc836976d44650a6996e8f971652ded4272b50f21d66e46d588d8b42cde379","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-021","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"0f92424da660cd2bda8bd5af9f62f7aefb3869513b07e2d718a5cc30446ed4f2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":103,"source_line_start":103,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"03945c6ac113705ddc77bc75ba19b316c892a9b5fe94a6cd0d2cedf69c7223cf","target_edition_id":"edition.r017.id-id.draft","target_line_end":103,"target_line_start":103,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[103,103],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"71dade9cc6ffff38645884b437a52f3db673f86718107cc3b1455f72703f8c75","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-022","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"e7f045b678450df9d0bdd1347b7e66b8183756fae33f56ca236e3d7e79525573","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":110,"source_line_start":105,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"60d353b8fafdff32162cb5b35bf664acf7c310be5eef4a2718d1b311476a299b","target_edition_id":"edition.r017.id-id.draft","target_line_end":110,"target_line_start":105,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[105,110],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e1e1c9655f38f891005936cc979cbf902cd7e3fe79fdee0c822f0ca8f914e5ea","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-023","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"85e942f240f7706f3957cd392ad0df0d83feeb39e1e2f3b65db1c6eec5087610","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":112,"source_line_start":112,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"9b5a8f061959362c52033a924b3e51d4ad686ffdecc77ee78c58052afcea192b","target_edition_id":"edition.r017.id-id.draft","target_line_end":112,"target_line_start":112,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[112,112],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e2a22a8ab56f86e6aaf02bc3fd8ce728ab855587704cf14441e5ba5cc7ed60b","concept_ids":["concept.operations-research"],"id":"segment.r017.book1.ch01.text.block-024","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"9c5806ecee565fd4ade6a09e431ebe6db91069c1b95b13eccc1f24e0600fac86","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":115,"source_line_start":114,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"0febba0c699d3275dff3e945af695327ef2076845901923391c35702b042c7f2","target_edition_id":"edition.r017.id-id.draft","target_line_end":115,"target_line_start":114,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[114,115],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6a9139d306654ddd3b674b02a52c9d471e1a0ed8ca695f20352fc212bd67a7d","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-025","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"ea9d7427d0a79b12a7639efe8f1658202ff488e553423c433d4b2196cb5e6e32","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":117,"source_line_start":117,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"ede79d6e4f998e20fe0fe0b8f6747a31a6c6eee24055681337bbc887fec6a8bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":117,"target_line_start":117,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[117,117],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a936395ed342784cb9cd61dda6140326822e485d69388f5bdfb86dca0ff96d58","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-026","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"c2f1f9e44f1ab7964e04b13abd30d623ee086e7850157c449a582d0160b6658e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":119,"source_line_start":119,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"138d92d3f6f714b5b4c598afd9506f35da75582b6a3a68348a35ae21517ab3e5","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":119,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[119,119],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"748d18287d43b840356f1aaedede39240c6ecb4400fd95f9f493469ad1551cbf","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-027","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"016eb2a0857cf1dbce9c98c59c0a2ea66b2fc6bd294d9f026abc24d837b0ba0d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":121,"source_line_start":121,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"8354916e0622122719046c6b270796f206bbd82b2e862867f35b8437990dcd01","target_edition_id":"edition.r017.id-id.draft","target_line_end":121,"target_line_start":121,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[121,121],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"002111b15de4ff0b580d7463f38645ac3eeb068e0c9ede7d554a0a6d5308c5dd","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-028","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"de0343444a26c36a643f98ca567b2397d6d271c9b362ad4e02f2aad6a29964a9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":123,"source_line_start":123,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"2cf761305814c7ad393a5fec51bf2622872738222557283107a372b85782eabf","target_edition_id":"edition.r017.id-id.draft","target_line_end":123,"target_line_start":123,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[123,123],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5daec8ae65e2769064cdc840e0bd54482453977f466255ab4c213bcbc70188ec","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-029","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"712caa7cc291ca1e90b89e4dcc57d3630cb3a1eb0da32746f14ed35db34f6eda","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":135,"source_line_start":125,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"356d6b86046f80d0f68c67e43e75f71653d0fabe0360047ffed638e0f0613e33","target_edition_id":"edition.r017.id-id.draft","target_line_end":135,"target_line_start":125,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[125,135],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c1dfefc957d9f17019c7143369197f8945468009bda871cef3422f903fe7b2ff","concept_ids":["concept.mathematical-programming","concept.optimization-model"],"id":"segment.r017.book1.ch01.text.block-030","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.mathematical-programming","concept.operations-research"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"e8d5e375bd53dea8a64d3b160007da338921e081119d6703b2e2c6326ed9b17b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":138,"source_line_start":137,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"21e421a7872dbee958e93461edf9c09d5cd3e3138520ead277ca3ba1404a2674","target_edition_id":"edition.r017.id-id.draft","target_line_end":138,"target_line_start":137,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[137,138],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fbbeab5f21535345908ec1e7172ac81be274535ccce9ec21c66732c92981f982","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-031","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"d24f98c32d3f8eb944fa4ab9c6463211df8e0b61e33967a3efb685a2cb1be300","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":140,"source_line_start":140,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"ca8d6c610e41bae25f09f486b2e7a10250cffb9d04ec4f62e02e70bf6f08f714","target_edition_id":"edition.r017.id-id.draft","target_line_end":140,"target_line_start":140,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[140,140],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e7290293202c0b4ee22165b5accd2c06d5ed7091438c91c35c31df78fdc8fc7","concept_ids":["concept.mathematical-programming","concept.optimization-model"],"id":"segment.r017.book1.ch01.text.block-032","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.mathematical-programming","concept.operations-research"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"2e92622a2f1da33432679dd6dc8eacf2da5343c97e28b5fc2a59daf3bdc871c0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":158,"source_line_start":142,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"ed8c9f7fce989be89cb7444959c4771a2f1c0e04f34d6e5873b2453bb574d6b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":158,"target_line_start":142,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[142,158],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce5f80e0d9fc5ee50548bd33a6da23b68f5855e259e6e39aa551eb3f480b1912","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-033","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"681e1314c61206f5dca34911f626833ab80e3aeb063952da2c79a6ec98a20fb5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":160,"source_line_start":160,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"b836dfdd26c6a3b1958000cacab26a5e5164a5c6337a7501a716ab1f197814b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":160,"target_line_start":160,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[160,160],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c51675ce804e83f78598e5c2ad612dcba671bacd54f37d1523fdeab917c7941","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-034","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"771ff04adda5817085930517a556499d7f23e98c67048263434aa38dc52b1ee2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":167,"source_line_start":162,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"6c28fd1080bc298440475f7abd3c373bdd6eede2e9a12b35302635ad8a1ee3ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":167,"target_line_start":162,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[162,167],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b210f63256dbc9bc3f43f7608735550be52806e905c50a92da1fdd0732ef9945","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-035","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"53a0181b82236502bad3bbe4ed20058a9844f36391ceb644af85fafc119afac2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":169,"source_line_start":169,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"88317d03637651c347c2b5047e0756a05982b7bd8f27a0915744ac0ef9719e39","target_edition_id":"edition.r017.id-id.draft","target_line_end":169,"target_line_start":169,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[169,169],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"54fe7510c9621b63a042fe20f84ae057b83596004c6e5c9ddb6e40f222749e26","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-036","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"a841cde02432f320ab0e41cc86b9fa808f296d79492b87de162e443de9e21671","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":171,"source_line_start":171,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"106a0f4d4b223c5011b4a45456bf5a14578fc73a3682cefb489be07566bb7f28","target_edition_id":"edition.r017.id-id.draft","target_line_end":171,"target_line_start":171,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[171,171],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6d3948550f9b81490aced87841314264597e06a82b1a1bbebf5d83860f0f99c3","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-037","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"e952ee6be066513fc8aeda2a588afe650f07ca7125ee428a84786681f3fa24b8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":173,"source_line_start":173,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"f1193a38b5b48a01b739cc9b709051b325f911595567c373df8127648a35cdf7","target_edition_id":"edition.r017.id-id.draft","target_line_end":173,"target_line_start":173,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[173,173],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d586f73e41573854ce04ac98633c7c11d74333767406b7574d13a2ff516731b6","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-038","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"345609e825fc91b3bcca2e6e879676641b18265bc5fab56384ab8bfc892412fe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":185,"source_line_start":175,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"ae4cbf8675e079bba50a746a955d4ca83170abe13117a447d00f713d3cbaa898","target_edition_id":"edition.r017.id-id.draft","target_line_end":185,"target_line_start":175,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[175,185],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc35326986bd9c7f5b25d0050b2435e2df94e3171080b97ca9d75784b79bf8c4","concept_ids":["concept.operations-research"],"id":"segment.r017.book1.ch01.text.block-039","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"3f66fe1658f71bc19d6dd9d1cc5f50bac790eebc4393abfa3dfcf5e1203706e0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":204,"source_line_start":187,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"7ab6115d1a549ac560dd74b3f000c8dbac7c7db2d33ee515b52a5cc93731dd4e","target_edition_id":"edition.r017.id-id.draft","target_line_end":204,"target_line_start":187,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[187,204],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ffa850d7c580d55c178975bfbda43318745e9fd71867fe5aceb39e35930e90ee","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-040","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"dbd3db76d5db0e13ab1eeb7107c3390e5ccbdb2f7c04f5aedb489cd7cadca241","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":220,"source_line_start":206,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"36faccda3296bb91a65090d133ee6b31aed8afbd083ddfde21b65df421c163ae","target_edition_id":"edition.r017.id-id.draft","target_line_end":220,"target_line_start":206,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[206,220],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9551583cd47783f314c86a168968372c385f0d8bebaeb0e618fd3673da7f2ca0","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-041","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"046d40ce53a3d6f8f10e7006f70595d4b065a166b8389757ff4cdadfdffdbacf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":222,"source_line_start":222,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"f415d61fc517bd1600a5b1ff6d9b29d097496f35a044280252ae65ea080c9911","target_edition_id":"edition.r017.id-id.draft","target_line_end":222,"target_line_start":222,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[222,222],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2384cbce0c25d9c64f6d369ed96abb06f90304020d4fec1bd8fb7d2f5c60f235","concept_ids":["concept.computational-complexity","concept.linear-programming","concept.mixed-integer-linear-programming","concept.mixed-integer-nonlinear-programming","concept.nonlinear-programming"],"id":"segment.r017.book1.ch01.text.block-042","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.integer-linear-programming","concept.linear-programming","concept.mixed-integer-linear-programming","concept.nonlinear-programming","concept.objective-function","concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"55d444b68ae43e44b3a56ba0b02405162763f0b504201af80d5501d8581f73d6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":226,"source_line_start":224,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"114644f6458f1f675af04c1bbad7277a38d05cdc990bd168d4472e3360028bbf","target_edition_id":"edition.r017.id-id.draft","target_line_end":227,"target_line_start":224,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[224,227],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"87d11bd1788406c4fb6a3f0bd2d0fefe6d463cafe3c80304ea58a1933886e64a","concept_ids":["concept.computational-complexity","concept.linear-programming","concept.mixed-integer-linear-programming","concept.mixed-integer-nonlinear-programming","concept.nonlinear-programming"],"id":"segment.r017.book1.ch01.text.block-043","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.integer-linear-programming","concept.linear-programming","concept.mixed-integer-linear-programming","concept.nonlinear-programming","concept.objective-function","concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"e5223240266f9dad3de92a7b95b6bad20cb96c3f7383342d6dd767015d0d483b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":229,"source_line_start":228,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"8eec41b9310b505e8bea02f8d5673d257afab3191ae10e8888358e3e51090a4f","target_edition_id":"edition.r017.id-id.draft","target_line_end":230,"target_line_start":229,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[229,230],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"75f1764083da4e4c53870adeb6fd2d0b70f01ba5b789c4fcb75768091b592410","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-044","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":231,"source_line_start":231,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":232,"target_line_start":232,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[232,232],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6f100bb9549133ebb6a4ae59f79e5a9fbfd95d8977704a7299ef35192b4d4fba","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-045","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"90a9eccb4b488f7b288586b9c8a3676a1127cc2a3ad0d257fd9371ca4e479b70","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":233,"source_line_start":233,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"203fd861d202358691aa7f1392c2d01eebab8471065b62dc71a5696aa6b5b75f","target_edition_id":"edition.r017.id-id.draft","target_line_end":234,"target_line_start":234,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[234,234],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9c772257f1b0b40aedcdd6de8dfa59ab33278b297b7bf21a88fdb6abe81f7ac","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-046","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"5b36f9a489e8479e217f1840443d7281a1b38a706fafbc15bd56a3f25cc5c49a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":236,"source_line_start":235,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"a2ac54379516e7f2788dc75423d015c883a99f4a3dd6550a3fef30e887700f50","target_edition_id":"edition.r017.id-id.draft","target_line_end":237,"target_line_start":236,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[236,237],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f05a896eca50bce2b8d71872c55956b528ff11647aacacd701d1edfa6e9ce25b","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-047","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"b18981a4e778601b298d2cedfbcdcf14a690c3094bf8ec6451fafca5f45eef6e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":239,"source_line_start":238,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"1e1c9397914830f33cc1536e73593222e533b46b39109d125513915958d97477","target_edition_id":"edition.r017.id-id.draft","target_line_end":240,"target_line_start":239,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[239,240],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8722eaec1d081c7ed2c55ea0880619d9688c5560a35cdc8cd009492e470c65d8","concept_ids":["concept.feasible-region","concept.linear-programming"],"id":"segment.r017.book1.ch01.text.block-048","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.objective-function"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"4e60c96c810cc52f656052cde89e04cd200bba66a597f51332d0bf6f888cf180","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":242,"source_line_start":241,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"b29d3322ef58a30fd34ca6566a2c3cd6f0d8a2e4051411a2099d0f1cdb5eb55d","target_edition_id":"edition.r017.id-id.draft","target_line_end":244,"target_line_start":242,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[242,244],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c825acda0237fa94c10f04b0996767ea790ae7f20a9086973d4eebcfdb61bc45","concept_ids":["concept.linear-programming"],"id":"segment.r017.book1.ch01.text.block-049","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.objective-function"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"5ba81783c246a5416e027a45fdaf03da6bbc5e4d905399b1bb664166d208a1b3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":256,"source_line_start":244,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"9e07c28573171745b4b40521f1aea9114288e604d2723a48c865ffce8bcc6b33","target_edition_id":"edition.r017.id-id.draft","target_line_end":258,"target_line_start":246,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[246,258],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"07d63a7411e8bd292cda8c297e900111f738a2ce8bf12db06ebff5eba7de5555","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-050","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"8e9f4b773d6b383b422206f3e2747431eb41c738ac2bc0a7ed4665be6243e311","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":269,"source_line_start":258,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"e20f1d4b502d329c6b53ae1737a4520caf00ce9d949b3ba2a243ca0033511e52","target_edition_id":"edition.r017.id-id.draft","target_line_end":271,"target_line_start":260,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[260,271],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f1d74a57b07ae43b3b46b9b1b5b832e458f187a52d95f8e97fd31d421d1dcb18","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-051","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"d4d028e561f5e23eee88ef5b0cd3618ebcb08790d2e91920ce61b04b056cea20","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":276,"source_line_start":271,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"66e7b8d8682e98fcb064833b5844d0bb3b83ea243391b135c57fd8fa072d17b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":278,"target_line_start":273,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[273,278],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"50a8eb8202f4bc6efc3a6ef632172ca3a08c784c004e2b292b7bf464cc6175ab","concept_ids":["concept.binary-integer-programming","concept.computational-complexity","concept.integer-linear-programming","concept.mixed-integer-linear-programming"],"id":"segment.r017.book1.ch01.text.block-052","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.integer-linear-programming","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"f2c67a514fe18fac4166999a3bb0153c88fa966495b500ed6b0a7f7ac2cee6fa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":281,"source_line_start":278,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"a5c3015c7fa2db55db0e365cd024f86af3c25526a021f011a2f61b85867cfbeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":283,"target_line_start":280,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[280,283],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d65c25721c215d8ad4203b8ea06d04953cf885a8f6e9ac4b945d473c900902cd","concept_ids":["concept.binary-integer-programming"],"id":"segment.r017.book1.ch01.text.block-053","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"c2b4721c400c38f5d2368a264ea8c020f95a4116ebb5894563f9d8d11da6ed6a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":294,"source_line_start":283,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"5cacb0a43fe6c7aacd0242a7a8633d77939ab90894f98884b87b5a7859d0ac38","target_edition_id":"edition.r017.id-id.draft","target_line_end":296,"target_line_start":285,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[285,296],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d2ed48f88a43fd6211a3ef3cbfd70ed53a4465a8b4f42b811d17e5055a353e1","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-054","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"743b208f3232d8a9d7aa09225a4b84a76859bafdcbe4373f5c868ffbe1346c15","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":297,"source_line_start":296,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"743b208f3232d8a9d7aa09225a4b84a76859bafdcbe4373f5c868ffbe1346c15","target_edition_id":"edition.r017.id-id.draft","target_line_end":299,"target_line_start":298,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[298,299],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed12caf754f79e7e0803d7eb659fc111b0684210783aa2f2e997b0e367346207","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-055","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"7775c9eb2f4437dea359182f7617fc651d8e479cc42c4549583d632f9570408d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":302,"source_line_start":299,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"7d5fa06354a48acb4d7d5fbe3c8c8bfff59029295b55997ea8eaf2cf88127197","target_edition_id":"edition.r017.id-id.draft","target_line_end":304,"target_line_start":301,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[301,304],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00129949b49848877e8112f35d2b0de5980bf47882d534b4645495e490ed8528","concept_ids":["concept.integer-linear-programming"],"id":"segment.r017.book1.ch01.text.block-056","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"0ee5b831faa9a6cee40af24ee73bf6453d4d5dcf5d06e3eaf67aedbe7df421d0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":314,"source_line_start":304,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"010c389e63165ed0fc056dedacac633610b10ad33945e50ffb60ecae4a0fb2bb","target_edition_id":"edition.r017.id-id.draft","target_line_end":316,"target_line_start":306,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[306,316],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bbc7d1f29037df7efa49793f4221f5628bfa34f3182ac05a661faccb6dd2dcf4","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-057","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"532996bf8457994d19a22919e6196d3d5788e189334d7f996f91f8ac4f2db49d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":316,"source_line_start":316,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"6d304401d8dc8b9ad71bce2a777d7f9c31db90422e8a77289cff06988bd4bf36","target_edition_id":"edition.r017.id-id.draft","target_line_end":318,"target_line_start":318,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[318,318],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2b8fa98976b3a7357da9d7a6a865de7f82840bfbbff40a95747b26ebe1e9fc5c","concept_ids":["concept.mixed-integer-linear-programming"],"id":"segment.r017.book1.ch01.text.block-058","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.integer-linear-programming","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":58,"source_content_sha256":"568586d08b6f88af9f4d6318fe2a4c84ac46a064484ea2c94ee6a04ffc9251f8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":329,"source_line_start":318,"source_local_id":"block-058","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"75945f5ca7ca588f238b28d64d3e412842a59e158f07baa0e4ee2c48bf86a4bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":332,"target_line_start":320,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[320,332],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a072556094af7711b1b06138d7bd6b20eaf8da28a46f8d8f6b6302c8b8d1dcfa","concept_ids":["concept.convex-optimization","concept.machine-learning-optimization","concept.nonconvex-optimization","concept.nonlinear-programming"],"id":"segment.r017.book1.ch01.text.block-059","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.nonlinear-programming","concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":59,"source_content_sha256":"480ad28f4951eb747ad179bf38703b3a116f98a9428a85d422553b7474ccecb7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":343,"source_line_start":331,"source_local_id":"block-059","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"465ac9f5406a7b21509b1aafd7735337502833d88a51415347cc7cd8d1aa0522","target_edition_id":"edition.r017.id-id.draft","target_line_end":347,"target_line_start":334,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[334,347],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6c4b88ba3dfdcc154463709a0c9846eafa8325741ba6f9cc28e993f68ddd601e","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-060","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":60,"source_content_sha256":"01aa659abf7b1e676c19d3028b51a1993ce23177e9802fbc3f89dad1675ce06a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":358,"source_line_start":345,"source_local_id":"block-060","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"c14a89724a3a3f1e69accbf9f7f96dcad1504f9cbf74e8959d8261bcb0bf1b0f","target_edition_id":"edition.r017.id-id.draft","target_line_end":362,"target_line_start":349,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[349,362],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4dbe2af9f3e4d68cb71e58b2c07e6094640ab5d13bfd31202bb11afcf4cf02b4","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-061","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":61,"source_content_sha256":"738ff8604a3b81ae92a92bef618ed82d72fc8064d957a2bb8809ea4bf6eee93f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":360,"source_line_start":360,"source_local_id":"block-061","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"fa83837a2676ee2625739ab27dd96bbab0500847d5244d3a9775608099cd76b5","target_edition_id":"edition.r017.id-id.draft","target_line_end":364,"target_line_start":364,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[364,364],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d64f35817749f809a9ee22793340310fd3cda5829df6f0b055cdb3a5538fd683","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-062","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":62,"source_content_sha256":"3bae45d94de33a6bccca9238c04b817daf455e8d8479f92d062380522b25c964","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":362,"source_line_start":362,"source_local_id":"block-062","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":62,"target_content_sha256":"ef3ae15fbea5d94e43fc482214fc2eb102dae42bf675f71aeb8eed733a2c8e16","target_edition_id":"edition.r017.id-id.draft","target_line_end":366,"target_line_start":366,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[366,366],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dfea6c7bc91ec3b8ce8a66c0a0a6f6b7f7aee3624014fd64c6a71e942f0c84d3","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-063","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":63,"source_content_sha256":"32ec1dda26890ac3d7b4335b530850ca44ba6543b98806a1eee4f24f854b9939","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":364,"source_line_start":364,"source_local_id":"block-063","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":63,"target_content_sha256":"85f62c504a77a1180bddc357274070e779bff4133214f46f64b1e8cd5d662ab1","target_edition_id":"edition.r017.id-id.draft","target_line_end":368,"target_line_start":368,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[368,368],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"89fc5f537f183c1514bb83b1e3442935b0dcca4f1a5db4ef67729593f47b30f2","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-064","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":64,"source_content_sha256":"5ddf717f758b61f70fecd87f46638d60446b66bb8564d4e93f03442bd0b2541d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":384,"source_line_start":366,"source_local_id":"block-064","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":64,"target_content_sha256":"bfcce5f21070e554317f3df14724d9a842116c0b5987d7dfa607334679b4ac85","target_edition_id":"edition.r017.id-id.draft","target_line_end":388,"target_line_start":370,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[370,388],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1725a214250607189ec0ddc750c842dc6228428cabc9c50d1485400f96c395d1","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-065","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":65,"source_content_sha256":"ca0e854fec5c9783e21c7527a72f1d38e01c41007d8b1ac789abf7c724faa50c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":402,"source_line_start":386,"source_local_id":"block-065","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":65,"target_content_sha256":"d478bbc1df81dcc1e8fe7679934390daaaa3da944c7393e8b0f11d8c2d2aa48f","target_edition_id":"edition.r017.id-id.draft","target_line_end":406,"target_line_start":390,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[390,406],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb68328524c646a013f198e30bc272d3730f54ad7266801b48a611f7b230c474","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-066","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":66,"source_content_sha256":"8a899bc6895008dc9fbfd4474f4467b26f20257b196d9fb2489d3171d4a64aab","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":404,"source_line_start":404,"source_local_id":"block-066","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":66,"target_content_sha256":"bc91ed68b216f19fdc2b1c4b4e60a0d6f900ce025edb5b9dcd955c95ed16d53c","target_edition_id":"edition.r017.id-id.draft","target_line_end":408,"target_line_start":408,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[408,408],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e119403ca24257672b5b04edc9aace07d53b87354215dfe3b77bd4cbb4a5cb26","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-067","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":67,"source_content_sha256":"808c6af03d7e72772f62036c679245689659b48cb87ec1da09312b46b6c06f0f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":406,"source_line_start":406,"source_local_id":"block-067","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":67,"target_content_sha256":"86c24d937ae5403480ad2d5f49d0adb1ec1fa925f5af554d991edc9ee4d1a332","target_edition_id":"edition.r017.id-id.draft","target_line_end":410,"target_line_start":410,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[410,410],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b835065eca5c43bab6295cc423b7833f4c6bac6d613777c6c38e1c934ee82949","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-068","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":68,"source_content_sha256":"fb15501416f70ef9e53f1b61a7c6a3077417e09ff40930d52200e94fbbef1e2f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":416,"source_line_start":408,"source_local_id":"block-068","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":68,"target_content_sha256":"fd2e46b6870c3dc8f9ef7efb88d571e4bc90b709c978055af3f4c9d393cb8771","target_edition_id":"edition.r017.id-id.draft","target_line_end":420,"target_line_start":412,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[412,420],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3062d19baa61f04bd3a9855e55639e032c90834c4ee49b8ea957a9635cb27ddd","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-069","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":69,"source_content_sha256":"7e5deb3133e5f5992a9189130200bc18af7149fd115d4d5dc2728f9ddd806717","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":418,"source_line_start":418,"source_local_id":"block-069","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":69,"target_content_sha256":"d1a9281bb763e1bc4d31bbed562dfd930aeef69436a026ecba516af4cb8209cf","target_edition_id":"edition.r017.id-id.draft","target_line_end":422,"target_line_start":422,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[422,422],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1dd36d95cff264b433ebded6df97611d736a67e074b2488e9ac6c3ba00a0adf4","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-070","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":70,"source_content_sha256":"5ef42260d5fb21934dcf38b386e3b240460c9dcc92afd69ce5dfcf432856fcd9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":424,"source_line_start":420,"source_local_id":"block-070","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":70,"target_content_sha256":"b2734da07a94477a9d56e13061789ba72d193719ea372ff3a469e1198577a57d","target_edition_id":"edition.r017.id-id.draft","target_line_end":428,"target_line_start":424,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[424,428],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"976d1d7d570b047fe8bfecd26722421d055648eb921a0fee0b79d40ae8d70e69","concept_ids":["concept.machine-learning-optimization","concept.nonlinear-programming"],"id":"segment.r017.book1.ch01.text.block-071","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.nonlinear-programming","concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":71,"source_content_sha256":"076611313e3c49b025556e40ac1a0aa62ad0d636c49f39809ebcce286d2b20f8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":444,"source_line_start":426,"source_local_id":"block-071","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":71,"target_content_sha256":"076405bb0eb424b8076f752fe371df1ab83f0016b41e1639d1c85a508a1e6f83","target_edition_id":"edition.r017.id-id.draft","target_line_end":448,"target_line_start":430,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[430,448],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26124fcbd58329346cd8d71e7e166655d1f650a83eee5e4f8422af927fb40b37","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-072","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":72,"source_content_sha256":"0ee36d1059f3c995b50dd512d860840fa1998eca02e2c931fccd13ee25a6c1e4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":446,"source_line_start":446,"source_local_id":"block-072","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":72,"target_content_sha256":"4ed0bffab6ce236be95319fd2bc75628324a850ace40386c92874763060fca2b","target_edition_id":"edition.r017.id-id.draft","target_line_end":450,"target_line_start":450,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[450,450],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3f24127db68237c09c5c6637e6e66cc759f5c00c1de0a3cd1a27d5a5cdffc912","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-073","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":73,"source_content_sha256":"73eb9e7db63d8de1191e664aecb09b8255f08df2d1e4a39d48f2bc81656c785f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":452,"source_line_start":448,"source_local_id":"block-073","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":73,"target_content_sha256":"8f560bd97ed0c46c1e84ea62e5bc9519f57df067d6b0dfa165396f8c0bd69b58","target_edition_id":"edition.r017.id-id.draft","target_line_end":456,"target_line_start":452,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[452,456],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4648892cc8446d59ccf070a90bde998652969645da38453ad2694e7f6a7cefac","concept_ids":["concept.machine-learning-optimization","concept.nonlinear-programming"],"id":"segment.r017.book1.ch01.text.block-074","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.nonlinear-programming","concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":74,"source_content_sha256":"4eb313d85077e979e2aaa2386fd6f704372c22d8a03057df9d849e0168cdd244","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":475,"source_line_start":454,"source_local_id":"block-074","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":74,"target_content_sha256":"4417917a61280fc1686c933048398d601c1a1e2067a01d68662db1029dd64659","target_edition_id":"edition.r017.id-id.draft","target_line_end":479,"target_line_start":458,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[458,479],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7ea9df38dc8255665c2b547e7fe3f3f00c869c3aea69828aa4a2a3c22ead1b46","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-075","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":75,"source_content_sha256":"5910324469c0c63f141b6b69e0deb895f4a7d58e36c3b4cc4684919ec5aa1d9f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":477,"source_line_start":477,"source_local_id":"block-075","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":75,"target_content_sha256":"f2b88dc229d826df60f73cae24be374762efc6347e28348b2aa752422e828054","target_edition_id":"edition.r017.id-id.draft","target_line_end":481,"target_line_start":481,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[481,481],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9585343621fcbcd8d0c438e8146da5d154aa8e5cfcc7ba9a80e02fe693f0cdfc","concept_ids":["concept.computational-complexity","concept.mixed-integer-nonlinear-programming"],"id":"segment.r017.book1.ch01.text.block-076","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.mixed-integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":76,"source_content_sha256":"534b694d7c4226be4325b843c1be610899870fb8a7c8a0b2cf2553f8fe3a1847","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":480,"source_line_start":479,"source_local_id":"block-076","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":76,"target_content_sha256":"838cbd65a1bdceca3d11547dbf340bcbe318c5485cd309bd44dcaba8a039634f","target_edition_id":"edition.r017.id-id.draft","target_line_end":485,"target_line_start":483,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[483,485],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"75384cb98fc9df2ec8cd342b5dd09a8294c5cc999c5f0de108bf9e6fe86ceb4f","concept_ids":["concept.mixed-integer-nonlinear-programming"],"id":"segment.r017.book1.ch01.text.block-077","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":["concept.mixed-integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":77,"source_content_sha256":"4d284ea54b175a13f78a919ca060f2ecb7dc88546e459a5b330350f0e096b18f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":494,"source_line_start":482,"source_local_id":"block-077","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":77,"target_content_sha256":"56dd50bcf195acb9548d655fec499077645e69e611924a383f69cded6ab3c4d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":499,"target_line_start":487,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[487,499],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b5dd8a56a7a08786090b93c42cec1fba81bb9046eb85b79fcdd061afafcb782","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-078","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":78,"source_content_sha256":"17bf5fdc9406db51cc766d5cdfaf160a495ad4a208fbe5162140f87e40114d13","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":496,"source_line_start":496,"source_local_id":"block-078","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":78,"target_content_sha256":"ed4ce19dd00a3c3e64d46c3a2acc6b16ba54b1ed45c2c89530bc8d0b17993c6c","target_edition_id":"edition.r017.id-id.draft","target_line_end":501,"target_line_start":501,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[501,501],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"494779546df044b862e6aaceab77df6a70b5783a198d9566b7a70b5c18bbd314","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-079","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":79,"source_content_sha256":"546609db023a8b2b9fe408c4268ec3a6fd413e3a0e921713b27f692d8fa18c5b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":511,"source_line_start":498,"source_local_id":"block-079","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":79,"target_content_sha256":"7a290789dae415b7b2d4b5e113c69f056c8382d4833cdc6971eed1d235ff9443","target_edition_id":"edition.r017.id-id.draft","target_line_end":517,"target_line_start":503,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[503,517],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0b013a7a05e91944f9fe6e0ae688887f59645c1f143b831bc840dd56e3e38d60","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-080","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":80,"source_content_sha256":"d0a1101a72e9167339c2463e9044ffe2fe3d0f4c8ededd39cfc213fd7f300975","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":527,"source_line_start":513,"source_local_id":"block-080","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":80,"target_content_sha256":"348b9cb1d941255488c8cc9015b29dc093d5c8c01107ac218124ee398fc1ee53","target_edition_id":"edition.r017.id-id.draft","target_line_end":533,"target_line_start":519,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[519,533],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5617ea8e77a40396ae72f023a2797454a0ff20cf7407b34b41e1853e2d7ab07c","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-081","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":81,"source_content_sha256":"fc69951dd731480dc797a40295360e763c2491c83ae5bd8b9bd962796c258d90","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":530,"source_line_start":529,"source_local_id":"block-081","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":81,"target_content_sha256":"efcef910456a4005c34bb4084985914fdbe38ca1df4f1735d92ca39f25ed95ee","target_edition_id":"edition.r017.id-id.draft","target_line_end":536,"target_line_start":535,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[535,536],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b1abeae8f4b372a530ec42a58b74035dc01afb7985933c46a3c342e89dd44eb","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-082","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":82,"source_content_sha256":"6ebbd1fdef2c577175a98716f2f447ca6b676eff0af8f7463ed55fae63b76abe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":532,"source_line_start":532,"source_local_id":"block-082","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":82,"target_content_sha256":"77ce1c218cb76035d1d5d67c916d08332b74be112c5a3bd823892f9aae71b466","target_edition_id":"edition.r017.id-id.draft","target_line_end":538,"target_line_start":538,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[538,538],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26c05d03678deeb71b8380c07cf40bd127ffb7db2f6cefd4e0d3669e48b03696","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-083","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":83,"source_content_sha256":"b11b2ffff23ace31d901d785529e2f19075a90bd1e4be32c4acae1a1f8700f2c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":534,"source_line_start":534,"source_local_id":"block-083","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":83,"target_content_sha256":"5d91492c536adc1337dcbf99117ac6b4660a57f1e494c4e0bfafa552984d7a45","target_edition_id":"edition.r017.id-id.draft","target_line_end":540,"target_line_start":540,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[540,540],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5273aaeaca5efbb8294a40746a3051bfd75f426a8d8c3ec96f5471fddad8e9e5","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-084","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":84,"source_content_sha256":"4caba3a081676e937f7ccd1f96e40c20a0fb71f6ab984e5251b8a0a65ae805e8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":536,"source_line_start":536,"source_local_id":"block-084","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":84,"target_content_sha256":"0697aa1de0c8b2c41604e65760f6bbd410a9faaef6c92ebc4ff0cea28dfd82dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":542,"target_line_start":542,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[542,542],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fac97249eb42eb6374fee69458ed9870446cf00ed2df66b5461f53bbda636a6e","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-085","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":85,"source_content_sha256":"edf732ffb9a09ff022f2ad837085e1e0ea5a269f0910bb92d133721ce79a737e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":538,"source_line_start":538,"source_local_id":"block-085","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":85,"target_content_sha256":"e6fb1b9458ca5bf996131db72a11ea0f530db8170491c7cd3660e9ed1a34a70e","target_edition_id":"edition.r017.id-id.draft","target_line_end":544,"target_line_start":544,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[544,544],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eab7a09bf455e924dc01a61761103893542b7d68c4501585f2e18780bf8a2957","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-086","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":86,"source_content_sha256":"4016f213990b9049c7c3dceba1ac8e32c5f21ff5d3c4f8b309ac30b7119564d2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":540,"source_line_start":540,"source_local_id":"block-086","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":86,"target_content_sha256":"1398dfc35607015d1223f3421c920f6fa3c1d7ecf21820fe5aa593832c3b091d","target_edition_id":"edition.r017.id-id.draft","target_line_end":546,"target_line_start":546,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[546,546],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d760ef60a8d2d117731e9de864e7db90434ad3d6819280da8112e6afbdc3c366","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-087","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":87,"source_content_sha256":"f09e8636d7a51e0bee73215236056e3f6207d751a99be61a7255f62f401c90eb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":542,"source_line_start":542,"source_local_id":"block-087","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":87,"target_content_sha256":"a06f81e2a5a486ffbfc527c8d8842390e69f79ecd5ecca2c85be7da7b4228851","target_edition_id":"edition.r017.id-id.draft","target_line_end":548,"target_line_start":548,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[548,548],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"efed0d884f4c598111cbde4ff96f557767bec8128cfafc6de503ef01a265a520","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-088","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":88,"source_content_sha256":"779b2e6fd8798ac8fa3e23ff676d6b5c2a227a2aac363aec9cb08963fc01b6b7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":544,"source_line_start":544,"source_local_id":"block-088","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":88,"target_content_sha256":"c9356b3c4c63b371e015ac5aae8c2df51311fda070fc9bb30ff5fb8510b807fd","target_edition_id":"edition.r017.id-id.draft","target_line_end":550,"target_line_start":550,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[550,550],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bf6e46352ad7db71c8f3c43237248961a4706230b1276ea0da0381789c65b0bc","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-089","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":89,"source_content_sha256":"ee87ce2f0e0e8d1441c0690f2322de2abc3eaf0c61d701ace81ca5e992805ebf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":546,"source_line_start":546,"source_local_id":"block-089","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":89,"target_content_sha256":"b12a73c095cf6f1e44bbfdb3c5fc5a192b681e62283e7788062ba1c54dff41c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":552,"target_line_start":552,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[552,552],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5287cbe02aea0f76e6f15d653e378fad006e32e8a8eff0ab7e3e8a19b8436e4","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-090","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":90,"source_content_sha256":"c90707848cee7ecf434e8679f33d976a21720267ef446f770f48fa22e1c30b08","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":548,"source_line_start":548,"source_local_id":"block-090","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":90,"target_content_sha256":"b415e2692779927c609124171fc8a6d66acf0e73a44a70b6bc46265d4571f648","target_edition_id":"edition.r017.id-id.draft","target_line_end":555,"target_line_start":554,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[554,555],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"79404a224750fad8dd0b54bd81aa7fba91ba95cb7a744c2d0d80fa1cad14855c","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-091","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":91,"source_content_sha256":"87bb6f17e6b7de2b7ad0016f6ccdff7c3cc58812093c1117ff6d53fd369edcca","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":550,"source_line_start":550,"source_local_id":"block-091","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":91,"target_content_sha256":"ac7de4085a6e5d7235f24c81c78414849c250292eb58ce44fe09c1dfb20157b8","target_edition_id":"edition.r017.id-id.draft","target_line_end":557,"target_line_start":557,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[557,557],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"83ada2fe26d2ec3ca113f5fb9a33a9da3397e656a7e697d301b95488c5f68703","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-092","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":92,"source_content_sha256":"0f6d7a223b723b1c0678bdfb894192bd3dbdf9debbb14c0aa39503b00b7e3928","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":552,"source_line_start":552,"source_local_id":"block-092","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":92,"target_content_sha256":"2a50b4b6f6c45e387b875e664170c2373185af7ac58c873b60193e1ced565e32","target_edition_id":"edition.r017.id-id.draft","target_line_end":559,"target_line_start":559,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[559,559],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"750b25d218c948c18354761dc91a9422f8739e1a1ee11382e0bb7d60eed5aa4e","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-093","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":93,"source_content_sha256":"38679af49b217e045198b5ab0ac84d7f7db651aff7d50d1a7530f9831f1ea711","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":554,"source_line_start":554,"source_local_id":"block-093","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":93,"target_content_sha256":"9a2a57800b81e4f4d62cba21bc4bb1996771801fc0396a69aed970194543a102","target_edition_id":"edition.r017.id-id.draft","target_line_end":561,"target_line_start":561,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[561,561],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18529656205d9cbdb2aa08192021b3566f61f48154549646ade3301b954f1d09","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-094","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":94,"source_content_sha256":"2f55f34514950b6596a4862165ecf31ee87fabf03206de9b6a4c1e6fee444454","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":562,"source_line_start":556,"source_local_id":"block-094","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":94,"target_content_sha256":"ed1c4573f7a7bce6ec377b506bffaf50d4f491d7c063c741e01670c30b518258","target_edition_id":"edition.r017.id-id.draft","target_line_end":569,"target_line_start":563,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[563,569],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"56cdac8a961d74e88d28db39498242a1f79b1c30f3693ad51b6fe6d10e44e322","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-095","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":95,"source_content_sha256":"367447663d462483c7fcd42b34c710f4e5e8c8ef116c938b27ef3e38acab0a8c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":564,"source_line_start":564,"source_local_id":"block-095","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":95,"target_content_sha256":"fe8b1cbfb0411ccd9d9ea3c6883bfa54d6e4d02c7e651e0521eaacf24b64d3f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":571,"target_line_start":571,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[571,571],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7ca08010f2e752ed6fb3dae0075e11a3664d39b66b81162bb5fd93da79d479c9","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-096","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":96,"source_content_sha256":"1e4ccc9ccba9038d35b6d9ebed7b22602bc3cbe77fc62260abb1d7f124da6cb9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":566,"source_line_start":566,"source_local_id":"block-096","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":96,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":573,"target_line_start":573,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[573,573],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"366ea69dcccd68b883752816abbdc5be69ca01b39121b10050f5bb1adb3b209f","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-097","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":97,"source_content_sha256":"a6c18cd910118035e9ea010f2ee79c798b3efbc009700c989db4ce6c1d1e71cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":568,"source_line_start":568,"source_local_id":"block-097","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":97,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":575,"target_line_start":575,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[575,575],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a37112d8a1b025b79ff1b556c951995caa561bb629a02314138809c648494159","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-098","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":98,"source_content_sha256":"89534e30f321581c80d9baf12883421020007dbf907802dddc5546a35c9c74c0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":573,"source_line_start":570,"source_local_id":"block-098","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":98,"target_content_sha256":"d20daf2d14b7d57b598119d01decdb84f9f5de6ecd5d0858925a6aaef4f2674e","target_edition_id":"edition.r017.id-id.draft","target_line_end":580,"target_line_start":577,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[577,580],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bbb8b0f61d0846d6e4e5ae93c127920c3e98bee03d00c361e05dbddc5ab93bb7","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-099","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":99,"source_content_sha256":"e6765f57d715e47566213073eb5c0bfdf8a656dc7e5506398e42566e36b46baf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":583,"source_line_start":575,"source_local_id":"block-099","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":99,"target_content_sha256":"8c6bed67c01ff60d629700591da633f421477638b4f52c07e99a320504742385","target_edition_id":"edition.r017.id-id.draft","target_line_end":590,"target_line_start":582,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[582,590],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5514e9029ad5f820c06a6a250c1318fc7556bd29452f33737286bd94f0f12532","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-100","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":100,"source_content_sha256":"573773f543dbfb7731744186db2a9adf97e26b30d2edcb91f63900e341a95f48","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":592,"source_line_start":585,"source_local_id":"block-100","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":100,"target_content_sha256":"9fb7a75f18cfa9de5da7a6f4e69d1730c7071261bf5eb4c32e97f67a1c991d2e","target_edition_id":"edition.r017.id-id.draft","target_line_end":599,"target_line_start":592,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[592,599],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4cdfd6046a3a2aea7676e33d78cac269755776a223f6de5a052d60b1e7081ead","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-101","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":101,"source_content_sha256":"6a7b9cf356c4791ea1594e872670ba96917e4aeb26403bab46be656e78095f0c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":597,"source_line_start":594,"source_local_id":"block-101","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":101,"target_content_sha256":"bbce4bf77a0e88afd844bbe62179c869de73fd7a13db91d8447c3a47053998ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":604,"target_line_start":601,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[601,604],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed92aa38fbb1435b69bd559f4a9b9626da80e588427758f23c05a895a704b8d3","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-102","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":102,"source_content_sha256":"befe6892ec44e33f7b364305fbcec8fa778e09b9cb39adc300c1dd14bcf212c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":599,"source_line_start":599,"source_local_id":"block-102","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":102,"target_content_sha256":"abf2c5e5a256d0173a5339eead0c2401c0fab3f053abd8ea94a8fd736024fa64","target_edition_id":"edition.r017.id-id.draft","target_line_end":606,"target_line_start":606,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[606,606],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d21f9b64f5d4b400ddac0d62e07b894b4e991d29110327eaeb2140c7fce2b8d0","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-103","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":103,"source_content_sha256":"671e6773d872a2f440dbe5e9831d6c62b06f51d3a0aaffba6ac37715fa5c0642","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":610,"source_line_start":601,"source_local_id":"block-103","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":103,"target_content_sha256":"e0aa94e40efb9b113092265844756ccb7e635ccbc3be252734268b18113b82cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":617,"target_line_start":608,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[608,617],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0097eff328052168a730d6cf3f9af1c840540910465c9a77caceba8195b5f9b8","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-104","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":104,"source_content_sha256":"dde51383b0539ab23b81e9484aa52c334d984b2d51440e73fb9bb893709a3461","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":615,"source_line_start":612,"source_local_id":"block-104","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":104,"target_content_sha256":"01e146db587116850236c2f966c58c5bdde76cc719c5c781341f18e9cb5c137e","target_edition_id":"edition.r017.id-id.draft","target_line_end":622,"target_line_start":619,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[619,622],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f588b54ab2c8d2c9a6c2cabac2db50c75aa5b3775423e47603400dcb5f788300","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-105","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":105,"source_content_sha256":"69ade488391d231bc2ba1882076ec003f2d284789102ffc919c12b325e953be2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":620,"source_line_start":617,"source_local_id":"block-105","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":105,"target_content_sha256":"bd899c8578e7bbdcaa3b83d718c0a74b40d59a99adc9c37f750e2c1c5c6a8d17","target_edition_id":"edition.r017.id-id.draft","target_line_end":627,"target_line_start":624,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[624,627],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b953039d131b673ccdc152770cdc273432db3ee03ce696f393d6924c6d37895","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-106","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":106,"source_content_sha256":"c8e278add1d6c18f659152466edf4e82568ebad5aaddedeaeb2d654335866d4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":622,"source_line_start":622,"source_local_id":"block-106","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":106,"target_content_sha256":"5a7c51fe019c052d866e25f75541baf5ff511cb9d0d48737b288dcbb3fd56de0","target_edition_id":"edition.r017.id-id.draft","target_line_end":629,"target_line_start":629,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[629,629],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3807028508d1224d227096d6a2a33c0af5c1c7d40b6b4511c7e537ff84e1de4a","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-107","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":107,"source_content_sha256":"089943b321c37d107a990180442aca1b6b5644438335280d78c2e8da5d88b12e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":631,"source_line_start":624,"source_local_id":"block-107","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":107,"target_content_sha256":"cf1670e2d55582c8e09b972c90af77b84972712a8a1288919cbe3f6b59159beb","target_edition_id":"edition.r017.id-id.draft","target_line_end":638,"target_line_start":631,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[631,638],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"93dbc7280889a37f741ebcce9e99d16b10221756a2ad3d3dd17d71790898e388","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-108","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":108,"source_content_sha256":"03a72f980f4acce420927ef0f3b9b0a46d4182800485fa8bca9aa88842a3eafd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":637,"source_line_start":633,"source_local_id":"block-108","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":108,"target_content_sha256":"93c72c8a46adb51ddae96bf30ccc7ed209e3e6bcb9bf184250d29d20441a2a3f","target_edition_id":"edition.r017.id-id.draft","target_line_end":644,"target_line_start":640,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[640,644],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e03401f0899127a3f36e4887267c8e2be76da0424175e2fda6c3e39884538033","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-109","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":109,"source_content_sha256":"c3a1f66a7bd82dde33e26e49f5d4dad59784a8e1cb36e162570a21a85b93c83f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":642,"source_line_start":639,"source_local_id":"block-109","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":109,"target_content_sha256":"62a782f5469d1c056710848880348a8fcf71f1ed47777e79b7e402b263a37e53","target_edition_id":"edition.r017.id-id.draft","target_line_end":649,"target_line_start":646,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[646,649],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da6ece965e8253917f71d496420970558739f0d5d1fe37d4664a0fe48f9e34ca","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-110","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":110,"source_content_sha256":"4be7db13a50a6cf69022429255b203425a63979cca3cb7d03e8476641e361703","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":644,"source_line_start":644,"source_local_id":"block-110","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":110,"target_content_sha256":"02bc411158e8112c9dc4199c8d99675c3a91d7015f2998ee73306674c0d2dd8d","target_edition_id":"edition.r017.id-id.draft","target_line_end":651,"target_line_start":651,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[651,651],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e8b8238acb7f96fc96dbad0d43ac72110912c7b36955a39c96c05f6acfea0fd3","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-111","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":111,"source_content_sha256":"f9955a1517e99305b3da4395c20eca320ac7694540c6e33e87c0ef9d61f2274c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":655,"source_line_start":646,"source_local_id":"block-111","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":111,"target_content_sha256":"a263336f9ede5d4aca2943414d78e4a5f26af5a4c577a91eebf6e0a3b4c5e273","target_edition_id":"edition.r017.id-id.draft","target_line_end":662,"target_line_start":653,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[653,662],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9987aaa7a0afb7336ec58d80ceea504d0958628a252a586271b4b7d7e9e5607","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-112","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":112,"source_content_sha256":"070c82f595a58c404017d08d60ef7ee4b27c5877e128e391ddb9e2145cbe6910","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":657,"source_line_start":657,"source_local_id":"block-112","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":112,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":664,"target_line_start":664,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[664,664],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"935196b06e3faf500ed6af37e15f7d21712ff1499fc2f961823ba4a8f5c4439e","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-113","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":113,"source_content_sha256":"9869caba29a6f3c4ec1fd92c3ff37a40b32d2f4f447858dd7e22f6ef5eda64f8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":661,"source_line_start":659,"source_local_id":"block-113","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":113,"target_content_sha256":"251885549a76fbf3cd8b75a68b119d1b6d0cbdd8f2714ac5a3dab601ba806847","target_edition_id":"edition.r017.id-id.draft","target_line_end":668,"target_line_start":666,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[666,668],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd4a17d45be7472560a42183455ca03bf306eac52fbc585d06aa753ff1bce23c","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-114","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":114,"source_content_sha256":"9b8c8a238694961fd4a671dedc2afa901f76caab8f262a96fe43f1872b56d0d8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":669,"source_line_start":663,"source_local_id":"block-114","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":114,"target_content_sha256":"f2b364e51a1ff16b84044a0653411287b32067b3bbcc59103ea1fa8f6bb46ac9","target_edition_id":"edition.r017.id-id.draft","target_line_end":676,"target_line_start":670,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[670,676],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4725d56324b4c3fb57ad90dca440661e0f3b0b5213850f07aca6f1eb155508e","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-115","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":115,"source_content_sha256":"7fbfcf5150c38d5815ca575526408c74cc1e61d2028c12fc62f38b8017bffe3d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":673,"source_line_start":671,"source_local_id":"block-115","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":115,"target_content_sha256":"680b65d0edc8f37f5366541cce1a72028f3ddda81e0c71753aca25f1568d4703","target_edition_id":"edition.r017.id-id.draft","target_line_end":680,"target_line_start":678,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[678,680],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ceeaa9ae3ee13ab635fc7618bd723d622716c0457bc7b9376ebd3cd481264358","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-116","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":116,"source_content_sha256":"0da3a477607f59eff6504e74602552a2b5ffb8cfea4558a7ab998c06d1d141a6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":685,"source_line_start":675,"source_local_id":"block-116","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":116,"target_content_sha256":"53e6d54616aa8d97e2611013e2198a51dee19c4b000b4ebc02adc675e772f047","target_edition_id":"edition.r017.id-id.draft","target_line_end":692,"target_line_start":682,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[682,692],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e45a8b1fe55133ba464faf19a63e6489f83f7fc2380206fa2878af01b5659e4e","concept_ids":[],"id":"segment.r017.book1.ch01.text.block-117","locale":"mul","parent_id":"unit.r017.book1.ch01.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":117,"source_content_sha256":"3ef7d53a9019d7e8514f91a7333baafe1f09f2c1e77ea14f9465e2a7de0ecb64","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":690,"source_line_start":687,"source_local_id":"block-117","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":117,"target_content_sha256":"3ef7d53a9019d7e8514f91a7333baafe1f09f2c1e77ea14f9465e2a7de0ecb64","target_edition_id":"edition.r017.id-id.draft","target_line_end":697,"target_line_start":694,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch01.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[694,697],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/mathematicalProgramming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5208511a131e70830237a88a194f68f9b004bf40a171f36d412e143d4a7a7b1e","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-001","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"29f4fd05238bde4ff260fab492bb186a268d7d4007915291dcda28e3cfb515e5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":7,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"8a20522e9734f2c759cf477f6fbfad0d443988bcabb67b8aa81c7f7a3de81b6b","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,7],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"519578548c15260b0252a410141063c31feaae6deb574a7265a62a4f42dff68c","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-002","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"de211984c74f8ff1fa8d4424a4aa59b9ed3335b53259e51fe833bad70d3d78da","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":9,"source_line_start":9,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"8800e97c6d29493a0a8af5bf1501fff472cf6da4f4c5b038196c67de69125781","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":9,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[9,9],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e6e715c001e6ed1195164993f7c4f49071056d3cac69f39e35fc9c54db7c45c6","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-003","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"7528beb7f5d9ad00701cdbc4d36973e780cf0de39b0775be0a2f9003c30d8496","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":11,"source_line_start":11,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"2bba181979672c965dbc9928092604c333916bca049a0c81589e9483e09b42a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":11,"target_line_start":11,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[11,11],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5098c56a6e3fe1ebc985ea28b7fd085f2102dc79bb22ac4321da39a3feb6c74d","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-004","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"256d2a79ed6b306f6ed6bd6e8a62ac0429b7885f4a9a9d752832e7b9936de9bb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":20,"source_line_start":13,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"81969a35f5c90cb899875a4b011f041dff1b29016f5de7e05ff8c665ab218941","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":13,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[13,20],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"535a3b553bedaefc33de8c525dec28c9dd05bbfe208a6549262eae60eeb56880","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-005","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"b167ba477913a1b8c8c7b917103007df434bb5ddd2c1c5fa041370bdf1e42f93","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":22,"source_line_start":22,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"8ef00ae7a4616280447aecb70d526a27727528be3813df1858d555b0d86981d5","target_edition_id":"edition.r017.id-id.draft","target_line_end":22,"target_line_start":22,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[22,22],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d69b84a69ac042a6bc14da7475ec431290bb27accb09437342790144e00c91d","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-006","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"2955bcb8802e08f2fb53083fdca2e0d7be4a2b2b44ed21e95ded68b05b6c4446","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":28,"source_line_start":24,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"8c53f79d4bcfe2bfc729b48c1f184969e0e4f4ee6c8207a1e3215a719db46693","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":24,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[24,28],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7858c18bcf2d2a857244ea7eda7141a9e2a63540ebd87f953180898ab3636d4c","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-007","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"1ca4f24ca9472c899ab9511a892ac03a31911380da15461acbd64737170f06c1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":32,"source_line_start":30,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"0cce7ccbcaf7b5a07848074f387ec45b1ebc5a6154a2d2560636c803fcc56051","target_edition_id":"edition.r017.id-id.draft","target_line_end":32,"target_line_start":30,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[30,32],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"86936bd79b550101f9b388fffe52d9f990abb1df66f4c762388372788d4ef2b5","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-008","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"784c2a873dceaa7cf0f0b965db0281567f32ffe75d81a61888c0c1799be120eb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":34,"source_line_start":34,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"a6761f45c27bc4ad547b407d10858a83915d6429fc1d24f34b7c0e907a821448","target_edition_id":"edition.r017.id-id.draft","target_line_end":34,"target_line_start":34,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[34,34],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"74c2edb8a456299271eec83edb5874259cd19894f5a9705671fe4586237c01ed","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-009","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"78ddd4777d2add1852463b08b23e99cb471d1521540bd7b70ebe055db4b5f004","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":44,"source_line_start":36,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"95af239c26fa66567ab978b4b7eca05d19a14bbb1058592f2445438d4a6ec308","target_edition_id":"edition.r017.id-id.draft","target_line_end":44,"target_line_start":36,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[36,44],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"55e54c72e211a5ef5faa0a565e10c879e4a1d60222abef66c5bf0c0006b65d35","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-010","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"04163608696762470325e798fcdb71452bc811c4963535207c718277c59d29d9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":46,"source_line_start":46,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"b70136e2f3d0725fd13ebb976da0adea5011694f17d328dbf2905dd139f74226","target_edition_id":"edition.r017.id-id.draft","target_line_end":46,"target_line_start":46,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[46,46],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dbbaf6d6c1125b2c4d2c6a9b7772927063f13229ad3c55475a3ab50eaf95428b","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-011","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"046f4c4c4d347d4174da7208a2e1d2b470e10dda1a1265178badd2e163f755be","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":56,"source_line_start":48,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"a514c64ba929746cf7c6f5a591a7c376650a0f1f8d785f1ade8c9f7c9cfb601b","target_edition_id":"edition.r017.id-id.draft","target_line_end":60,"target_line_start":48,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[48,60],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8031935c7e7e9e4dc9ff0cf3bb5423395bfea292465a8b6a672bdce82b4a6c5b","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-012","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"3d9e3b31a57e762c5eb2eed10ecc0e13b14bdfc754a0d868df3cbb36c031455d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":58,"source_line_start":58,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"b5a2a925d1d2a021cdae27f9f3ede9c3374907b541ff9686580ed53fcddabc57","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":62,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[62,62],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"175e51bbfe36362eeb3f93fab94380c5de7989c20825e511093b87ec6e89ded2","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-013","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"d59c9bee1200302e245d316ee06531b5bf7ff697beb0922a669cdd625eb65d0c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":68,"source_line_start":60,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"bef05b34e53e852ffd3f964adcf4f64ee69af9baf96a3f9d1be468f6363d00e9","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":64,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[64,72],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24d3b9b49a5f7eb657e066a7cabf79846f3bae8df24f8a3163564981b166703b","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-014","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"4fb8342a78b33ce63b1da99d1f234ba789828d4d3363ed9b4deef9e5f263db28","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":70,"source_line_start":70,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"8950974095771f79dbe2425d91aa278675f07640101cd12b9485c089c37fc09b","target_edition_id":"edition.r017.id-id.draft","target_line_end":74,"target_line_start":74,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[74,74],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"41680497fc37fbd12d3ba7c6c34caa97ffbf2d406d22d160e1538f33fb87effc","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-015","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"28721276ae1d034b55594c0ab2e1cc320daad4bd07f80c8fea22ea721b480c94","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":80,"source_line_start":72,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"31cdf24ae2bc4751fdd1c84037932c7ba5b33121350b5a448015ad90c182b880","target_edition_id":"edition.r017.id-id.draft","target_line_end":84,"target_line_start":76,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[76,84],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd25734073bc6a92aac2dee9472a4b89e808bd856d3614869774aad950c18085","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-016","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"2bd38c919d431df9e4c61b677a528f7d776a2f8845fa8d2b5e1f7a6f3bf24f90","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":84,"source_line_start":82,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"a71e294eb47e5da086bf675d4cf0a31356ab7676bd924ec880582000f2975c30","target_edition_id":"edition.r017.id-id.draft","target_line_end":88,"target_line_start":86,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[86,88],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a197504c89877d64c3dbfe99bbfcd268603f70fd9383c52c4f9e6810d7062384","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-017","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"98426e7153f5c7381820c8aba0c92cf85e377fefb9ab8f2f743535e40e277788","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":86,"source_line_start":86,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"48da353e87dfed6b8a9aea668e19d7223eaab5916b3085657f3143c0ff3569b8","target_edition_id":"edition.r017.id-id.draft","target_line_end":90,"target_line_start":90,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[90,90],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"195e31339c3e8cb22747da7c13a2dea6d552a9a426b48cdf6642e656ab690d52","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-018","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"a72788f16dd21e164b59bcf5c7c0842e75686fb7f939b4304f98e8712779ab20","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":95,"source_line_start":88,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"a4b88c983de1f2a55fd013ab2f525caad46825c74a7d85d598a781d9f8995b95","target_edition_id":"edition.r017.id-id.draft","target_line_end":99,"target_line_start":92,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[92,99],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b089dc5de79524c26e360caf6c53702b54c0e1ab3a6195e1a2690cb5614b2adb","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-019","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"2715889d3c6988013dd56a593f8446986647265c40465d84c7a2f69a662b2310","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":99,"source_line_start":97,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"ff881a3d2e3a9c7c2cee51faf2285d6446f52a93e3b11bff781aa429eedb3774","target_edition_id":"edition.r017.id-id.draft","target_line_end":103,"target_line_start":101,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[101,103],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"477ad6eca9dbf5c32751c1cc48e071fec9a2603dd3e80089aa8e5a126771cd7f","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-020","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"6de3169bd286bc46160ef82df1d79d984fbbe9d96038409699223fd172899409","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":101,"source_line_start":101,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"93d8546dd6082b83d8701a563508be625e161072f890e59238b1b2ff455c5962","target_edition_id":"edition.r017.id-id.draft","target_line_end":105,"target_line_start":105,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[105,105],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b64bc5d7b30f73f634c016afcfc96348f5eb5ca806928d83a636c045744120a8","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-021","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"93120fe23ca03bc724ed6549ea608469a77c181ced32a97bbee687c6a5648e8e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":111,"source_line_start":103,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"55452e303fd2ecab51b187e8a57115ab2d8c21ba1337c623a6f06c77bec5cfb7","target_edition_id":"edition.r017.id-id.draft","target_line_end":115,"target_line_start":107,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[107,115],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f28e5da91aa50ae0a9074b71809174a328d108ae508384d2f4cea60b14e2207b","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-022","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"0f9da5f493123514d7e6b2f6ba634766f802cb7824951d93521e5a1f5ae26dbc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":115,"source_line_start":113,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"34bdcab65b630dc8c462cd9b99af69445fb713bbe222418dd6e78910c8ecf6df","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":117,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[117,119],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7632cf4d2e11e831be4b4d33a7c483c6aec7ddafe63eef428a971c6ba3c4e6be","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-023","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"88332f81d4f5a1ddefd25c2a51e087ce4ca8e450787d2bdcab2adcec0ce56b17","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":117,"source_line_start":117,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"d5b900c5e7cffab49470fb01f8cf95141a4cfaa0656f6e35a5e82406374da121","target_edition_id":"edition.r017.id-id.draft","target_line_end":121,"target_line_start":121,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[121,121],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e172fc272e6b75394c02906030f318994526c62f098847367cd33c7fdaaffbae","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-024","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"7511456b03633f44792e2c3d46e74cc71b7573da2b37c5120a72711fbbbe463a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":127,"source_line_start":119,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"7b298b6551b4c6998942bebc4bfe77c860561a1da78d0cc5b63f50b47fc836f5","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":123,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[123,131],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee00d14dc67126d339615b3b9a8b7ff536576b54de420add438e8e54ab8b1578","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-025","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"d62f4f8c7d8ac19ad74fe11f11fe9568eec6ce409130be5bb04a842a6f410ac9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":129,"source_line_start":129,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"a745899fc03192997d6c23e4a2371af9679d5e68f84f1d4df45f980dab107241","target_edition_id":"edition.r017.id-id.draft","target_line_end":133,"target_line_start":133,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[133,133],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab6e88b1b947a1204b13141801151816dae2c6f78d1e1b692c98f472be4c4128","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-026","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"17fc65d782a456168533361fd712c57b532361b5808d85efdebe6c0491e6b387","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":146,"source_line_start":131,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"bcba99ce53202f3bde57e41dce5ec2fcdc4ca9414c84df66b979f69e296e08dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":150,"target_line_start":135,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[135,150],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14b05ed584e6a9fb6af4090cd4ef2ccf3b3f10a6ea72a85961ef11bdd50f6637","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-027","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"c447345bd63231a903a003fdf5beba8046ccf8e8d89c8078f7201627d9fba27e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":148,"source_line_start":148,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"ee89bbc9a5bf13fb4ac3fb1dfc7900db5859009ea176fa9bfdf6a699492903c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":152,"target_line_start":152,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[152,152],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"462fa4aad2fa9ae99b910623b073fb696c08724f2a2394aee8444aaacfbfedd2","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-028","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"17f74ac4a07b3dd62254cbe210e2c9495813bb4d63ea20bddef3d95a8dd5b92a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":150,"source_line_start":150,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"28a84a996ab61fdc41dcc58a512b84e94e46a265e51ce54f53cad16df7fb24f3","target_edition_id":"edition.r017.id-id.draft","target_line_end":154,"target_line_start":154,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[154,154],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eefcebae82d06fcc2d7dea7ddfa44e504beaa34627a4e48998036984f398bcb0","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-029","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"20c335b1233b0e67a5affece2be3a58cacd67aed5812421cffa7b9b73a42219f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":152,"source_line_start":152,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"407dc085b1ab63363943e64d8dd10cd8366c66c8e4f2b020fccbd1e7a9555b1f","target_edition_id":"edition.r017.id-id.draft","target_line_end":156,"target_line_start":156,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[156,156],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd59f21c8aae5f214ff8218257c24a672e25b9d51aa6af6dabe884678066b189","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-030","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"651e9f57830763d223cf396dbda07922c09331d41605ec575c5da45783c975c9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":154,"source_line_start":154,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"2444f93db0c6be3f04bdbb4c2665a21360ca771e140626e170ef4e832fcdc121","target_edition_id":"edition.r017.id-id.draft","target_line_end":158,"target_line_start":158,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[158,158],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce645b6df14bafd6541e40146cf0a70818daeebeec1826721279c74884271553","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-031","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"f2e850fbc73b0041bcdd1849b70998f2954c04b2a2efee306736629e7a3092e7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":156,"source_line_start":156,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"5addd8d6b47212c5dab08265bf43298686d4b47771bf77be9718a03e77e829ea","target_edition_id":"edition.r017.id-id.draft","target_line_end":160,"target_line_start":160,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[160,160],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b54d2cf473ba11e1ab88d41f4784dac86f4fb288c6c1cd116f2f8adb7a5d397","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-032","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"fd5db592a859318bb597ba33d804d7224e90ccd23c0b033d2bd8d45272c7d98f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":166,"source_line_start":158,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"1c22756424d3a7294e9464df75c591d658d29237fe957b1bc47a4c3dd2547803","target_edition_id":"edition.r017.id-id.draft","target_line_end":170,"target_line_start":162,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[162,170],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7ba09530e94ae54d31248b15bb32cf5062ce7e6c81502c5477f1afc75bcdb398","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-033","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"4f22ba71c02713a08a9775fde82bd2c837c4b134ffdffa54e0b2128a77d9d8b7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":168,"source_line_start":168,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"af8de6d02fd06daf2d8bef0214e3f031debd8d29c3acb03a86302e88e2de1570","target_edition_id":"edition.r017.id-id.draft","target_line_end":172,"target_line_start":172,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[172,172],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5001c96558d63904f190cf1c4be9985a7835464a75781ee6f5a001f6e6dda2d","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-034","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"ba1a83bc62dafd2a4f6f78dc5f36fa30cf8ff17cc70fcb96bd6edf329a413a31","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":176,"source_line_start":170,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"2483690db4d057882486986c70fe74a91a31f82aaf30c9ca599df809bd4ff182","target_edition_id":"edition.r017.id-id.draft","target_line_end":180,"target_line_start":174,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[174,180],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1acf5c379285e62e2947ca26ee0acf44e556dee6feefe53730e48d3d6a785a41","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-035","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"25696e4956e7766fd43b3051fb57586b7a802c9b53392855278dba7c29330eec","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":178,"source_line_start":178,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"b55174e3b1dc5de0a502fe9585fc84f866f2d99e2669ae789554a1113dfe1457","target_edition_id":"edition.r017.id-id.draft","target_line_end":182,"target_line_start":182,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[182,182],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"046f87d794c4bf95d24fa3041d0f7133944a15c8a8250fa41141ed0b8026ab89","concept_ids":[],"id":"segment.r017.book1.ch02.solutions-manual.block-036","locale":"mul","parent_id":"unit.r017.book1.ch02.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"2b8b9b54d0fde3efd812a5e7dcf8ff81bd4caca21a53e3bd01cbca8a84de1c21","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":192,"source_line_start":180,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"9807e5d914335e5cf7f5aa40a91cd9051ccb73fc0f0f53f7500408ade9c38270","target_edition_id":"edition.r017.id-id.draft","target_line_end":196,"target_line_start":184,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[184,196],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch02.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f9901f720e03d4dea05ea4b1a537d5e3f19f4bc4419b97c559bedc26c9c794b6","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-001","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"c8981522a0536b7cbc4baa701f4ff862cb0c37fdeb536481c8e3a3b40d6ffdce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":4,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"2b43dd1c4f8087e74ff6fb01ed1824c3bc33fb2972425ce6bdd8b98267ec25a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,4],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ff0580d4299d80fd412ebcfc79ff6166b5792d7717db8c62e5d40fb1bb4180fc","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-002","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"0ecf825ed6f0d6788e317371f9f68d81c5ed1096cb16fb838be917ba570c821f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":6,"source_line_start":6,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"12a8f8bed93f074e8d5d7ce2f630b0c8380ae0ae85ba93f413ded79ff4c5bf20","target_edition_id":"edition.r017.id-id.draft","target_line_end":6,"target_line_start":6,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[6,6],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd4185c2d7375acb3f9b7762d2590ef8e66a80f7f662e7b0f964ea6490a03a2b","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-003","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"55d33360dfee63bce251e720de072963e780d9462574079daef75df2bbbc31b4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":20,"source_line_start":8,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"416a885f794ea5310b41eaaf4484442e1112a20adae387e69a0768f533042f35","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":8,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[8,20],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"efc6dead16487f03b0be3293b2cb8a2569f51047336e8ac0292351ee254928f3","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-004","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"064f1e3f93798c9539b182744d4084791ed3137539af43f31f3475d3922b47cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":24,"source_line_start":22,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"000548d2dbb1dfd112934a48f5e1b44d9374bd1262eb9dbd1da356d1249c5119","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":22,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[22,24],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c6fa4676f6d478287cefea3ef11ceb7cbb45331e8e93a0f13397efc1ec412fa3","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-005","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"2be4ccbed59f7576ad87e72093090a5306835e8577d04949c6890ed22e185edc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":27,"source_line_start":27,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"6d7c676ffce96fc4a011c021279e39d87f305af6b164435d1e76494b453d0abc","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":27,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[27,27],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80f5d69ad0e3b9dd2afa29cf57db16b4dcb15438563e0af25b14acb6e4153280","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-006","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"2e0e3a940f196734834b58ec226f11fbdab59002d4f213e68e072cd2cc251931","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":29,"source_line_start":29,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"96d4fcbc9072f9c922f62a01ca7460e883c05a92d10b91cb027c792a1b4a2ac8","target_edition_id":"edition.r017.id-id.draft","target_line_end":29,"target_line_start":29,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[29,29],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"be0b857e278c019d8a40e749feb7f2d67dc3fa24fbc27dde66b53e7b9e590904","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-007","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"f8d3980dcbac908046c323198e05e612120b67b09d5429ed941d82eb565dfc13","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":32,"source_line_start":31,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"b77921e613c0af249abf19e0f4daa12118e57d023674d0c7f57bb5cc0b82c91f","target_edition_id":"edition.r017.id-id.draft","target_line_end":32,"target_line_start":31,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[31,32],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"13aa2dd2f6af3a315ff2dc79e658c175083bffd0b329c8affa9d5544787d5bd1","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-008","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":34,"source_line_start":34,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","target_edition_id":"edition.r017.id-id.draft","target_line_end":34,"target_line_start":34,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[34,34],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5d34d16bc5da27ae9223c5f03b45c3aed4e0d87b57a4efaa9378a47d2eac3e0","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-009","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"f2dca7614e803e278127188027ccf8570a3095c67732732e3360117e2798cb87","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":43,"source_line_start":36,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"2824b7f47246e496d4e3f6fe6b330b167dd18af4d140123fb489c01be2586b78","target_edition_id":"edition.r017.id-id.draft","target_line_end":43,"target_line_start":36,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[36,43],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"be49f6bbf09dab837b6284b5365363a9308b0056bb5322ed867c73e5fffb3cab","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-010","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":45,"source_line_start":45,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":45,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[45,45],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"232aaaa87bfc20dee9e475565c81573453d2b2dca73de23b66b86702de464110","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-011","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"dc331c24422f4a61ae035e808c5bcf4d0c3cdff154ff6b75efa8439d27ce4a2c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":47,"source_line_start":47,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"204724499781753acbcadbf788860e5538f815a4c5eabc607d31c395b65975ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":47,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[47,47],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5bf2380dfdf6be9d52c61394b7884ca8dccf6247c7b87427f4bd8c817c2d96d","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-012","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"783537386b72729488ee6d7cdd94f21112fbb53eb1b2a5e163c40ad45782d25a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":57,"source_line_start":49,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"31970c3ac07551367de436681f8864e6cabb1bc727962486dc50cf1675ef8969","target_edition_id":"edition.r017.id-id.draft","target_line_end":54,"target_line_start":49,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[49,54],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3d6a2714f0c328c6747300b9220f5775bbcf139fd83cb7cef07e5531c2989705","concept_ids":["concept.constraint","concept.decision-variable","concept.linear-programming","concept.objective-function"],"id":"segment.r017.book1.ch02.text.block-013","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.objective-function","concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"b0afb727f700957318d8e672517850a3c1d77c1d25a08bfbc771aa0b82c5662c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":84,"source_line_start":59,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"bf8371ab628529ae11ad59ee4a5854c19b57b88fcc6cd2a60fd762b3d8be8fc4","target_edition_id":"edition.r017.id-id.draft","target_line_end":81,"target_line_start":56,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[56,81],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bfd0dbff4f82d958b30230d0fe47dfc36bd0c7385cec4ecd1c3403b79c3e5292","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-014","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"45b33e33190034209e08f4f53756acfaa0f50768cb4b83e4cd490f1f93e24349","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":87,"source_line_start":86,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"55b3d217e32d0ed2e16a66ebb7968756e5a2a67c9d2eb8fa0d0e46d74cbec51b","target_edition_id":"edition.r017.id-id.draft","target_line_end":84,"target_line_start":83,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[83,84],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"edfd97ddc8586def75fc7037de6ab23cff5b1792e46e5f4c02c77335ddac4dc5","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-015","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"d1d2baf861d35693fbc523855251b5339ba008c11af97761b63a927f5575f716","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":93,"source_line_start":89,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"26e546351545c76f734e2c6e0720aa0e28525fd0b3d0397f63e5eb750d96ffc2","target_edition_id":"edition.r017.id-id.draft","target_line_end":90,"target_line_start":86,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[86,90],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57fb02f918ed9d15c434141dd47d8b15142bf0e9d7272490c82babb9d9d836c7","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-016","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"848baad1bd26a0c8b5b35b720a7ae2e9cfc33aa7425f4b76d12bfd0c8d523212","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":95,"source_line_start":95,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"652dca158426fa49a06c11ea0b4e2317dc7a6306320937d46b27e3d940d90031","target_edition_id":"edition.r017.id-id.draft","target_line_end":92,"target_line_start":92,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[92,92],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"edcc8d397bf716c485afdd6969b5183aba29f5dfb44a1da9a4bc8f73aa73d6f7","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-017","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"84f463d60f0ab6a7c3f52d675e7a8c077c224feaf80f32c18d3fe97cc9d6b9cc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":97,"source_line_start":97,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"f78b59ce9727ede6f9730720202b65c271edbc73dd7158f68a4de3194e83e882","target_edition_id":"edition.r017.id-id.draft","target_line_end":94,"target_line_start":94,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[94,94],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"876b54512194ff2726be17c23ddb63a0b54233df13203d07e5f803045b20df2b","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-018","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"580ea02c1b79cc52922e48355eeb52871bab3f3dbbfd9b8b6d0f8f7b488a7d7d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":104,"source_line_start":99,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"a5377b053ba1012ef4866536cfd6afbed99cae4cc8348940e9c815c921214026","target_edition_id":"edition.r017.id-id.draft","target_line_end":101,"target_line_start":96,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[96,101],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d71e583b4214dca9eac9b4e29b908adb6d6b306475b169e221e0ed8f4c5e614a","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-019","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"24c0e04ae56292c9c96a6871036a8a1e270f716372296559fc5149d9bec2893d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":112,"source_line_start":106,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"516a0a68aa56568b36afbef220358c6ccc086e0802c874c30ecd9a7a3715d342","target_edition_id":"edition.r017.id-id.draft","target_line_end":109,"target_line_start":103,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[103,109],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de528ccaf8910e8c0c2a90d866f86734fe1b149709015f8141fef2f54fb2a922","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-020","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"e63ec5a929c4824d7f48903bd1ec0f6da23f507170ec5427cc9e62c84cf83dcb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":114,"source_line_start":114,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"65d8768c96e4c84f14592f092a08b67afc011cfa80ca0a46eaa64bed7b5c071f","target_edition_id":"edition.r017.id-id.draft","target_line_end":111,"target_line_start":111,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[111,111],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a11a4e5a72f7f9ecc4037a78b8fad6a8f5f38f47edfdc1f06e365d3484eda181","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-021","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"8c4e79a73af36188c5abc6ed4fa3ed8916c6ea4ded4b995c2d161f9d96a49358","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":125,"source_line_start":116,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"8c4e79a73af36188c5abc6ed4fa3ed8916c6ea4ded4b995c2d161f9d96a49358","target_edition_id":"edition.r017.id-id.draft","target_line_end":122,"target_line_start":113,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[113,122],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3eb13c7ae7e0b71e8833bbdb746c2dab9acec00564166dc784689bfbcbf20562","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-022","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"6d5241efe24557eb9789752470f87ad101b8fd32fa4ff06647ab7e172219a9de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":127,"source_line_start":127,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"491c38d05ac53cf3ec5317a2697c5634a99a9dc289879722f6cd4ec7a9c6a7d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":124,"target_line_start":124,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[124,124],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fae31ef84b4365e7363156792b6d9792eda12086c3836a74f2ad69afa121e6d2","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-023","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"0a3afbd12ad818deae04a554d5cb2a5b0dc384502672e23baac7464c0356676d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":135,"source_line_start":129,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"7717ecf9bd2011cadd1a5f90437e9197926acf49375d6de0b877a3968511cb71","target_edition_id":"edition.r017.id-id.draft","target_line_end":132,"target_line_start":126,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[126,132],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ff9d7905c773b9b08095f411c972dfc3dcd5ad2a36304ac888cd59d5681b61b","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-024","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"ed296465564596aa0d45bbcdda9e4c6eafc06d53c86eb9ff03deb91387ab3f40","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":138,"source_line_start":137,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"41efc751fe5d40625f37a34032d5c4e3b4519ab5064195e6c62bae25940750be","target_edition_id":"edition.r017.id-id.draft","target_line_end":135,"target_line_start":134,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[134,135],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e9c376068e50a3f8134011222b5dc98c71425c92bf4f13874ce9f351d6226df","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-025","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"6a08551b83b2d1d0670854fadae6eb79feed44ed2fa3a55657e2a4cd9dbeb4e0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":141,"source_line_start":140,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"e4698ea44ed1d7214b40db20a2909e400b678abb8d1e024ac0f6b3853ed7f3ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":138,"target_line_start":137,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[137,138],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23fb1637c949b809767513c6c880c97d77ccb131e89b77688d5a22bedfa5117e","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-026","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"13eb3e164ea1713433e541f67a27b6b4f9f8a31fa972656d68e28f4b15474c14","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":148,"source_line_start":143,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"d5378e15a720376bac8b6819dbade287d8d009d04b094eb318a788873faba44f","target_edition_id":"edition.r017.id-id.draft","target_line_end":145,"target_line_start":140,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[140,145],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8159622985999ebd9eaf36fd49740cca33edeaec17cec2d79838d6ab438834c9","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-027","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"fd50fc2d32f83474494836e351c6ac738477678b1dc9b197116f8f953f5a9669","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":159,"source_line_start":150,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"e3f316a7df585df4f09653bb01515144c1946a02360e7522d9b5128173b3c551","target_edition_id":"edition.r017.id-id.draft","target_line_end":156,"target_line_start":147,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[147,156],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8eff83b7e8d03eb9a378971cceccb13976e251e0473b1492ca48cec2c7d872fc","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-028","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"b53c9a979c3984e7b4c1b2b25bbb9ca0b5e07e6fb39e4bf000e6ab0eb049292d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":161,"source_line_start":161,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"d97262caa7c68777e161b4b892a5900acccf7612a92b9d9a1639a5b09f82b103","target_edition_id":"edition.r017.id-id.draft","target_line_end":158,"target_line_start":158,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[158,158],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb7e5d0adc29ad3946a35e7f7b96676966c640351ed79382d8ac301a9cc7cacc","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-029","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"39f07eeab583e3c75426a5ca531ad3568221157f5c43c3e707647fea52e09fcb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":169,"source_line_start":163,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"c6fe1487618c89ef9d98209c90b6e58d698b56c72d0ddca9b4ff13ccfd2f2d56","target_edition_id":"edition.r017.id-id.draft","target_line_end":166,"target_line_start":160,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[160,166],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1107b6d37ea55b4376d14a7f99907cedd7476d81d7b0d76c3515d94207ed43bd","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-030","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"55e48c584e0782743baf1cf789bc41e0e29b30c1b7880f909eaf35a2a59b92d0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":171,"source_line_start":171,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"bf9d4489bdc12041a6f180d6138d80a67551823777f2ce7c3d2c3035ebaf06b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":168,"target_line_start":168,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[168,168],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5af352368e8f06926411535541eb6d4cef32143ec875f4037178ffb0452400ef","concept_ids":["concept.linear-programming","concept.lp-modeling-assumptions"],"id":"segment.r017.book1.ch02.text.block-031","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.linear-programming","concept.objective-function"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"bd2d11220fdb3062d194fc23268f7d9f039fb1ba36ce61854bbaedeeeb92be4d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":175,"source_line_start":173,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"e80fcf3dbee7dc199eb5bf13119470577321b3dd0373ecb95022862d7f7bff46","target_edition_id":"edition.r017.id-id.draft","target_line_end":172,"target_line_start":170,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[170,172],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e68b4f10325fcf72389965746b734699616667ed129010336aea7dc26b75811f","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-032","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"d35bb63e52e02a2e31e8cc1e0742abb957fa0e155583916801ae17f00ee6330f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":178,"source_line_start":177,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"ba06e949c9efb0aff5686f56a563abbc0ac49f506fb4edf74a019a1d7a9cfe1e","target_edition_id":"edition.r017.id-id.draft","target_line_end":175,"target_line_start":174,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[174,175],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2870c561bd195c4538657ceafedc3e5b81549407e6d513e75befa867a17366f5","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-033","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"e9d3a834156e2b784bec9ec831f932a8b7cdd7b1bcd3c6a227a07ce182ee2dd7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":180,"source_line_start":180,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"da4ac1ff62d71d421b6fd3349a1fe7451a981b6c818ea93b27ca7096605c3159","target_edition_id":"edition.r017.id-id.draft","target_line_end":177,"target_line_start":177,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[177,177],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92723bcb30fa94f4845ff6a59a53b4fa2e3cfe67663de2d043dcf205b9ee91f8","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-034","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"d39a29fe44e0d29058b89a6ce5600b388bf6fe9d9d54c48d827aaad6d2796109","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":182,"source_line_start":182,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"1a5e136ed0c9f34bc9c70c299af24ae38b500311c1a5c78604e9d404a6587268","target_edition_id":"edition.r017.id-id.draft","target_line_end":179,"target_line_start":179,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[179,179],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1fdf404bc40e5869ad81068d7475674c576f3382cbd6afbb98a5357069144cc1","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-035","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"400ab5670144973876174ccb06d30931ae1e7ffcc760649a0dca22c4f5b67811","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":185,"source_line_start":184,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"4f07f576dd97f350a5f84b8e6cd90f9c480809931b4db2346ca2ad23e336badb","target_edition_id":"edition.r017.id-id.draft","target_line_end":182,"target_line_start":181,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[181,182],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c0c87d2e3625f06f2901a6ffd6b2c020b48def5b5b80dd891995cde9471baf2a","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-036","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"a8c3f8f6b5bda05750bfcc727cf48366897a3889b9911344abc6372a6d80e97d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":187,"source_line_start":187,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"6e6f048268b0e2825043c4f51c28e48276398df326dc88413f0feb8603782e4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":184,"target_line_start":184,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[184,184],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b660a23e850ca514f7245c0e5596ec4ad3f07596891220027bec1d8203a28e4b","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-037","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"163b4c876d8a42b71f3168ef3166fe27b6f13597ad730511f494737f636f897d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":189,"source_line_start":189,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"e9a520a2fef75ca0232e22cecdec49ee915c5b646b387284c3ac7cfb8005aa12","target_edition_id":"edition.r017.id-id.draft","target_line_end":186,"target_line_start":186,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[186,186],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3448ba0f801d97c2a74b7476cc01ad31f5312f396116854c681f5e27e268faeb","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-038","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"869bfe5356472bb9ae8c5597d516f9456e11b04c33679a2a65530d449e1ffc5d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":191,"source_line_start":191,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"80ebe1da8c82f20917ce997f0584cee2cbf90ebe7d476620b10aa6bf481ff86f","target_edition_id":"edition.r017.id-id.draft","target_line_end":188,"target_line_start":188,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[188,188],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2857d8da40dd27a8b7947e9dc975365463e8c4c18bd9106c714de5b91c8ef324","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-039","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"5655121af0eb0c25316a9a6ef98e370dee765860173f2d4d61b5171116ddd079","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":196,"source_line_start":193,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"ace0f64ad58c15a44eaa6dd13acdc669ce280421b74cbb5cd1bea5c723331a37","target_edition_id":"edition.r017.id-id.draft","target_line_end":193,"target_line_start":190,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[190,193],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4efd7d028b32b5b9602d7af45681ffdbf06599d3c696ea970404e87419b4b3aa","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-040","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"d80b360a91819cb1fc408944e802bf611f5718d0e418cdfb9b90f34149c9bf53","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":200,"source_line_start":198,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"25b1e539c8a90a805436611667386bed43f54c3a064fa7474272a00bd80230de","target_edition_id":"edition.r017.id-id.draft","target_line_end":197,"target_line_start":195,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[195,197],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5fd93b949b1caa413f355580daee4deffd5a44ece67b9b79a8adb1691f0563b","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-041","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"432f3e9d0553f8bd5f4c91c4835bdb1084ed2e6a2deae1d6a47340dfe3e26da1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":203,"source_line_start":202,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"ac548c26760be03a14b55a426ca15038350c1ca3fe044c3caba87bf3aad9aade","target_edition_id":"edition.r017.id-id.draft","target_line_end":200,"target_line_start":199,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[199,200],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ccac5330dacb764e6ebc5d627f628ab0a61e5a91b463909c4ecf901575865a09","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-042","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"0a50cf26eba9de5f177d8c21f6b7d967eedd57643cfaf65a6525608d2a006440","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":205,"source_line_start":205,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"0a50cf26eba9de5f177d8c21f6b7d967eedd57643cfaf65a6525608d2a006440","target_edition_id":"edition.r017.id-id.draft","target_line_end":202,"target_line_start":202,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[202,202],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d54abefb083bd6c6bcdf0791a02f4407632f6fee555c183159f2d95eba40d4a","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-043","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"c51d676243cf407f9e57dc844337ebd8f9aabce56490b2a07b0641082df013fe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":212,"source_line_start":207,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"d0ee63f6a0bddc8441d944488079693a0a55c2ff6591c8fef3a3047a6102b93e","target_edition_id":"edition.r017.id-id.draft","target_line_end":209,"target_line_start":204,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[204,209],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb445be4a76794096f308227d0145a511eab809ef8e9dbe1a1fb1e354ee1b869","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-044","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"efba98673776480bea2652736d86f032b61bf3dd70c232abfe076a3010bff1b7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":214,"source_line_start":214,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"45d47177ada27f73b411ae25ca86b224692fbf9fcf6d3e59b25e4ca0d0612a83","target_edition_id":"edition.r017.id-id.draft","target_line_end":211,"target_line_start":211,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[211,211],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94e0231e3ff09d87d0f582f06bff1097782f82b126b53dbbe4f4582d3235a9da","concept_ids":["concept.inventory-balance","concept.linear-programming","concept.production-planning"],"id":"segment.r017.book1.ch02.text.block-045","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.inventory-balance","concept.linear-programming","concept.objective-function"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"e6cfe8b3975cf3b20c453af82c6e8ac69db1091c5bdd5d81a2130472a4d36cc1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":221,"source_line_start":216,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"0ed40d814d6cbeca77d9095d6159a1730237e38dff396f04e8658c21e7eb18eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":213,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[213,219],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2f65cffe4dd32266c55d75cfb8c2e3d09e9a464a3a6813145b3e3b053750552","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-046","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"904e231cb0868d468cb53ce3c47caaf068a8de2fd6f4c6f47b133754f1749f76","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":226,"source_line_start":223,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"35d76c7d5194f753cc704aa0ce22b818f6f797dd6936239e108385753522c701","target_edition_id":"edition.r017.id-id.draft","target_line_end":224,"target_line_start":221,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[221,224],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2099f250281d665fe689d240c0af16b28ae3a2f6e9f2347ea25a53e20d1692f2","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-047","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"c4d4bf3803d9d31fb2ee82411877e46bcd05f123d02cf1e28480401abccf056e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":234,"source_line_start":228,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"c4d4bf3803d9d31fb2ee82411877e46bcd05f123d02cf1e28480401abccf056e","target_edition_id":"edition.r017.id-id.draft","target_line_end":232,"target_line_start":226,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[226,232],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"efb26bfca75a5326a530652698a56d99447dae98985b94e61e3c5a3508f4645e","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-048","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"52d0390c932c219fefcc31c327f0cdcd2a78a1be24ba8171a11a9b62d417b8f2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":238,"source_line_start":236,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"cbc6b1d59d40925a3f4ab1211dc1e1c7a7cca510bf8191c4382de382957eb06d","target_edition_id":"edition.r017.id-id.draft","target_line_end":236,"target_line_start":234,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[234,236],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e1d18eb9921103929ecad2ee8d9b4403d3b27e87b8e14653b8a4e1aa76556f9","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-049","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"b0d641ef6806f08990f378ae22dcc6ef6cb76e10f51aa1d7d8edf281cc4c562a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":242,"source_line_start":240,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"60264636b08453df021632bbf199cd46a54e5a687e5b782ff8fdc0783aec04e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":240,"target_line_start":238,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[238,240],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ed9abc051483aadceeb875f77e712f3e73485bc9a97c8368ca6b3a446d305d3","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-050","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"217c0dd2afa85531cfee1ad82a354679dc70e880ad8123240545736175eda946","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":247,"source_line_start":244,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"b5dc946982b31a761fcd9a85ce64e42945230d4ba1e29cf0ca726754a74226f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":245,"target_line_start":242,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[242,245],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3231c2ae5d7530eb3cc736f3ee3780e985a91ada5de92ee0b5f9af5390a59a47","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-051","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"ce342e882b2b05212689cf26fbe23347a5aa00ced9ba6b0512225bc2ad5d2f4e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":251,"source_line_start":249,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"f98407e91b72cf70ff6ed7e5bf0f990e2e3b8bf95f321d7dfdb14cbc399dcaed","target_edition_id":"edition.r017.id-id.draft","target_line_end":249,"target_line_start":247,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[247,249],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9f4ae5e2a1c032ea1aa3e3af0e8bd0e23b0234e27a50a08757fbd5792331548","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-052","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"176d2b0f5b87e159b557caa3d23bba2d8b95c919f9b67cc640755716a2f5a238","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":256,"source_line_start":253,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"a39073fdd5cf89cbd03ec8cfb053a62ab5011d4c3ab793da1b0d8b7a0c6029fd","target_edition_id":"edition.r017.id-id.draft","target_line_end":254,"target_line_start":251,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[251,254],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"27649afc03d3abab6ac45576af5e8d47f4d3df1c89dbe5edccd3bc8b76e633f6","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-053","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"1ad208f8bbf7765ae6171e5bcd7795b74c643524955d0c4513e9cfddea03d82f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":258,"source_line_start":258,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"160f8af2d2c4d8445fd387f2d91b27b821c8a2c4fbbafa728677c5f8088bfb1b","target_edition_id":"edition.r017.id-id.draft","target_line_end":256,"target_line_start":256,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[256,256],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dbd66c7dda69fa9b43a4e0b1b5df9e34fd3775e7b6154a14781a863b11804010","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-054","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"a6cfb252290cbfa3a4c3ed02af5e98ae3a85ff8ebd8f564984a1c9ff4ade5f0e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":261,"source_line_start":261,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"3d99f18c9477cefeefa885aaf40985c7a4c28b0bdd21cc2684753bad41c3cd2e","target_edition_id":"edition.r017.id-id.draft","target_line_end":259,"target_line_start":259,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[259,259],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe363ae4b1f99a3c0b50676bf8d26c6ebfa6ee03b43fe73f0bb6f8c85a3b16a7","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-055","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"47b5761ba87d8a00260a213c6943542ce10ab8ac821954c9894cbd9751babe06","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":263,"source_line_start":263,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"47b5761ba87d8a00260a213c6943542ce10ab8ac821954c9894cbd9751babe06","target_edition_id":"edition.r017.id-id.draft","target_line_end":261,"target_line_start":261,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[261,261],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"71df364f3d66eb34db52e39d421426ad375da926ad0df1b83f01c79b5c7ff802","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-056","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"f18f608127ca1ecdeaca7996447ab7ce1bfe775df91d92c1b54d8a6bdd5a382c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":278,"source_line_start":265,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"10b5764515a786569d1b4072af772c7ace409a8a7f043496c4c9a53bd80f5380","target_edition_id":"edition.r017.id-id.draft","target_line_end":276,"target_line_start":263,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[263,276],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dbd2abc54d98b9b2c9559894bfcad47fe8ab66173066b457487baf57aab49413","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-057","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"c71f2863a424f2c650f4980ce85b222858fea03c543fe9f11141c254483d0100","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":286,"source_line_start":280,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"3319b2e7609717f65203cdb872aa777b981f31621a3ee19adf3a648dbacc859f","target_edition_id":"edition.r017.id-id.draft","target_line_end":284,"target_line_start":278,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[278,284],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5597dec24bcbc5228ff0f5c5352a6f160455c0e93352cdd5bb86a498f66eecca","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-058","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":58,"source_content_sha256":"3d9342829c60f94be6477555fc05c014da2823175c48e5467b6de5027166e0ec","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":294,"source_line_start":288,"source_local_id":"block-058","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"e605180c12c7b63bd1e8ff4eb49f798108748175dfce2b03824cc2879300b863","target_edition_id":"edition.r017.id-id.draft","target_line_end":292,"target_line_start":286,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[286,292],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8872f821cb0c45212d18d265c7d28f9eb5c1335d98912fa9912e159812e87481","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-059","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":59,"source_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":296,"source_line_start":296,"source_local_id":"block-059","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","target_edition_id":"edition.r017.id-id.draft","target_line_end":294,"target_line_start":294,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[294,294],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3277262cda177bde3a92972d4c4de325d29506681624558473c017821dedba2a","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-060","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":60,"source_content_sha256":"42977f4c6d35595f087c0427fd20162945eb144521394acd3ba46ef8c2a9a77b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":299,"source_line_start":298,"source_local_id":"block-060","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"3e7f6478a081bc77a001a58b5ad85758d30c76ab8ea94fd2ac08b6a108b88318","target_edition_id":"edition.r017.id-id.draft","target_line_end":297,"target_line_start":296,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[296,297],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5a4d3e04ae119a4a253f475bc97bce85bc1ca0f4a884e3032c5ec6ab9f0bc3d","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-061","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":61,"source_content_sha256":"1373b9cc9c6b821208e75344fb7522e796c35686d2169170ca506e6e4e91203b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":307,"source_line_start":301,"source_local_id":"block-061","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"210421c667ddb9830dc59f3dff9796c336c44994b2cb8a743bbb829a6d0797a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":305,"target_line_start":299,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[299,305],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"74da4e8b3464af19336a28bc5b8a23cbe14e32be3423465f3e4f86e76288bd02","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-062","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":62,"source_content_sha256":"a0d5472c5126ca8e5602e8f06e2c77d2850624d2ff8c7087e9f044be6eea4582","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":310,"source_line_start":309,"source_local_id":"block-062","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":62,"target_content_sha256":"e1167379b0a00e3ccbee94ab24f050525d7f6188f035a6ed40ab707782e6dbe0","target_edition_id":"edition.r017.id-id.draft","target_line_end":308,"target_line_start":307,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[307,308],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"080e7b3b2b0da36c6c9e3ba402d62dd3af6d2528bf00b8718e5950fe142c49fe","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-063","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":63,"source_content_sha256":"ff5fae595fc824518d51460e849a96fefc946c0b18efb16747e31dbbb495257c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":318,"source_line_start":312,"source_local_id":"block-063","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":63,"target_content_sha256":"ee13f0604b317875d616e8d145d8c07cec772bab5a0990780be48bd1784f7ef1","target_edition_id":"edition.r017.id-id.draft","target_line_end":316,"target_line_start":310,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[310,316],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e8a8b88feb062f7479045254618108a2eda0bcc6d712f213e457a1dd3759a438","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-064","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":64,"source_content_sha256":"e0b7f83889f8ff0afc6166ad7c5f0692b07f4a180e15fe3411a25c251b38d65a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":320,"source_line_start":320,"source_local_id":"block-064","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":64,"target_content_sha256":"e9c35eb4aebcf150a84d1cda9d6942514133492e2e1869d999399bbf4cf8dfff","target_edition_id":"edition.r017.id-id.draft","target_line_end":318,"target_line_start":318,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[318,318],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d97a6725f2022b0715dcd103a809fced3c839ca3112276824204652104a59e7e","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-065","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":65,"source_content_sha256":"c9007ed9c229f07ea4d8fd7e0d42951e9f52ff27c313125b7024b42a2eb95771","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":322,"source_line_start":322,"source_local_id":"block-065","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":65,"target_content_sha256":"7b1627fdfa4ea80d8530bf24b28be0baddb74394396f0d06b6ff36ef67fe7393","target_edition_id":"edition.r017.id-id.draft","target_line_end":320,"target_line_start":320,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[320,320],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"95756e01d5ea07f802d3086cfdeecc385d45a680f68f31db28aa390857b0c6ba","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-066","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":66,"source_content_sha256":"d1bcb254614e0b66bfcf07efc5e402b8b62f893d7ab5b40b95c553e938207dce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":324,"source_line_start":324,"source_local_id":"block-066","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":66,"target_content_sha256":"852ce3d9ebe8bdd9e464deded157a58de51bb33a20c591ede16295d67478dd7c","target_edition_id":"edition.r017.id-id.draft","target_line_end":322,"target_line_start":322,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[322,322],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f49d43868fa81b2855007a0143cfbf91e0535a0df921508ac5ffca8691889d0c","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-067","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":67,"source_content_sha256":"127e19a7f2fadb7039b48a5f3021f4a6eef3b98959f7924e7bd25bcb002e6ad3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":326,"source_line_start":326,"source_local_id":"block-067","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":67,"target_content_sha256":"6066c6e3c4d1b655c8d368acdc1438f732d6934da70167f25e203f85c4709482","target_edition_id":"edition.r017.id-id.draft","target_line_end":324,"target_line_start":324,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[324,324],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4140c40ef05cfbd5e91fc2fff80b9b782928c39d2cb421228e7d6f1dfe0d81f7","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-068","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":68,"source_content_sha256":"50310b9e4affe784adec4001fb53e3f457145dd2e7b586bee1b567448724d6e1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":339,"source_line_start":328,"source_local_id":"block-068","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":68,"target_content_sha256":"e5783328d6b27218e06a33fb3be98016571c61419a0ec9cba762475fef74f236","target_edition_id":"edition.r017.id-id.draft","target_line_end":337,"target_line_start":326,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[326,337],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"79b50239c4ccb197063ef99246515b9f4ce3c2cc510c14e4db4a627436aac5e6","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-069","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":69,"source_content_sha256":"3d359cd352f9791aa2d4be778b9c46d4e5fdc2a627aafa00dc5a73fb7d543883","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":347,"source_line_start":341,"source_local_id":"block-069","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":69,"target_content_sha256":"609b0e2b05cb558bcfa820da2f1ecb4b5087e12a7790665981f89ade329ab973","target_edition_id":"edition.r017.id-id.draft","target_line_end":345,"target_line_start":339,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[339,345],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a7c893ea89da60bd616235bdd6d5d9ba30a4c938c06e72d4702967db3bcfd8b9","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-070","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":70,"source_content_sha256":"b4c02532e156b0b915a1929b3782362c16d2c891df5dc468b37282a2a79552d5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":350,"source_line_start":349,"source_local_id":"block-070","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":70,"target_content_sha256":"57628c0edcdb45360ec254eefc5ae25008d67abb3aa023324cd4011347dc8609","target_edition_id":"edition.r017.id-id.draft","target_line_end":348,"target_line_start":347,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[347,348],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7423eeee46851e70fd32bde9721356db31025e3025a8fb3fa95f64158265fdf","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-071","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":71,"source_content_sha256":"bdaa4fbddc95f6ae8de127e12b2b19e392a99a332ff6a49fe1e80162bde527bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":352,"source_line_start":352,"source_local_id":"block-071","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":71,"target_content_sha256":"bdaa4fbddc95f6ae8de127e12b2b19e392a99a332ff6a49fe1e80162bde527bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":350,"target_line_start":350,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[350,350],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c6f44fce197dbb68bc9cb3733f1453419d74491d2a45845ba89b94ccb0048d0","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-072","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":72,"source_content_sha256":"13dc58c6558f9745188a1d0b9cb18a4e4aeafb66372085ca04717f7408110dc0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":365,"source_line_start":354,"source_local_id":"block-072","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":72,"target_content_sha256":"5b1b9c050356278276d31941f8d08f4d621aaa68ea35aa55bde03da8c3409861","target_edition_id":"edition.r017.id-id.draft","target_line_end":363,"target_line_start":352,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[352,363],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"50e509ae3967390d447862fa8eda0e32e0a0671c49801ef59ac43c187ed35cc3","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-073","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":73,"source_content_sha256":"8d7820fd41b1c6f4d3e4b452eaa6add6153a62bd377eda4a8fdbc2acc98c0f5b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":369,"source_line_start":367,"source_local_id":"block-073","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":73,"target_content_sha256":"1946367b473f3913122db0e6065f709357cac682db7ee7a0ce59f2170f1f42b2","target_edition_id":"edition.r017.id-id.draft","target_line_end":367,"target_line_start":365,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[365,367],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ba82b6d5fa28da2bdc3d58746897e2b83b513cf10d087856f905c875db1a0213","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-074","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":74,"source_content_sha256":"aeb716adc55e809abaf69130b6ef5879cfb980fc053014f54e358a485b2309de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":379,"source_line_start":371,"source_local_id":"block-074","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":74,"target_content_sha256":"250c4fe55882781d49d561ad2a07e26f13d5236b123afbd66b98cecbaf4667ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":377,"target_line_start":369,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[369,377],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"45df6ff5eb1c495c1cbc5346af1653f441073434ef25831fbad217342e0e2ce5","concept_ids":["concept.diet-problem","concept.linear-programming"],"id":"segment.r017.book1.ch02.text.block-075","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.linear-programming","concept.objective-function"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":75,"source_content_sha256":"870e7e9cdc1467b54257980b20d376d21c3b97e5fe029a9771ef64a9e6dcf640","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":385,"source_line_start":381,"source_local_id":"block-075","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":75,"target_content_sha256":"0c9c80c5425a3e0dc62e695957c2e908f6ca747d7f246a521783b2ab54dab038","target_edition_id":"edition.r017.id-id.draft","target_line_end":383,"target_line_start":379,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[379,383],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8151053e9a9afc88cd2e109ec45203f4eee88aa4b954d74b8c43bed082fa387f","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-076","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":76,"source_content_sha256":"68e7e4c467116798512256db616ae9f93e0fd6fdff090e3a1e1e10a56c6cc08e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":388,"source_line_start":387,"source_local_id":"block-076","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":76,"target_content_sha256":"d39884c47328b0ec2381270c17981bde43fdb053d6b4520c7ba94d18be252329","target_edition_id":"edition.r017.id-id.draft","target_line_end":386,"target_line_start":385,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[385,386],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8653e2d9d099e1829eea05ff29efb556e8b1cdc66f613bbc18c89fced4bba4fb","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-077","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":77,"source_content_sha256":"a0b223b839f95e1cda1b47d0c23f11cc5c4fbf37e0ab78c9ca5329552780ad6f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":403,"source_line_start":390,"source_local_id":"block-077","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":77,"target_content_sha256":"ccdd452d0c1271cec00e1842852d5f9a4a2171c67a95e921a21f3e92081b5a15","target_edition_id":"edition.r017.id-id.draft","target_line_end":401,"target_line_start":388,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[388,401],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b39e2312e8d2dc475352487df87d31c9e821c4dbf843ec2f2cd1296abfc613c","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-078","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":78,"source_content_sha256":"5836fc427a927208df6006ce7a8fd5b3a1daeade5462cc87195688ef2ceae5c8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":409,"source_line_start":405,"source_local_id":"block-078","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":78,"target_content_sha256":"c7b03d491b494b6bdcb5418d344a4d4f20e68b1e1f4fac2fcab5282254ccca06","target_edition_id":"edition.r017.id-id.draft","target_line_end":407,"target_line_start":403,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[403,407],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b760aa9a3e5fd3af363cd6c3a567b2b7b1ce69bffd69f3210784910de959d959","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-079","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":79,"source_content_sha256":"a44db84afa5e276b39588584d78d173a26df9bf9f713f64294ef3fb5915accb7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":418,"source_line_start":411,"source_local_id":"block-079","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":79,"target_content_sha256":"5c9d1f4ebcfea167be0cb03d26346d56929fb0bfc5a55b4e85d7659bd46e5df5","target_edition_id":"edition.r017.id-id.draft","target_line_end":416,"target_line_start":409,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[409,416],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb228a340f2643de916a3e3ac37459b1573454d3d57fce04333b3d1e3f960280","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-080","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":80,"source_content_sha256":"edc092fe7588a6d77f760ebd3dad27d9d47d183c97750727cc57337f7185b518","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":421,"source_line_start":420,"source_local_id":"block-080","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":80,"target_content_sha256":"13a96a4eebcbe24162ffe76693d6818919d2466b6970ae8c38053c64b2d0cdb5","target_edition_id":"edition.r017.id-id.draft","target_line_end":419,"target_line_start":418,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[418,419],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6c913c165eaabba4862825f49d66ed16352072c5a3f6566fe5348e592a33275f","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-081","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":81,"source_content_sha256":"3723ee4848c6a727c24db0d4bd5f7d90c9c992e9e7aff99bb659cded719b5c55","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":432,"source_line_start":423,"source_local_id":"block-081","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":81,"target_content_sha256":"3723ee4848c6a727c24db0d4bd5f7d90c9c992e9e7aff99bb659cded719b5c55","target_edition_id":"edition.r017.id-id.draft","target_line_end":430,"target_line_start":421,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[421,430],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e774b827d380ce126b984ed9497700687ea5147e3604c38cf21751bc70da569f","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-082","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":82,"source_content_sha256":"77023fab2ca6ceec0abfd8bd611d26b68ef4cc616cf3790424d0b7612048def3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":434,"source_line_start":434,"source_local_id":"block-082","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":82,"target_content_sha256":"b9cf69b8bd2567f1e33ceb995b3c4a05d7b232043ad1d1a0b752aae189cca195","target_edition_id":"edition.r017.id-id.draft","target_line_end":432,"target_line_start":432,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[432,432],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ecbb96a5c507f3d10dbfb4c32005d0408a02c9b5371abbb8ab1d4b3e9c5aa16b","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-083","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":83,"source_content_sha256":"6786c74c91e119811779175aff91aac0f934b6c8ac799ec4c05858b1ca634ec0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":439,"source_line_start":436,"source_local_id":"block-083","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":83,"target_content_sha256":"012b65192588f4470f10235e2a34127cb9f0bc9172610a6661d8f84a427c901b","target_edition_id":"edition.r017.id-id.draft","target_line_end":437,"target_line_start":434,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[434,437],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c7f444ddd4b78f0a1778b27c62936e1779d5d2dd5001af139c716e9902aa6f62","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-084","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":84,"source_content_sha256":"df2aba7e6e4cfdeda11bcd89fbafd48ea1a79913c400337bd85cf86d94a27989","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":441,"source_line_start":441,"source_local_id":"block-084","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":84,"target_content_sha256":"08caed6b453c5a48c4b5b257e3ce3927b1ccb55aad5f40151a9a923badec6a74","target_edition_id":"edition.r017.id-id.draft","target_line_end":439,"target_line_start":439,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[439,439],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ebfaac0f97ee5abdafad56de8f128489678eb9862224dfe75fed175e4d0b60dc","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-085","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":85,"source_content_sha256":"8633c057c324e06ae410d7044c75091837c7fed6aced4a9cb788b121478c97be","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":444,"source_line_start":443,"source_local_id":"block-085","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":85,"target_content_sha256":"1e452e9f8118ff4f46b4e804370db6aea79aaede2f4721ba9f4e63c706603b9e","target_edition_id":"edition.r017.id-id.draft","target_line_end":442,"target_line_start":441,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[441,442],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3681640d91168cb23a00163291b1963e9e0525ca9b946af3ab2c3bdfd086b162","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-086","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":86,"source_content_sha256":"ba608e653f5b9fdddbd07fc2cdf5e29d1f73d1d35a0a0a8a513006fd72de9365","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":454,"source_line_start":446,"source_local_id":"block-086","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":86,"target_content_sha256":"68a523b98a500e3395742c1a6e09184b3d0bd4c9362e099b0098d8ccd5718c5f","target_edition_id":"edition.r017.id-id.draft","target_line_end":452,"target_line_start":444,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[444,452],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ac3399381f70687ea7db02e8d6208f47f04fdde03dac88cd94678232275c0cd9","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-087","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":87,"source_content_sha256":"bdaa4fbddc95f6ae8de127e12b2b19e392a99a332ff6a49fe1e80162bde527bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":456,"source_line_start":456,"source_local_id":"block-087","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":87,"target_content_sha256":"bdaa4fbddc95f6ae8de127e12b2b19e392a99a332ff6a49fe1e80162bde527bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":454,"target_line_start":454,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[454,454],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8aab67f98b813b1ceed4dce067d6f4f86a2ad9af0458366f137f1e1106bec133","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-088","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":88,"source_content_sha256":"c27b2ba9c0ca9673fac7833ad93983abdfef4d4930efa545a463d2681ed37312","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":482,"source_line_start":458,"source_local_id":"block-088","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":88,"target_content_sha256":"5c55ed55180911950358269e3bcfccc080f6c3c8f12224a43dea2c70ebffe32d","target_edition_id":"edition.r017.id-id.draft","target_line_end":481,"target_line_start":456,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[456,481],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61a86a37bf83fda622349d73a678c426defe7ddd815e800f4cf1e44c64ae50b5","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-089","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":89,"source_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":484,"source_line_start":484,"source_local_id":"block-089","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":89,"target_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","target_edition_id":"edition.r017.id-id.draft","target_line_end":483,"target_line_start":483,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[483,483],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e916076d8b96c64064d75308e4228c19ece226c101b4c0e899dc4a91286b4f4e","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-090","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":90,"source_content_sha256":"7a5a03c595677764db9ddfb2c413ddacfc820ce558fbcd1ccf12a194f7a6aca4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":486,"source_line_start":486,"source_local_id":"block-090","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":90,"target_content_sha256":"8e7fa59ab4b25b5a524e5e6d0eaf44b247fb0d042d18a7cbe201ad2152da10ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":485,"target_line_start":485,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[485,485],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3d4c7f3245d95bc32377c64a87ff18ef97399e52adb78c7925a811a61fd46ef4","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-091","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":91,"source_content_sha256":"b722b26130cdc952da40284e7306378370613e598caacf0baa77167bb120b48f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":489,"source_line_start":488,"source_local_id":"block-091","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":91,"target_content_sha256":"15db2173a735387e90fdb3fe82bc7bbae06b1071622e61d539f935dd76ad0aa7","target_edition_id":"edition.r017.id-id.draft","target_line_end":488,"target_line_start":487,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[487,488],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"edfb67449a9f81a9f659e36a03ecc834fd24cc821836ab546d27f659b2c57954","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-092","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":92,"source_content_sha256":"545b809adc5001a3bfdee2279526587720b48cb48fb655e4caea76d44b8af38f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":491,"source_line_start":491,"source_local_id":"block-092","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":92,"target_content_sha256":"74e2d14ae5c44d06bc5dbdd849604b013a27dbc83483052a98083766735bf1d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":490,"target_line_start":490,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[490,490],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70bd5dbdd658b1b9899266c5f8fb1fbdf0c5376d64ba66279a3d056bf48260f2","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-093","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":93,"source_content_sha256":"307bc5650ddb20db6687b8cd9e3b15a39108188ac659688745ce5bd3aefd1b8a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":494,"source_line_start":493,"source_local_id":"block-093","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":93,"target_content_sha256":"ce0df34d06772973724f1479c95c8986d8306c52d9d4dd8e4b5ce0be705d18fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":493,"target_line_start":492,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[492,493],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"485b6cba096041d2f1d321a0a4fb144710f0d60ade9aee584306395a908e6cd4","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-094","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":94,"source_content_sha256":"9c84f0f35c2210e23cf73890f7305d63aced31f57e19ceba17f8525e3af2183f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":497,"source_line_start":496,"source_local_id":"block-094","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":94,"target_content_sha256":"8e15665c60f774a90a944f918a9f4341f4a6a61e0a3644a17c4bc8f4c843c505","target_edition_id":"edition.r017.id-id.draft","target_line_end":496,"target_line_start":495,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[495,496],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5efe33d02daa59b231543304924c526ed6f88f84218714a9827f1e2c45cc5f2d","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-095","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":95,"source_content_sha256":"ab8c4c76ecc7d3400968e62f6539100a527d169828ff17ae23280e80a2a3266d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":499,"source_line_start":499,"source_local_id":"block-095","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":95,"target_content_sha256":"440b965a9b9ccde0dbd2fb10d2d3107d924784cdd813e9d3791f8549237096bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":498,"target_line_start":498,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[498,498],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1bf83b6072a6efc7fdfd0a97a6266d47802102134eac10255d3f1dc956057791","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-096","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":96,"source_content_sha256":"dc00d70249a5a8d57c9ec6010f9e6f538b85204dc7b063a7e891589d9fef03ad","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":505,"source_line_start":501,"source_local_id":"block-096","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":96,"target_content_sha256":"aac56b615036d98591f64b43d5525b54624b306992a54bb6ee29474e3f56268b","target_edition_id":"edition.r017.id-id.draft","target_line_end":504,"target_line_start":500,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[500,504],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"96bc6fb1639bf657e800e5323e40a749ff35b6c167f4ea7056d90515b40e9300","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-097","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":97,"source_content_sha256":"28b6ff6667ffbc3bbac63dea65e8098dd0a97fe32953bbc348696ff3eebe9ced","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":515,"source_line_start":507,"source_local_id":"block-097","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":97,"target_content_sha256":"06abe39bb5eb19a1c3c28104646177d21918f279423dce9558e330ab812ff02a","target_edition_id":"edition.r017.id-id.draft","target_line_end":514,"target_line_start":506,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[506,514],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"271c02e20412818ab1cd95be8627ef09612fdc81578ade84f7b31fa265fb317f","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-098","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":98,"source_content_sha256":"1098593185073ac9d75d5150b579214623209d252a87d10492e859fc2db4c503","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":521,"source_line_start":517,"source_local_id":"block-098","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":98,"target_content_sha256":"fbdc2601bbc2227448101ed8d694ae583c96e14d5b29d132122dd12c670d2e88","target_edition_id":"edition.r017.id-id.draft","target_line_end":520,"target_line_start":516,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[516,520],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ca42aea0993ae153d1a85bd72421a9b242785581eb447c4dc7b342d1379040b","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-099","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":99,"source_content_sha256":"ffd394aa0f2314d94d279ec144d8e66266accb05d360bfb838a746ff4a6df917","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":524,"source_line_start":523,"source_local_id":"block-099","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":99,"target_content_sha256":"0b1e93bf0c14068915133e2b3d6afb4d8efd26c6e390a350c8efd2cfbe3bb3da","target_edition_id":"edition.r017.id-id.draft","target_line_end":523,"target_line_start":522,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[522,523],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"36f4f66c758ec74899edf1f2e8bb916d16d2b9c8d548bddfc082aff28b5cc58d","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-100","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":100,"source_content_sha256":"f10cf699004322f470156b614395a20fd0fb2869fe12755c62a93acf644c66dd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":530,"source_line_start":526,"source_local_id":"block-100","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":100,"target_content_sha256":"4a8bc13012c78c8118957e88f486ffe1101ec940cf7d525615bd074b0c9cd2f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":529,"target_line_start":525,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[525,529],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7085afafa0f8d4de9682082f4f85e6cd59947b892727d53af4df207d977906ef","concept_ids":["concept.integer-linear-programming","concept.workforce-scheduling"],"id":"segment.r017.book1.ch02.text.block-101","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":["concept.integer-linear-programming","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":101,"source_content_sha256":"b350480c438b3e5e34f13fc0ae1e809a6e620fa0d0c1bdf64b57c7ccf461394d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":536,"source_line_start":532,"source_local_id":"block-101","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":101,"target_content_sha256":"0d0547e8e8f7603798d815ce68451fd9ddf19fbc2dfc3a2a53b718350310321e","target_edition_id":"edition.r017.id-id.draft","target_line_end":535,"target_line_start":531,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[531,535],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"85068b9d1a37b8aec423c271a674e7137ee5d03ff5b74a7a07110b99aeb0d8e2","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-102","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":102,"source_content_sha256":"bf4e45ae8b44ef6c72e84f5703810810db3b569af73ec4530b38b6039990793f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":538,"source_line_start":538,"source_local_id":"block-102","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":102,"target_content_sha256":"4f5a670427d0cafcb168ad3f8612b5b3e041f926b130526c11a6c718dfca4b5e","target_edition_id":"edition.r017.id-id.draft","target_line_end":537,"target_line_start":537,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[537,537],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b2a0235fb82e472ae4b530f42ce761ee1571459a82d15a36b6df54d3f032bfa","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-103","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":103,"source_content_sha256":"47b5761ba87d8a00260a213c6943542ce10ab8ac821954c9894cbd9751babe06","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":540,"source_line_start":540,"source_local_id":"block-103","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":103,"target_content_sha256":"47b5761ba87d8a00260a213c6943542ce10ab8ac821954c9894cbd9751babe06","target_edition_id":"edition.r017.id-id.draft","target_line_end":539,"target_line_start":539,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[539,539],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce1040ac9b47a93042365fc2ca1ac2ee98fff45bf0a6a5e7014ac67818586f9e","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-104","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":104,"source_content_sha256":"4a144cd1b539ce299480ba9f510b8781d9612ef0e89e89f57156cd43d96f4470","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":552,"source_line_start":542,"source_local_id":"block-104","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":104,"target_content_sha256":"1988ef3b7d94b12cd3f179d97042a5c4119489d909a94368586a35b383c7020d","target_edition_id":"edition.r017.id-id.draft","target_line_end":551,"target_line_start":541,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[541,551],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a07b5dbb25de87a39906605172a38f1f2d3085d028fe28c8ea92823b5d1dcb3f","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-105","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":105,"source_content_sha256":"7215f283aea966ecfb79d0a3b45fa35e9e13b306e361228b2f80b9b1fa21ce29","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":554,"source_line_start":554,"source_local_id":"block-105","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":105,"target_content_sha256":"f21fd713731f65b1f3602e687172496405b3ce2cc5365f3c33e16e37e3ebe75e","target_edition_id":"edition.r017.id-id.draft","target_line_end":553,"target_line_start":553,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[553,553],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10312bfe72fd2e55cc50cefed3dcfba0af344ec4c8229852906a812b77cf0cf6","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-106","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":106,"source_content_sha256":"3f2e2c2336997f65b8422d941ee4796b95d589b0352427639b2d900e013bc3e5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":569,"source_line_start":556,"source_local_id":"block-106","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":106,"target_content_sha256":"3661a3c5df3b443a3bc97c56e523734057910c911b4f8612290fc59d6ac2519f","target_edition_id":"edition.r017.id-id.draft","target_line_end":568,"target_line_start":555,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[555,568],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d8d542ce4aef16286292d9091b19b204bec558241537558a8753fb1ffacb1f40","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-107","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":107,"source_content_sha256":"8f696e00adbb48e20b60060110e58fca1e872147410f0efcc01848663cc9d68c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":572,"source_line_start":571,"source_local_id":"block-107","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":107,"target_content_sha256":"8c3c925ded1d3fce5e7409cb54607de9331dbf527445b6aba1698fdb34dcd91d","target_edition_id":"edition.r017.id-id.draft","target_line_end":571,"target_line_start":570,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[570,571],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"44ef31f5b785891f10baac8816f6344d9337f76c5804377eeba3a40ed6687836","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-108","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":108,"source_content_sha256":"d0d2aee39680d3bda0e60053d9a814d9f0495226e96836834907b4b19b6f62b5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":584,"source_line_start":574,"source_local_id":"block-108","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":108,"target_content_sha256":"52efad6448c21099f598cff2aae65e3bf68c5391b101b59c5b64552dd17fb4f3","target_edition_id":"edition.r017.id-id.draft","target_line_end":583,"target_line_start":573,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[573,583],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ebe8cd68497387620d1e509b37640dc7cbb02c982a6d86df7f2b56cef4c096d4","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-109","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":109,"source_content_sha256":"47ca19c5f8e7172ee10a51fa8e5d44f2c765556777a1052b9dae8d1f1e6c09cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":600,"source_line_start":586,"source_local_id":"block-109","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":109,"target_content_sha256":"a726a692506e64aa9c10fa5e8083be4de06f8fdd0401c5a2680b215637ef5ffe","target_edition_id":"edition.r017.id-id.draft","target_line_end":599,"target_line_start":585,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[585,599],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d25fd2cd5daeef97f3ef7cf5bc5fca382aa99d9514d0027728c14bbb962b01d2","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-110","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":110,"source_content_sha256":"5f95403c027b90f3764b8e8a3746d32290da248420a2e7cb3e5e00591f753a5d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":613,"source_line_start":602,"source_local_id":"block-110","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":110,"target_content_sha256":"c9bdf02c9948c1af811b27d6dc4f2da58685a7d685b4196dc039537f6bda9524","target_edition_id":"edition.r017.id-id.draft","target_line_end":612,"target_line_start":601,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[601,612],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9ee113053cfdc4f5266236c145b58e0d597caf45e16cf81a18494eeea5ea01a","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-111","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":111,"source_content_sha256":"a4ee0d090cd08d5c0128468814089d3661358a59c9354ea0d043d4b74956382c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":626,"source_line_start":615,"source_local_id":"block-111","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":111,"target_content_sha256":"71b21db9263cc86cf626eb11b27c0c73ea59064a72c769ae0364af73b7d6b559","target_edition_id":"edition.r017.id-id.draft","target_line_end":625,"target_line_start":614,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[614,625],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"251ce9c548ddcd25b89dc48317cb0bdf73504333acd5aa9db36118bbd7be6d31","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-112","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":112,"source_content_sha256":"50d55542ad65f51b9c08b3c64168d2a63c1303c4bd4dd23c12096f912c7e3e79","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":630,"source_line_start":628,"source_local_id":"block-112","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":112,"target_content_sha256":"cdb6af1669ee87efc1d0354fafd1dff9af725f4de7e9a997a191a60dfc4886b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":629,"target_line_start":627,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[627,629],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6de64817b291603204e8acc805560d5f839dea74228875311bf95840ab3a40da","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-113","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":113,"source_content_sha256":"c3ee36391eb9c5d5a023c662a59f54a700eefc2f9c3ce87133a716b72cde3f53","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":638,"source_line_start":632,"source_local_id":"block-113","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":113,"target_content_sha256":"c3ee36391eb9c5d5a023c662a59f54a700eefc2f9c3ce87133a716b72cde3f53","target_edition_id":"edition.r017.id-id.draft","target_line_end":637,"target_line_start":631,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[631,637],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb4812d0c715e0c5e55d2ce6a1ce258c459491e314c7a3470b70d855782322c3","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-114","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":114,"source_content_sha256":"0e41a0d857bddb6026e9932674f7255b7a5d540fb1d21c03579035e3a2a67a65","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":648,"source_line_start":640,"source_local_id":"block-114","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":114,"target_content_sha256":"b968b3887860e708f89a17969cc2effd558bc1f75f841a5a7e7cf994733864e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":647,"target_line_start":639,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[639,647],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5041f7bb6cfa5d996f850c353bed5dbb33ada18638ebcc7c7f9850224fed037f","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-115","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":115,"source_content_sha256":"bb85d44bad77cf25c50a820ae7c52c77304d870c08f0ff6a227e8c3ea6e6e427","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":651,"source_line_start":650,"source_local_id":"block-115","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":115,"target_content_sha256":"3af323b39a4e252546cb21c31b2299975c77b4c34a65f2a23f7aa0d59a2e5c10","target_edition_id":"edition.r017.id-id.draft","target_line_end":650,"target_line_start":649,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[649,650],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5acddf13af6166b4e5d005ebdc965b0334d4e80e397df97142d9abb1f7e13b5","concept_ids":["concept.binary-integer-programming","concept.capital-allocation","concept.knapsack-model"],"id":"segment.r017.book1.ch02.text.block-116","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":["concept.binary-integer-programming","concept.knapsack-model","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":116,"source_content_sha256":"8347d4f874843a92d76ae681db9eb221ebb07061548aefb0906e3e75b4035605","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":661,"source_line_start":653,"source_local_id":"block-116","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":116,"target_content_sha256":"1159595eb9c27b2dcb9638f92ba93bf9e286583ae77267f7a033daa94ebe07a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":660,"target_line_start":652,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[652,660],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"578709de2090221db53b5d96f8953d0a641786ef135b15ac4c08895a6b51e511","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-117","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":117,"source_content_sha256":"bdaa4fbddc95f6ae8de127e12b2b19e392a99a332ff6a49fe1e80162bde527bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":663,"source_line_start":663,"source_local_id":"block-117","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":117,"target_content_sha256":"bdaa4fbddc95f6ae8de127e12b2b19e392a99a332ff6a49fe1e80162bde527bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":662,"target_line_start":662,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[662,662],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"239473bcabf2d159ff31364ae74e2be1d4dfb7395bb2ed2022a1c83a5d4838a9","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-118","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":118,"source_content_sha256":"109074d1cce705273580f216978675c4e227b2138e20622f3cba2fc67da160f4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":668,"source_line_start":665,"source_local_id":"block-118","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":118,"target_content_sha256":"601f352247cd590a37cc69cd7e6141df7e4b60f2eb103eca1e4887559da878a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":667,"target_line_start":664,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[664,667],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"981a5ff53fe6195a01f53eb5fda2d0b8ef665aa3f63b617e518651bbf2e72611","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-119","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":119,"source_content_sha256":"25bb1b09a5a63927178b5e11fa5316421f98970e1841107a015e30e18569ab6a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":675,"source_line_start":670,"source_local_id":"block-119","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":119,"target_content_sha256":"8c5af2b1dfd5278f83d559e998ac249391fc6b13b669691e835ed85b68848858","target_edition_id":"edition.r017.id-id.draft","target_line_end":674,"target_line_start":669,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[669,674],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"417a4f8ff203ecc2ffd0e5956d76bb81c57011bc9505258f2dbe6391718fac23","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-120","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":120,"source_content_sha256":"3f6498fe67d915c4cdd4499c04501d95044410a1d17960fdaeec2e46821140bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":678,"source_line_start":677,"source_local_id":"block-120","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":120,"target_content_sha256":"e8aefc6cc0d13a16b4de9e6d6b30f8dab27160380e508c94801114e22ba94068","target_edition_id":"edition.r017.id-id.draft","target_line_end":677,"target_line_start":676,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[676,677],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c3101cdcc1693f09ec6d2f5da214cb6e42838fad4b74bb7656efc63c57548a73","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-121","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":121,"source_content_sha256":"5b4d8cf03db24ad3d29a7e3fd36829281a7ec13625697abd04ad55b513070e71","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":686,"source_line_start":680,"source_local_id":"block-121","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":121,"target_content_sha256":"5b4d8cf03db24ad3d29a7e3fd36829281a7ec13625697abd04ad55b513070e71","target_edition_id":"edition.r017.id-id.draft","target_line_end":685,"target_line_start":679,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[679,685],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23b88a2dbde96bd6a9db8ade14c820738034a8970a1a8a292077b97a222fc2c2","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-122","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":122,"source_content_sha256":"4d3f88d5b08befafee0e42d2f015f4d964cbaa080867685b3bf570cf02c8a367","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":688,"source_line_start":688,"source_local_id":"block-122","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":122,"target_content_sha256":"4f457705c493c8b2007761378f3255aae1a0051282b541cb1af97aae8d75cc85","target_edition_id":"edition.r017.id-id.draft","target_line_end":687,"target_line_start":687,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[687,687],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e6afe333cea850189a6c1bcee4a7ea03e9b7886f413540f6d61d9ad585b5662","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-123","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":123,"source_content_sha256":"fb18062cfaaf4d96cc546e76974a3bf467f61c8f59de52ebcdb0521979ce6fd8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":694,"source_line_start":690,"source_local_id":"block-123","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":123,"target_content_sha256":"d9fd8d0cf0cc3ca5de27d175ac36fe6396728d9fa66bea0d9e6cf36c3e3d7ef3","target_edition_id":"edition.r017.id-id.draft","target_line_end":693,"target_line_start":689,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[689,693],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c28c1cbc27017e1ce99ecda683421825fc864d54bb861f52199498b479d1b06a","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-124","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":124,"source_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":696,"source_line_start":696,"source_local_id":"block-124","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":124,"target_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","target_edition_id":"edition.r017.id-id.draft","target_line_end":695,"target_line_start":695,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[695,695],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10fb55ce68856adfe776af9c5cc2fb66f4bc722166fa98f1b5c856426422285a","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-125","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":125,"source_content_sha256":"f38a056ba462d64af9cd358ac2dd262b3e9eedae4fa0835b4be9bc637674a87e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":702,"source_line_start":698,"source_local_id":"block-125","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":125,"target_content_sha256":"a6b1d921d6ef9669e8ada5196362a586821d815fb979ecf08f5682470745d59e","target_edition_id":"edition.r017.id-id.draft","target_line_end":699,"target_line_start":697,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[697,699],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9941c01585c673a9773a3c7b456d45270a112e3c0f1f66bd9cf25732722288da","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-126","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":126,"source_content_sha256":"d1143be8d19458d535079abd956f0fe47d69346d4dc7b95374679ffde5f813e3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":704,"source_line_start":704,"source_local_id":"block-126","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":126,"target_content_sha256":"573f347579e87a12daafffab2ad3102d3a1e3f3384edf56963283c7a606a329e","target_edition_id":"edition.r017.id-id.draft","target_line_end":701,"target_line_start":701,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[701,701],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bde1912f19edb01b2c54872c593f44d4ca3f5cb5e8541b1db7168a7d7c5f60fd","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-127","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":127,"source_content_sha256":"4ac6a24dd89893f0d31ce0d779190b76d93fcb698d700a8728bd287ccd345ea8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":706,"source_line_start":706,"source_local_id":"block-127","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":127,"target_content_sha256":"47964bc7ec7e8dbbf3170003548d004664dd2d78ed781f42f2b1bf98a5b7836a","target_edition_id":"edition.r017.id-id.draft","target_line_end":703,"target_line_start":703,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[703,703],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab5ff83bf2007eef20b1b72a6bfdf0eff7693a4957a8e9779e1c13a449130040","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-128","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":128,"source_content_sha256":"e17b11d25da9f3b9a4be8d8db110237704e7b31e557a18a58bc0d504d363418a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":708,"source_line_start":708,"source_local_id":"block-128","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":128,"target_content_sha256":"23b00c87d2bd4e2d1f53b7b853b594a26c6500e1382887dc71b31d696f1cf62d","target_edition_id":"edition.r017.id-id.draft","target_line_end":705,"target_line_start":705,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[705,705],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"78bd1eb126b9302f439ae78a2c04834916c0f97ad838f8f0bc96efa305a2c225","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-129","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":129,"source_content_sha256":"47b5761ba87d8a00260a213c6943542ce10ab8ac821954c9894cbd9751babe06","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":710,"source_line_start":710,"source_local_id":"block-129","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":129,"target_content_sha256":"dcc6e6495f0be6056a856e63d1acec01ad2634206bda52c32dde5e473fc70e99","target_edition_id":"edition.r017.id-id.draft","target_line_end":707,"target_line_start":707,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[707,707],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0c1ea54910daa30cd192e22422a2c082863d10dfd38915289f693d2fa6dbe5cf","concept_ids":["concept.linear-programming","concept.transportation-model"],"id":"segment.r017.book1.ch02.text.block-130","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.linear-programming","concept.objective-function"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":130,"source_content_sha256":"0d4bd52a677625cd3d2c983589dac3acc9ccfce82482f3d7437042b01b18d030","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":719,"source_line_start":712,"source_local_id":"block-130","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":130,"target_content_sha256":"8b3c88a350cfee593ce8148246d217741ba658325599e11d8693fcae6be5eb65","target_edition_id":"edition.r017.id-id.draft","target_line_end":716,"target_line_start":709,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[709,716],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24c33b3e8327659587442657d3e15c1161fa3284fd9d1925109fc749ade0de90","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-131","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":131,"source_content_sha256":"4ba509c7bb3bf7dafee88774423c11f92f07b24242e4d6ca40f7a1ce66ec5750","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":726,"source_line_start":721,"source_local_id":"block-131","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":131,"target_content_sha256":"bb5bbd5f2cf4a1ef526c79557a2d8600ba6cec846bc3bc560898028e05e30c37","target_edition_id":"edition.r017.id-id.draft","target_line_end":723,"target_line_start":718,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[718,723],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a84b678f82169ea367c7c4f5ba5ece2ed07b531c2757f71497e6b13c9d64568f","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-132","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":132,"source_content_sha256":"bdaa4fbddc95f6ae8de127e12b2b19e392a99a332ff6a49fe1e80162bde527bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":728,"source_line_start":728,"source_local_id":"block-132","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":132,"target_content_sha256":"bdaa4fbddc95f6ae8de127e12b2b19e392a99a332ff6a49fe1e80162bde527bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":725,"target_line_start":725,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[725,725],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39586636dc7aa48c1e71c2b8cec0cbfc263ce500d0144eb9d9ae174cc1ad55e2","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-133","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":133,"source_content_sha256":"5be57a6fd485f08688ffd92094496076a549957a3e32c7e397a00b00d13437b0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":734,"source_line_start":730,"source_local_id":"block-133","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":133,"target_content_sha256":"6fbdf5c25bc55b42ab4674bbeca8ce38fa581b7f4487d4fae43377eaf8055f06","target_edition_id":"edition.r017.id-id.draft","target_line_end":731,"target_line_start":727,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[727,731],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"125fd668d9c152c9d18331a6c9d324ea490d48f6302477956fd94735f1cc2989","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-134","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":134,"source_content_sha256":"66fa91f34f167b4bde49e661f490bc0a4ea46614f2f9d6de54bc58bf990bc580","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":743,"source_line_start":736,"source_local_id":"block-134","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":134,"target_content_sha256":"7880fe4d306fa5eace1777db756a441a1fc258d7bd01aff278524e89df42e9a7","target_edition_id":"edition.r017.id-id.draft","target_line_end":740,"target_line_start":733,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[733,740],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f1a0a7e297e99c4f47fbbbbfb12b837d4a9a3139aa68bfa11d81bea0cdfcfea4","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-135","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":135,"source_content_sha256":"8bbb637499c1c84ef8dee9602b6c6625135119c722e7e8ebd7b327633157a620","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":746,"source_line_start":745,"source_local_id":"block-135","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":135,"target_content_sha256":"403aee524519a68eff8cb7427d7db2fb9973706d5c5ca441ac2939b22d245fb7","target_edition_id":"edition.r017.id-id.draft","target_line_end":743,"target_line_start":742,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[742,743],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3e650b96014645e2df8f503b1c60c70fa423bfc4b78ba424e7b37da2a7120f9a","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-136","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":136,"source_content_sha256":"4a1d805d25981b57dd59bdfa4c4d3a3230de5f2f011d9889f356536c6512a5c1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":761,"source_line_start":748,"source_local_id":"block-136","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":136,"target_content_sha256":"44fa2dd2ba5243b9549384f726a1d5f90e9d747ac333ffe2e58ee1f698f6c460","target_edition_id":"edition.r017.id-id.draft","target_line_end":758,"target_line_start":745,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[745,758],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc9fc6f3eb733682c2944cf0d4d9f8b9aecdcc49cf4874d14cf5a4c0c6d6f0c9","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-137","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":137,"source_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":763,"source_line_start":763,"source_local_id":"block-137","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":137,"target_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","target_edition_id":"edition.r017.id-id.draft","target_line_end":760,"target_line_start":760,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[760,760],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a07bcb79c01ccaab824b1f7b38f1278083a81ba2f9b855d2dcc2a36bb6dc7d45","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-138","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":138,"source_content_sha256":"813a89780309b8662fad73e5022e5272a40d0f3bb2f8ebb6e732c1537c26468d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":766,"source_line_start":765,"source_local_id":"block-138","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":138,"target_content_sha256":"c4742d029b2c56dae03cfe23f2bdc1ca19d30758ba0086666122832d7449134d","target_edition_id":"edition.r017.id-id.draft","target_line_end":763,"target_line_start":762,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[762,763],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4fe4d459805613a901b514d05da3dcf7663f006d26014dbb4aa8d22d88dd3751","concept_ids":["concept.assignment-model","concept.binary-integer-programming"],"id":"segment.r017.book1.ch02.text.block-139","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":["concept.binary-integer-programming","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":139,"source_content_sha256":"335a9190dd029db5019247222f1cc0e3486daab1c4c783c88a20e46042acfa95","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":774,"source_line_start":768,"source_local_id":"block-139","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":139,"target_content_sha256":"58f7e2155eed2764424d03502059c53f6b0e18138295e850952f2e50691b1f18","target_edition_id":"edition.r017.id-id.draft","target_line_end":771,"target_line_start":765,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[765,771],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81120133574419d7bc91b03a2fcd95dce09584ad4037ce438a799929979c2b5c","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-140","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":140,"source_content_sha256":"de296ca6e6ae47e6eb583623a6fdefe50f59359f97fcf1edca8992444c2ead27","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":786,"source_line_start":776,"source_local_id":"block-140","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":140,"target_content_sha256":"7152a6c38980ac3b8fea9045be86e30bf93fde5953ced84dfcc8554073d95bd2","target_edition_id":"edition.r017.id-id.draft","target_line_end":783,"target_line_start":773,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[773,783],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0ecdcd9b729f68c5b11a938b54b3934aa2e5a5e6bfd7198ae7069390c2a18423","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-141","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":141,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":788,"source_line_start":788,"source_local_id":"block-141","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":141,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":785,"target_line_start":785,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[785,785],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2f9593472df15227b829d846d41b0f3f5c143176da1798cfed45f9d13ef2af3","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-142","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":142,"source_content_sha256":"9731087e42068d4f7848ee5760de65eca979759764307394f674eeaa47b2ba3e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":792,"source_line_start":790,"source_local_id":"block-142","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":142,"target_content_sha256":"e88a2bbf0f5e2496edef9cb47a967395100e6f8bd782bf47be4463dfe576b53e","target_edition_id":"edition.r017.id-id.draft","target_line_end":789,"target_line_start":787,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[787,789],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2365e4e3e0632c12f07dbffb2afda04506922b41e059c0966a08f2e0d5f5eee8","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-143","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":143,"source_content_sha256":"10af73ce0805b4c3e0d0b24889ef0700234861f49ede2353282f8f5b09d8d0f1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":798,"source_line_start":794,"source_local_id":"block-143","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":143,"target_content_sha256":"326fdd067ed1599c5d6eaedc7afe674fe0e5986f69067fe9fbb4eedd0141c926","target_edition_id":"edition.r017.id-id.draft","target_line_end":795,"target_line_start":791,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[791,795],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70d860f32f2b093ac5c4079794f6ffd548d2b0dd21871a4fadad4092a9ca7051","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-144","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":144,"source_content_sha256":"22dc331e211e73945ad57c188b9fd4e5a394014ad55560ab985ebdef4221fee1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":803,"source_line_start":800,"source_local_id":"block-144","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":144,"target_content_sha256":"85d42d4705149c0c3492cb33dcba65aa468d7802280d0c19a4b702f0a798bc02","target_edition_id":"edition.r017.id-id.draft","target_line_end":800,"target_line_start":797,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[797,800],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa416d44a7dc47f95ca3b78705ec0eb3ceb58b1c6458944c40b82b066a3717bd","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-145","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":145,"source_content_sha256":"787d99c500aab469aa984e4be0fd3aaa8e998e6157a38fa1c6b5442a2d87d6f3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":806,"source_line_start":805,"source_local_id":"block-145","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":145,"target_content_sha256":"4eddc2e12f3211efde10ecd4db07078714ca6af73d57ac853d23f376f0868f8a","target_edition_id":"edition.r017.id-id.draft","target_line_end":803,"target_line_start":802,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[802,803],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c27b59781dcc8704e85eace1a69b4efc037bf12b8ed79f1e139448ff12c6cd8","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-146","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":146,"source_content_sha256":"797ade1ff1365a182500f700d1ccb78f1744132486752c7e55cc716c076cca3f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":819,"source_line_start":808,"source_local_id":"block-146","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":146,"target_content_sha256":"921f810447e794ae7d92bba1efd7886d8eae1e4272bd8a1b3ed9e9eb6a7de9cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":816,"target_line_start":805,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[805,816],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9148d4d6e68ac29291199237604c6f6142267b54185dcf1d1381d28b7c886691","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-147","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":147,"source_content_sha256":"1e4ccc9ccba9038d35b6d9ebed7b22602bc3cbe77fc62260abb1d7f124da6cb9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":821,"source_line_start":821,"source_local_id":"block-147","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":147,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":818,"target_line_start":818,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[818,818],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"46fcea5d9b1a1ac3ee1e68bbd0f55a4ce6dd8463a437c4e39c13308f187a9e29","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-148","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":148,"source_content_sha256":"b720066bffcd545421a8088f018798b4bf652efef8520c8f4d758de3565aa526","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":823,"source_line_start":823,"source_local_id":"block-148","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":148,"target_content_sha256":"54563944526eb2b55da9f1267faa4aac1e61953603d2353d325671a4ac7c5080","target_edition_id":"edition.r017.id-id.draft","target_line_end":820,"target_line_start":820,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[820,820],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e0d4179832046c0c12b602b0908a6c979b9e360c72fb1dc655606b65cc07118","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-149","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":149,"source_content_sha256":"a6c18cd910118035e9ea010f2ee79c798b3efbc009700c989db4ce6c1d1e71cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":825,"source_line_start":825,"source_local_id":"block-149","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":149,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":822,"target_line_start":822,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[822,822],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f271c0f729b2bef646a2086b491945e5b37c2d5b4019e07d32c816f9f241ffb5","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-150","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":150,"source_content_sha256":"436cc4efdec53ba7be30c1910683923e439fbd00c1deab5dc7b65cdaccf3e288","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":836,"source_line_start":827,"source_local_id":"block-150","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":150,"target_content_sha256":"5022d41a98859ae6fe0b6382ccbc731d4955c487bc585eb0d2ae6c574360cfc2","target_edition_id":"edition.r017.id-id.draft","target_line_end":833,"target_line_start":824,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[824,833],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b36864b4293021b63d98704383f89286d0dcc37a8b223444098168a61b48b0f1","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-151","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":151,"source_content_sha256":"c6e52163ed240b6093b192320047952b179461722e29084c2c85e176807dabf1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":839,"source_line_start":838,"source_local_id":"block-151","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":151,"target_content_sha256":"811be24aa5a1e560052a638d834c696b3da53caf554fb21dcfbe1d86fbe0c87e","target_edition_id":"edition.r017.id-id.draft","target_line_end":836,"target_line_start":835,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[835,836],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"620458987a82213430ed23bad414d2d66374efd91c40ba49344414f39f70e64e","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-152","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":152,"source_content_sha256":"df42953eeb6b19484b1c1924ec5965e64120ee09ff1871ea65c86b16b6f9684c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":846,"source_line_start":841,"source_local_id":"block-152","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":152,"target_content_sha256":"2b8ac1c688e112afa7165e60e3b86fcf8beb57c4e9c5619090e6d7d8e7b99c68","target_edition_id":"edition.r017.id-id.draft","target_line_end":843,"target_line_start":838,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[838,843],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f9c10994e5ed8b73d978d033359ad9cd1c225cfe356e249b9720d791aa2b9bc0","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-153","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":153,"source_content_sha256":"2a79024de5507be7a2c0ac436eed276562d6eccf44fc62e900306593f7a5b531","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":852,"source_line_start":848,"source_local_id":"block-153","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":153,"target_content_sha256":"f0ce2d1652eccdb28c98f303ed819f0cf9efde3e85f6b942d918795d33a34b0e","target_edition_id":"edition.r017.id-id.draft","target_line_end":849,"target_line_start":845,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[845,849],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a26ecbe3e4825f5282b020925146a8fae29fe413874b532cbb48a932a47fa848","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-154","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":154,"source_content_sha256":"190dddb06c8b057a2c8294a0c8a9d6abc29334b423079d2fa591058ae102bcfd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":857,"source_line_start":854,"source_local_id":"block-154","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":154,"target_content_sha256":"e68d295c8566b8872d93000cbe2fed5f0871dcc0d9ce97f837ee54d404a7eb30","target_edition_id":"edition.r017.id-id.draft","target_line_end":854,"target_line_start":851,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[851,854],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e8eb94bc411eadc482e9a8fdf72878d5913947e16130bdcdba04e52e00a73073","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-155","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":155,"source_content_sha256":"befe6892ec44e33f7b364305fbcec8fa778e09b9cb39adc300c1dd14bcf212c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":859,"source_line_start":859,"source_local_id":"block-155","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":155,"target_content_sha256":"e3f87b06f7a641556fe14f6828c82cf2c975b6a9ee5826c46c7cbd0d343ca7a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":856,"target_line_start":856,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[856,856],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"56b1ec2a8c0f81578c27a97347b006366a0d437c3a33134a701121971e052faf","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-156","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":156,"source_content_sha256":"bada5f89b3e9dc6abd0abf997fced47c08af735bd777413aec3efe0307cb654d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":863,"source_line_start":861,"source_local_id":"block-156","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":156,"target_content_sha256":"18c2be9e140d526ccc67ad6c9699885a92846d28012624644fbd0d5a6f698c0d","target_edition_id":"edition.r017.id-id.draft","target_line_end":860,"target_line_start":858,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[858,860],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e9d86e87b0511f976e8de9f3b87d0182870350621c520611617899b7e005256","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-157","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":157,"source_content_sha256":"1dd9fbabf94f98c5661e064a1780df71c34230792d2d03c1e859df15004f01f2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":865,"source_line_start":865,"source_local_id":"block-157","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":157,"target_content_sha256":"3d3580e7dcb83633f022188a0ba703fbb40b1d92b155f6535bc1b2ef5abfe057","target_edition_id":"edition.r017.id-id.draft","target_line_end":862,"target_line_start":862,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[862,862],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b28c926f31c61ac19be24b2dc849cc62a2a82a03882159fac27a61dd722fe8bf","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-158","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":158,"source_content_sha256":"1aad8d2e63663266e2d622b71d6e23980003dfe34c7d5f37714d0bb788f8a670","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":870,"source_line_start":867,"source_local_id":"block-158","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":158,"target_content_sha256":"babb9e34fb5572882bc14b538841afed242bb527476b037cb39d94f5e5ce0871","target_edition_id":"edition.r017.id-id.draft","target_line_end":867,"target_line_start":864,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[864,867],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"192b4f0fd919e56ed3bd0513eb417568cbde76ac537902ebdfa425d0344b86ae","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-159","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":159,"source_content_sha256":"f4241bb2df7bc8e31d6a87a124bf1b40e2cc1e4cce595f25125257997d5b190f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":874,"source_line_start":872,"source_local_id":"block-159","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":159,"target_content_sha256":"27ba162020d8422bb2afbdf902af251b20c9a3179525c29cf126be8f5ff3e959","target_edition_id":"edition.r017.id-id.draft","target_line_end":871,"target_line_start":869,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[869,871],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fce81ba3cfa6079180e14115d66865e975393d5292098efe9f4bdce56bda6540","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-160","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":160,"source_content_sha256":"8d6716809ac6231a6026a01ed95c803b4cc4a69ed47ff6d7a32a19b3940311b1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":878,"source_line_start":876,"source_local_id":"block-160","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":160,"target_content_sha256":"1f95333e9883069142525260a2be944a9e89daca6311705b5394f49fd826db78","target_edition_id":"edition.r017.id-id.draft","target_line_end":875,"target_line_start":873,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[873,875],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3d52dc4e3a5f97645a7c3fd980c2f3d159bd66eec8e0cc6dd093efff15318ade","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-161","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":161,"source_content_sha256":"2b38e9d560779b9da7cd5ffddd3307f2c881f75a807985a9b196cf8edfc474c4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":882,"source_line_start":880,"source_local_id":"block-161","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":161,"target_content_sha256":"aadef438116710efdeb6f975c94bc705c495c23a5beeafe766922e696c9e545a","target_edition_id":"edition.r017.id-id.draft","target_line_end":879,"target_line_start":877,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[877,879],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de1577718176c9b6545bdc8f317371144f020340a7c80a5d9d69d3b26f315359","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-162","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":162,"source_content_sha256":"165fad28c0ba422c745a8e633a6ea01bbcb109be702f78584f2c314bee700a10","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":897,"source_line_start":884,"source_local_id":"block-162","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":162,"target_content_sha256":"0f12fce579ca952b086dcb4dc3901922cc4b2ce842fed77ce08ca57e59a916a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":894,"target_line_start":881,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[881,894],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"278d488f8c5e2a9be0cc801318e282a066ff594609753419e74a79b2186575d7","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-163","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":163,"source_content_sha256":"c1670ea8041ce451cf3c53f3c60b63b2030a8eea21d3863059ae04b3f1b68994","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":902,"source_line_start":900,"source_local_id":"block-163","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":163,"target_content_sha256":"49f62932838054dc0909d30e0f926a7f22325239486f99c6dda0060c146c9d49","target_edition_id":"edition.r017.id-id.draft","target_line_end":899,"target_line_start":897,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[897,899],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"15913381301a6c11530944f7c4d51eb7af3055fa933e8f4d6a486b3c9672bdbe","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-164","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":164,"source_content_sha256":"fe04ef0fbdc0db6bfca87f98bcfe01719333c2483e140cbd8ab7e137c4769751","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":906,"source_line_start":904,"source_local_id":"block-164","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":164,"target_content_sha256":"595e92f809f604be8e52ed9a84c7f18ef7164e6f255407e20eceed6a063f9fec","target_edition_id":"edition.r017.id-id.draft","target_line_end":903,"target_line_start":901,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[901,903],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b459275300a94beafed7551847292c3f48a80da158963cc84e8f66361d0cb132","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-165","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":165,"source_content_sha256":"46e6a4341ae6901c330ae97bbdc622a02e5535f60248039fc68091dc6f41bc8a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":921,"source_line_start":908,"source_local_id":"block-165","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":165,"target_content_sha256":"e2af1c10ba61181625125ac69a2ec7ccf7a5efadfe93cd6acb1dfed0c0c97321","target_edition_id":"edition.r017.id-id.draft","target_line_end":918,"target_line_start":905,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[905,918],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bdc07ed0d32b1c1dc1b68ca2b960198739157fabc78c13182ea423c60d4fbd9b","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-166","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":166,"source_content_sha256":"3a6773194e15388ae87f6c1ec6df9a3d4ccef017aef8a7309ad01d1d9b5fb2c6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":926,"source_line_start":924,"source_local_id":"block-166","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":166,"target_content_sha256":"21c5e84be8110d68dbb570e4e2c6216501281a36173d07e1ff56601ae427ab8d","target_edition_id":"edition.r017.id-id.draft","target_line_end":923,"target_line_start":921,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[921,923],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19435540412c1918c4b1ba302b88c93ee8a4f27e0954f36b556ce296003d04a2","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-167","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":167,"source_content_sha256":"f32d5de92a365a7ca84b6e2b3d2e9f31ddc90aa9878ec49d08cf0aafe8e65431","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":937,"source_line_start":928,"source_local_id":"block-167","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":167,"target_content_sha256":"4a8b459529e69da68e36b7b43ec033f6e17503d5227e37873918f9c40af03d14","target_edition_id":"edition.r017.id-id.draft","target_line_end":934,"target_line_start":925,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[925,934],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e58f98b56b45b30a43149bcb56dc252c0a5e34a738356a050f695974197801e4","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-168","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":168,"source_content_sha256":"3451057901b2be558ed4befdc9512137dc6c869274056091b090c3a1cebd9a8c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":945,"source_line_start":939,"source_local_id":"block-168","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":168,"target_content_sha256":"56b3008bd497603af1a064024b74bdc6acaddceb08651632e0e2bef6fdbba0a3","target_edition_id":"edition.r017.id-id.draft","target_line_end":942,"target_line_start":936,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[936,942],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a7590b4e355a867a535f97c8e99fb9eee9f826732b2b91417220d56cc4b51da9","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-169","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":169,"source_content_sha256":"4c2328aa57ef2d61e4e72af70b273498a63ba6ba47d74138956e1230ded0118e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":957,"source_line_start":947,"source_local_id":"block-169","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":169,"target_content_sha256":"4a15a717056e815e91dc9150d6391aaf54d89c95378998b04b08842d6aa724d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":954,"target_line_start":944,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[944,954],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c3a00b716b30488eb46bb273c7ce31c29d42ed68570a2032ecf2c0104b25a66","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-170","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":170,"source_content_sha256":"4e687a740c4821df9d17a220631134aeead3b046bf242eef0eb8714fa4c59954","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":971,"source_line_start":959,"source_local_id":"block-170","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":170,"target_content_sha256":"8b1e505b4e6dc6bfa68aabed37b34ef6917d1be08f42df6b0f7f4d650f23ff14","target_edition_id":"edition.r017.id-id.draft","target_line_end":968,"target_line_start":956,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[956,968],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a9956c8124fe2e45b59f29eafe61c01899bc30e88bf3cf65b8761024aed45798","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-171","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":171,"source_content_sha256":"333df332c900b327b3482a99840bdc638d7f5027ef7325c3994eacaa40422ff3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":979,"source_line_start":973,"source_local_id":"block-171","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":171,"target_content_sha256":"58da44a809705c984bd6906f6eb8a3a1cbb2ba2ffa68c60e3f8384d2de7c2c8c","target_edition_id":"edition.r017.id-id.draft","target_line_end":976,"target_line_start":970,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[970,976],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3257c1256053da6a2dea9baf69901052d8fa3dcd95e6304224e29194de55da7e","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-172","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":172,"source_content_sha256":"c8e278add1d6c18f659152466edf4e82568ebad5aaddedeaeb2d654335866d4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":981,"source_line_start":981,"source_local_id":"block-172","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":172,"target_content_sha256":"5a7c51fe019c052d866e25f75541baf5ff511cb9d0d48737b288dcbb3fd56de0","target_edition_id":"edition.r017.id-id.draft","target_line_end":978,"target_line_start":978,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[978,978],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3359a3af8274f314c39b0fa37282a86ae3f7030c67b33b4ba8b4b8e663917325","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-173","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":173,"source_content_sha256":"aab0b042a2519570ff5cdca3c6e09fee14978942da9636ebabe031ce1f968ac2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":985,"source_line_start":983,"source_local_id":"block-173","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":173,"target_content_sha256":"8f39f9f2bf7e56f0ed2590b02871535512ec6ab7c7c8747c63a2c9c5a977b999","target_edition_id":"edition.r017.id-id.draft","target_line_end":982,"target_line_start":980,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[980,982],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39903d347e7e1b9df1e865eca066ab4e5d48776a4e3d4ab302c6f3510c10415a","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-174","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":174,"source_content_sha256":"6383594e069f6576fb57ef9924a80db2f09f826a33d5dce97cb1a6cfd6f3ce08","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":995,"source_line_start":987,"source_local_id":"block-174","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":174,"target_content_sha256":"4aaf960dd0b5577c0507d88c458c498069fcbdd121964af7f33f084c02c5064f","target_edition_id":"edition.r017.id-id.draft","target_line_end":992,"target_line_start":984,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[984,992],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"047cbf69092f2c2aa89cfe95ae874d3b7df5d3e37ff99ee15e9d53476305668c","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-175","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":175,"source_content_sha256":"9e6f456dd57b4dca6d5b4c7c15dfffe075cb52422a90a48b4d965a4aa84f5681","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":998,"source_line_start":997,"source_local_id":"block-175","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":175,"target_content_sha256":"6d948ce6ce47fbc8fbdc1b43c3e89c1f19660cd39bddffc581bfc271a60b8e4f","target_edition_id":"edition.r017.id-id.draft","target_line_end":995,"target_line_start":994,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[994,995],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6227f02bf4596abe197e3c59f579952f4d98effb9f51b036721ae672509cab32","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-176","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":176,"source_content_sha256":"9909c84d815590ec07b525bb6ed5c11df6ffd2dd054af211bbaa1bb7feded3cd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1002,"source_line_start":1000,"source_local_id":"block-176","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":176,"target_content_sha256":"f32ac39d19a31d2dad75fcc3efc36618f27888d9a4b6c80a613f2c742ba2b937","target_edition_id":"edition.r017.id-id.draft","target_line_end":999,"target_line_start":997,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[997,999],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"343549918ea2c7b311715fbb988a997748c7e987bbe02e7f87b35083fea664e4","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-177","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":177,"source_content_sha256":"ba112060e5f8ddccc81f1dec1f05bd23394b1f873973530070f790b5937247b2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1015,"source_line_start":1004,"source_local_id":"block-177","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":177,"target_content_sha256":"8a343e9f1a1d482f1387836b96b53cdf210bc78e96424b303d3b3a3470feb898","target_edition_id":"edition.r017.id-id.draft","target_line_end":1012,"target_line_start":1001,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1001,1012],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6de6cf2f88c994fd25390a3b73ebd6ffd9aa6caf0b88a54233c7954f9a03e7c9","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-178","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":178,"source_content_sha256":"4be7db13a50a6cf69022429255b203425a63979cca3cb7d03e8476641e361703","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1017,"source_line_start":1017,"source_local_id":"block-178","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":178,"target_content_sha256":"7c4176f9ca89c18c50f3aacc3b3a978ec2d874e6385a52e4b13e5c4d0a343459","target_edition_id":"edition.r017.id-id.draft","target_line_end":1014,"target_line_start":1014,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1014,1014],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f6dd923c568af242fb65642f21305f0dfdb166eaee1679e750ec0867939c01cb","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-179","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":179,"source_content_sha256":"563375f96b3ffc55643ced52f96dc9e218d24c642faac9fa52e19e5487ddadb5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1028,"source_line_start":1019,"source_local_id":"block-179","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":179,"target_content_sha256":"e16311f9ba0ef329412692b65ab53b3684c7b4a15fd3f40cd40d15275d5edc3e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1025,"target_line_start":1016,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1016,1025],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"853bf48b8df25ddc694e419fbfe0e3d008505e10629963b27ef00b26443d3957","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-180","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":180,"source_content_sha256":"070c82f595a58c404017d08d60ef7ee4b27c5877e128e391ddb9e2145cbe6910","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1030,"source_line_start":1030,"source_local_id":"block-180","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":180,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1027,"target_line_start":1027,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1027,1027],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef94a89096d1bca3c6ec0b91d29b11ae2c5408bc357d197c48499dc2b88f8974","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-181","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":181,"source_content_sha256":"7b6fbc15d94a9b11dd52a0d226728a620e2d4834115a9f005f738207072cecec","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1042,"source_line_start":1032,"source_local_id":"block-181","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":181,"target_content_sha256":"7ee66405fe59e82f80b82a48f8de9e5caa80a8c06ca82bdcbbd03ec2fbefbf79","target_edition_id":"edition.r017.id-id.draft","target_line_end":1039,"target_line_start":1029,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1029,1039],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"44f34fac0e480fd2f98f7ceb766fed7b47db7dbcd0e41eed3ad74780f4240822","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-182","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":182,"source_content_sha256":"553e6685fcd1c78e8cafb4267dedecfd9e3bced2550cb8f404bc26cbf1f0df8c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1048,"source_line_start":1044,"source_local_id":"block-182","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":182,"target_content_sha256":"7d175aa5ed98139f221e0ef0adcf8bc54b22e3b6372324fffc17020685d79d5a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1045,"target_line_start":1041,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1041,1045],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e58cc4c9624007c5f52b78edea2956a37ca862d6edefac1a5c476932590d3715","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-183","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":183,"source_content_sha256":"fc140080decf9cb7eea77490f1f9c481dbf9e41a1531b0b38ae8d4f7e4a7d329","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1059,"source_line_start":1050,"source_local_id":"block-183","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":183,"target_content_sha256":"512e5ecc0055e687514eea4a8cd536635c0b92b5cf95029e082a435fee8b2364","target_edition_id":"edition.r017.id-id.draft","target_line_end":1056,"target_line_start":1047,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1047,1056],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76d06081e2595be119248c165d30d92cc3aaa8c8da173170c8c313b59c8c273f","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-184","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":184,"source_content_sha256":"52d199d862ac8da905bee799e840e971572e342bbaac85962dddea49859dba63","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1071,"source_line_start":1061,"source_local_id":"block-184","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":184,"target_content_sha256":"124cfe585bbfc35d58f94503972e9005536241aea9aebf44b043d10e9c9b39f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1068,"target_line_start":1058,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1058,1068],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9fa33dcda5c7f61cc55344c8ded15a3fafc81292b1f27f282fc6dde24776f5a6","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-185","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":185,"source_content_sha256":"ffa555641e63b6a3eea722be88a03b34c29a294e993dd7eaa3666ed417a4e5bf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1083,"source_line_start":1073,"source_local_id":"block-185","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":185,"target_content_sha256":"923c541a85ec0a81ac8ca30dc3ce969c07db300e989d592b53a6beb2675dcb58","target_edition_id":"edition.r017.id-id.draft","target_line_end":1080,"target_line_start":1070,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1070,1080],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"156f6857649472f676111a471a7c384a463b3f89c56b09be14d084947bd27229","concept_ids":[],"id":"segment.r017.book1.ch02.text.block-186","locale":"mul","parent_id":"unit.r017.book1.ch02.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":186,"source_content_sha256":"c39f533a56f9e7a2191b2dc4e2e25e0373eebae469313ec462bebcca26ba62a2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1087,"source_line_start":1085,"source_local_id":"block-186","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":186,"target_content_sha256":"db3b0edb23b94adc7ba6a8bbb6cdb6b685a5e443e77f2570c7f9c3d998bebd9c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1086,"target_line_start":1082,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch02.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1082,1086],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-linear-programming.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f16de9aef1b4ae41269b7dca8b4d6804260e0cf2fcd3e844b25fc3fca65c3d14","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-001","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":1,"source_content_sha256":"58b3f843106c844c9c314319f198e22eb0490d7a158406cd628c7db2f56d64d7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"58b3f843106c844c9c314319f198e22eb0490d7a158406cd628c7db2f56d64d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":1,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,3],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2aac8468071fbc292837a8d14b2a9693576870c9d39d28a26d7ad5d669c3a49a","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-002","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":2,"source_content_sha256":"09b0c1a2a0e2e0b7f0921381fe68a515094c1815a7d0ad4eeb44c6d91e2b2429","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":7,"source_line_start":5,"source_local_id":"block-002","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"09b0c1a2a0e2e0b7f0921381fe68a515094c1815a7d0ad4eeb44c6d91e2b2429","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":5,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[5,7],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f1f002f8b1ff660fb1eb5e0f51f321b03842265ac524bdd1e006b88a38afa2fa","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-003","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":3,"source_content_sha256":"9b267f01d89a85f6b3bd7b7ba58d935b2a2f85801660093f5f2b2b8ba598fcfd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":10,"source_line_start":9,"source_local_id":"block-003","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"0e427d326b4f4767abd3a669f27db712992e303c825e17f3e7fff0f260b89036","target_edition_id":"edition.r017.id-id.draft","target_line_end":10,"target_line_start":9,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[9,10],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b1072d9144e19a4f874188e64afb89cecbc791bae9951c895b35240639c191c","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-004","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":4,"source_content_sha256":"7c59e4aef1c74c7db22cdb179b8a18a8e271cad1f2144b3eec04c5ccd73e59c8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":14,"source_line_start":12,"source_local_id":"block-004","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"359582d41f9d2f56ebdeb95c731716fe3591ed223bf5423ef76cee173e8fe328","target_edition_id":"edition.r017.id-id.draft","target_line_end":14,"target_line_start":12,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[12,14],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4269dabafa53ada075706433c7b75aefb8e9e9c5aad720868f67ed4343c6d9dd","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-005","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":5,"source_content_sha256":"5432e54f0d459bdb49cb50dd975255af0a05f16dd77138eefc49440c0c2a5f84","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":21,"source_line_start":16,"source_local_id":"block-005","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"a8c42890ae593cecd214f73e1ec859f8f7eb8e6d9fbe2b971d21f3f2f89be2d1","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":16,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[16,21],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c0009217e084808e65050bc151567e7a8ce1e385ce9b43d11066ff52603e6f6e","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-006","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":6,"source_content_sha256":"3b4de94fc55bbdc56c70252a8961cc0ba380c35d5d1d69d303f3c9040cd7b6ab","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":27,"source_line_start":23,"source_local_id":"block-006","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"2e3f3d51e638b6bbbb450f1d41d1c8265b6dc362018285d7ea5956795ce4008f","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":23,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[23,27],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce82d31f4f1f3e9aa9ef226fff1e1e33209597024ced2973576d70a5ae5daa3e","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-007","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":7,"source_content_sha256":"00c2c65face06bc5823467376499496005c40210156c7476c9bf1b1c7204aa3a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":47,"source_line_start":29,"source_local_id":"block-007","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"ca7fe3461339ef87f2d014334cfcf2d586036402e5dc1d593e8639b35cbae0c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":29,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[29,47],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a838e9bd35577f9258fbc93935c7a231fb848ba9508350f5d725330f9349c443","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-008","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":8,"source_content_sha256":"a5d223f9ffa363f8c64c6bb5f01868d6269671bd84eee584263b5c22b9282574","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":49,"source_local_id":"block-008","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"a5d223f9ffa363f8c64c6bb5f01868d6269671bd84eee584263b5c22b9282574","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":49,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[49,49],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"49a6516440e63a1ffd5165f2e6a8b5e3ee02b273a8fe2168717c091b5c923406","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-009","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":9,"source_content_sha256":"f423bbc45c610b7b3ebad6d9b2e37b90c3a1d1d70d8eb5229d090f9f6a200b14","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":69,"source_line_start":51,"source_local_id":"block-009","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"f423bbc45c610b7b3ebad6d9b2e37b90c3a1d1d70d8eb5229d090f9f6a200b14","target_edition_id":"edition.r017.id-id.draft","target_line_end":69,"target_line_start":51,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[51,69],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"980d0cb2d6bbadc33be91a9d886a7b2215d658a33f3fcd28477b58147c7f6a16","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-010","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":10,"source_content_sha256":"a232f7726b2b4006f3ae84413f6a43bf4494cce73831b3a0df2dad4aa9eab3ad","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":73,"source_line_start":71,"source_local_id":"block-010","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"a232f7726b2b4006f3ae84413f6a43bf4494cce73831b3a0df2dad4aa9eab3ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":73,"target_line_start":71,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[71,73],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6c7568f8637608b02a126629a5d09a948308e59834e35055b687ee06a8df4d74","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-011","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":11,"source_content_sha256":"57a1d0ed6044463e9d2ea3befcd29808dfc4d81a62ec3719e7dfc9311e4e663c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":79,"source_line_start":75,"source_local_id":"block-011","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"57a1d0ed6044463e9d2ea3befcd29808dfc4d81a62ec3719e7dfc9311e4e663c","target_edition_id":"edition.r017.id-id.draft","target_line_end":79,"target_line_start":75,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[75,79],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"99e78eeda852242dc38f4afa285ec6420471ca65dbf1f92be5bfdfb1f4cf664a","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-012","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":12,"source_content_sha256":"d8e96745c38b39f2b18ceb5649780b736160369faec4c344af027b4e5fb722ad","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":138,"source_line_start":81,"source_local_id":"block-012","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"bd6ec68b3bcf52d16ad8322b1abcf881bf492890addc2dc77df51df97b95f5b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":138,"target_line_start":81,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[81,138],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1fc188912cce27ec7f67dd1e007cea94ba8e5feef5e26233879aeb4f58d07e82","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-013","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":13,"source_content_sha256":"66a42ab5add98cdd9aa2d07e6cb4f952623452bf51ede3fe072ba489a9916758","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":160,"source_line_start":140,"source_local_id":"block-013","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"ca175434fb49f178f87475e55fdfa50b3a9ed56b5357dff7d509440a4f4a387c","target_edition_id":"edition.r017.id-id.draft","target_line_end":160,"target_line_start":140,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[140,160],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7663702a1a54aea8361a250e8fe783bbde55b4c22032e3e6bc1986fee5d7c4ce","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-014","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":14,"source_content_sha256":"4bf4493718b7a7554a97553ec60c98db0758da7e72aecbe4518d76452f5bee98","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":182,"source_line_start":162,"source_local_id":"block-014","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"d346d8750de3450435f2efc9e2ac2a6c82e186064144e2c38bd25cabad6cf604","target_edition_id":"edition.r017.id-id.draft","target_line_end":182,"target_line_start":162,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[162,182],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f174c770e20c1768d24658ecbfb1a082474a133b1ce55f1da644bbbb6fe638f","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-015","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":15,"source_content_sha256":"4efe0b7cd5dfb057bcc78b0a168c49a6500a6dcb9a9bcd5dc198b28b6709f193","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":218,"source_line_start":184,"source_local_id":"block-015","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"1b21c274c62ab2d6a51bc3f5779daffdf774fdfb11e042a86eecc3199b29c3fe","target_edition_id":"edition.r017.id-id.draft","target_line_end":218,"target_line_start":184,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[184,218],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a24cb6c8d0acd8e95ac5f2146559185255f42531094b2efbfa4c841ecd3f397","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-016","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":16,"source_content_sha256":"b3897e2c20457206d4532c6a7d1301167a83c3a4f69724105670cee1f0e6dac1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":234,"source_line_start":220,"source_local_id":"block-016","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"575d8596a9abd3a8a7907c2389ac3311eeba47dd8e9089b5e5281a0852553f9c","target_edition_id":"edition.r017.id-id.draft","target_line_end":234,"target_line_start":220,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[220,234],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3578d7202e83d517b386ac704cce2de28155785d13b135d2a79ef2efc97ee170","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-017","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":17,"source_content_sha256":"31b1de82f1c17cb49a52a5c0cafa7e2dc90c7763dff9a1e074d574c40be4e6a0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":291,"source_line_start":236,"source_local_id":"block-017","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"12b5b2786dd20ee8f8000b91e53a81f3ad396cea343e2531a6d21c42448c505a","target_edition_id":"edition.r017.id-id.draft","target_line_end":291,"target_line_start":236,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[236,291],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20e1132c60fb71a7a84d3f12a3796194c22065de20c952c2353797cf9ab9e0f3","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-018","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":18,"source_content_sha256":"972aba15f67bd51c8f7feca52225534b49b334b76b194042fa22cee1ffa7f050","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":308,"source_line_start":293,"source_local_id":"block-018","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"aa2d64562166cf8aec002a7855e7cac24495d5a2935f8e88134ddcf99858e4de","target_edition_id":"edition.r017.id-id.draft","target_line_end":308,"target_line_start":293,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[293,308],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b00864255aa9e43af9d7ed78c42405e1bbbb67f9c8dd2c3449ed5c703219b504","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-019","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":19,"source_content_sha256":"7ef7982e9302fb8b864feef89c8cb2ccdb9c6923cf4a2fd9ca6363a2443b99e2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":365,"source_line_start":310,"source_local_id":"block-019","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"607cfa71362c54d4143894fd35ee58f5d387a60454b8f14568fe2ba2311fcbf7","target_edition_id":"edition.r017.id-id.draft","target_line_end":365,"target_line_start":310,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[310,365],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"183e99ccb2b90864fbbbba2aebe39abd737070940fbcd9b3770ad320c58b4d9c","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-020","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":20,"source_content_sha256":"9f6bbe180ce5ed03e6936f91b97a518e85c74a5c74714475d53375f623023ae6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":443,"source_line_start":367,"source_local_id":"block-020","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"8f5f597e7c74f08012ab8d78f89763dc167d146c17a5f0fe83bcd0d228afc7c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":443,"target_line_start":367,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[367,443],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aead7f0fbc012702f68130f611306eb58198e5f2c2078867038cf1ca3f19f25b","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-021","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":21,"source_content_sha256":"d14714ca9684701c1d0490b94fa7de2d53733082ec0cadad744397c550d10ab5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":505,"source_line_start":445,"source_local_id":"block-021","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"f59b9059ece4fa4f875553d6d423c26398300f8a033d625fc52bdef735724492","target_edition_id":"edition.r017.id-id.draft","target_line_end":505,"target_line_start":445,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[445,505],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b8f3f71813c8f2ae8221f1f8e57fb559deebb0b23b2651205a18aa432483becd","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-022","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":22,"source_content_sha256":"8bb6e23152d61d047bebdbc76c823e6f50a9be3a962de51ea89d0dcc4c2f8dd9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":522,"source_line_start":507,"source_local_id":"block-022","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"8bb6e23152d61d047bebdbc76c823e6f50a9be3a962de51ea89d0dcc4c2f8dd9","target_edition_id":"edition.r017.id-id.draft","target_line_end":522,"target_line_start":507,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[507,522],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"12a6983ed52d2cb94e9cf96d1470c1df1bc2ff260fcdf1125ccf42532464b05b","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-023","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":23,"source_content_sha256":"76b1dbb7e8bb266a905ab0268267bd8ab88481764c73ef886e91545cf437213e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":547,"source_line_start":524,"source_local_id":"block-023","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"293f7b3167e58a0ca52d838ec0ea35c620aa60cd3472323194ea716e89c5d532","target_edition_id":"edition.r017.id-id.draft","target_line_end":547,"target_line_start":524,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[524,547],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f402484df209b248eeb454cb77f1a44d29fcaffecd8a8198a953bd81046a2a1c","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-024","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":24,"source_content_sha256":"d1c273a4a623ee22fcb5a31eec794bc7c3ffa2c4b23d98b2450595812daeddb4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":558,"source_line_start":549,"source_local_id":"block-024","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"1e4513b98edade7d037458ab33cd6f102bedb1760194d43677b4083ac91918a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":558,"target_line_start":549,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[549,558],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa92458b2675754713fb19e43befa90be6d3f0930369550b02931fb9213b5055","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-025","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":25,"source_content_sha256":"59c699b311a7ca78f471a44f9f8dec368a051ebba0bb7cb2df61bcef3a59ba2b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":609,"source_line_start":560,"source_local_id":"block-025","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"6f511f80933992bb488331987bfa885e8d1517a86074eeb8c3f02b768010d4dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":609,"target_line_start":560,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[560,609],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7528db4f90ac03a4a8fe3829086834cd3df226728a5f4e38f08a8f2472914c5b","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-026","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":26,"source_content_sha256":"b9c1ff1ffa032c1a491cf9351b17e898d0e584d9619fb537eea683cfa4492709","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":660,"source_line_start":611,"source_local_id":"block-026","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"afc5dc66bb1c3c58c6ff999b13ffbefe9095131c5fc935d0c65cda29199c9499","target_edition_id":"edition.r017.id-id.draft","target_line_end":660,"target_line_start":611,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[611,660],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b2cc1897b76fcd37c037c4829115284f8cac6a0cfa04c9e4e488d07c3963c6d3","concept_ids":[],"id":"segment.r017.book1.ch03.interactive.block-027","locale":"mul","parent_id":"unit.r017.book1.ch03.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":27,"source_content_sha256":"23ee6ca1b81542378ff4fa49547bbe9e895a2951a6a980dcc0de6953396b9eb5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":665,"source_line_start":662,"source_local_id":"block-027","source_locale":"en","source_path":"visualizations/source/excel_solver_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"23ee6ca1b81542378ff4fa49547bbe9e895a2951a6a980dcc0de6953396b9eb5","target_edition_id":"edition.r017.id-id.draft","target_line_end":665,"target_line_start":662,"target_locale":"id-ID","target_path":"visualizations/source/excel_solver_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch03.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[662,665],"member":"source/visualizations/source/excel_solver_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5a4fdf203bdad71b69d19bfec41535dc640d851eb4069ee07112bfcc8e08e08f","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-001","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"517bd01ed7731bdaa89f0802ca8643b8da65930863fce39c6ae7efea896d4e91","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":6,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"0260ce55195f9048b9f269ed736ffd3bc99d816a97edd6395a4419437c40a044","target_edition_id":"edition.r017.id-id.draft","target_line_end":6,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,6],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e0ad45ed9b353f10ea245dc0ffc651dd66c128b5b7a9a6ba35ee498f7025f08","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-002","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"46a4528058764f54b2f4c25919605ac8ea6cb0d318850b6e6d94ef8f92a9bc8f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":8,"source_line_start":8,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"5e0cb831dbdd56fedead1c5ecfe4e26e515ea6fccfed6c743d79dee1cbf7e59c","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":8,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[8,8],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e743b84135597b90b4f9c8453b65a0d1d64c7005647b12d126324143eca56a2","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-003","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"bffde90f67148dfe3cdf741d4383fbb466f70a43df8a7791ab15028516cada67","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":11,"source_line_start":10,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"59e0d50e4cef5d128ebe2806fb1acea045dc563b33d035f7fc87cf3a913255d1","target_edition_id":"edition.r017.id-id.draft","target_line_end":11,"target_line_start":10,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[10,11],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c56670da7f313d45a55b7000263f125c338546cf76d8bc73515f44d00ae6c9b","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-004","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"e26660c71b4eaa90b9ffbc06625e30bba11d7eb8f29b1df2ee551aaec486fc29","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":20,"source_line_start":13,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"e4bd764152b66be574ac070a4f8f305f871496c286f3efe77ebc03888c52e90f","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":13,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[13,20],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"17afa7663fe82f43cca513004ffbe75b7a351e14098d746f3477c68800dc7a17","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-005","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"249d576fa4f16ec415f4f53d5cb2f553dd53832d0853e8a27299833692938a49","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":22,"source_line_start":22,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"142fe62b461ea0a748e9c10ca9093d268eb7fea6bf6095d1dfeb4fe85d565903","target_edition_id":"edition.r017.id-id.draft","target_line_end":22,"target_line_start":22,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[22,22],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0b26a6387f3684ed048eb64296f1879296866205d4784689321f2fa708af333d","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-006","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"c91fa3a49488730cde3ace559bcba4e2f199be4bf68a0f91c50fc0e72f776f7f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":24,"source_line_start":24,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"9ab912b731fbe9ed804b0ab9f9890827b4b39850d7a985aee90e9e9740e0d040","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":24,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[24,24],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b87cf022faa96097503fdf527ff1b3b0c4fd51af44c1e60c8d4a146426229f3b","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-007","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"bf22804583e479650223133ba54795f1137644228acdd5ea77409401a3cd7592","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":27,"source_line_start":26,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"4be55342699e34508538963e90a8f4d6c3f1c833082312871fa6a76504cd7816","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":26,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[26,27],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"977b9ec59b1923ff05120326db0aa07099949b8ae08baffa9f6473db053ca45b","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-008","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"9465e1ef4a1063483907591060a6fda9020429e84277a2e7fa0225b6b42be556","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":33,"source_line_start":29,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"31df7e5945b801a81acbc8aa106df0f193b1eb09cc8e944f4607fe85a80ce756","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":29,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[29,33],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ea907408e0b98477a18cf7dd99370ba94a4ff9738e635139c02894f0962cf58e","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-009","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"42c68e95e62f7853ef479f12b9d288783c7d9093a641a0db7dc5acfe117ca9cf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":35,"source_line_start":35,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"b8195d0426acb39b0f775b775a66be929bf6ad9369f9f82830f324bec0064c25","target_edition_id":"edition.r017.id-id.draft","target_line_end":35,"target_line_start":35,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[35,35],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"802f1ff380f07fc2b75a27d33d7be9285d58b91f5caa005acb7fe5f8a8f6cea2","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-010","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"84b5d35b46eb265efcfab50b714dd7b0c80f7411e6dad2b7e6f89f3fd71f4734","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":38,"source_line_start":37,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"1dae456c9b112562deda2eceda94a0dbd3d9bf96ac3b365f3416ab854898bbdf","target_edition_id":"edition.r017.id-id.draft","target_line_end":38,"target_line_start":37,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[37,38],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c937265673e35fef90d8f2ff49c00a2b5bb49a54ac8e2018400b98934b62add1","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-011","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"6e45e55ee243fe5fbc9f5e25a6fde5f20938eaf5d08a89ebb153252fb53ef101","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":40,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"bc8131445e72e4189ae0fb24c394616fd900d8d69e26fcf2b0b9e417a025b798","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":40,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[40,49],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a30baf42c6008638c97e92533db8604605a7b9216ba9b5aea2a9987621c3c51","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-012","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"51e21cbbdc6873af16cfe3c626744231239657280d6d9b50645eb7c384365b5a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":55,"source_line_start":51,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"89d43062f035c450e7db0e2024eabf45a4562fa76e19be8a203bfe1aa0b6831c","target_edition_id":"edition.r017.id-id.draft","target_line_end":55,"target_line_start":51,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[51,55],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"55090e6fb170f121b230549ff9df16e52c6135d13afd0a4f20e53aa421659c4f","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-013","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"0a6c549c0d23d3acef484f8bb20dd392f8e6b20bda7e5293ee77d21c3d002d28","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":63,"source_line_start":57,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"16faa6dfe2c37e9266661269ff83f2167703b091d5013eb19c63da59911967d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":63,"target_line_start":57,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[57,63],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"49807301f7eb2fc04da15fb68b92e96099ef55099c452a6d2bc2e70961a7e724","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-014","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"ee8aa1a6ea62a6a03edc9fb0bfe1f1fca576b4d4bbabb33d6bd5114045833797","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":66,"source_line_start":65,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"55405b3578755f887af5bdf0badebdc9ed449150d05f220731fd1a2467ae49fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":66,"target_line_start":65,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[65,66],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d828534bd031fdd637837b1233c5dc362c4c3268b8719ea74d419d6bd8a81aa","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-015","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"a7ca1e37a22d64df4bf735b562f72cf77b5a307b6c53f91a53c0651ea81e81ea","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":74,"source_line_start":68,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"64ee4ad3023118c441f83ffbbb6faf68d5467b0c2fb6cf3a4a638b58ff582a43","target_edition_id":"edition.r017.id-id.draft","target_line_end":74,"target_line_start":68,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[68,74],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0c4bd633d06318da61af65c4f279891cf525929dbf86561a9763135b7663056","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-016","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"5de076920ad19725be93a77e1884c9a42d70972ce4aefd173ad8294760da0d93","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":76,"source_line_start":76,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"eac052a8d2f394ea17cee4d82980ccd0dfb9d80df4ea747f78f97b770a5bd207","target_edition_id":"edition.r017.id-id.draft","target_line_end":76,"target_line_start":76,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[76,76],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6f626291684a2703861d68c9263c225a6def2b8ddaac618fa5f066c3993dd14e","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-017","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"d566d0085b7639732bb8c3360a043c84c0c23417832b1c8a00f8b77674ca8d7f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":78,"source_line_start":78,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"bdbedd78771d943e61327b6ae3d2d0839319efbc9d30316a9cab51d5f928bf6a","target_edition_id":"edition.r017.id-id.draft","target_line_end":78,"target_line_start":78,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[78,78],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a1ff3b9faca33bf2dab23ecad31fc4042b6109add8b4f57c8b761afb2bd45851","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-018","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"a6160fe7a5ae2ad8df6703d67d1ec8a2570a112e695aea498775b9791b4d0edd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":80,"source_line_start":80,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"4edab531ec5d27b06b0b175b941f53b4c76536fa96329f53ed59727d81feffff","target_edition_id":"edition.r017.id-id.draft","target_line_end":80,"target_line_start":80,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[80,80],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"79915f5ffac628916b005150849eb64ecaa95e8e7b32516901e81b98ae5ec866","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-019","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"97d54447e62127c476a5067659cd6b6a4975ac3c205a2e8a4d672731ad4a030b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":83,"source_line_start":82,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"f7e2dcdfbf6e44a74da3b31d75c31133d6d49d779cb6f900f0c841b4f61d7d7b","target_edition_id":"edition.r017.id-id.draft","target_line_end":83,"target_line_start":82,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[82,83],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f037bf08cc6795fd8101f70eb363666f8b326c69a707181582c511d5fceb291","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-020","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"bbf323a08813a0116684070f3f38468b24de20d84a59fc2f0334a1730eda2764","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":92,"source_line_start":85,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"d19af91c76eb05e8ff7aa1482cfc22aa2d9bb0d8eede320ab4940474ed6e4fdb","target_edition_id":"edition.r017.id-id.draft","target_line_end":92,"target_line_start":85,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[85,92],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a7196541ac99964b6f3eeb4e23e9e5b1b8f7eaf0fefa4d96585cea216853bb44","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-021","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"00ac82959830d9bd4c98da2813128f4e93ddea1a363c59d5544f5d880cda29fd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":98,"source_line_start":94,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"b38af6c30a819eae879f42d0de5c8cc7c4707a04f0d245ad5dfa30a800c6e445","target_edition_id":"edition.r017.id-id.draft","target_line_end":98,"target_line_start":94,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[94,98],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"157f71647434df8ea46650ff0b41bcccb8cce17ffb199f1f8b754e385a232ee0","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-022","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"951f4e2aca0f3fdcd56d5434ea3a2cf184aa7bed4f01c65ec11d989e2dc52dde","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":101,"source_line_start":100,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"fcd99d446b9b547b75afd4801537854102d3a7c815a46a726da91d3ac500b4cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":101,"target_line_start":100,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[100,101],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c92c41fbfc38717594eeabeb1978b39e87a8794c00377fcf356a1403bf4d3647","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-023","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"728d9601a139b69012286bfd00cc72292c4c85518bee891c34b7863420028e12","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":109,"source_line_start":103,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"a540d48e9e541ff2dc495fd65f5f80512063b1f17524eec89a7bf602c6ffb502","target_edition_id":"edition.r017.id-id.draft","target_line_end":109,"target_line_start":103,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[103,109],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8909c20cd8cccc2ca2a37459826f4a24d3eb4d70d103e44b0c5419b12b406f2a","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-024","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"c4868171ca42fe7d317e941cb7bec310ae3c19dd0393ef882e2b8600aa111907","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":111,"source_line_start":111,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"88378f9c3e3861c41caaba08efddde741dc1708d4c444f713cd780671c6df36b","target_edition_id":"edition.r017.id-id.draft","target_line_end":111,"target_line_start":111,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[111,111],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6c7dd9d004ae77b8494bc6afc29d492449655963e44ff877ffb0d8d193e2861a","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-025","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"eb8176990743cbd887a32acb7e06c978f69fd3ebafde69be0ed8b8df32d3e2c7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":113,"source_line_start":113,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"9be0d9dc389059dbc54d8040332d787b39c6a3d995d7272444eda309ea54f650","target_edition_id":"edition.r017.id-id.draft","target_line_end":113,"target_line_start":113,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[113,113],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4fcadfb18d60eccba4ab873dbc3c879d12b8045deed88a34a81de26c5ca7253b","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-026","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"be4eda13a84117d55c8fcabd0360c2dab60fb0e442da37631896286b66427e7e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":115,"source_line_start":115,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"3e1e266fbf3f71d2e81a1a0de65f604c03f1a5133c03a3fab275855ca43a6a4b","target_edition_id":"edition.r017.id-id.draft","target_line_end":115,"target_line_start":115,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[115,115],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2d6748a67c053bc2c388e2a69ea8e1f2bc714d6fa1309a25c70d44b027e6573","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-027","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"c43e8adc6bb8f5c7ecd1de8f826884285366abbda927fbb07c38e0368225e79d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":117,"source_line_start":117,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"e344d175fdd68f650041972e50f282eaffbbbda7321c486bba01aada7decb963","target_edition_id":"edition.r017.id-id.draft","target_line_end":117,"target_line_start":117,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[117,117],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c5c76068ced443f0512f51dcaf27cae06f70c8cd6cf7456740443c115ce185c","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-028","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"c607e755e16e930259bf06fbece701a6b00ccaca7a4fa510a3ae4bd574f5079d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":120,"source_line_start":119,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"81dd36e87988205a7e09d908a0edbc507666b30b542ac011ab257e28a7f6e9eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":120,"target_line_start":119,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[119,120],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3caa828e36a4e4b2df72aa5110c796fbb37fd9d41624eb0e8bac2740e0b18dc4","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-029","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"7de5c97bb69874bc9e23cc7f83e79328d8673241f4fc4d0d27947da59fd3d6d7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":132,"source_line_start":122,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"7726c71a7cdaa5736005076bfae6ed92d8005433a50a12b320d6c895704e45cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":132,"target_line_start":122,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[122,132],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fcb07f4a52571ced9231212acd950c368c5476ddf436a5ad3c59c84566d81416","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-030","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"07b9438bfaf98ba47730dfd7e684fd7309abb444a84d4191aa2baeaf6fd679df","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":134,"source_line_start":134,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"9039513b6a71ca8db2836e4a42f3f88863edce20ccda497a9d69d5037fa85562","target_edition_id":"edition.r017.id-id.draft","target_line_end":134,"target_line_start":134,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[134,134],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"496e2cbd6c970d3340aeff7e81fa79adca5bdd0f0f3c21f1ea1696c798dd842b","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-031","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"d41e66f8302e4ef1b75fafd272f3b43cf6b2215fb6c2f30528bdd11f242f1fce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":136,"source_line_start":136,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"7e0141493ed905c252e7eab5eb3f32b7655d754f16d3340c84021affe1add5e4","target_edition_id":"edition.r017.id-id.draft","target_line_end":136,"target_line_start":136,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[136,136],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b5cb04e15841e447225bbd7026b8c2e3f5c85d3a1a2ab7b3da88b119e1548b2","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-032","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"af5f1965efaa5da610d4a3aa062a9587840d930d5dcbaf7d11009e36f362ded6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":139,"source_line_start":138,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"af5f1965efaa5da610d4a3aa062a9587840d930d5dcbaf7d11009e36f362ded6","target_edition_id":"edition.r017.id-id.draft","target_line_end":139,"target_line_start":138,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[138,139],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bd195f450da30ee4a50d5721e5fd67ce75c05751808dec5ef0b9f6b18a19f7bf","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-033","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"d097922a5e647ba29c601b9ccf143a8cf4f1bdec97fca8539a2af5e3f3000e27","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":141,"source_line_start":141,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"ed13a97cfc6faa223498df556631a7d1a65238520bf987ef0d75522a9d50becb","target_edition_id":"edition.r017.id-id.draft","target_line_end":141,"target_line_start":141,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[141,141],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd56c82beecf59f3bd39de3d8974e820ca77d73186a4debf5718deac43e9500f","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-034","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"5a195805de925cbc31647419f153cc8f2888a1661f86375f8f78ee90fcbfb509","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":143,"source_line_start":143,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"88ee59cb229ac1c4f809cace57dadc8054a9b567d52d99e4cf866e176bfe6a0d","target_edition_id":"edition.r017.id-id.draft","target_line_end":143,"target_line_start":143,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[143,143],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0322414e752fc196cb54f1fd4df722c370a8cdccceb6766a69602a7915e7f5c0","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-035","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"5ca0c32c984c5c57ce0f15a62030d6a0c95a62b92ea13a4811727796dfb29fa5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":145,"source_line_start":145,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"e8a458f1d62829e1eddb186e7fa58ce7f39c9d60ecb1a145f7e498f7640dfded","target_edition_id":"edition.r017.id-id.draft","target_line_end":145,"target_line_start":145,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[145,145],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2b006b88f992f5b896a01119c636466c8143159e58052f32fc084e162cd0486e","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-036","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"898a69b8558d90bdc3e41befd9b30c99657a1f4840e1ac08ea30a54ce34c4f30","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":147,"source_line_start":147,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"0893adc43bcb1d4217b99c4a2630d39966a0299dde6d9902b33a9848738c6f40","target_edition_id":"edition.r017.id-id.draft","target_line_end":147,"target_line_start":147,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[147,147],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d1086e3d2d29b3f99add66ee0e9280a4dbd536a4582206cd43d9db8db2b828df","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-037","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"693008824b10cf30c567473ecc06167b5b555a02557f1c57ff123cb61c080b18","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":150,"source_line_start":149,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"7f4bae2813cf9d5fc241e5111127170f009da16a0f0f1e5ff6690dcb9f3683c9","target_edition_id":"edition.r017.id-id.draft","target_line_end":151,"target_line_start":149,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[149,151],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57a6a59575ff41c20808f849c87b483a472c80f52cf00cee471674b4cdc0cf86","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-038","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"c823b45c1e605395ff153272df3ad60b6d4b06322a8279f39a20c710de0dd92f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":156,"source_line_start":152,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"03b73b163cb97ecdfc563bfd3a3242d6277e2c5f156370cab1f6eab47036fb49","target_edition_id":"edition.r017.id-id.draft","target_line_end":157,"target_line_start":153,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[153,157],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"764830bc768e3333d214da7d59e3155c3e0d9446cbbe6ae586aaf91e4a9cbec1","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-039","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"ff07d3e80ce98bf2732324704e218c18de54f3cc7ff59db47eb82b41d457a1f3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":158,"source_line_start":158,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"da6339def7ca05c4f700ffed9ae0810472fe1e69d1d3103e49cfbfbaf9cf86c7","target_edition_id":"edition.r017.id-id.draft","target_line_end":159,"target_line_start":159,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[159,159],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"91165c971667f84ac59d6fdbfec9701b89e764a74cdfcc2dd06b359580c6aed4","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-040","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"1525072a356c370e3b3f89a722ffa89b2942a285b9a215ae04fcf73619ec702a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":160,"source_line_start":160,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"76a4caf9a9072e6be8220c8504c4575b6d54cde278c67abaf131c951ffed5bdd","target_edition_id":"edition.r017.id-id.draft","target_line_end":161,"target_line_start":161,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[161,161],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8ba8d34ad9de7929bf5a176146a326ed6da4a15b86f82fe81b3c2dafe3ad900","concept_ids":[],"id":"segment.r017.book1.ch03.solutions-manual.block-041","locale":"mul","parent_id":"unit.r017.book1.ch03.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"d5b15865aeeb4221b530327801ed343759589da1f667b8770037394ca6bf28ea","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":163,"source_line_start":162,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"43d3890e6c79b13b4e5b553059f08b1eee46bd9a6e0a6a5928428a0e077785af","target_edition_id":"edition.r017.id-id.draft","target_line_end":164,"target_line_start":163,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[163,164],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch03.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cdcd0dd5815a1fec6e5c5149e458c51381e54bb3e392b01722ffbccd89d04519","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-001","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"971d6dfde43257b2430b711c6853f913600e5e40fa91d0f67e36dd36457cb2d0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"c700c6fb541a00a5982c23e5ba36dd9679ec5ec82c76bd5ff8b4ba50147a1cd4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"995d0551b75da598ab196e0fb0de8d84ba95aa78c6ef0a4bb0a24328b2e0334d","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-002","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"cf16e2c1e47b5a057910f6d9f2532969c11d3628032ba668f28151ccb9d19553","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":9,"source_line_start":3,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"f7830d8a4a70aef73bd7b6802b913d47be4ba5ea626ce56ad081ed4e2c69578c","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":3,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3,9],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e64791534c3eaeb49162c9314cbe2ccfff5ec11780df4dcb3e037f8054ea36f","concept_ids":["concept.conditional-formatting","concept.data-validation","concept.excel-solver","concept.spreadsheet-formula","concept.spreadsheet-modeling"],"id":"segment.r017.book1.ch03.text.block-003","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":["concept.optimization-model","concept.spreadsheet-modeling"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"c01140df1235fa211008d0cfc4d15dceac325a2f98b66d7dc809055e12e65a0f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":12,"source_line_start":11,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"24cd2945902e7a196007fb12b2e7224b27a78970f2a8e47a2f3af2c0fd4bfb89","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":11,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[11,12],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d40dda5e0242e51c6e440c1442c15f0c1e7f3d957c339d4388f75ee3a1bc19d","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-004","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"554181da507e9e6dd5e99186977d7cf1eddf2b0d54bf851bd01ce68a8317fa25","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":14,"source_line_start":14,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"46ebc8084dd65d118460a7b83cf4db44a1c08a5033a890521e456c4fb49cc6e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":14,"target_line_start":14,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[14,14],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"30d19fb3b07d4583c70d079d585ecf1725d5cfc0942ca0d9fd6570e65faee277","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-005","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"dab87b11282643f6582a464ec3cf9b8da38c1fe2b989fb568e2b8ffa0e50b41a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":16,"source_line_start":16,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"8e3310b1f1d9e1a02b692118a6aa5af91e4f649d78cc094bfbaf005444c2e8e3","target_edition_id":"edition.r017.id-id.draft","target_line_end":16,"target_line_start":16,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[16,16],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d1855685e554323edf864e405dc2b79f3618936049513d65d185d1b29cd545b6","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-006","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"ee2b68c35071f462e2313d5a48fd517ace9903ec96cdd2138f4de551be4b16ac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":19,"source_line_start":18,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"a6f1432a3cea1c7bb8ff0bcd088e18f02160f5257f549b4c2cd523bf5f09eaec","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":18,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[18,19],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cce6f20e66c1b2b854ae5b2fad4d4a0087389442eeefa2ebde31228fb4f8a9c1","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-007","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"9485c076ef065ca857ac3e663f43a056199bdf1971abc23678b24555fa74d47a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":22,"source_line_start":21,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"ee540edd53d16c1bfd728869dcd3251674ca60e6a917c44435b74460cfaef676","target_edition_id":"edition.r017.id-id.draft","target_line_end":22,"target_line_start":21,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[21,22],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a9c12d9c8595206a83de9adb9d9b904e42fbc73f0af5a6ffb93db14e90508cb3","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-008","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"3a9def68dbd351f8117e0d2cb5bc17766d179cdee3f77f584fffce36866dcf87","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":25,"source_line_start":24,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"2e72152323e58072f13dc60184f60b1c4cc55b6ba0a762046044ca9419724baf","target_edition_id":"edition.r017.id-id.draft","target_line_end":25,"target_line_start":24,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[24,25],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7cc37e111955680c29b3f5f8440450f332dd6005d0562dd594fad47323fb2130","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-009","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"87e0c7f3251b41d6cc39287ffce7cb9e8e331610222c29a680ea97532919c72f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":28,"source_line_start":27,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"e9be174c8569b1b0627208543aa90ad31f3732ad4444b1244afe39a42ca2cafc","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":27,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[27,28],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a90a747c99e8b679814957139c9d386b0166d5fd98b5070ab933bea336ace6c","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-010","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"5c96ed1400c9a5d8049520259da8dc547bb720066226e7ae54f45ade01bd7c36","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":31,"source_line_start":30,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"6906d714411fc6b055131273ad452f8b78e89257aab8ef3428a70ae23cee12d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":30,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[30,31],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a8caec6e15c6ace60bca3ddb4ff832c752aa852a401073d0710f196c26695475","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-011","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"6626de1e7486b830f0d24fd32a877d85f3613423c22b3d33f51b4b95f0371b2d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":34,"source_line_start":33,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"d1377d3cd2e606bd4c9f4f677c0cedcb3291d3c752fdb22c4c0777e45b14a282","target_edition_id":"edition.r017.id-id.draft","target_line_end":34,"target_line_start":33,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[33,34],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6dea669b83094f08429556e7deb07bfde8edc3a6faf1b294dd466c2786c1ca98","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-012","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"4b2423273a2d72bd3067db45e6e75bfc8d5239adb774b601061a78655e7be771","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":37,"source_line_start":36,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"a7073f40ade8b901d01803ae8787e7f05070f5401b7b224200e2bd7a2d189a20","target_edition_id":"edition.r017.id-id.draft","target_line_end":37,"target_line_start":36,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[36,37],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c72c17233906ee6eed6b6908a1b609630d1671acefcf605ac4f3ba9d1abf224f","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-013","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"ea3b2adb83e47be2ec293ef4960407601aefe6562f3a3a4112d85678d7262c0a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":40,"source_line_start":39,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"63cd8ff9c2a60e0fec82dedde70d8c36d098f99a57239412a2267fc027895890","target_edition_id":"edition.r017.id-id.draft","target_line_end":40,"target_line_start":39,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[39,40],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00a04471027ecdc06e71ba4ef15b3f9d41314ffc2641e833ac984380afc12ba7","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-014","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"605c950eb6b40f8423bf9d651520839149f6bcc92e7b612e0b7003e204f4776e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":43,"source_line_start":42,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"11b553ae90088308d2fc6483d75af7d6c5fcdc775935c7053b6ce850eed10abd","target_edition_id":"edition.r017.id-id.draft","target_line_end":43,"target_line_start":42,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[42,43],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bda7a1940b3e9d332cf5ebc70edb09474b8434648844c9144f9c4b2e286999cc","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-015","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"13dfa7113cbf40e527e73631130e0ebd9c29f2fcef140d719f83c2e692f28e24","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":45,"source_line_start":45,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"2bfe512d8826e09ce4d11ef7076faa70417f12b675bfa87bfc4d2ee53b9f040d","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":45,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[45,45],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4660100ab49390c8927d64ad8b41c75ccc10515b03398132a550ba78e0cd381","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-016","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"a408199b1a5942c910ed06bf087f250dc79e3792686379b10ea03196a7556533","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":47,"source_line_start":47,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"fa0f43b2c805369dd9c6483198fc97deebd34225f2cdde29d505ce86a0d17135","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":47,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[47,47],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8df68510448a4ba2f7f29ebb59249408dc40731b252772eb707b26ea8b63b9c5","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-017","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"675da09ffe8f3ee8c8f64c5d5cfd382cee296a1f944c7af00081e761fb8497f9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":49,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"0e76c2a874eba5b704dc7483700711b651528fb5180e2a6ae7fdb3fdbc70ae8f","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":49,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[49,49],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a7646072f358a7a2eccbafaf68e2a0f645968e3a361039a08d0320a7a82d0728","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-018","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"9bd3cc4f5be12b49e135830400a4b15db9687e1d34431b201bbb3bd83edf3559","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":51,"source_line_start":51,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"232c263d131d7e8ade7d6395f45d148e9f21580b2259a1b1943684e76dd57660","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":51,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[51,51],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d8eb5f7bc875810f666e2310a16aaed38d31160b85853273d8532573c5601d1","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-019","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"e6fa8d9b0842aaad7112a9c3e0c6777cc35b6590552dc07edce1eba50a3c45e4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":53,"source_line_start":53,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"eeb34b6bc1e43b79128e17678614d390d0bdfc21e0e7f89fcaaf17de6684aec8","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":53,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[53,53],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"09429cca9c85f228e9a2cdf7f1c6a93b5d577553bab0d88fc68f36751302e2a0","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-020","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"f1c679e57dc4734fdbf8f4c108f4cff33367c11c838bb1a2d28d941378a6c6e5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":62,"source_line_start":55,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"fbc63208d77ad5fc5a37dc9a46b1f7d1f12f2242cfd0a5d5b53648f1d6571131","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":55,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[55,62],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9847abb429570b2983ed97423d9e5c60577085af98ff2e73af1b75f3de3779b3","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-021","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"3ae853d2309e60e095d263199557bee0f67de38dbd9c59e7292338ce4e887690","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":66,"source_line_start":64,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"eb3cde65905d852bf83ec8c600275f8d2472e149e041da5d5bc11135e8ce7dde","target_edition_id":"edition.r017.id-id.draft","target_line_end":66,"target_line_start":64,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[64,66],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16f9d6b10317b951d043b5b76092f7763703006fdb20349edcd371b577762ebb","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-022","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"1e1cc6e69cdc8a24f366d04fa3a81973e53a8538a6ec0ab2e3c5a83d4d58fc31","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":69,"source_line_start":68,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"c5cc25f7547fa2b44bb84020c9448ac6afdc5eb148ef2b415a105cb0b40c8fbe","target_edition_id":"edition.r017.id-id.draft","target_line_end":69,"target_line_start":68,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[68,69],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1adf35b922221abc89b86d86b3aa5846401f7100a51a9f43ca7d9c85e21abdb6","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-023","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"a0477418f84a9437762c1557ef7d6ffbd4d1fa6fb93b508105de728635aeb7c9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":72,"source_line_start":71,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"0a1f9d13660bbe77eeb061ce4cb2e7f84529000352b64aa654c1acaf34043f54","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":71,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[71,72],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26bff70bd062a2b7d5df7abe1f7482c1e539758451df759dc9fa3d2d7a3a69bf","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-024","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"ecbd3c44d7be722cf691cd414b99c97e0673d7743d041565e2cb1898401db5bc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":75,"source_line_start":74,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"bee0d03f0cbf19a15a785ad4535651ac0a2302412fb9dca14cd5d2f1a776cd6d","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":74,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[74,75],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d489214d9772f42a84f26a51c88cca87ea6a59a2a8a4a8f347593cdbcd7578b9","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-025","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"dc057798606f3d64f61075eee6886003b74c8d3baeccaf544d3018bef6e6d552","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":80,"source_line_start":77,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"4abeb31eb16bf9a1706dee048ccd8b7e891735012cc06dd8df4a87c395fd7149","target_edition_id":"edition.r017.id-id.draft","target_line_end":80,"target_line_start":77,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[77,80],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a2e46ba67ea108d5d5236a86c643da8b56fe8225611313f67af44e180d0ad9d","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-026","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"679cdf0fac4572df6a133280c9411476870b86933b91ed1f1b5790d01c6ef71e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":90,"source_line_start":82,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"b89bc22e4d1ad8a153c1cc42e68fbca8245805d8352cfc0a04afadf3e632147d","target_edition_id":"edition.r017.id-id.draft","target_line_end":90,"target_line_start":82,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[82,90],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"262b54fa76ccd0d365295deb420ecaf14d7201d1d083d33f31a7364dddcd08c0","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-027","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"5f61cb3e0c0f021e1e33e7fd00faca22fada153919f2aa9ea53d3e1c8dd283fe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":94,"source_line_start":92,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"a0227d9aae55774391ec9540eaed6e057b7f8f5371fe22cd913844f82dd35053","target_edition_id":"edition.r017.id-id.draft","target_line_end":94,"target_line_start":92,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[92,94],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e1aee6f5677b8697a8873670baa9c349727407889bcdd8ccc61d10f81567d38","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-028","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"9651104265618062522d69336b955f8b82d28933c1449450f2c8bd0cef99aa19","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":106,"source_line_start":96,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"c56e2ee5f7f6fd91bca9ca8f8ec89a079ab02e5c9356a3d8e962d4ea4f9183e3","target_edition_id":"edition.r017.id-id.draft","target_line_end":106,"target_line_start":96,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[96,106],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"85a4db44ca80f482b57ef756bd67afba757128112ed58e0238230c4d54fdf511","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-029","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"bf846af383d075fdd6560672f79db9238c82c45a95bedf5b15ef85fc40007cc0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":110,"source_line_start":108,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"ee8c83d13e2ece896b04729728039a39e85e672e0bb1384d7fb89de47a4a66e8","target_edition_id":"edition.r017.id-id.draft","target_line_end":110,"target_line_start":108,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[108,110],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c9c73d08b650ab95764df2af10102fdfc21966dbe52d22cca63459b39055832","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-030","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"200f267ee04373d93ba3d098d87bca59dba99fcaf645096378c41235ab4330a6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":114,"source_line_start":112,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"6dc81ac5c0eec4d3ebed0e37f71ce93b2e625103504234639b4b062b35e8e294","target_edition_id":"edition.r017.id-id.draft","target_line_end":114,"target_line_start":112,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[112,114],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3b972a1bee4db630afb7053f4359e7cb507a9912fb99a6133fc25e4702c8e13d","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-031","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"d405ef4c2afa3760104e56f06a934ec8c16b61d99b2337cefd9bd4e2c6806e48","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":131,"source_line_start":116,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"db5979a24b5fea75603d8d7ebada53ad8cf3766cb8e7a7fd00a91e5319ded644","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":116,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[116,131],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e959b35e16847268379b80ce26d33a2d6c9b12d2506249c99a749e3f5a10cfd4","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-032","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"752c3a997d2939b96ffb6cb40b8b498d1af96a101b85fb96d5c455fb54d160f6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":138,"source_line_start":133,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"817a34c70a2b15aa449c2b490f186fa6095f9da29d1f8c237129989f3359ffa1","target_edition_id":"edition.r017.id-id.draft","target_line_end":138,"target_line_start":133,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[133,138],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f418c3ebaee6ee1cdc5d96b6d20fe52a540c857130ef9634c946d74687de8333","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-033","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"8718096da629bfe3ce6bc7b498598f3fe46d091c0d41b55980fcde3d5b993d2c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":146,"source_line_start":140,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"e8a28d6e562c4889602c27c758f4973b7d907105046f493f8d03477380819176","target_edition_id":"edition.r017.id-id.draft","target_line_end":146,"target_line_start":140,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[140,146],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3567533afb72f70dfbdb871437a15e4d06d402739b80666d3d6526623ef04f96","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-034","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"9e4376d3db72751e70575832c73a3d83f2864d9edba41359682c64b95d508e3f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":148,"source_line_start":148,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"648379507908ade82d2b939f5549fe924bdabe0686f789875d508fa95e7f131d","target_edition_id":"edition.r017.id-id.draft","target_line_end":148,"target_line_start":148,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[148,148],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"33b7ef085551bed5bf536dd4b05e763a1d35d5db18be3fccedbf5152e8f2794a","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-035","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"32b3f6515d38b25f225efe5a15f3697393b219bb02f387b722ae4fd2d405ea5a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":150,"source_line_start":150,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"c4e0f22841ac1a640114dab76c3cbf2bdd6b0b549c4b4d11246806cd32caeb28","target_edition_id":"edition.r017.id-id.draft","target_line_end":150,"target_line_start":150,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[150,150],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f5705c062cc4eb02c130f5b5a45b48e44f731b52ce12e09ad40376a7e595412","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-036","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"25158d0fad4b1dc77fdb5167153f0e305c7142f11abf8428a27b8b8b80fec0a4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":152,"source_line_start":152,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"0e4dd96d9e88caadca4f6f841f102877e67534fca2e67f8c8201cc16bd2d0ec4","target_edition_id":"edition.r017.id-id.draft","target_line_end":152,"target_line_start":152,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[152,152],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c05233e229631df6631264924e36fbab47b389a7f427597a0820c12845c434ee","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-037","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"dbf4cfd9f8939169bead22da34106b403ad9d10f2715ae01ed16eb82d46b5518","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":154,"source_line_start":154,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"1c3eac936622a52bfd653d9280a7570f2b20bee8e3a972f13b1ac42b3344e63c","target_edition_id":"edition.r017.id-id.draft","target_line_end":154,"target_line_start":154,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[154,154],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d7085e91a7b479b2a1a4c6d874ee2ba66bd6f9d08463dfc98904c50c6913c917","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-038","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"cf73b7c5cecfb1142e55533d210c83280584814af0e8407cd4a7dbbf8302a01e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":156,"source_line_start":156,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"b0e31c7e0f484aa2295648c4624a545080e7cbc276e8117bccbb075d329169c9","target_edition_id":"edition.r017.id-id.draft","target_line_end":156,"target_line_start":156,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[156,156],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"63a2b70472b00d46bb07cc879820ff9521bd7b73de2c9d8d3681bc6fae7cefba","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-039","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"e430390d8c5132d7f263fac305f9553a02fe38bb21b799b02599a07f5197de19","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":161,"source_line_start":158,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"4361d4bbe0b042d7d88b4c0377ab0be60b6bcb5e19fd50c0eee0ce7f864adbaa","target_edition_id":"edition.r017.id-id.draft","target_line_end":161,"target_line_start":158,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[158,161],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"73cba80d2cfa50654a46c6b12f835635a3a4a642241255914cfbd63732820505","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-040","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"1970510125cbe6fe19ddcc9ca34c8bb09bd6410e9f5f1503b28f12656dae6c17","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":165,"source_line_start":163,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"09eb1cfa98534e57af5ba11505de7833289ee5f4c7186160eaa4bb15413e33da","target_edition_id":"edition.r017.id-id.draft","target_line_end":165,"target_line_start":163,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[163,165],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"faef2b089a1107a815e31cbf147ed7d3e4491cb4cc30dfbc1d9277223f9ff1e5","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-041","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"afa91323605a9f129e25a233b4d0e6534af20c9229941b15565e5c7d13f39956","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":169,"source_line_start":167,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"1267fefce69f5cce61169d1ed32f8993cde17519d01998c19c6338d47331b42d","target_edition_id":"edition.r017.id-id.draft","target_line_end":169,"target_line_start":167,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[167,169],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"66ec3662bbb2872e071faedc327fe8428a81a5acd3524fab1b51453ff3303d5e","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-042","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"1e4ccc9ccba9038d35b6d9ebed7b22602bc3cbe77fc62260abb1d7f124da6cb9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":172,"source_line_start":172,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":172,"target_line_start":172,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[172,172],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2cee0ffad928b46a479e28a4d838340eb6a976af5646416c2f32985ce214f0b1","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-043","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"a6c18cd910118035e9ea010f2ee79c798b3efbc009700c989db4ce6c1d1e71cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":174,"source_line_start":174,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":174,"target_line_start":174,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[174,174],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7cc65644b0a3c2838521fabdfd08d77970ea6b4182bfd7eace441e8a7f4733a7","concept_ids":["concept.excel-solver","concept.network-flow"],"id":"segment.r017.book1.ch03.text.block-044","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":["concept.linear-programming","concept.optimization-model","concept.spreadsheet-modeling"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"9f49a1f91317d50cb4f916a8208558041a9eff6035f5972593364cd0b491b857","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":184,"source_line_start":176,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"52ff3db8e0dfaa70e3332f82a300a639429767bec53cdcae8ed67781c448f6ec","target_edition_id":"edition.r017.id-id.draft","target_line_end":184,"target_line_start":176,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[176,184],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ab2e0de3dd10491ae6a0e627f2abd125373b1dae47144bb89abde8afc3d4376","concept_ids":["concept.excel-solver","concept.inventory-balance","concept.production-planning"],"id":"segment.r017.book1.ch03.text.block-045","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.inventory-balance","concept.linear-programming","concept.optimization-model","concept.spreadsheet-modeling"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"4566ae246a3a004d580cb01829de702bd1977f3d8526a92c602418e936815461","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":194,"source_line_start":186,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"196057370ab333d860b59e4360fac44397a29fee68a9a9e6732b6ab56630c0fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":194,"target_line_start":186,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[186,194],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b1fbdbf2a6c2718f7b7d19a7b6c652deee0bdaad8126f79488db42173f38d3a1","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-046","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"befe6892ec44e33f7b364305fbcec8fa778e09b9cb39adc300c1dd14bcf212c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":196,"source_line_start":196,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"f438edaf4a0806f3995a450a1127b02b51c0eb792dab8d6cf29a3f0ccd77bf60","target_edition_id":"edition.r017.id-id.draft","target_line_end":196,"target_line_start":196,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[196,196],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a296b63f14c58e1cdada4fd34be4ed99f1657e99522a0ebea2c305a49c4c2df9","concept_ids":["concept.diet-problem","concept.excel-solver"],"id":"segment.r017.book1.ch03.text.block-047","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":["concept.linear-programming","concept.optimization-model","concept.spreadsheet-modeling"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"930827d3d1b249ba3806d088b9cf2efa5cac9df2e33f8663775d405d5b2cb33e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":212,"source_line_start":198,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"719eafa6eea92baa8b0845006bc1e4ba794f5d160e15c9258616da93d889b021","target_edition_id":"edition.r017.id-id.draft","target_line_end":212,"target_line_start":198,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[198,212],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a670d0c7952ae6c16d9a5cf7ecd415bfe03164c9503e10d2c64fc437aa327ff","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-048","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"fafdc511695fbd39edddf66e31164e05df5e4eeab64d09dd54efa0c22ec07b7a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":222,"source_line_start":214,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"8ae8e489c8a5fdeb0929a286b24ab6d2a6573af1bf1975d627295100975204c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":222,"target_line_start":214,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[214,222],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"908b1c215e535f730a705b40620a59d51425d9ebc50c5df86cd16c3ab025d53b","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-049","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"1f227d7c311ceb726893037dfda6ba7c1fc214617487f1822654febc0b1b1b22","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":226,"source_line_start":224,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"c6c8de7419653d3e1cc23f5cc18e9172459b1fdd48dbd9a5e4a07cfa9e87e145","target_edition_id":"edition.r017.id-id.draft","target_line_end":226,"target_line_start":224,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[224,226],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1354fd24969763401f58bb13f0226809592fa7cc12599972c249eea8627ada00","concept_ids":["concept.excel-solver","concept.production-planning"],"id":"segment.r017.book1.ch03.text.block-050","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":["concept.inventory-balance","concept.linear-programming","concept.optimization-model","concept.spreadsheet-modeling"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"c117aada8a403c18a32921fbfba5d1397f083249444af7f0de2c0d89b3b228a2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":230,"source_line_start":228,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"063be69e1a407b1f67c97077edaae490ed58addf70fc20410ce86c1b7184e97b","target_edition_id":"edition.r017.id-id.draft","target_line_end":230,"target_line_start":228,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[228,230],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88c7a5f078009e1b958f1ab341ccd902125675c24c36921b73da37ddff5253dd","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-051","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"0aa61d03616b0b7a6bb9fbf51b3a66dab9def6cbe2062ad3a763668cdd709ec6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":239,"source_line_start":232,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"5993a26b425a5ef753c040c40f485020e2cc75c11cb82388d4da453c5a4bf986","target_edition_id":"edition.r017.id-id.draft","target_line_end":239,"target_line_start":232,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[232,239],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"959b5857ad127e321fd0b5f833c53cf5ca1f9fd840f2ee1db55329c0486ccdc9","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-052","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":241,"source_line_start":241,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":241,"target_line_start":241,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[241,241],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"305420e51b073303874f701d457d6a61ec54bcdae6e4b0bad838cf435568a917","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-053","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"cd95fb31a1a60c0c2a437728224308339628e128ff5fef76cb8d2877f0b6e00a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":243,"source_line_start":243,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"96858b1fac056680eba9390ac866840f7d10be759f48168909c6fc4031417ea0","target_edition_id":"edition.r017.id-id.draft","target_line_end":243,"target_line_start":243,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[243,243],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cfdfc27d7b20d2c48f167d40430b1b0d1d1755d594c69b935afac678bc7ba602","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-054","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"6671bade49c4caef4873886627d8c948540b2f305e95bde705bb87a63c66376b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":251,"source_line_start":245,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"ffb2606503069144a857ef33c6c7c6483f71fc6864fbef98cebf032625a6eb7d","target_edition_id":"edition.r017.id-id.draft","target_line_end":251,"target_line_start":245,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[245,251],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5152367205a0cca67c781b98c9ad2f1aa935051e667562a4bd35358ee5016e90","concept_ids":["concept.excel-solver","concept.transportation-model"],"id":"segment.r017.book1.ch03.text.block-055","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":["concept.linear-programming","concept.optimization-model","concept.spreadsheet-modeling"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"51dd4a23be5b7c2e635b05ab031264e594ae5eabac4e2f7f36378b63002eb74d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":255,"source_line_start":253,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"f2bbc8ca7f2aaa3125e470cf6271e1cae94849a3575dc7059660f72bf1a8814e","target_edition_id":"edition.r017.id-id.draft","target_line_end":255,"target_line_start":253,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[253,255],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ab7d6fe6ad274c73a575d63a1e7e34ac82f2a82fdc4fd1fb729485f26832344","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-056","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"6b34353c01e65bb57fec98291bb77cb90aa1dc665be007dd2195985fbd99a9b8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":266,"source_line_start":257,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"6ae33eadfd5aa6f8ee72cb97311da96b3adff8b072a1cc0087066edeb467e923","target_edition_id":"edition.r017.id-id.draft","target_line_end":266,"target_line_start":257,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[257,266],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e970e5b6c522ae90234ba38822921a18b264c8bdc066c6900adc33212a3685b2","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-057","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":268,"source_line_start":268,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":268,"target_line_start":268,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[268,268],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bbee9f8b6f579a2fe248f3a3ec8f23da554ba51c6d508068b2e8b3af1672c440","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-058","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":58,"source_content_sha256":"7e4712002bfaf18dd48b2edafc445072073ddd3b2ec98f90c17fe28a2b27e705","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":275,"source_line_start":270,"source_local_id":"block-058","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"e8e2372ccd342916cfe1a699aa5346ae7b3fa5f2c7d99831792bdd4b00b0b24e","target_edition_id":"edition.r017.id-id.draft","target_line_end":275,"target_line_start":270,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[270,275],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9bb865e7b1b03d0b10dc173d40eda7937133e94e9cebfdf9fc1170a6b3296763","concept_ids":["concept.excel-solver","concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch03.text.block-059","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":["concept.linear-programming","concept.optimization-model","concept.sensitivity-analysis","concept.spreadsheet-modeling"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":59,"source_content_sha256":"190d84d9087aca59d29445fa4b8923baf4b500f5a371c01df048b219778d1852","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":279,"source_line_start":277,"source_local_id":"block-059","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"53e88e34ea77432417f52b60439ad9e653ffb725a8ff13a67739627fcdf28097","target_edition_id":"edition.r017.id-id.draft","target_line_end":279,"target_line_start":277,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[277,279],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6a9dbfa396969b2c3ab355b92fae4cbde06d1b93296fdabad4876400c064b791","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-060","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":60,"source_content_sha256":"80fcb6fccff6d239a45593d5508d87d230b9f7ab0f7040558e8212520b716234","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":289,"source_line_start":281,"source_local_id":"block-060","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"79462358460c0d969e399bc96aa2f7cac19bbdcc39b68d3aa9fc939e1eeb034e","target_edition_id":"edition.r017.id-id.draft","target_line_end":289,"target_line_start":281,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[281,289],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"05833551b7a2c4e25d00c325c7d49af223aba2691a82dd9f2154e97d9fd35db1","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-061","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":61,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":291,"source_line_start":291,"source_local_id":"block-061","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":291,"target_line_start":291,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[291,291],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5abccc4c2dbad7f62f00bc05bd1acff1d9d816c7aad412f6227284718a7ee095","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-062","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":62,"source_content_sha256":"4f1bdd5d4989a1d0e235288fddb6b15c79f89e4d157e306d9a57da83c53797cc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":301,"source_line_start":293,"source_local_id":"block-062","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":62,"target_content_sha256":"0e65e1175c11417f9868f178b340cda089c6c6b59d2c82d467af8013629aa9df","target_edition_id":"edition.r017.id-id.draft","target_line_end":301,"target_line_start":293,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[293,301],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81ffb39a6dc9960e35c955ddb518865d4c3f583248300a9e095faa617405d96c","concept_ids":["concept.excel-solver","concept.sensitivity-analysis","concept.transportation-model"],"id":"segment.r017.book1.ch03.text.block-063","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":["concept.linear-programming","concept.optimization-model","concept.spreadsheet-modeling"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":63,"source_content_sha256":"ee4da53bc79574cc1e79b0f5d73739094b02fa1a230398fc3c4c62ceadd975e7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":305,"source_line_start":303,"source_local_id":"block-063","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":63,"target_content_sha256":"44a9f1f8d4ea24f11fbdaff2ad33b4a735f80a3869a849b989421f891278b411","target_edition_id":"edition.r017.id-id.draft","target_line_end":305,"target_line_start":303,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[303,305],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ceb74db1e13eb3647a37605fb9e2290ed765ceefe054c901ca798a8d75ea145","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-064","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":64,"source_content_sha256":"6d2f3e8ee6cfba13f04784df031a1135ba95d57f4c53ac4db5412cc6f1612c6b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":317,"source_line_start":307,"source_local_id":"block-064","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":64,"target_content_sha256":"568988f158e0075166b07a7c33e1ec1579f45e1341d0b679ee896c7604d5a3bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":317,"target_line_start":307,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[307,317],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"187e87cd485da03c1bb638722b7472b1ca4e9ab0ae4027c184567f14aa8773be","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-065","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":65,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":319,"source_line_start":319,"source_local_id":"block-065","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":65,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":319,"target_line_start":319,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[319,319],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5a92a00e187c28741b81354acbd1d016f9b856efa64af09a29c41729cd9ef2d7","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-066","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":66,"source_content_sha256":"196ca333fc430d0db1b3b970fc560d922ca80547502776b2dd989a17ba431b95","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":327,"source_line_start":321,"source_local_id":"block-066","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":66,"target_content_sha256":"6ce2e8721976bf6751c5dcdf7f6ccd6729e51f2aaff7969a2edc3797b1f4a0dc","target_edition_id":"edition.r017.id-id.draft","target_line_end":327,"target_line_start":321,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[321,327],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7cbe2b801ffc52c086ad2a19f134200e839787a5ee33e24c1fae054a4f8da5ba","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-067","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":67,"source_content_sha256":"c8e278add1d6c18f659152466edf4e82568ebad5aaddedeaeb2d654335866d4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":329,"source_line_start":329,"source_local_id":"block-067","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":67,"target_content_sha256":"5a7c51fe019c052d866e25f75541baf5ff511cb9d0d48737b288dcbb3fd56de0","target_edition_id":"edition.r017.id-id.draft","target_line_end":329,"target_line_start":329,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[329,329],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"be413e0c9803f7917e27d37c88bb2b62b8b035ec5c1c75441212ad0a3b11df50","concept_ids":["concept.excel-solver","concept.linear-programming","concept.nonlinear-programming"],"id":"segment.r017.book1.ch03.text.block-068","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.objective-function","concept.optimization-model","concept.spreadsheet-modeling"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":68,"source_content_sha256":"b3d93b1e4857dc5ad74d7cdb89454bf547b0342860abc100ab838d124d3061b5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":341,"source_line_start":331,"source_local_id":"block-068","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":68,"target_content_sha256":"7cf5fac9605d9d4671306f2bd5d03aa2ba37471cf179d1b5ce6a855709c29e35","target_edition_id":"edition.r017.id-id.draft","target_line_end":341,"target_line_start":331,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[331,341],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e5b02d7f04f370ffd84d5c57b3de7faae8c7a053d40da8217a6486fac3fafae","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-069","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":69,"source_content_sha256":"4be7db13a50a6cf69022429255b203425a63979cca3cb7d03e8476641e361703","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":343,"source_line_start":343,"source_local_id":"block-069","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":69,"target_content_sha256":"02bc411158e8112c9dc4199c8d99675c3a91d7015f2998ee73306674c0d2dd8d","target_edition_id":"edition.r017.id-id.draft","target_line_end":343,"target_line_start":343,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[343,343],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ceefc7e2337f855daa43145267642c3fb88303cfd03f34735fe81291d586dcbf","concept_ids":["concept.excel-solver","concept.short-selling"],"id":"segment.r017.book1.ch03.text.block-070","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":["concept.linear-programming","concept.optimization-model","concept.spreadsheet-modeling"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":70,"source_content_sha256":"741bcd0109c45c4c8afd8eafb3486b9c7e323f4faea47b5c2d7f423d539e8b6e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":359,"source_line_start":345,"source_local_id":"block-070","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":70,"target_content_sha256":"fdb34309a18b6905612d6c11713fff905d115d9287fabd950326da04173a2e60","target_edition_id":"edition.r017.id-id.draft","target_line_end":359,"target_line_start":345,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[345,359],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e5f6991d1951c2d03b153d47fe03b6ea4f29f2d4e723cf7118b1d6aa9a80c38","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-071","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":71,"source_content_sha256":"070c82f595a58c404017d08d60ef7ee4b27c5877e128e391ddb9e2145cbe6910","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":361,"source_line_start":361,"source_local_id":"block-071","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":71,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":361,"target_line_start":361,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[361,361],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1705765b4fae0d3b18e1dc074685db4e159186cf2db676979ade8f4c9492bd34","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-072","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":72,"source_content_sha256":"8a22d0a847dae9644a995925730a116cc0548d4eafd25f95bcd7e291f7f641bc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":373,"source_line_start":363,"source_local_id":"block-072","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":72,"target_content_sha256":"453cef6dcffc02dc71bdb9e06758c81d43286d776dd54927710249f29feca698","target_edition_id":"edition.r017.id-id.draft","target_line_end":373,"target_line_start":363,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[363,373],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b4e39edaa99fdfcca10355e011a742b407df70fd0f0f9d92994fa283f6e6bb7","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-073","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":73,"source_content_sha256":"23960a8fee867250fe8811515e9f7d442e76a8478a2571cbb38368cec7a8c553","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":385,"source_line_start":375,"source_local_id":"block-073","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":73,"target_content_sha256":"c38c8527672628a1d53debca56c75ffd5768721ef11ece9744550e56fabb65ec","target_edition_id":"edition.r017.id-id.draft","target_line_end":385,"target_line_start":375,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[375,385],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"03ede5c1910c1c02eb43ac668eb27506820a09b36d943e7344bd66b222874cb1","concept_ids":[],"id":"segment.r017.book1.ch03.text.block-074","locale":"mul","parent_id":"unit.r017.book1.ch03.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":74,"source_content_sha256":"39005009940f9f10b08bb9e0722fb42bede068f1786bb11c23b7e7dd6948bda1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":390,"source_line_start":387,"source_local_id":"block-074","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":74,"target_content_sha256":"40a737593b20292816192f790029b8daee70384447dba7510b850b88f217d001","target_edition_id":"edition.r017.id-id.draft","target_line_end":392,"target_line_start":387,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch03.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[387,392],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-excel.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0964f209b1e53f12662d17db3282ac4662fd663025522e3417722f7ac2242ac9","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-001","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":1,"source_content_sha256":"232fb28be4fb5b7396532877e78d713f742386b2b6c055a1c0e8a2a246b8dbb6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"58b3f843106c844c9c314319f198e22eb0490d7a158406cd628c7db2f56d64d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":1,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,3],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"73e621f96d1ff57db8cdafe356aec2261adb1b57f8999c033f326da401afa546","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-002","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":2,"source_content_sha256":"4a309f39f2cdceafd842b5ff3eba577c95f73b57868f27a5b14e2c7519206282","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":7,"source_line_start":5,"source_local_id":"block-002","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"1580dfc29780b7b8409a2e2f72401d5f73c8039b632710efbafd2b35ee9b57f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":5,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[5,7],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cfdd07066f135c5b0340223c306501108aae558cf083956f77356d6ab5a2abbe","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-003","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":3,"source_content_sha256":"474c4556a3340cce1b910e25a5ac12d3001f711fb1bb013a66615b0f5ec6f672","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":13,"source_line_start":9,"source_local_id":"block-003","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"265836249f6661f2e489c4d3f49c3b0c229f1568a08f8a9aac4dafd324381e8a","target_edition_id":"edition.r017.id-id.draft","target_line_end":13,"target_line_start":9,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[9,13],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a65d7582ea0f852b8553d1714666dd8552db996f3ba91ba717d02c39d8df23e","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-004","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":4,"source_content_sha256":"e503409c2b2b6807264d4660999560bc773ebde16d2694f97768165b79ff88a0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":19,"source_line_start":15,"source_local_id":"block-004","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"a0029d1270d0f2bb042f98574dbccd3eccc5b174d6f248a07cc0075279797484","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":15,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[15,19],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7bd7fdb90565a896267f29fe215c04ba776f9043e5d8925db31d7c528216982e","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-005","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":5,"source_content_sha256":"c5b28ec1a63d6148af9ce3917b5361c62f8bff9a5c754ae9ade31ade136b8a0e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":33,"source_line_start":21,"source_local_id":"block-005","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"77299714615a4a944873a9e1609d19989fc91bccd3b93807c6bbefba4a6422d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":21,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[21,33],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2fc2de1309d5d288feac3e681b92038b14e9f03a22cebaf236834a4d501e89b4","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-006","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":6,"source_content_sha256":"f063182008289435f2b364b6b341a0925572b6860ce976bf61a90d492808716f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":52,"source_line_start":35,"source_local_id":"block-006","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"afbdd26539b66a8f87b40ab116dfef2d5cb48d7f8b4173b73b0836cb5f5229d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":35,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[35,53],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"286a111ad69bd780fa099328f11a61c4341a024e980a73a36d22ae807dece6b2","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-007","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":7,"source_content_sha256":"df3c75cc543fdbecce0e884659057b45c603868db0d2f09fe36a052737dbebca","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":62,"source_line_start":54,"source_local_id":"block-007","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"389e5914f2998660135e39af38cd206c2b5c3ccc45bcc615de82ab3014b9b9c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":81,"target_line_start":74,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[74,81],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"513c35d42c0eb353d9c3e6b84f032f5c4739d1d23bd255c077ad792126e4ddcc","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-008","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":8,"source_content_sha256":"04ed2d4b002bab78d419a6d1c1f61f21ee895cb2abd74b00a0cd6871718c3474","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":84,"source_line_start":64,"source_local_id":"block-008","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"6a7e2c042baa987442859a209ba2b30a3d583fa3a1d4833e517f44efa8ac213a","target_edition_id":"edition.r017.id-id.draft","target_line_end":98,"target_line_start":83,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[83,98],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"119b6644005a548a08e49572c0164ec8b01641e843c873ca42394c84e9a4c6db","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-009","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":9,"source_content_sha256":"1ddb6f00a40ffbc0f321fa1d967d3e5559221eee1d385157ec03eb2574a10218","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":100,"source_line_start":86,"source_local_id":"block-009","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"4fca862672833ddfa09f383babf1e730ef11e30aefd0cad0749e644b72329be5","target_edition_id":"edition.r017.id-id.draft","target_line_end":114,"target_line_start":100,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[100,114],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a61b598d72461be173f852faf09a71870a8e6265456e5d4ca23511c8a31e3e0e","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-010","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":10,"source_content_sha256":"b142034ad2004a805ebe089b30fef94c87899aef9580f9809fdedcd1fd7407ad","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":106,"source_line_start":102,"source_local_id":"block-010","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"9720dcc4b1e27ebb4b6a1e839b8471f84924c3faec60db6c60e4bc47864d2c41","target_edition_id":"edition.r017.id-id.draft","target_line_end":120,"target_line_start":116,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[116,120],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c8d6d298a9939277e72a8e17e1625b6cdb831bbd83354e3ae0e847b5ff249f2","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-011","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":11,"source_content_sha256":"f7eeb13b4f1e4088658598b1cd958040b68725d96bab9d200f2aa08eeacc8eca","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":117,"source_line_start":108,"source_local_id":"block-011","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"f7eeb13b4f1e4088658598b1cd958040b68725d96bab9d200f2aa08eeacc8eca","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":122,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[122,131],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"67ff986bb28c863838fb20482c738a5e056a996c9f8f1f7cfe215159bd1a5868","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-012","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":12,"source_content_sha256":"bd392ee8a9150751171d6977c7658ed732760cda738fa9437a5c7585a21310a0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":122,"source_line_start":119,"source_local_id":"block-012","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"46fda921005c1b7b398fc592f836579e29c42315b0277e92755d7d5ebe69d701","target_edition_id":"edition.r017.id-id.draft","target_line_end":136,"target_line_start":133,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[133,136],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0fa4acf2e5d9e81c7468eb7b2e0c0e0c0c85dca0a9ed1d1485ccc5d4d4689d21","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-013","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":13,"source_content_sha256":"defbf2108171d755d201525d405e28a03f9a294e75d54abb2a5f073f231d52d5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":125,"source_line_start":124,"source_local_id":"block-013","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"b18a50269bcda30c6186e30c7df43d12ac81196a5e0be2d575d11fa642f1bc59","target_edition_id":"edition.r017.id-id.draft","target_line_end":141,"target_line_start":138,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[138,141],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a1a3de878ed97ffee1ab317861932540c3cd8126143eec42b987ac3fd39baa28","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-014","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":14,"source_content_sha256":"fbae15cf103f49bccdc0fc788ed35c56390470ba0f2f8e13ad822e731b396f75","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":130,"source_line_start":127,"source_local_id":"block-014","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"45fa3826fdf161eababa5a00a76af498d0eeed8c30dc2d60e950ae5be3c45476","target_edition_id":"edition.r017.id-id.draft","target_line_end":146,"target_line_start":143,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[143,146],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5824d9d957b71f86f05fe26832ad05a6d69b161954db698b64cb212df531f70e","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-015","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":15,"source_content_sha256":"705b40e89824ee75a490a7ccbd745bf24e6a9731ff1c05de8a027d58d3d25d5e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":134,"source_line_start":132,"source_local_id":"block-015","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"705b40e89824ee75a490a7ccbd745bf24e6a9731ff1c05de8a027d58d3d25d5e","target_edition_id":"edition.r017.id-id.draft","target_line_end":152,"target_line_start":150,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[150,152],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd83f527b187a5fe55e411dea2d80758d29f929192e22218147db0f99be00fd9","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-016","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":16,"source_content_sha256":"295240077136f2b21f726cd6db74acd736373151ad8a9c519d47a76f8612a77c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":137,"source_line_start":136,"source_local_id":"block-016","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"e6e11742742173360e4475300c4ff8de9bba0bd8a374ce4218a091303256fcfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":157,"target_line_start":154,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[154,157],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e66f4d8975ca061894c73d8ef8d95f4dc0ddb9bed9361e43f10c9100da5ebe33","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-017","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":17,"source_content_sha256":"9760be8be4e308186474900790b5e11fd9e236c6f622b077b3e5a60b45521915","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":140,"source_line_start":139,"source_local_id":"block-017","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"59ed2b813aced1e9e9f63f02a0e184bb50f06365dc70b41a40e2bb22f31dab00","target_edition_id":"edition.r017.id-id.draft","target_line_end":161,"target_line_start":159,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[159,161],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b604508eb8b8026bbd388bdc6b28ab3ec9c35c0a0e36fe062e02ef5b8661322c","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-018","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":18,"source_content_sha256":"c2b8681b95781a200366d77ac8eb15b02e7f41ccfcfa6c114d9ec09c776ed499","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":144,"source_line_start":142,"source_local_id":"block-018","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"0792e19f8d27f58c338b5f4f9e9d8997a74133d1f02702baf882e94c08f6b70b","target_edition_id":"edition.r017.id-id.draft","target_line_end":165,"target_line_start":163,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[163,165],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"12b2756761bee3982317847419f4acc0c90d77bb3ab78f148b13c71efa465aaf","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-019","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":19,"source_content_sha256":"edbd0a06789fe289e87cdd36e3a5c46498183b4e2e1ed2f4305e8babd66942a5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":146,"source_line_start":146,"source_local_id":"block-019","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"edbd0a06789fe289e87cdd36e3a5c46498183b4e2e1ed2f4305e8babd66942a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":167,"target_line_start":167,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[167,167],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"29f37672396ff642dcd92a2dd0d0702be8dd58e3329ca6563ab58d654b57b7b9","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-020","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":20,"source_content_sha256":"b5a34efff498871d9e16db7f3f4af49eac0a4d2b2aa3da3a0019d48ea1d321e6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":150,"source_line_start":148,"source_local_id":"block-020","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"b5a34efff498871d9e16db7f3f4af49eac0a4d2b2aa3da3a0019d48ea1d321e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":173,"target_line_start":171,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[171,173],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f2ed68624ae8223ecb1310cf07caa8be8a89ea9c711378a3c364e26594a70e35","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-021","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":21,"source_content_sha256":"46d563d59b8913b7ba9a66c83ce900eda1549e1fb9af043d32c4e14d2b818e2f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":154,"source_line_start":152,"source_local_id":"block-021","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"774793e0eae914440ca9fad18ca9372a6bf861701a4d255468cd6c99e8c51ece","target_edition_id":"edition.r017.id-id.draft","target_line_end":179,"target_line_start":175,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[175,179],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e3b69348877df8238ee6e2e9913479bec57aa708e85e6ead05e061144ca79526","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-022","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":22,"source_content_sha256":"5249bb59c8c457d4a49f0b19f88629567f9fe59508ac352668cf7bc884b42756","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":159,"source_line_start":156,"source_local_id":"block-022","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"3bcad64bc2dcc5c7d608c58db29e1df5b44806feeaece66f4a06f5e1de44fd87","target_edition_id":"edition.r017.id-id.draft","target_line_end":193,"target_line_start":181,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[181,193],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"db682c01cc9da5a08d94a5336514cbb622338a81544db94559f04d5950e1db26","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-023","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":23,"source_content_sha256":"501985207d9a0c73e32233f63e7ad29b9fda254969a7b720a052fab6a147ceb9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":161,"source_line_start":161,"source_local_id":"block-023","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"501985207d9a0c73e32233f63e7ad29b9fda254969a7b720a052fab6a147ceb9","target_edition_id":"edition.r017.id-id.draft","target_line_end":195,"target_line_start":195,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[195,195],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37f4e9e8df12cd4c90be7a0f1aa448252c54863a35cfa66f8576b1202997f78b","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-024","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":24,"source_content_sha256":"8590dfe63a821971dec931dbf1ab5405e7bcf0fb78ca5e1d28b4aaa53b806cd2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":165,"source_line_start":163,"source_local_id":"block-024","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"8590dfe63a821971dec931dbf1ab5405e7bcf0fb78ca5e1d28b4aaa53b806cd2","target_edition_id":"edition.r017.id-id.draft","target_line_end":201,"target_line_start":199,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[199,201],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5036fdebe89a04e30d64f07fa88c37da07ae8ad791e568a92dbc63e3e1269f8a","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-025","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":25,"source_content_sha256":"ba40b949483f33bc319843b30f5411ec2174f318bc3ef1054b751cfdd932b809","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":168,"source_line_start":167,"source_local_id":"block-025","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"ba40b949483f33bc319843b30f5411ec2174f318bc3ef1054b751cfdd932b809","target_edition_id":"edition.r017.id-id.draft","target_line_end":204,"target_line_start":203,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[203,204],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1fd9e70e6c97a894e0d62de2d09a6c4fa8cf2123aa75e42e57ee3ab2da22ba4b","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-026","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":26,"source_content_sha256":"50f1b54ff95dcdc22a2acac8d981aba3c49e50a4eadbb26f2c9f34eaca1541c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":171,"source_line_start":170,"source_local_id":"block-026","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"4b73f81469ba3bec41833de576636e31d28224b8e8a52ba5985cec0d4332fbbd","target_edition_id":"edition.r017.id-id.draft","target_line_end":207,"target_line_start":206,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[206,207],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e3bb615b8108e9d5fe22d8181166db636fb39e951da24b6d26c8baba5caa15c1","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-027","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":27,"source_content_sha256":"0df0c39dbe84d594ccfc5211ef4ea85d19b075f9049d3fa9750113ab78a6327c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":175,"source_line_start":173,"source_local_id":"block-027","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"a0c34f362c80bf2a343731743ec54f697de74c7696441cc78ee8f5ed4a3ec459","target_edition_id":"edition.r017.id-id.draft","target_line_end":213,"target_line_start":209,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[209,213],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"86d2735b0030aed371073ad5edb07319efc91d0213942e7ba109160d06957276","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-028","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":28,"source_content_sha256":"993fb51247065ad3942c6db2137e7b2df4889964b68d4892abc82a52144481a7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":177,"source_line_start":177,"source_local_id":"block-028","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"993fb51247065ad3942c6db2137e7b2df4889964b68d4892abc82a52144481a7","target_edition_id":"edition.r017.id-id.draft","target_line_end":215,"target_line_start":215,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[215,215],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2044f95f35e90e1ca386f27ed4fd9987ebe11d79742e768be751efb93d71bcba","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-029","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":29,"source_content_sha256":"ba819d325b62a91a3d66cfbf25ec886c39466e39bb4e680b472e7e6c32977aaa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":181,"source_line_start":179,"source_local_id":"block-029","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"ba819d325b62a91a3d66cfbf25ec886c39466e39bb4e680b472e7e6c32977aaa","target_edition_id":"edition.r017.id-id.draft","target_line_end":221,"target_line_start":219,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[219,221],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a450909f5f8c1ab30c02ac24128c8395f315ecd01c93f4b7fd59960da1c9508a","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-030","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":30,"source_content_sha256":"90a2f72733b98319a6b4a61271e7757921b9002f723d7d235bd81eb41ac7e37b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":185,"source_line_start":183,"source_local_id":"block-030","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"956eef4d37ca1b748aadcccad84a591ea413168496a65a3baf8df6b85632f012","target_edition_id":"edition.r017.id-id.draft","target_line_end":226,"target_line_start":223,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[223,226],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d3990912a9a353d80a57c8f1df91063d6af2ec4f4ddf24015251ce38a0f1241","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-031","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":31,"source_content_sha256":"0e2adea4fc88993e959e9c4b29ad7b9a050e0878c30ad1dcb143b3378182ac61","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":189,"source_line_start":187,"source_local_id":"block-031","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"0496abf40a64535f78cd275bd99c7e7706603ada7456c8cb97c12f1e55832e1c","target_edition_id":"edition.r017.id-id.draft","target_line_end":230,"target_line_start":228,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[228,230],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c4c3ae8208c9aff0bac241511543916f67c67017f532eb8348b9fe0b2f193021","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-032","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":32,"source_content_sha256":"f06a971624790a0828d90ed694a5de447ab482dcd45fc6ea7a91a3dc65225fb3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":192,"source_line_start":191,"source_local_id":"block-032","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"f3c5c57743eb6fdf5876413c04d387f6047f580a11fecbc719bedb9e3ae90312","target_edition_id":"edition.r017.id-id.draft","target_line_end":234,"target_line_start":232,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[232,234],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a0c775d716065b780ebe5711791468c73b0735b3a4674f2d36729279b2575e87","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-033","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":33,"source_content_sha256":"95fb9d9d1d797b9398d67f69b2f7bfa09902fb603f11a15d5f2f7a9027b66e7d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":194,"source_line_start":194,"source_local_id":"block-033","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"95fb9d9d1d797b9398d67f69b2f7bfa09902fb603f11a15d5f2f7a9027b66e7d","target_edition_id":"edition.r017.id-id.draft","target_line_end":236,"target_line_start":236,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[236,236],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6502b4539c72cf161d84199e8119d614a4801b62b49619f14fce5053c6e4de6a","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-034","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":34,"source_content_sha256":"705b40e89824ee75a490a7ccbd745bf24e6a9731ff1c05de8a027d58d3d25d5e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":198,"source_line_start":196,"source_local_id":"block-034","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"705b40e89824ee75a490a7ccbd745bf24e6a9731ff1c05de8a027d58d3d25d5e","target_edition_id":"edition.r017.id-id.draft","target_line_end":242,"target_line_start":240,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[240,242],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c63c95d55bc12439d12980f4623d6f67a0f0f108fb9a531d0f9bc866861576f5","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-035","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":35,"source_content_sha256":"78d1e2c81296454fa88b16451a13a8fdc485854f0322036d019b2d9460942c15","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":201,"source_line_start":200,"source_local_id":"block-035","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"880efbb33dedea20e110ea934232141c6cdb483e9af3e3a4a3ae8f8a7d95cec2","target_edition_id":"edition.r017.id-id.draft","target_line_end":247,"target_line_start":244,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[244,247],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e332952b109a4c1f344400c30cdabfcd923eae35e81d253eaf02a58277a2d84a","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-036","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":36,"source_content_sha256":"e483d7451032651ebbb1e9bdf0e0df7a44aa10f268c221fb905d0025525c6d7c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":204,"source_line_start":203,"source_local_id":"block-036","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"b7d66197a8c5ca6184d5bba491ecd6d2ccbd052405eee8a3647540b23fe354db","target_edition_id":"edition.r017.id-id.draft","target_line_end":252,"target_line_start":249,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[249,252],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1f4d64438850f04099304cd50ed9d55bd331567d70b5c67eafa94dd7c5e11d62","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-037","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":37,"source_content_sha256":"3875c4c69ec7f20db0b99e605fdbda73733ef669a0d370bec7ed77314d6ae189","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":211,"source_line_start":206,"source_local_id":"block-037","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"abd7607525cd91804800074f166e3494fd80c9866a4c5a2a7dd374a04c909f56","target_edition_id":"edition.r017.id-id.draft","target_line_end":262,"target_line_start":254,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[254,262],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f817086a1d673e04aa48a173d1aa4fe795376d922383583307e3cf1d24699cd","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-038","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":38,"source_content_sha256":"0b4bc9f66fadb7cb2bbb8b91d17bc0b3ea071b504414064c27e11c7e848c4d1c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":230,"source_line_start":213,"source_local_id":"block-038","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"14cfbaa90ca9df1dcf70d7e47d18515a38d28988a91fd4f68cdbd4530a554f88","target_edition_id":"edition.r017.id-id.draft","target_line_end":281,"target_line_start":264,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[264,281],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ac024a54dfa39e097adffb26c162fbfffd7ddb61347eb308dae27c55086816bb","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-039","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":39,"source_content_sha256":"e4c662704a041155d0352b879415321c26a43513170ecd25a46470ce13642400","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":254,"source_line_start":232,"source_local_id":"block-039","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"7bfefa17a8cf6ff31632dbeea265992cd5cb25dd6e485276ea8dbe4608cbc684","target_edition_id":"edition.r017.id-id.draft","target_line_end":306,"target_line_start":283,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[283,306],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81e985f7e799954406eec0a9ee77c336ff5cafa3dcf58d5cdb7e72ddbe42ad06","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-040","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":40,"source_content_sha256":"8b035c7031c1f29880dc48b7f49792879b7f9512190af95569e16df4f1bb6a29","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":322,"source_line_start":256,"source_local_id":"block-040","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"b9d48c131701858ee51e56feba3d7a34ce7ceb30cd43d345829b7f7bafd6f657","target_edition_id":"edition.r017.id-id.draft","target_line_end":380,"target_line_start":308,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[308,380],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"432a83f6a23603c6053cb082beebb55c3b39d604a98e8f894d61f2ba5bc94ebb","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-041","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":41,"source_content_sha256":"b53f16b0d1955060b9cd8a1620ec97801ca48a8861e2dd87cc3c9d5cb25e4dae","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":356,"source_line_start":324,"source_local_id":"block-041","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"69d020297b2c721afb8a38a77627c998ec4ed0d22841ab1df7745982b1154560","target_edition_id":"edition.r017.id-id.draft","target_line_end":414,"target_line_start":382,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[382,414],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb91eedec1eb43fa99e187cf61c6bde4ddd594d7f723e5351cafaa17df494200","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-042","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":42,"source_content_sha256":"00ec63368bf12ea4b4dcdaa01e58eacc4bc49902d64dd36de3ae130c498ae7b0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":358,"source_line_start":358,"source_local_id":"block-042","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"00ec63368bf12ea4b4dcdaa01e58eacc4bc49902d64dd36de3ae130c498ae7b0","target_edition_id":"edition.r017.id-id.draft","target_line_end":416,"target_line_start":416,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[416,416],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"01f2db4c8db7d1fdbba415ceca0cea3ff16390e476cb25bbaab9eeb51a9bfb98","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-043","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":43,"source_content_sha256":"39309de982230d5985a7423c8a9f2cd075bf800e7eaab5b52af43eb3cb0407e0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":364,"source_line_start":360,"source_local_id":"block-043","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"39309de982230d5985a7423c8a9f2cd075bf800e7eaab5b52af43eb3cb0407e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":421,"target_line_start":417,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[417,421],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4efa53e32efa1623ecb83c38e609e604e35174c05d62a2c4534f1164b5f1ea05","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-044","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":44,"source_content_sha256":"9fe6ab3805bcd077b4bae430a030151e0be6a4a7a9d9b9e5ba6b038e1f915235","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":379,"source_line_start":366,"source_local_id":"block-044","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"aa0c34dc200523a7165956a1d129b23a0c2a28e1561fe014c6ca590d58413681","target_edition_id":"edition.r017.id-id.draft","target_line_end":457,"target_line_start":423,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"alignment":{"authority":{"exporter":{"bytes":152116,"function_lines":{"alignment_parts":[1793,1832],"nonempty_blocks":[1292,1308]},"member":"scripts/export_backend.py","sha256":"3edee807a41c766c84efbda2a67b209b3d41a8afa7dbf00252ee3cdd846eedb9"},"input":{"bytes":448536,"member":"backend/input/backend-input.json","sha256":"c70da303e2feade5dd52092b8e15b722d0ea8cd5e26be63d8cb001739b55daba"}},"contract":"frozen-native-exporter-strip-each-declared-part-then-double-LF-join","parts":[{"line_range":[423,439],"raw_line_slice_sha256":"c233c537f11d08078ef944efdacc7f321ba68597f006cc4b3d90fdedec9c7e5e","stripped_part_sha256":"c233c537f11d08078ef944efdacc7f321ba68597f006cc4b3d90fdedec9c7e5e","target_block_index":49},{"line_range":[441,450],"raw_line_slice_sha256":"b1bd179e32b25303b929643ad7b32083ff749f29f5da739d77eb3985fad5ce83","stripped_part_sha256":"e1c0522e6d5adf8ba74a09f05e07fd8e18912117d8ec9de6c86082c9a541599b","target_block_index":50},{"line_range":[452,457],"raw_line_slice_sha256":"a5cdd97fde0a24476ef7b75b022d3501e3efe05d7209fc381c9fd2cc4159cf2e","stripped_part_sha256":"67045c794a0a7d0aace2fb2d7eafd96c7fd2cefb63542c436f6917f5ec82ae1e","target_block_index":51}],"reconstructed_content_sha256":"aa0c34dc200523a7165956a1d129b23a0c2a28e1561fe014c6ca590d58413681","source_block_index":44,"target_file_guard":{"native_expected_sha256":"110af1e063e78a0cb26b8abd3f9df2e3201ad8b361756a38314f33d9de6a3c4b","released_file":{"bytes":32978,"sha256":"110af1e063e78a0cb26b8abd3f9df2e3201ad8b361756a38314f33d9de6a3c4b"},"whole_file_guard_matches":true}},"archive":"source","line_range":[423,457],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_native_alignment_parts_exact_text"}}},{"canonical_native_record_sha256":"13bf94c498cf76d411fdb1f2983517573258b2aa7898f13d35486651b7a9e2d3","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-045","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":45,"source_content_sha256":"7398e0c87796b6416eb2b68a340077282729b1b4b9a8b6e3a4bb9b51fea96c14","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":404,"source_line_start":381,"source_local_id":"block-045","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"bbe92de9298c588d101e0f8780bb15bca1d4db331cdb5d2fa2e8ad32f2ddb307","target_edition_id":"edition.r017.id-id.draft","target_line_end":482,"target_line_start":459,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[459,482],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"59518197949ad9985d0548d22fc178245aa6b93eee853447d4f9507f9135a404","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-046","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":46,"source_content_sha256":"2494d5335fe35397273146652a49f16692aa997fab457a1dc3a32564f0957f05","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":427,"source_line_start":406,"source_local_id":"block-046","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"58208d2b4baf238134bb104b52e42de31ec61c6f8dafc870d92dcaed62086e55","target_edition_id":"edition.r017.id-id.draft","target_line_end":505,"target_line_start":484,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[484,505],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3bb296da9ecd367dfdf18a935b937c1d9625b0b752f2e5122d28dfadee28f996","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-047","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":47,"source_content_sha256":"00104f7906283d2a28fc2c09f495088d57aafe8bdc52aeb42912ed0c9599590f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":455,"source_line_start":429,"source_local_id":"block-047","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"00104f7906283d2a28fc2c09f495088d57aafe8bdc52aeb42912ed0c9599590f","target_edition_id":"edition.r017.id-id.draft","target_line_end":533,"target_line_start":507,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[507,533],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b39348c7892e04df1690ae184d00f6696353b22b8971147e636405ed9d9d1e3","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-048","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":48,"source_content_sha256":"fb1e5e1e124a8ee49b360f375a2b90715fd370eb739cceaa4790300234a02389","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":483,"source_line_start":457,"source_local_id":"block-048","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"8b9c226be85a6e6a9b865570dcb868b01a042da78d139fe37c594b19bf857e40","target_edition_id":"edition.r017.id-id.draft","target_line_end":561,"target_line_start":535,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[535,561],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7ae0757936e8d477b5b53b349ceecb278f25f7b4ddb5c118eeab37a52b391f09","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-049","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":49,"source_content_sha256":"4cce72fbe37f164c9c63bc82b28a67ce5f0534d8575f74c8faa7b57231569dfc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":513,"source_line_start":485,"source_local_id":"block-049","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"10f8d51457ff40caaeafd4e5c97252c3690959d94da25c76a6f3dda4a1d572e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":591,"target_line_start":563,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[563,591],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14a96cfbc3654ee1809b508157aaebb12162ca2f3558e73fc3737d0ca14cdf2e","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-050","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":50,"source_content_sha256":"15264be11e83fbf5358d075e43a455f34495772ec7288eee86442a640db774d7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":562,"source_line_start":515,"source_local_id":"block-050","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"72d188666ecec3104040219a8f46baecd31af8935de5452cb5b53f525306f9cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":640,"target_line_start":593,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[593,640],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52d26337086755ec93ef5af45150deabf01e12ce1cb3fb018ae15d7f105a88e1","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-051","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":51,"source_content_sha256":"502f687f8ce8f3a5e1df0d671f5a1dcc737176f8671a7cc94256eff66aadd9d9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":571,"source_line_start":564,"source_local_id":"block-051","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"502f687f8ce8f3a5e1df0d671f5a1dcc737176f8671a7cc94256eff66aadd9d9","target_edition_id":"edition.r017.id-id.draft","target_line_end":649,"target_line_start":642,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[642,649],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19b434cc0978e7f58e4a45764f2a0e39564b1cb0694b0139d8bc83a61cad296c","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-052","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":52,"source_content_sha256":"111eeabd77ce7926aba3b18662775261d5874d1bdd0e3b2e4323c56c6698dfc5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":613,"source_line_start":573,"source_local_id":"block-052","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"4f9e08037cb3972b3cde69ec16a7616b0234d648774f1d9ba4454d676a0ebbd0","target_edition_id":"edition.r017.id-id.draft","target_line_end":691,"target_line_start":651,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[651,691],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c1d73e70460cd716aecc84a5153004d1b97d706ae823fc8ee8fa26a82e64c46","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-053","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":53,"source_content_sha256":"17a372d66a49e0fadf456b76aa3d7f372f7a46b16e10ac8cb3a7e5bebf1e88aa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":639,"source_line_start":615,"source_local_id":"block-053","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"73e0ea1cf2d2783683468a23e9d11cd6cd61e43c2d8627b9a02f35803cb3c44b","target_edition_id":"edition.r017.id-id.draft","target_line_end":718,"target_line_start":693,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[693,718],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4248ef1f418d1f840a0fb443132042049dc28287eb1a839ad4e63bc77404a6e2","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-054","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":54,"source_content_sha256":"a9d8e1a51a1a0f394f1244b220141dc16e35eb573dd355b058319c63df71555b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":689,"source_line_start":641,"source_local_id":"block-054","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"9967fc953a400838e7271374f302e8a7adbfb06f258b732c2eac03801a5393c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":773,"target_line_start":720,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[720,773],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0abbf4b041315757de5ec59c9f27e6be2df657d5685d465ff755d440bdc4a046","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-055","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":55,"source_content_sha256":"cf5f14e931d2da930ad6aa7572e3d46fa160631bcd90f8231c92a5838633c1fe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":706,"source_line_start":691,"source_local_id":"block-055","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":62,"target_content_sha256":"dc8ec651fb10a2bdf0240270c63203746972c170a924d4164dea05aa29a0b3f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":790,"target_line_start":775,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[775,790],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a66b8c8f677a560dbd5b2c95ec869bf86db25d4d9939c77b13a4e45bba3ebbc3","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-056","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":56,"source_content_sha256":"1fcc19969cafaab4e3e617a3ca0481c865a7cd2b40396f02e3eb8532fb0c06fd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":714,"source_line_start":708,"source_local_id":"block-056","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":63,"target_content_sha256":"1fcc19969cafaab4e3e617a3ca0481c865a7cd2b40396f02e3eb8532fb0c06fd","target_edition_id":"edition.r017.id-id.draft","target_line_end":798,"target_line_start":792,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[792,798],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"533385bfbbc7c022580313db3139698b635b08ceb308fc846f0bdf624c0ad933","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-057","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":57,"source_content_sha256":"8b6e5bf79d2992a2e6e6af53b0d600cb3755f916e8961329542e34ad05927c20","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":750,"source_line_start":716,"source_local_id":"block-057","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":64,"target_content_sha256":"b084a5744db77cb8197e3827220313788b2877f43f03aaaeaf359e75ee45a320","target_edition_id":"edition.r017.id-id.draft","target_line_end":834,"target_line_start":800,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[800,834],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"25212f3760ccabeab044d0ab36f74bccd7cc3b5a8be735c2fc81f27a67f574ff","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.block-058","locale":"mul","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_block_index":58,"source_content_sha256":"e72286a0c8b92eae7792e71edc348f95e9dd092a81402e643e3512e2a3b4569f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":798,"source_line_start":752,"source_local_id":"block-058","source_locale":"en","source_path":"visualizations/source/network_flow_demo.jsx","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":65,"target_content_sha256":"a4625d7dd8043d5b043184de5954debf739db7dee4a275efd7246a0a1c776f05","target_edition_id":"edition.r017.id-id.draft","target_line_end":882,"target_line_start":836,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"translated","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[836,882],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ee3887efe60a2daed5c0a5caed25fd640a2b1ccd48a822dac1f688f93472e08","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.target-native-python-arcs","locale":"id-ID","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_edition_id":null,"source_local_id":null,"source_locale":null,"source_path":null,"source_target_relationship":"target_native_correction","status":"verified","supersedes_id":null,"target_block_index":7,"target_content_sha256":"9fd45eecd4e448f3b42aae8279ecade5d8495e7dc42a9a0da5dc923cb866d408","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":55,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[55,72],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"50ca5549a568fdf8bee03ac72565a82f4f01406979e29b3bf3c92b2a5da14e9a","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.target-native-python-arcs-maxflow-nx","locale":"id-ID","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_edition_id":null,"source_local_id":null,"source_locale":null,"source_path":null,"source_target_relationship":"target_native_correction","status":"verified","supersedes_id":null,"target_block_index":22,"target_content_sha256":"d4ad71ec7c68144ef0076b4084e63a585bb9bd628b0e29234ba6565509013f70","target_edition_id":"edition.r017.id-id.draft","target_line_end":169,"target_line_start":169,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[169,169],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"87dd159936a6f827a6704eeff7f844d551a2282f30c220b5a27929cd07e6c58a","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.target-native-python-arcs-maxflow-or","locale":"id-ID","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_edition_id":null,"source_local_id":null,"source_locale":null,"source_path":null,"source_target_relationship":"target_native_correction","status":"verified","supersedes_id":null,"target_block_index":27,"target_content_sha256":"d4ad71ec7c68144ef0076b4084e63a585bb9bd628b0e29234ba6565509013f70","target_edition_id":"edition.r017.id-id.draft","target_line_end":197,"target_line_start":197,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[197,197],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a9abf3500f9ce9d7e437bf532f835fd8b8456fc3b02a05823ed6e3721f310b12","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.target-native-python-arcs-mincost-nx","locale":"id-ID","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_edition_id":null,"source_local_id":null,"source_locale":null,"source_path":null,"source_target_relationship":"target_native_correction","status":"verified","supersedes_id":null,"target_block_index":33,"target_content_sha256":"d4ad71ec7c68144ef0076b4084e63a585bb9bd628b0e29234ba6565509013f70","target_edition_id":"edition.r017.id-id.draft","target_line_end":217,"target_line_start":217,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[217,217],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5cede6e988a8f27898ce747e9737288ba958670267b821a4c853d85c806fca24","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.target-native-python-arcs-mincost-or","locale":"id-ID","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_edition_id":null,"source_local_id":null,"source_locale":null,"source_path":null,"source_target_relationship":"target_native_correction","status":"verified","supersedes_id":null,"target_block_index":39,"target_content_sha256":"d4ad71ec7c68144ef0076b4084e63a585bb9bd628b0e29234ba6565509013f70","target_edition_id":"edition.r017.id-id.draft","target_line_end":238,"target_line_start":238,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[238,238],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d62bcc558f61d0935353ea27efa55ac4cda8079c3eb7a62672fd806b4ea7d55e","concept_ids":[],"id":"segment.r017.book1.ch04.interactive.target-native-python-arcs-shortest-or","locale":"id-ID","parent_id":"unit.r017.book1.ch04.interactive","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","source_edition_id":null,"source_local_id":null,"source_locale":null,"source_path":null,"source_target_relationship":"target_native_correction","status":"verified","supersedes_id":null,"target_block_index":16,"target_content_sha256":"d4ad71ec7c68144ef0076b4084e63a585bb9bd628b0e29234ba6565509013f70","target_edition_id":"edition.r017.id-id.draft","target_line_end":148,"target_line_start":148,"target_locale":"id-ID","target_path":"visualizations/source/network_flow_demo.jsx","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch04.interactive","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[148,148],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae87b8e97a90df96f119c00ea5de43b177670199f2fb734859ac00732d4fff1d","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-001","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"5b27f23a6e36cd5a3e6ecea53f5f2eef8d93e7de64a03ebdd0d3270b4e07af51","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":11,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"a1c7340cdf74eb1cebc6bda9fb73108325a602ce4d60056772ce2a86515e85d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,12],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de32918cc6676edaa0dbdcc80e2b55e363e1d2052bbfa3f514d71f8598c186a8","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-002","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"781cef6cb6e438c0478d5ac38b2e07e472836cc27134f6baa9338b75cbcd64d8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":13,"source_line_start":13,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"ad4baaab69fda5c8935f6aaab1ef0311cbba728693d7c0659ca8688f24d34fd2","target_edition_id":"edition.r017.id-id.draft","target_line_end":14,"target_line_start":14,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[14,14],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d6df995cfa25db252a78805c2da6684d9defbdbfbea62bcea629efd9a4313fb2","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-003","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"dbff34eb34da5637251113fff793376f9a9b05630b1a56677ca2399eca19d578","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":16,"source_line_start":15,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"431338eead8dddf439e6a2cd138da46362db577dfed74b3003f32ea3ff384c55","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":16,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[16,17],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a25dc515994e1b27e17e7bae10782d828c69b9e94f38f68798a7a77018163557","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-004","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"3a7db7c41e3433f35d67c2175f856a6c83210f88f5336519e79293f81e6a9e5b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":27,"source_line_start":18,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"19f6bcb94ade85c38aa1ad34037e56b21aa787305fb786e28bfcffe323ac1dfc","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":19,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[19,28],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8752afe1189d00ad1bd905885dc74a43f064cefe7c256b93a479119a5e650340","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-005","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"55f6066c7452c7d4f05e54ca574f5d862f8c657da1922c9a0f2d32ef1933a09d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":29,"source_line_start":29,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"92d989653a207b4c4a06d96a600d7433342e7a19afa55bfe1d0e8d4cf2596b9c","target_edition_id":"edition.r017.id-id.draft","target_line_end":30,"target_line_start":30,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[30,30],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a299755b090401cbf91142f58f57bd69dd4804225eb921980f67632bfe780b53","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-006","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"c49ff492ac13b0734b85294aa33147f4c21230c87d4e6c3902fd99b36d3f0f53","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":31,"source_line_start":31,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"c9ba921b84799edd47b64d024a4f4dddf3acbd1f1edde0e2e3d3e5a6a2da1fd4","target_edition_id":"edition.r017.id-id.draft","target_line_end":32,"target_line_start":32,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[32,32],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84edf560df9865261f6afb077c228871def2e50ff5412318e418b0d734c2bf0d","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-007","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"9a001805465f82be026b3941ba84f40dd02d5730ea838da27bc540b4b1d10639","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":34,"source_line_start":33,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"b79ae807aa588418da7691665ed8fce179f3e14e54df858960b2dcd246ae3ab8","target_edition_id":"edition.r017.id-id.draft","target_line_end":35,"target_line_start":34,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[34,35],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a7608b83b5faedac92264877682b160d0652ffdf13d165894d8dee960814428","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-008","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"c0b5f4bb2b477083c835fd1e221b867d7bffc16572290667144db45df03b59fa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":40,"source_line_start":36,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"9d6526b88ce21e9ed5690fd21793f314f0c1544a020f6981cf98bad303bce7c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":41,"target_line_start":37,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[37,41],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c7a4ba75ba87c1f0e9c3d0d15877908a038ff204745c2cdfd1c89e658a94d387","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-009","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"f258f9605288c5484824c0461740c9aa9ea2f93a65def950e28f778696745750","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":43,"source_line_start":42,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"2a4362cf1f7d51b2d480c153accff40faf8298ea7ce4ca36c2809e1dc90680c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":44,"target_line_start":43,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[43,44],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4beec741ba91b2737499b0f46e93c3a63804979029764e3e4807471ca30f0652","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-010","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"1427a5556f6ff023b9957cf8eb182afede6c0a89dc1afc9a5222d03a00b624b6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":51,"source_line_start":45,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"369e206f8a38fa6582b86cf517252362a23c2aef0e7010c9c98295552f41d463","target_edition_id":"edition.r017.id-id.draft","target_line_end":52,"target_line_start":46,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[46,52],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9c193a1eb10fa85a5efd3e618f9ed200e1e02a02676fccb02517e0d98aa777b","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-011","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"60fb8480da160e048b9d7c80405e099572bb4f45881adbf91b85c08f7493f8b4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":57,"source_line_start":53,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"aa24b4f8f145a59304cd2062e632adbc9a915e0452168d9b5c17e9c7bef786ee","target_edition_id":"edition.r017.id-id.draft","target_line_end":58,"target_line_start":54,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[54,58],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"72140a948718f0076a80e2466ada200413a16cc1d83343b7e16afecaf5001d4b","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-012","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"667b08a9bd5f008365b2e5ec2e2f831eaa1144145e1ba56897ffd0ec84a153c0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":59,"source_line_start":59,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"d4d037bd998fa07de5fb21d2ba47b4d58749846d967ddbceff5f246f9a3205e3","target_edition_id":"edition.r017.id-id.draft","target_line_end":60,"target_line_start":60,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[60,60],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d896cbcbd301a84c1ad19cde01c8e710bbb8588f393e98e080e935a32b242fd","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-013","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"ef749e055c1bb95cc7188f1208321d7ce1bb0b994737ff1a045a937eac511448","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":63,"source_line_start":61,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"14945060ae3b8f1fc05fa1e794f03b50e9526e9d952cedca757351f64f107f09","target_edition_id":"edition.r017.id-id.draft","target_line_end":64,"target_line_start":62,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[62,64],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ef53e7f8fee74168ac5fbc204f0b876db757547efc4d7535bc314e3a0312b56","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-014","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"adc1f251a3e3154e78e5e4c58e9f73c301c2ccfe93c7adf148944991f786c261","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":66,"source_line_start":65,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"03567084382d49c612d64b9b1185ee58f25f0d2c14c77ddc6f8deba048e8bf19","target_edition_id":"edition.r017.id-id.draft","target_line_end":67,"target_line_start":66,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[66,67],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3bcc5756bdcc623d8b54cf98b89a66e4b828eaefecf3edaca1489bdf2c532147","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-015","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"ea6cc478dbdbdffd2cc44b3d1434c59fbaa7276c50eee79f3813f290dc355b79","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":68,"source_line_start":68,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"6a0022bec7477b34e18cd40916c7fc929298f9ec7708f6b05a238262918bfebf","target_edition_id":"edition.r017.id-id.draft","target_line_end":69,"target_line_start":69,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[69,69],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d28a0c5a539a75866cc038d5a97a51ffdd7ce7db7ee27a3469bdb385f2cbf12","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-016","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"b82450d5a874b46c04b7b3b7a99331bb9dd8572c3082a488810c0bbbaeb6929f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":83,"source_line_start":70,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"4a1c469cc3ff7094b2cf12fabd5012c1ecb50e68ba5ddf1474fbee9ff7003dba","target_edition_id":"edition.r017.id-id.draft","target_line_end":84,"target_line_start":71,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[71,84],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d74ecc2162b04f084ac33745e0d67a690c343f1e269c4efb6facb910a0ce8db4","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-017","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"5972b5796f2ab002a44993eb76a06cc4b52e6c093e73540a6c23de6b3bcc76bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":85,"source_line_start":85,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"e8cec17fff4f57b0df3f94ea49f313e01d617e7d9c985134e7bf200f6dea709a","target_edition_id":"edition.r017.id-id.draft","target_line_end":86,"target_line_start":86,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[86,86],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"63e344cfec4e5c295332d4700fce6bc46f63a438365cf5ab16860cbcd8dffc8e","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-018","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"55119f2acd098f681f9719580df8d898ddbf10d440c4f5ebc02c8b6f1725e93c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":88,"source_line_start":87,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"845a8cdf1b9f47e1479bf4be9755934f0e1474fe0ffd53eade4b462198e43eb3","target_edition_id":"edition.r017.id-id.draft","target_line_end":89,"target_line_start":88,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[88,89],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cbf6d75597f72b399fb5a2acec88c0e64df9cb4913d7fe701b51b3a1d6afe7ad","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-019","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"e4e4d9a4698a8f2254cd815ed40866c8744b9372f19e496e4d0900d42587112d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":90,"source_line_start":90,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"37c608d86924068809796724c7a73b747cddd673a2cea29f360af5bf5fee9933","target_edition_id":"edition.r017.id-id.draft","target_line_end":91,"target_line_start":91,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[91,91],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9301b42fa8f048468d22ac0ea4a7ce3db0d8c9df64b4e7997c81e6303ae5c349","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-020","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"5e3ca04977b6be8f33a9715e5ecff5dbf95abba029f9b857a2eba142ae05d584","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":95,"source_line_start":92,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"759061820755b2476702c7e094d1aa22fac59b127a2b2be3bc0330a43083db6b","target_edition_id":"edition.r017.id-id.draft","target_line_end":96,"target_line_start":93,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[93,96],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"077d216d3fc6b60205907ede2b7c862517009809d26ae7f95c6500fe014fabb5","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-021","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"70f90bc6d531d8e857aa260e34966fd8a02dcde48f498b85ef452b4fe29a2b93","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":107,"source_line_start":97,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"c1f547bc8ee05972026b5ddce2686309d6f8c7bc14ac5c1d06fbe204c1d6d6b2","target_edition_id":"edition.r017.id-id.draft","target_line_end":108,"target_line_start":98,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[98,108],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2a5335e37b6ab3fd1943a62a8030ea9c7da5892ba25878b9b077fba7d619132","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-022","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"e7aa5476930bd5e9cd538c45bd84d69e3ef7e361a9490612461db4a2da1a82a2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":109,"source_line_start":109,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"d6105077fc0c060d35ed9aaafb752588fcf116d03014c0c0f428c3b2c36df545","target_edition_id":"edition.r017.id-id.draft","target_line_end":110,"target_line_start":110,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[110,110],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b3f5512a6984aeb4de24256c04f0abbfc377042a1ad45b0d9eb328ab37e70c4d","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-023","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"01c4d3c3992671819a374b630a95c4b23c3048d553325053ce29797db1a08cb3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":111,"source_line_start":111,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"faccabbfba8b9d9d69a39e7cc12a52d9338242d4a4ad5aeddef50d0c6de18c4b","target_edition_id":"edition.r017.id-id.draft","target_line_end":112,"target_line_start":112,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[112,112],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da6f370e8e52a5a6369c29afb581b226d4741f4a18ae1f9d4c23fec7b86dafd0","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-024","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"b571aa64236c3a3e1b4f7daece1db0278b824f6db3d0b7f59edadd13a47a5507","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":115,"source_line_start":113,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"87de4b5d89e7cdbbc14a97938fa31758e6f5af1900214fb6491ac832777aa1a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":116,"target_line_start":114,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[114,116],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"04b875d5260f9b5bc0d14dde5acca2f419208252208d73925469080592bf0ac7","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-025","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"b94887c0f4e194d32a785aa49d258e7d2e4cb16dfc3c37657b349de4c9292f10","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":118,"source_line_start":117,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"084c6fce9bb4d91141a3c5bc5028c8b9bf4ae747ec3bd3e79fdafa33ec048740","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":118,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[118,119],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"03f6b5691056665933a66ac01269786cb2122c34a1963265c8584ecfd5016c66","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-026","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"bfa89dad45bf1fc4ccf2b2a68dcc27683a70e2e873c7eba8576f76ca931c3fe4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":131,"source_line_start":120,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"4b20b3a6730bfdbd677be57e17a9bf5752ad72f10d4dbd668bfdac61c5e623ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":132,"target_line_start":121,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[121,132],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57a7dfaf892e45741065a5d6d10e829589cde901f340dda712cade6ad4a8ae4c","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-027","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"ecb1969884094d25ff6f3b410fc28319ec5084e01d963266ababbc7e87e9860f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":133,"source_line_start":133,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"5e2dc601fdd0a78030a4bf82a7c95e7449a37acc29fa301d8a4c8e063a9470bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":134,"target_line_start":134,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[134,134],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70d364506a12151d742ce98bd706ada0adab5ff133580ce337b4e44bc4bb610b","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-028","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"51dc719e536db4caada4d7872a69700c5bac1fbd1d7790e55ea98cd8b55411c4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":136,"source_line_start":135,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"beca47836fa24761af2baab225418b31115af640cfbe934edeee3cf7c7a47655","target_edition_id":"edition.r017.id-id.draft","target_line_end":137,"target_line_start":136,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[136,137],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b6b444a3b21024b2e6e337892d81b45edbc6b32c86bdad10262b35a1bb3f6880","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-029","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"1bd828439ef6d7b0e2806bbc425984b16397906b3d2034afddd0559bfa5c5a75","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":149,"source_line_start":138,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"1d1ce1594be4cc90157202f4a152b37c93ac9eb08d8296849f6e1de2125fdea3","target_edition_id":"edition.r017.id-id.draft","target_line_end":150,"target_line_start":139,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[139,150],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8075523d01b729094b4f4ab6935354588205558b516722d4b8cb2ed7a8a96ca6","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-030","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"4590513b42bf28ad00015fed00b3e2079d59c043772be7ad48d212a167b61042","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":153,"source_line_start":151,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"84406716371379da975e1d565affca439b7a4b1ed376716350aa4ed708ce7cf3","target_edition_id":"edition.r017.id-id.draft","target_line_end":154,"target_line_start":152,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[152,154],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec9fce8930f979433307f3e983a7c10d6201bd9fb353fa31534fba195080a975","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-031","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"33ae8479999112c0b054e74778f18b1ab36c5ab721936e294915014d25771dc5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":156,"source_line_start":155,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"452e194b3b7876c76abc8faec7393ebc984903c2deabc93f7a40c1efa0d9569d","target_edition_id":"edition.r017.id-id.draft","target_line_end":157,"target_line_start":156,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[156,157],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"98477eff096246cf6be99fe1c8a8d494f8af6293fd55b26f51e7ce6c353d1048","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-032","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"2bf0dd744731b337f1feafa24da402fede6266fa7692f140f213175adbbc1ba3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":168,"source_line_start":158,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"9195caa0faf37e1a389be34c3bdae184fae18401c08779eb5b7bf6a92f9b6b7a","target_edition_id":"edition.r017.id-id.draft","target_line_end":169,"target_line_start":159,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[159,169],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"63c42f35e2e918448a0becff23945af14f4e745b692629fb01e8491ce0ab086b","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-033","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"c75687a39a0b89fcc5545cda7099238b30033fda3a30e94212d8a3f5acf19594","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":174,"source_line_start":170,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"5b1bdfca828a389088845228238b03bb3b64f8a54a4892352776d56e885c3645","target_edition_id":"edition.r017.id-id.draft","target_line_end":175,"target_line_start":171,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[171,175],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7b0625f6d3abb9b623686f9ceea784279a18aebe193681874fd13402d7588aa8","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-034","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"ca74331631b80ef4855076801a936ece14cedc20d1b1f745f41657bce58c1a4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":177,"source_line_start":176,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"f82225891b990a83d68e441bfc41125c13ce295f28fc85b343fbe4ea11919d24","target_edition_id":"edition.r017.id-id.draft","target_line_end":178,"target_line_start":177,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[177,178],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a85a79b193d5db8b3cf97a430ab7ae9db68e22025207a7d93404498f86b3b6f","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-035","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"c4ae76ad15c8733c043695cac313e7343a1a527c458e767e52ee13c5d1d7cb5f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":183,"source_line_start":179,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"bbe37f5a5a584b1882f13fb70c845816f37c96a0755c4ce576db6348b784ecad","target_edition_id":"edition.r017.id-id.draft","target_line_end":184,"target_line_start":180,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[180,184],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9555c5fd7b923b9f98b289455ed24c7fdee67a852df8d8985d3c653eacb15edc","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-036","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"822ea35583c311cddee75fab25e3b57a76c33dd5b684c6653c6a2578785f2aef","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":185,"source_line_start":185,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"f5f3c712e175ca2f9a3720062cca591ed4260f96ba4882fd42853bdb1f7d3113","target_edition_id":"edition.r017.id-id.draft","target_line_end":186,"target_line_start":186,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[186,186],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c29f2bca4628b293d920e0b57862c69ae4ba258a642af7cf05378a6680c32d55","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-037","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"6dac990afe3a9dd621935d3dead637f48967fb5ef16ec01a960d371267601c2a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":191,"source_line_start":187,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"def3709947c3a6d758675503e5dd2a09b91bb51f4127f76bc79953744c7b1b36","target_edition_id":"edition.r017.id-id.draft","target_line_end":192,"target_line_start":188,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[188,192],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3600dbd9918e3fc9b34042b57c17a589dedd3f84f66f1ca74aa6f495163891bb","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-038","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"0fd7616f8e3ef6e430791154db664afe9be49a103fc0f3d995b0faa619d97719","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":194,"source_line_start":193,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"1971281f066922cafc3f3a49834634dee8d449b8377760f842229ae15f96c1ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":195,"target_line_start":194,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[194,195],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5a53753c52c15039cfc1b8f78169ed9b8576a34551c3a5612a1403dec2598c2","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-039","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"04231cd8c35566928d7a7ef94a350764e2e3251245493fad0b8c1f9e4bbd3067","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":200,"source_line_start":196,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"89826dedd8b258a22d406142eb302eda1f673db6efe04483e51a8695031e3a58","target_edition_id":"edition.r017.id-id.draft","target_line_end":201,"target_line_start":197,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[197,201],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8ad04daec73704e03c31f17265fe3041d55d8d5a1aa1e1e8d572b98348741b3e","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-040","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"f2d4aea1f9444fef6f461496bfeeccc8f246819a939432b0a489d8285320234f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":202,"source_line_start":202,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"15f116569c2313d7ea5000c31d3606c03719e4a614b24a2fe338acd6893acbc3","target_edition_id":"edition.r017.id-id.draft","target_line_end":203,"target_line_start":203,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[203,203],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4aad3d510a3bc5df053bc82e78f3550ab66b5158741ac429f0b00e37db316120","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-041","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"84957bd4d033bde86593675e252e89242ddbe5069d8fcfd39612d7b157573ac3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":208,"source_line_start":204,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"a553aa3c7661a227e2fff0b4f902ddc7aa0b537e4a89f7206eb96b0fcf49f868","target_edition_id":"edition.r017.id-id.draft","target_line_end":209,"target_line_start":205,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[205,209],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"45b95c2083df8a4dfce96b99d125f75fac997f163f3f77f35df80cafe452ef44","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-042","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"852000716c73b3dc6ae85d88c8c365efad173cbe8459d075771cef1743a2ab69","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":211,"source_line_start":210,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"b51f417e29c9a56219eab3b53cd046f010820cdf26e1f6100e2e8bbb455ab2eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":212,"target_line_start":211,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[211,212],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6181de7b1617106864a17e53ad6fe88038109297df5195621973c8acc6ab039","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-043","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"4066ad3a866027e8029e63ec098c2e6b0a5597978250f2a7a5065198fcf1aaa7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":217,"source_line_start":213,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"0ccc283a0557603a5a0eeaf4ee477624c4e98ef1a0cc9019301009b6820e85cf","target_edition_id":"edition.r017.id-id.draft","target_line_end":218,"target_line_start":214,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[214,218],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"046a6d9da2f007514f361a20bd890676fa608313c5b19749843395f1932c35eb","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-044","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"1123a5f264c8e89cdef2fdd0bf611ad23fc5eddb11c4f7ecd28a5ac70eb81267","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":219,"source_line_start":219,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"a279957001337c9c5351998e227409af714702f5cdb9baac36ce850f92a40092","target_edition_id":"edition.r017.id-id.draft","target_line_end":220,"target_line_start":220,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[220,220],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c1e2d62affadd1748d978f942f9e2124eaddc1a044362599738f1eb030f8bba2","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-045","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"bf3cb2b4878f8504f9fe7446aee48857f134b5fcfb1fa2fdca547bbb0345af7a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":221,"source_line_start":221,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"9b4c9ca22c98f971b31a3a35e19f60e047f8c41857814030fe481821baf9057e","target_edition_id":"edition.r017.id-id.draft","target_line_end":222,"target_line_start":222,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[222,222],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3fb7cd0d92acd59a2db3e77da556ff30c919b92ee94cba6e7f6ad764b7b6b696","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-046","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"3cf4f1afd2238a6a7b7b6281a583bc54c8e5e00e3b1c7cbd543c924f26274199","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":224,"source_line_start":223,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"417aa7e81ca20e626dd2c69112324a01b1ca15c108d45967f140fc69252803f2","target_edition_id":"edition.r017.id-id.draft","target_line_end":225,"target_line_start":224,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[224,225],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc69c4ab0da4f1d7ad12aceeb993de4547fee42343e77dd683f42f749e3f6b9f","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-047","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"5e7c58bc95d6770684610d4f9dbed361f7b6e041b1a9d8cc5d389f8f6dfd5f08","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":226,"source_line_start":226,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"120843ea42bd760f22425103aee2ece06edc72fad47ab30c72d4b47f2d3d7624","target_edition_id":"edition.r017.id-id.draft","target_line_end":227,"target_line_start":227,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[227,227],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b3ec755b6a720a649982cd248607258e575040466e510ab9c7802c974441c19","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-048","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"b9f7274ea12961d8dc4aa2c71a6fe15c8eb5604fa958570d765c4f3a27e2ff61","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":228,"source_line_start":228,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"48feb4531a2b250bf8b700e373066ac56be733b9ffbcc839517682bdfd5d0b11","target_edition_id":"edition.r017.id-id.draft","target_line_end":229,"target_line_start":229,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[229,229],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ab25b606482b0b4e60ac5ae3c6785d2e7810db36a695988de5428fd89f696b4","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-049","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"f3c2e6bb24afebfd6c688f09ed7219b4784bc15bcda855b725c26fdf59bddc91","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":230,"source_line_start":230,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"145d502ba4702cbb571472ae3ff1801642921ad19dc1ace7102cc41a8526f904","target_edition_id":"edition.r017.id-id.draft","target_line_end":231,"target_line_start":231,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[231,231],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ebd7dbb35c2cd75abd2ffd6e97f1e02c93bc4ce9d35a17444970e746b660034c","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-050","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"5603c1722f945f4a702b085ba66bd2b891dd6c47b681594bf79f8afaad9770c9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":233,"source_line_start":232,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"dbe1a55a0a92eb67a50633efac57efe547c57938e72c28fac1a93d68996f3917","target_edition_id":"edition.r017.id-id.draft","target_line_end":234,"target_line_start":233,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[233,234],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f33f13f5a8977bf62085b32ef2a9087ae2ef121eb7075e9f307f978a3dbfef87","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-051","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"c8c787a5f4a821cea18841647a3dd064dd859f547947264878fcad3046478cd4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":235,"source_line_start":235,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"c3b8eb551373fd7f3198cecebbe2f745c16247e3aaa901e66f6ea5b1b41cc8b0","target_edition_id":"edition.r017.id-id.draft","target_line_end":236,"target_line_start":236,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[236,236],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da17773d14b1650f878fe0ba0e68342511633d614a4c2b92238818738d4c2b8d","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-052","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"a5789a6d09f1e6a28629d036134acc96e443531489de12910b3030e42459eb53","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":237,"source_line_start":237,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"d852ccb59ff594ff91f7e86d97441f038f40d3f1b2f1ae8409afe7634505fd22","target_edition_id":"edition.r017.id-id.draft","target_line_end":238,"target_line_start":238,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[238,238],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7fa097c812b1daace4477cc93fac5dfead4877f03829e06cfab6f10d5ae74159","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-053","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"3821bda4570084ab5655aab618624aca2556f8735caa7a9a4035baa36761ae07","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":239,"source_line_start":239,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"57e4de46665d0820c07f846d0f33bbfbe1390c0154591df38fb805aab2bcba9b","target_edition_id":"edition.r017.id-id.draft","target_line_end":240,"target_line_start":240,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[240,240],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b7576b59a07df4514680fd5869c230ee67a5f685eb7ac027c4d8e7057ff27fc","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-054","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"b6a662d57819ab2cadb5bbc00dff57420e3e754f0b1b60f1fed33c40634a09d1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":242,"source_line_start":241,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"560a50bcb6157515c4e94c61fdb6cca54be649f98ea1079ed8c50df663b72230","target_edition_id":"edition.r017.id-id.draft","target_line_end":243,"target_line_start":242,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[242,243],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb7628dcf2d39912b4ca2b6a725c1ad9f7c79f0be88515dd257fe811882c25c2","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-055","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"442d9ec62ae8a1ad51a1c7fc432da284500a76c6926d275ac3f6d6e49ee54cfc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":244,"source_line_start":244,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"a8f3939c77dbe97ad20809c3313abfb1a378cf4499f55b1bc4249a3e62aa50ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":245,"target_line_start":245,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[245,245],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"99c4ff522c06a946817249ed81a70412a28fc786a0a562f9e45542b8ebd17044","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-056","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"3c5a2ee30535cfa0ff4861119cd79452bd41c64ab7c42ea218882c6952acaeb0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":246,"source_line_start":246,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"9c0797af7cbde7be5e534fb806e8af43321f6eba49c2d24724dd79572268a104","target_edition_id":"edition.r017.id-id.draft","target_line_end":247,"target_line_start":247,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[247,247],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b95d5c137b2a7ddfd5db32f0a02eb076eec2f4d18a40226add22b766b92cbfa4","concept_ids":[],"id":"segment.r017.book1.ch04.solutions-manual.block-057","locale":"mul","parent_id":"unit.r017.book1.ch04.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"ae3f44a15361420a590822eab3f924da0d1acd0f0d547ce8a760a70470997144","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":257,"source_line_start":248,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"f910c9dd54e949d4a5e664744047f20ddb8af22ba6a7f168dafaad404df22dc7","target_edition_id":"edition.r017.id-id.draft","target_line_end":258,"target_line_start":249,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[249,258],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch04.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"721d0216441974eff83fcbdb5aa644af4467ad7c43b6637a3d52d0d09a414b12","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-001","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"90e4e747b1d33600c0aa568ed932bd09e1d5f99f672b3ec2d5c9710aa7080279","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"2bc99964c85cb238e9f4480a9fc9076851e1c58979679be70bfe770782532b9c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88cfba3a4b8a6c5445c141e88c8c8902eb06ee61110983ef69daee1f93d9e9a5","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-002","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"d5f4262c9cd2b82b2c28bc2733fdc54d34004084ae752e6f3d4e20cb62a4fdc0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":9,"source_line_start":3,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"b45864a920211d9e4425f62d41ecc69be4bcf611896b65cdc1ea90bac1162198","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":3,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3,9],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"34a01fd4c4d0a0f31d8ce65082bdcad68114680a706a6ebadc19430c80ebc93b","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-003","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"6f7144b81bf9796c4470daf7d77b957a5df7a1c7e9cdd068c7dbb9bb7ecfa755","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":13,"source_line_start":11,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"b9662326a4a4d175782cbc382f6cd8435d974c757ecc5c88f9c46ad6217467cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":13,"target_line_start":11,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[11,13],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c4b8f49aefbfb2d53536e8876dfa7fd291c5bdd6d195d61542752f73b5b68052","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-004","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"c7ad9e77443aeaba625c5314589cabc0766f97c6d31082755ee74ed485d2b6d7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":15,"source_line_start":15,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"5a8046dc2ced942815a85a73b1f975a837df69337dc9acb546440020ce132286","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":15,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[15,15],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4fbd17ad49de711ba8edac840085f7ff04635c1eac085c039a824ae354fa2a1","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-005","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"64b415e53813bdd8daeae112982e46673c9eb5066467656a4e63473bb1d69a36","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":21,"source_line_start":17,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"e4f88d7df1e7e80d3598aafafef20328009deaa6bff910c34a2a4df9f54d77d2","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":17,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[17,21],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4029d1b4b0691ec624630fce9c622d28e21c9138dd3e2479c3f0429fa9ae1ced","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-006","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"a7c8e0ef343839ebfc8e2dbcd71e39cfe352cbdf89691d7ccdaf93c5259401f8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":31,"source_line_start":23,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"232ea0b813c5999edc81777cbe3fbf8dbeb8e42979379fd1fe6ca035aa7ee8f7","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":23,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[23,31],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e26d4518072abb34b5c443e1ba8f21fd2c568e7bc6e1847383879ea7db28472","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-007","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"1896d3000d770b30b621d667be694ae1fa709f88090e32a499c951eb899a1935","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":45,"source_line_start":33,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"9bfb0f8d2d8dea0a93534e7837faf96857a9a00677ea06129cc18f123a031998","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":33,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[33,45],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4945381641095e9238798cc99da6215d7db8d384d1569a42d2f20d3aadd7c09d","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-008","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"d87d55806d3614e913309b8db637829dcfcc18238d58fea36ee60e3b9c6a1c84","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":47,"source_line_start":47,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"3aebe1ca142823e34c680635c17be4c64a28af4c2452b2b0703c8833ee07ed09","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":47,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[47,47],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a1bcfc2e4f65bee0ea9062c27cd8e724653f827838de9f9837844d0158a2b32d","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-009","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"8a527dd3dc81d7fb448c025b6aeccc6a93eabcbed6d853c718fe877dd7e93e2d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":49,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"b4c52ce90cf365dfea6be5d7b18a461ce10ec35650e675d19a824e0ab03666a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":49,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[49,49],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64f293012bda1842e01088f8fdc7e02af73fbda31e3f5965f5cbbde6ee699d20","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-010","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"34ac160e5041de93984945ff5aace4f4f69837cec10cee4c643a99202692b084","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":51,"source_line_start":51,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"9e28343160641fd8bb1679ee6a8c204f8cbb1e2ccb5b86e4f61b774447c2bd99","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":51,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[51,51],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d34f38301ed14a83554e3450a777417644bc67c547c7ac00365632904d7fd5b","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-011","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"487935d4c22681bfbfa315757c00299d5e937cf281d910f52567ce1b6a6a79b9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":62,"source_line_start":53,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"1a2a8d0c7f216bbd5ec4aef298fff8a1e1ef82a64ce8ac9a3c5eb1f0972a4604","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":53,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[53,62],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6038678524c9c2d874d208923d060a26cbf9f776d333cfe93db05cb90b66d94a","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-012","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"1ea56da9b485f9138ae9d8372c173bf2dda2278a4552b8bdb536054f31f2e9de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":72,"source_line_start":64,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"6c40f73eb65c4832ccea9102c109ac28a13c142e4acfa0b7731d71570396f55b","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":64,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[64,72],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6fa1a13ff9543f3d66971f1d47a5af9c47a30af03b51df7b0cf5718e9fe9676a","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-013","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"0fcf6bf8ef1f36ff02d203ed10a3e92401c8b2c6bc15ef6ca1b2d506013a2d5e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":78,"source_line_start":74,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"36d2694fbf03bd18112a5e0f848324f1c60c783471be7adcf72b5ba265c87f4e","target_edition_id":"edition.r017.id-id.draft","target_line_end":78,"target_line_start":74,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[74,78],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d8a8cdb8086b4fd16c8038329eba1f9119089d31de933b81302ed263cf57fdf7","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-014","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"1ba7d93f9e030cbc85dd138e564b117f9955e1fbe9ad5fafc819a277bb064f7c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":87,"source_line_start":80,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"368113c65985a46776c2c52057f47f19f061b022b86d5cc8af7bc651e66785c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":87,"target_line_start":80,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[80,87],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d1921847d280a02001a5e5ceff721cd68fec518bb0243721e19dadd77e2cd182","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-015","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"1bacfae727d21e5bf8afe97efd13af63cb8f99102b029fcc69b30738ca437807","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":94,"source_line_start":89,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"0c84514d647c30efca4106fb2573a4efc48cb3df70f4eb5c7b0ba5e10c111e15","target_edition_id":"edition.r017.id-id.draft","target_line_end":94,"target_line_start":89,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[89,94],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61f5af1941add53f1f7d636253d73e9e964bc4f82a1a69886ac83a5fb837d881","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-016","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"622cb647a3b6559c5ecfd2ef31d93ef9f2036b4822df0011503b4159209f0a49","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":102,"source_line_start":96,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"ae51d8b8c35a6008c7a03ea2009908578ddcbd7c22a960e76519fbb3ba22adc8","target_edition_id":"edition.r017.id-id.draft","target_line_end":102,"target_line_start":96,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[96,102],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d2667173de2685c683108974577d5a4c6724411a311b4755c0b2645af7db7c8b","concept_ids":["concept.compact-indexed-modeling","concept.inventory-balance","concept.production-planning","concept.summation-notation"],"id":"segment.r017.book1.ch04.text-a.block-017","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.inventory-balance","concept.linear-programming","concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"6710e2c1a6eed84636100bc59e56c9e20f04d8078090f68e670f23a0aaae13d9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":105,"source_line_start":104,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"49dedca9fff4c5e038f9855d47d076812f140a035e3ffecdc003813a33acf2c5","target_edition_id":"edition.r017.id-id.draft","target_line_end":105,"target_line_start":104,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[104,105],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7572ad2de7cccf90209c7d82963f41e2d1e73ae6caf067a52f312116be4338e9","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-018","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"aaa3fcc1d1564d23a6cc022bf1b1eed30bc330ce564d4273f880014a5546896b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":107,"source_line_start":107,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"cbeb4b5805e71a6786c9818942fade1c97d72fedc9e7dd3ad69b8be682cce9e3","target_edition_id":"edition.r017.id-id.draft","target_line_end":107,"target_line_start":107,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[107,107],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bc9d8850871b83520dee567719b9da856b214bca2deeda2e2bdf218858513d9d","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-019","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"f0a9af4f25bdf6a848186a433d6d45ef58ea4bdd6f1a7302e9e2891d0141a09b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":116,"source_line_start":109,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"f0a9af4f25bdf6a848186a433d6d45ef58ea4bdd6f1a7302e9e2891d0141a09b","target_edition_id":"edition.r017.id-id.draft","target_line_end":116,"target_line_start":109,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[109,116],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"edb7d598fc071a97fdc2ab8d32f6fc081396bca08a9166d1e7f14735f31ac15f","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-020","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"bbf495c5c31023e2de1fa8ba01451047c3b0d0d1ed0cddc33c8a3a21f7699313","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":123,"source_line_start":118,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"bbf495c5c31023e2de1fa8ba01451047c3b0d0d1ed0cddc33c8a3a21f7699313","target_edition_id":"edition.r017.id-id.draft","target_line_end":123,"target_line_start":118,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[118,123],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"928098e349db105accc4d74239644ce3db5eef9d1b2652576445bf9aa44d04c4","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-021","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"4850c9246c112432db2619e083d9f27e3e55e60a47d36225ab6c4a2807daac58","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":136,"source_line_start":125,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"4850c9246c112432db2619e083d9f27e3e55e60a47d36225ab6c4a2807daac58","target_edition_id":"edition.r017.id-id.draft","target_line_end":136,"target_line_start":125,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[125,136],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"626571b9a71da4bcaec4fdeeece9eb79793d6315fd11191a1edc7f285a7291b6","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-022","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"4a32582c93f37ee58aaedb4f69dfaac370c63b5c674fba22af52cb3a42fb14c2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":140,"source_line_start":138,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"4a32582c93f37ee58aaedb4f69dfaac370c63b5c674fba22af52cb3a42fb14c2","target_edition_id":"edition.r017.id-id.draft","target_line_end":140,"target_line_start":138,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[138,140],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b37b537afaba00e9c20553a8f9abf0e3cbd5d1326d97fefc197d5054886ac2ed","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-023","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"df50d8b83d02b7368629c735f0cd24884985c1c5c780be94df0eb731abaf075b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":147,"source_line_start":142,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"0674985bc88e52310bdbee2b193d58253743beb2281c3d2f907190fd90da00e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":147,"target_line_start":142,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[142,147],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"89f6fe7bf888161ff568437d0e2a5edba6315e109cfb7284667f204e85452a88","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-024","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"568e6cd4a06aebaf0995db75e76158cc7c61e6059cf13ecbff6b17bf6edd7a6c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":149,"source_line_start":149,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"bc70c971428819235d50b682aa5dcce8397eb9b32456bfe4996605c911a63e10","target_edition_id":"edition.r017.id-id.draft","target_line_end":149,"target_line_start":149,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[149,149],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d735a2abb9538b74942756c0827d0570ebd96826782dd404e9d0847becbc8a4c","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-025","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":151,"source_line_start":151,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":151,"target_line_start":151,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[151,151],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c132ed48a20896fc4a9fefc8f779936f34864308907767be8b0c95ec380e3a9c","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-026","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"efd66cf172dfcdcd06eafb95828697cf474b4e85f2057319fa4b808edb3fa437","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":156,"source_line_start":153,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"c35159c5e87bce5f80ca43442eecf3e0da9eb63446be286054dab2e8e445ef79","target_edition_id":"edition.r017.id-id.draft","target_line_end":156,"target_line_start":153,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[153,156],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c59d8fe81e618dda6a43aa294a4c1f5c0e40f03faeba0aea792cf8ce2ce25da3","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-027","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"26c533918f58f87121827dc350e169e664e523ae91a30cf8316ef8c60bff9027","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":164,"source_line_start":158,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"1fe8afc7b58756ebdb2e2d6ac3bf5b43ff2a8ebb71a0f5338fd51a09def57b49","target_edition_id":"edition.r017.id-id.draft","target_line_end":164,"target_line_start":158,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[158,164],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"db93a64e5c95f95370ed256d4b89a6dccb6869a993a8f8c16791442176a24228","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-028","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"4405fba741f760c0a1effc197589c6902cef5e214cf3e9d7e43b4a751459ee43","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":170,"source_line_start":166,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"ae5e22a2c3fdaa7edd58d15cf81c5ccb6bafc11fc963efbaf93b49847f611717","target_edition_id":"edition.r017.id-id.draft","target_line_end":170,"target_line_start":166,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[166,170],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8011927697d2838ea6272fb305f4cd10f61e6cd89333266a43ff6b38ffc4bf48","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-029","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"14302eb511023edb6e58ed89cb569f1be1a870987161a8e7fb941d5961642576","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":178,"source_line_start":172,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"c29a69ebe5bd509d6db9cbc2cc49d8f1679e2d0a6ba3725afdf3fcf62bd73861","target_edition_id":"edition.r017.id-id.draft","target_line_end":178,"target_line_start":172,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[172,178],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"62fa22b8a6bd442125619b70d28d90ccb8a0b8264c1e3fccb3411d6b7cd4a7f8","concept_ids":["concept.inventory-balance","concept.production-planning","concept.spreadsheet-modeling"],"id":"segment.r017.book1.ch04.text-a.block-030","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.inventory-balance","concept.linear-programming","concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"e897140ff50798565fd08978b1ae175887aea61784e3776e3c71488a3d3adaa1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":184,"source_line_start":180,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"fb75eceeddeab1fcaa1ec35c609f75da178a71bf57e263adc493df46ee3bdb3d","target_edition_id":"edition.r017.id-id.draft","target_line_end":184,"target_line_start":180,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[180,184],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37abdf985c50092af224c6d691c2d3f601f7a928572ee3616026bb0af7cd82a2","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-031","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"d1c185d97ac4e27e90cc82bbf26fc8e3c8182e39639f1aa8ba935fe41848b510","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":189,"source_line_start":186,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"de15868196b38e9d67c06212f3906d9f7a29b3a802fa0f35d55a3b06bd0bda60","target_edition_id":"edition.r017.id-id.draft","target_line_end":189,"target_line_start":186,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[186,189],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e55e3cd13bcb165b1ce7ca00f003c46c779f805c10701cf8aba0107943bf41e","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-032","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"763a631059bd9da2167642f95a8386b8d9ca606bc0d9849526b4ea4e6a4f599b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":201,"source_line_start":191,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"4d77c5acd906da7dd9e222c8238d66dea54b6836fb1bc748c7ee999a88056f96","target_edition_id":"edition.r017.id-id.draft","target_line_end":201,"target_line_start":191,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[191,201],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"78f8ea8d11ca0a8912908d1ac0f195c09bca92a21dd60586fff29868f9b4e94f","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-033","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":203,"source_line_start":203,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":203,"target_line_start":203,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[203,203],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c0380ae1e4d3c3d2544c3c6fa1294e5f515ed272db616d3366b56476aa7d016f","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-034","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"2e442dbcc2585b3da996a737fc6009aced6873c33c9cc17e74274e637702c731","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":208,"source_line_start":205,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"b4b7bd4ad132275157a5d396c0e4ae6946126c3523c316af7ca8c00f092170f3","target_edition_id":"edition.r017.id-id.draft","target_line_end":208,"target_line_start":205,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[205,208],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7437a589694b8e11e804741321776ae6ab8052399988cf9d6426290222d83dfd","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-035","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"4405fba741f760c0a1effc197589c6902cef5e214cf3e9d7e43b4a751459ee43","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":214,"source_line_start":210,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"ae5e22a2c3fdaa7edd58d15cf81c5ccb6bafc11fc963efbaf93b49847f611717","target_edition_id":"edition.r017.id-id.draft","target_line_end":214,"target_line_start":210,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[210,214],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"99bfaaa0dd2fc5faa0a3dc73faa78d8604a925af01f20f8414703c706eb3ee28","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-036","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"0a8a3ed49820bb81f2a7fde1dc9ab286bff588706413def7394fe406fdf62760","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":232,"source_line_start":216,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"99e2aee5035a474b07325726c8b8d37baf5401f20c384b029729d3a56f90d753","target_edition_id":"edition.r017.id-id.draft","target_line_end":232,"target_line_start":216,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[216,232],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d4d4f945663b88e6a5ca5aa712627e768c79a9c3830da536deb80ecbe188517b","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-037","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"fbc178f98ecf6b0a59fb67b442c17a5ddd6633549bba43e32ce73c752f0dfed6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":234,"source_line_start":234,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"634193e1543f6903845887a092f2c09d54b824df4d1b66563e227635043461db","target_edition_id":"edition.r017.id-id.draft","target_line_end":234,"target_line_start":234,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[234,234],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5335a4838e3d6e623fe9420713d9c4b08c5a380aa5c01112d6dd53b5f2cc04be","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-038","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"dc495631ade2e8deb5ad33c0107d4053319d33181bf4bc17585003c0351bac5b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":241,"source_line_start":236,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"6247ed6fbdb8bfa307531301ec8334eeb83b503705e1e1edf04a06e8888fe18a","target_edition_id":"edition.r017.id-id.draft","target_line_end":241,"target_line_start":236,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[236,241],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"216baaa2258c5d24911fce5df785099ece548e65ea6aec8c39c8ab49827e2f84","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-039","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"689c228cce4b2ce23bd1b44a02ba88924a5c00e4c8cea394342b72616e11bc09","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":243,"source_line_start":243,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"30768d7704b064b0f348d9b5628b793b53f4e45f0a41039341dbd2a8bd4ecaef","target_edition_id":"edition.r017.id-id.draft","target_line_end":243,"target_line_start":243,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[243,243],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88bf592f9a0e541fb59f9b17955fd3267dab1fe669cba6acda855b801e65b76e","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-040","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":245,"source_line_start":245,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":245,"target_line_start":245,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[245,245],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"21db534c80e2f910825e4d31c589447e5d101c5e8422037b40f977c4e733ab4d","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-041","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"f1cbde53b5e566a105ebf7609af2ef6abda0f4c65d58b09ffb347fda7e2d2bb0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":250,"source_line_start":247,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"2018420bc98f4d397efb9f8a7675f69af70220e77246615fff8a297a3b0bf3ef","target_edition_id":"edition.r017.id-id.draft","target_line_end":250,"target_line_start":247,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[247,250],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d84df729d0e04ef0de274ef13cd8822a90af3e8eb201a76f572e29f7dc6467e3","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-042","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"90b4fe56d149e979232f2c958d5ad7ce8b6042dee170fc0f533bfd47adf83c97","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":259,"source_line_start":252,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"e1b95a7611397709adfb154924c722b6e9091a295e66b6116340b5c292f592c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":259,"target_line_start":252,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[252,259],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b90c18d771e33d0f14ff4ecc226174e0871ffb614f1132a67b376f6207dd0be8","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-043","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"f2f8eaffa82fb1df9a8e22f657240dcf19e14d3f5761ea74f0cdd9876b159be7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":266,"source_line_start":261,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"ce25d41d7e665be5778153d6841074a4bb499b4de0cf5431148a41870fde259f","target_edition_id":"edition.r017.id-id.draft","target_line_end":266,"target_line_start":261,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[261,266],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"728e385baccb2309967e0ad90019ce40a1f7402547f48509c29a9af5d3dc85c6","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-044","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"53cf2f989c45a91dc0556298eb2b6d37b532612de6de03a6a42c41f7f3ebf1b4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":274,"source_line_start":268,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"bc79fdecb53dfd8e658d142e68897200356ef1d20f236bfaaee306980a4db79b","target_edition_id":"edition.r017.id-id.draft","target_line_end":274,"target_line_start":268,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[268,274],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"25d026d86d2fa31d7db232c0fec8906dac76077749fd7196a030a85d86dbf6c6","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-045","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"94f4686f566188d767448955bddafefa7e745781d7afdfafcfed07fd7232deeb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":276,"source_line_start":276,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"94f4686f566188d767448955bddafefa7e745781d7afdfafcfed07fd7232deeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":276,"target_line_start":276,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[276,276],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02dde436d49c50dac9cfa0811d781c0ab790ffdcc8f516a259dde8b9a338e0cb","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-046","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"1935d85ee69cf0a71bff40645b1a355b40041c1e46ccf12e050d5b390e9f3a83","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":281,"source_line_start":278,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"1091267510e1a2f363ef7dbeb6e616b7fe6524c0e3f122dde302e444b1b90461","target_edition_id":"edition.r017.id-id.draft","target_line_end":281,"target_line_start":278,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[278,281],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a57943b3cc24e8bafa652b2723e9ec0193cd555f2024501440ec6369d35adb4","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-047","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"1717fe38b159ad218927932d3bf04acde9b7fcb16cd63078513dbae5da746a43","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":283,"source_line_start":283,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"aa6051ac8e2b7b620b48d52e9661666a462181ef93a31572a9b9130fd1ddf914","target_edition_id":"edition.r017.id-id.draft","target_line_end":283,"target_line_start":283,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[283,283],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5eb902c06a228a326743e6ae90dd47bee09aab906fd65d4e651d368921163f66","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-048","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"b6e83a31b5b0999c77ccdebb109fc87882fccabe26f43e638d098d753beb627e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":285,"source_line_start":285,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"b6e83a31b5b0999c77ccdebb109fc87882fccabe26f43e638d098d753beb627e","target_edition_id":"edition.r017.id-id.draft","target_line_end":285,"target_line_start":285,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[285,285],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ea604709488f580c152e5280cfc45a80a6fde59c7bf50a75beea467ff3b213d8","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-049","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"40018a74354f5d9bcc64c9295ed34aea26dec169f81deff450ea204dd24ad51e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":299,"source_line_start":287,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"f1574c109a46f35fdf32ab883882d4aac3654dfaab17c36f4063f76f29e00084","target_edition_id":"edition.r017.id-id.draft","target_line_end":299,"target_line_start":287,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[287,299],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c08ce77f43cb67e0d0bc5511d73b38ccd3ce30c86738168ddedffb7212996c81","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-050","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"ecf18934fb04be775a009d11516712abd9e4ebb5e9c9945ae0935c91cd0ba0d1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":305,"source_line_start":301,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"1e4d2f7d2cf8bd4efc2ea46b8c39b4244b71484fb2c97d27ed42c0a9cca4342e","target_edition_id":"edition.r017.id-id.draft","target_line_end":305,"target_line_start":301,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[301,305],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6079dd13b1ff7481e87959878661747fbb2abc9060395528088781866470a91e","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-051","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"1ee44c3f2951eeeec41ec71536a2b59c1ebdf9c5989767f6a9d537014fb25a8b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":312,"source_line_start":307,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"37e414066f3508f4127c33fcdf5a173e0e7c1f1cee826a15361d17521736e6e5","target_edition_id":"edition.r017.id-id.draft","target_line_end":312,"target_line_start":307,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[307,312],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a52f058af4b22bcebc4cff3115617d951b08f98f9937fa6d5794e8231dac6724","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-052","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"b7e819e60571b25ac83a49b177b68e3f32ce7081a8a45f415d864bf8298116c8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":337,"source_line_start":314,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"485fb0b65507cb8558e9ffb40ea9b7f66cdc16043269d1154f52b3ab84467789","target_edition_id":"edition.r017.id-id.draft","target_line_end":337,"target_line_start":314,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[314,337],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"50bf3d7ac7e6f3328f63a9382a88bc5bb4d75874ee06dfbe618bd216384e8cda","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-053","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"0ea4b75dd643966220c11ba9a7cf3ad54087d406d99316752824166bf39a38ac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":339,"source_line_start":339,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"2cfdb2b51cb2e09dea7835006983f8b4739c797a46c9fe5679a461331df430a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":339,"target_line_start":339,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[339,339],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18158f9fcf5edb1139eaa07ce1a365304d7cfbc3f01febb6f32d3a1283570dc2","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-054","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"47b5761ba87d8a00260a213c6943542ce10ab8ac821954c9894cbd9751babe06","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":341,"source_line_start":341,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"47b5761ba87d8a00260a213c6943542ce10ab8ac821954c9894cbd9751babe06","target_edition_id":"edition.r017.id-id.draft","target_line_end":341,"target_line_start":341,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[341,341],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7aa2fa2610168159d7140a66661a53bb42a8c937b6ac2ddbca8cc542cd76cc09","concept_ids":["concept.assignment-model","concept.integer-linear-programming","concept.total-unimodularity"],"id":"segment.r017.book1.ch04.text-a.block-055","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":["concept.assignment-model","concept.binary-integer-programming","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"6a2dc246cf55e305d4b32a13480b2ffe551b7bbd3f8250ea773b35ee875563c1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":345,"source_line_start":343,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"848a53c7ac02982415a8aa34ecdedf5be249303221d7e38e2490341442c92bd9","target_edition_id":"edition.r017.id-id.draft","target_line_end":345,"target_line_start":343,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[343,345],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c62f3d925649bb23cd032a8033974e50f1f57f54ecb6be79b8ee594c6d4ffbc4","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-056","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"2bfa8217e91521294cc0ec2754ff77e56297aae42c574f69413f03da83927e64","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":351,"source_line_start":347,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"2bfa8217e91521294cc0ec2754ff77e56297aae42c574f69413f03da83927e64","target_edition_id":"edition.r017.id-id.draft","target_line_end":351,"target_line_start":347,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[347,351],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"44a6fb87594fb7bcda3496cb456ad230dc1383f98998667f815764e5f1ac9604","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-057","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"b68527b927f2d3c9652e14365b89eeb6aac713bb022811b6b17b493577dd78f9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":362,"source_line_start":353,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"b68527b927f2d3c9652e14365b89eeb6aac713bb022811b6b17b493577dd78f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":362,"target_line_start":353,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[353,362],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5a2d1433411be79e3ab9de57c384b3db6b6b7b276fcf06dfcb132f456d98ac48","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-058","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":58,"source_content_sha256":"41a99ce8d6cc5cafa858adc98c7b9d3a374bb3a55417fd1398785c1221c5d13b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":372,"source_line_start":364,"source_local_id":"block-058","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"41a99ce8d6cc5cafa858adc98c7b9d3a374bb3a55417fd1398785c1221c5d13b","target_edition_id":"edition.r017.id-id.draft","target_line_end":372,"target_line_start":364,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[364,372],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"27b9a2e072e50095142a116f49148cb5b3c54b2bb8d68a331ebd51c05f4b31c7","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-059","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":59,"source_content_sha256":"27da85be43d6c60ae91c88be94be9b64be0e5636810fa0c15962b153e9d9d20c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":382,"source_line_start":374,"source_local_id":"block-059","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"27da85be43d6c60ae91c88be94be9b64be0e5636810fa0c15962b153e9d9d20c","target_edition_id":"edition.r017.id-id.draft","target_line_end":382,"target_line_start":374,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[374,382],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"765dd535da5300cc8af4c5441d75e34d98dbd59e64d20e11ce5dedb84f18db92","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-060","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":60,"source_content_sha256":"7a27647eed9ba82a01208b7622902ed256fc62a181c40934fea872ca3469e923","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":392,"source_line_start":384,"source_local_id":"block-060","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"7a27647eed9ba82a01208b7622902ed256fc62a181c40934fea872ca3469e923","target_edition_id":"edition.r017.id-id.draft","target_line_end":392,"target_line_start":384,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[384,392],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3973520d4f2b28d390438c75a87ed0de6a7fe2c92a30c20befaf50a9ffc70596","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-061","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":61,"source_content_sha256":"fe33d814cfbcd081d5796ad9e2000441cf41e0ff9dedc972a97248507d8519f9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":401,"source_line_start":394,"source_local_id":"block-061","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"fe33d814cfbcd081d5796ad9e2000441cf41e0ff9dedc972a97248507d8519f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":401,"target_line_start":394,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[394,401],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76046e1d69a581a91b15be10542863746756567bd79cc60ad4bfe2efef839d3c","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-062","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":62,"source_content_sha256":"a538112943f49026bbb67ddaa17fcb4cc76ce6195fe2e8e7ac247ada591ff2d0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":410,"source_line_start":403,"source_local_id":"block-062","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":62,"target_content_sha256":"a538112943f49026bbb67ddaa17fcb4cc76ce6195fe2e8e7ac247ada591ff2d0","target_edition_id":"edition.r017.id-id.draft","target_line_end":410,"target_line_start":403,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[403,410],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0fd4da76be6df4761d59c5b2bfcd7dd0312f027c504ec5db0c74f55d2e1f66e7","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-063","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":63,"source_content_sha256":"292f4fd79b689ac34cdd08e29510955ba3b44eecee4bf5f15d79d767d618c867","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":417,"source_line_start":412,"source_local_id":"block-063","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":63,"target_content_sha256":"292f4fd79b689ac34cdd08e29510955ba3b44eecee4bf5f15d79d767d618c867","target_edition_id":"edition.r017.id-id.draft","target_line_end":417,"target_line_start":412,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[412,417],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"059c7336cbd9f8b7c2c12952c762447461276dd923c878933b3fbabf9be2e468","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-064","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":64,"source_content_sha256":"14413380cdd37c559f7c1c35f2ece200ff03086603e42764d59aa1714686ed28","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":419,"source_line_start":419,"source_local_id":"block-064","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":64,"target_content_sha256":"01264d6c545a27f82732c0683b8af8e17fccce6099123de1b4d1826c043aa5a3","target_edition_id":"edition.r017.id-id.draft","target_line_end":419,"target_line_start":419,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[419,419],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"87cc918ab041e6d8751116dd4b5d85bfae359e5d1ee6eb5d1d631caf22db41cb","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-065","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":65,"source_content_sha256":"44a8d0ae908e10a5f43f5c3ce85b7e03bbbfd7bd07d023c9a2dfd1600cc3d4a5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":427,"source_line_start":422,"source_local_id":"block-065","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":65,"target_content_sha256":"ca1ec9481aa5facd2772730d7ed4769ed2568bf6e30c119a58cc50d7b2f8d928","target_edition_id":"edition.r017.id-id.draft","target_line_end":427,"target_line_start":422,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[422,427],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00d7e21f0334b47f844574f1c38bd53d0e7d69ac66cf156c67ec6cdc98a70c36","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-066","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":66,"source_content_sha256":"7965ba645ada2d0df99fa0ff8be3f3f33953848c9d3aa61ac849f2d50b78485d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":433,"source_line_start":429,"source_local_id":"block-066","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":66,"target_content_sha256":"d51addccb69748eebaaa8ad57ba41d8aeefb160f287c33408c7ed48db430a097","target_edition_id":"edition.r017.id-id.draft","target_line_end":433,"target_line_start":429,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[429,433],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef3d94dd826c12ecce84c01cb33c6d503db661ce6ea046573d35377d6d87d9ca","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-067","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":67,"source_content_sha256":"c0ce933d7590f17afb738593a73c06b1123b54b3b96501b4ffaa7a774fec90f8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":446,"source_line_start":435,"source_local_id":"block-067","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":67,"target_content_sha256":"eef36ffb4d24e9f44c01effa5acdd0134770e5be6c921d773fabf815ca9047b8","target_edition_id":"edition.r017.id-id.draft","target_line_end":446,"target_line_start":435,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[435,446],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8366a1ac483936b46c5cf76429d30beaf2f8c2b513cb228483024d6ff9e386a4","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-068","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":68,"source_content_sha256":"ee7e2abb4db15ddc42ea2bf301c731f1c3026db33077922e0e48f40920e0d5a4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":449,"source_line_start":448,"source_local_id":"block-068","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":68,"target_content_sha256":"ee7e2abb4db15ddc42ea2bf301c731f1c3026db33077922e0e48f40920e0d5a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":449,"target_line_start":448,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[448,449],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fba57b734411cbec5f1f942324a5494784b37fa4bfd191f4d93f279be4cf2854","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-069","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":69,"source_content_sha256":"82c3f3b0139e1d944cd7c9db0b4e488caa5c69f3f8b19a7dfba80a1f46fb394b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":456,"source_line_start":451,"source_local_id":"block-069","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":69,"target_content_sha256":"6193a86478bfd4b8afa9d9c1ad9219558e9ce37ad9a599643bd3a9520929fc56","target_edition_id":"edition.r017.id-id.draft","target_line_end":456,"target_line_start":451,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[451,456],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64925384a70abfe371dc13c33c1ea803d690718b0190dabef5bbea8afb5ae076","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-070","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":70,"source_content_sha256":"b12210978836d488301511d0c05aec6f2ca2e32c144d94fadc7ea58ca447ef6d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":465,"source_line_start":458,"source_local_id":"block-070","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":70,"target_content_sha256":"07e5a94d171fccc4c82effb7a273b657d9c7666978012fa587d60533a4aa51ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":465,"target_line_start":458,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[458,465],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2682a5e3e51bab43eaaeb78e80d679e68aa866d370c4fc0cd7aad80470227271","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-071","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":71,"source_content_sha256":"967c072f889a3c64758bbe38842171c613ddf3cbb8ae7c74bbb79b6f58d80930","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":467,"source_line_start":467,"source_local_id":"block-071","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":71,"target_content_sha256":"967c072f889a3c64758bbe38842171c613ddf3cbb8ae7c74bbb79b6f58d80930","target_edition_id":"edition.r017.id-id.draft","target_line_end":467,"target_line_start":467,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[467,467],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3435cc8788336636ccc2e8a223debd49a15c91aa1dbc1523b7d53be56a37ba83","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-072","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":72,"source_content_sha256":"86c3b2e827873028595a5ab378924d3f7cc3a8929a53e50a8f472c94c7019e44","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":471,"source_line_start":469,"source_local_id":"block-072","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":72,"target_content_sha256":"86c3b2e827873028595a5ab378924d3f7cc3a8929a53e50a8f472c94c7019e44","target_edition_id":"edition.r017.id-id.draft","target_line_end":471,"target_line_start":469,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[469,471],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3b77da08e2e737dd2bd0e7ccab9a14aadb7a5d99e2bab52851785d3a34be070e","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-073","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":73,"source_content_sha256":"82682c7f35b19c411b5faa567e504ec3c9e298abd6414dbead1dfa0df0cc649f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":476,"source_line_start":473,"source_local_id":"block-073","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":73,"target_content_sha256":"e638ebc309897b2fc05e229d08d82616f5410e8794528b625da2e567a7f3870b","target_edition_id":"edition.r017.id-id.draft","target_line_end":476,"target_line_start":473,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[473,476],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc0916c6e5b37bfe9fdfef4f0e2fc2ce3c0b73443d0b62a73bd519aa7c5d2bff","concept_ids":["concept.assignment-model","concept.spreadsheet-modeling"],"id":"segment.r017.book1.ch04.text-a.block-074","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":["concept.binary-integer-programming","concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":74,"source_content_sha256":"3c4a6769e91588f0a7f2226b8051247923dc4fd436b8b0907db0fe298fff2e91","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":482,"source_line_start":478,"source_local_id":"block-074","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":74,"target_content_sha256":"3e0c4d83ab68ee22238d38a4638c0ab5df0063c16672ff138690f449730d3622","target_edition_id":"edition.r017.id-id.draft","target_line_end":482,"target_line_start":478,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[478,482],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e3248a2b6056450134fdc8f8b22b4ddfbe1f13ca62bd4fc76ffee31bd2ea54f","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-075","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":75,"source_content_sha256":"8a27e5071962fbdf7a8b073517ec0d7f4401a2a87bfc35166759e33f307f700a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":492,"source_line_start":484,"source_local_id":"block-075","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":75,"target_content_sha256":"eea9d500bb45526777afe6ea9cb32aa66088f17f8a9eb222929ef61052209517","target_edition_id":"edition.r017.id-id.draft","target_line_end":492,"target_line_start":484,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[484,492],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bef2d8b1f80776b22431373c347800432a3b6860236c537f856882f0098dcd06","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-076","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":76,"source_content_sha256":"ae34fffea17ce8f28d7f1d9a0064a318eb4198ba4953ab97b00a12b61b270667","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":499,"source_line_start":495,"source_local_id":"block-076","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":76,"target_content_sha256":"d7b1369e7eb9e17dfed0f7654c8f5066e9503cdea0af26329d0b2169727c9609","target_edition_id":"edition.r017.id-id.draft","target_line_end":499,"target_line_start":495,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[495,499],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"42ac460f2e63a261c52aedfb7e5e248c656a766740bf9588aafc92aefbbcffa6","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-077","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":77,"source_content_sha256":"764a3c1a73b4ef9e08687d8279575a47c29f8c066b567c02a7ac25cf637a05fd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":504,"source_line_start":501,"source_local_id":"block-077","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":77,"target_content_sha256":"8eb912fee3d57e7320b8da806886df4c28141eb2ee8cedad1dc8a7cb92c742d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":504,"target_line_start":501,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[501,504],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8adb4863ccb82f312937c94cfa986f913619c1d74d7716d10886648d3bf61001","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-078","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":78,"source_content_sha256":"2fc617111fc323229c7948a803dd76772b45eeb9d90a6c4a688c72c5a3a7456c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":515,"source_line_start":506,"source_local_id":"block-078","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":78,"target_content_sha256":"a3cdf8b98d4644f08f2f36bd320e73a896ea612270764879db0a34566c45fd2f","target_edition_id":"edition.r017.id-id.draft","target_line_end":515,"target_line_start":506,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[506,515],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e5925ebd6d3cef92333053852bbf53b14165e2d7cea3263ab2f9458bbb955386","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-079","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":79,"source_content_sha256":"97c384d5e8fe41815c94bcc788e8c3e0b2454ebce1758127f84e5dd849bcf81c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":524,"source_line_start":517,"source_local_id":"block-079","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":79,"target_content_sha256":"15266e47e506a427df6486e32863c6b838cec461b7c7c927de56b770a2930015","target_edition_id":"edition.r017.id-id.draft","target_line_end":524,"target_line_start":517,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[517,524],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1f0a2f22d1f654337035adeeb3d357fb2893199dab68352b69e7f26573eecd6b","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-080","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":80,"source_content_sha256":"a4e7b7eceb1ca29149872fef00d027e9fe7d18ef9b205a50c4308d8bad45e3a1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":529,"source_line_start":526,"source_local_id":"block-080","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":80,"target_content_sha256":"b71ae6d2d58a69b589fa8b33778b8dd412ea8d072cd38ac7a04abc32725f4029","target_edition_id":"edition.r017.id-id.draft","target_line_end":529,"target_line_start":526,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[526,529],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e366342b09ef1b6cacc2366f559754b06c4ec63290ed45ceeaed8e5904eb841c","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-081","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":81,"source_content_sha256":"d986bb5f42c811ea737efab3fe01015e3f38ef9a4108fe3227f472baf3c4b05b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":531,"source_line_start":531,"source_local_id":"block-081","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":81,"target_content_sha256":"e6fccb57d7701378bd135467b85d1ff00e6169f58356fdbfb660bbde1d486613","target_edition_id":"edition.r017.id-id.draft","target_line_end":531,"target_line_start":531,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[531,531],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"395c44ceedaff2cee4d14ae02c59ac5023218abab7eb40cb54af03b1d836cfaf","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-082","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":82,"source_content_sha256":"44a23c4d63b73b1eee01ba3283a25473a519fc8bb24eec03a0dc091713fcb277","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":545,"source_line_start":533,"source_local_id":"block-082","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":82,"target_content_sha256":"c685e7ac6511637b9733a086da185d0671f153c3043cdc1d72e7002658271f1b","target_edition_id":"edition.r017.id-id.draft","target_line_end":545,"target_line_start":533,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[533,545],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e12efccaa178545ea2d93e97629b5bb8a29c973894c0af1d45306474e94327b","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-083","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":83,"source_content_sha256":"6ee5e4869cb67758d29df0f0fbf5c72c8cd1709927cf307500f50397bb2a3282","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":548,"source_line_start":548,"source_local_id":"block-083","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":83,"target_content_sha256":"c691c59f8ce8f07ffa5155b90e54c13e3cbcf0fdf62531cec4bea75d9a0d79c5","target_edition_id":"edition.r017.id-id.draft","target_line_end":548,"target_line_start":548,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[548,548],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"adfedffe84edcbd7acf069d70d54ce63e831d65fd7db135225dc288e30bf783f","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-084","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":84,"source_content_sha256":"1d9603f058343d4876d3e86d302cbbc1aac47b56236a08b4b6046092693ed473","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":554,"source_line_start":550,"source_local_id":"block-084","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":84,"target_content_sha256":"e1acdb6855c8e375a8e63ba3bf94c15fc5304bcfff591afbf798adcabc9aa484","target_edition_id":"edition.r017.id-id.draft","target_line_end":554,"target_line_start":550,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[550,554],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"40615d6f0703339b09a7de8ba979d99a0a55c79ea2d535a1e3dfe7d27eb20a52","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-085","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":85,"source_content_sha256":"18c094f41f2a96cfb60bb3261d6b0914deff18ef8ccd155f8147220dd2435363","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":559,"source_line_start":556,"source_local_id":"block-085","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":85,"target_content_sha256":"3527b723b111fd0b42bb990d49b2d2a7e8359ee770e62cc745e0344b4463a6aa","target_edition_id":"edition.r017.id-id.draft","target_line_end":559,"target_line_start":556,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[556,559],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c3f305c38b257e22278668bd9344532e59e27d0351c94afd1cd8299a4f0541a9","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-086","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":86,"source_content_sha256":"fbdedecce3ce6a052b28c42a7129e831cea19b2b7616c46e5788aab895df930b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":564,"source_line_start":561,"source_local_id":"block-086","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":86,"target_content_sha256":"37713ec44a921408a626dfbe8617a3b253c900a0cad30dad04c4f6317efa69b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":564,"target_line_start":561,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[561,564],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a1764cd52a4fbee47ea508ae706a12451f5fa5db6df8f11a273c4a0920d9453","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-087","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":87,"source_content_sha256":"e33112bd38bb8ce0e943eda1e5c9f90e10351ca2468c1692132d2051b372ea2b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":573,"source_line_start":566,"source_local_id":"block-087","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":87,"target_content_sha256":"8bc7cd95ffff1de25955603b1acc6534f366aa9adb376a0044f936cc5757fe59","target_edition_id":"edition.r017.id-id.draft","target_line_end":573,"target_line_start":566,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[566,573],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"248ca96d825d520c7cf3d97d0584fdf963e0476d37a4e9df3063e73825a5537c","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-088","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":88,"source_content_sha256":"47e8bc301fcb884be1d8b43b36a2ffec51d51669aeae45e8129c92c713bbd8c0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":580,"source_line_start":575,"source_local_id":"block-088","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":88,"target_content_sha256":"9b170f45dc6c8cd12bf8925d3a96e4e0d68a66265d15a49ae427a4abb2080cb3","target_edition_id":"edition.r017.id-id.draft","target_line_end":580,"target_line_start":575,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[575,580],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e00c8490e5b22f5db8df538b26c1f88e4942501a2a72ffe5ace96c526aee37b3","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-089","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":89,"source_content_sha256":"18f85b3d835e0a404b90ece63761937fceb7a01d8369b6055a88b121181442fd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":586,"source_line_start":582,"source_local_id":"block-089","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":89,"target_content_sha256":"9f5782f82f7653fef45a06213562420a34d54ce71ca5519ccd93cd8194a165ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":586,"target_line_start":582,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[582,586],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c794957fd0fe53abe53f0fdd7f5ae9374165710503b485cadefe942e1e2b78d5","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-090","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":90,"source_content_sha256":"cb2c2504b06521d70656eb7f1834037a7922e47c66e6ff94027296f71cb212c2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":598,"source_line_start":588,"source_local_id":"block-090","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":90,"target_content_sha256":"915a5866ae4f8caac9679e5a6204f5efb2e4c394638a144badfad5994c008204","target_edition_id":"edition.r017.id-id.draft","target_line_end":598,"target_line_start":588,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[588,598],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f6ebbe33921c2dd32a1e7b6552bb9bb70e61e89ca394c7ce3d9cc8b48d3b11aa","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-091","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":91,"source_content_sha256":"2265f6c9df27a2c63507b577a70e42705abec23361cb04661de2647b8e958d21","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":607,"source_line_start":600,"source_local_id":"block-091","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":91,"target_content_sha256":"553f32a2d61b971e59cb27e70e142246daeb01404eef76212c2cf4ea7dbcab06","target_edition_id":"edition.r017.id-id.draft","target_line_end":607,"target_line_start":600,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[600,607],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e83276b8a23437e3d416dca4a6fcb0e5284122a99d4dc31bedd2d9997dacccca","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-092","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":92,"source_content_sha256":"e72e711ded24db4f0c3b5c2e7dde13857688490805f4defc0a258517b86ac5c8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":609,"source_line_start":609,"source_local_id":"block-092","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":92,"target_content_sha256":"e72e711ded24db4f0c3b5c2e7dde13857688490805f4defc0a258517b86ac5c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":609,"target_line_start":609,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[609,609],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a36282a886ceb93a5f3439debb4e8c626c7f91446b9dbcfca64281cf604d74f8","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-093","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":93,"source_content_sha256":"cafcfffe7788903ea6162c6170e00cf4bed3c8e2aa8faa65b1cfa4f94d40f89f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":617,"source_line_start":611,"source_local_id":"block-093","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":93,"target_content_sha256":"c97b5d956c0b585d73b144804fcfdb2096ad4ddde1131333127b6b6736fe124e","target_edition_id":"edition.r017.id-id.draft","target_line_end":617,"target_line_start":611,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[611,617],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ec225fd5dc8041a6ef00c21d85863a459b1ecb801666d945e727fd29f6713e2","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-094","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":94,"source_content_sha256":"05f80268e7e17b93ab955cce7af807f6b89cca0757d3131d852e67613bdda575","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":619,"source_line_start":619,"source_local_id":"block-094","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":94,"target_content_sha256":"33218efbe322475626f71f242db6e61d3e4fdaa897ecdce4d51ff1f58c8bd31b","target_edition_id":"edition.r017.id-id.draft","target_line_end":619,"target_line_start":619,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[619,619],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"01a6924f9245faa6efe8e3878dae0ca9fa6be4f1162c0c2e4734e761c5b76da4","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-095","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":95,"source_content_sha256":"47b5761ba87d8a00260a213c6943542ce10ab8ac821954c9894cbd9751babe06","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":621,"source_line_start":621,"source_local_id":"block-095","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":95,"target_content_sha256":"47b5761ba87d8a00260a213c6943542ce10ab8ac821954c9894cbd9751babe06","target_edition_id":"edition.r017.id-id.draft","target_line_end":621,"target_line_start":621,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[621,621],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a2767892fee1098dd4cb6c9ca5981884c8fba7b86022640542f6b4b6c4245a7","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-096","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":96,"source_content_sha256":"83499aca1f1b547f82a594a38fa144ec270d6f0fa4e2dd09a6ffed7f9832e145","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":623,"source_line_start":623,"source_local_id":"block-096","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":96,"target_content_sha256":"ca553d4af820df4305ccb1412fb4465ef766e4f0ebcd204ba61a5728144254e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":623,"target_line_start":623,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[623,623],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52ce4c5aa200221f67b92fd017f106a30315d0cc1b068c4bad497a42cd6a83a6","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-097","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":97,"source_content_sha256":"3378909e4a08abe366540c0edaf0374d18f1343a3f4299bd410e6d0569cc329b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":625,"source_line_start":625,"source_local_id":"block-097","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":97,"target_content_sha256":"1f146754ac2b266f9083dffffc05ba5bd1c288276df24e2c7bc69e7bc9d09295","target_edition_id":"edition.r017.id-id.draft","target_line_end":625,"target_line_start":625,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[625,625],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"949b01a8437bd37cda07c0d774852de5cb812887878ac7278b3edefbd5f10a9c","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-098","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":98,"source_content_sha256":"55dc3c014d607da72fa395063d9815863fee3975744f5df12bcdabb398b2cd9c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":635,"source_line_start":627,"source_local_id":"block-098","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":98,"target_content_sha256":"0eba1a8ff04e564cc40913df7886dc2b026382b9126f47090e4185aa11907419","target_edition_id":"edition.r017.id-id.draft","target_line_end":635,"target_line_start":627,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[627,635],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76930eae9cb03e92ef1a65f2a555ed01db371a9f04c3fef8d87c65f92c7771e4","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-099","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":99,"source_content_sha256":"5b2dc7bb76309fb704f3a7298d4d5a9929206fece847b5099ede58692709fc78","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":644,"source_line_start":637,"source_local_id":"block-099","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":99,"target_content_sha256":"89bcf720986fa34b7d5463662b391144b403bae042815d4c19da7fd49b1cfbd6","target_edition_id":"edition.r017.id-id.draft","target_line_end":645,"target_line_start":637,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[637,645],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8164a35b5e701e7ea40af77bf4bdf4f16d6579a1bff94289ecf3957cb4a9071","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-100","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":100,"source_content_sha256":"e929cb97850ff2a829ba5e45f56dbfb9aceb73634c9c1586b64f0284b1c32a8e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":647,"source_line_start":646,"source_local_id":"block-100","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":100,"target_content_sha256":"4ecf55cfa3e50b82e13cea038995bd9e5b958067496df16dbd46362caba13db4","target_edition_id":"edition.r017.id-id.draft","target_line_end":648,"target_line_start":647,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[647,648],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"34aea67e34069f6c3cb430310493cc75f0d2de894879fdb5a7f0a3202393c212","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-101","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":101,"source_content_sha256":"c5719ad453a0a4c6cb65b45695d7ada80e400ff89b01ef3e9919865ef4abb78f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":649,"source_line_start":649,"source_local_id":"block-101","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":101,"target_content_sha256":"6e6857bf6aa61f5d569bf9887fd756724405f174ea4ee4bf36d7ad9a730db46e","target_edition_id":"edition.r017.id-id.draft","target_line_end":650,"target_line_start":650,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[650,650],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9bb3348d3e3d2a5d224462141bd136491aff016d91cd352de0336dd164c34b3","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-102","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":102,"source_content_sha256":"4f5f548861db5d378a3cf54a5c3f588f436146d661d1d098ec3f23a1e42e948e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":660,"source_line_start":651,"source_local_id":"block-102","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":102,"target_content_sha256":"9fb145ef0ec200c12e73f659b7af799cd7c13db3ad684eef4b2c4b1eddb37a2e","target_edition_id":"edition.r017.id-id.draft","target_line_end":661,"target_line_start":652,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[652,661],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52ef8dd0d113ac5ab9e5856cd79eb036f57e0458aae251cd03b1d597e505e3bb","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-103","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":103,"source_content_sha256":"0590ac0cbc21bb7536444514936f1dcf185b7a512dc21badef99af1e773e81bc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":662,"source_line_start":662,"source_local_id":"block-103","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":103,"target_content_sha256":"e7e7644aaae3982712d27b71fd7d69b527680f54dddd90c8f674bf4f4044d232","target_edition_id":"edition.r017.id-id.draft","target_line_end":663,"target_line_start":663,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[663,663],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"30785c8809524851b8a49eb55f1702f8854d91f3969356857c6dedc9a733a206","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-104","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":104,"source_content_sha256":"cf77ba89dc99eeb50693369995d7428e5421788571046c9d65abed6c08d2f23c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":665,"source_line_start":664,"source_local_id":"block-104","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":104,"target_content_sha256":"56a00bf36d238e731b80496e4d84fdbb5283b42f3b1c89f9b8bc4e9d837a9b10","target_edition_id":"edition.r017.id-id.draft","target_line_end":666,"target_line_start":665,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[665,666],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8de07bd429dc0c708ce4c8140dad651e2a476507049eb8e6a1b14b93c67d7ca2","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-105","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":105,"source_content_sha256":"92320ff14bb00d68b439154d592e691a6cf36d960b0aadba6b76ede06ea284f3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":667,"source_line_start":667,"source_local_id":"block-105","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":105,"target_content_sha256":"b6cdb5a2e44cbb16bd1e490bf949a408c621f1352162065e2a31567b8cb89d41","target_edition_id":"edition.r017.id-id.draft","target_line_end":668,"target_line_start":668,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[668,668],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e0fa1e4d1f69594c7a7dba4a6ffa55d7c20b1c3c8c7fb7bbd9258327606a022","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-106","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":106,"source_content_sha256":"616d851b3316cac904d28251a14bc019a581d226a3e3564edb311c81b68e5755","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":670,"source_line_start":669,"source_local_id":"block-106","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":106,"target_content_sha256":"16c7aaeac7ff66cd527f7909009049519cdce9a705355ebaf9f314e1dbcbdcbc","target_edition_id":"edition.r017.id-id.draft","target_line_end":671,"target_line_start":670,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[670,671],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0cfbec32b867c79c29321d0d62afe8a60299a2e1cc26998aa82abc3c106968c","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-107","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":107,"source_content_sha256":"8c56edb66ab3109a6e60f645ba2a057af6ef9dc9115b883400a04b9fc58bb91d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":672,"source_line_start":672,"source_local_id":"block-107","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":107,"target_content_sha256":"7cdf50e7cb0d1ef55e703e0fde6e65d229c9a964cec474278a7df3ef35a1d61c","target_edition_id":"edition.r017.id-id.draft","target_line_end":673,"target_line_start":673,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[673,673],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64d0721eef388063d10848e372f5591fab17cd27ce5dc633050e4f35ca12e592","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-108","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":108,"source_content_sha256":"8f0a06da41ccf262458069a92f95fb4be1dd36438c6c56fc3f52e7bc62443acb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":681,"source_line_start":674,"source_local_id":"block-108","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":108,"target_content_sha256":"4f3c319be399bdbcdb488278585a6896c374f8d3ed776736b1f90596f63cae1f","target_edition_id":"edition.r017.id-id.draft","target_line_end":682,"target_line_start":675,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[675,682],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c24a18e1116ff14e0a43b3fc94b84aae9edb17e6af9abdfd5b938171020658d","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-109","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":109,"source_content_sha256":"5f4c5db967f9151bd6d83f8493798a410aa609c242ee46f69174ae76157f7ca6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":684,"source_line_start":683,"source_local_id":"block-109","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":109,"target_content_sha256":"81a75dd4a7b10e8ac0d0f207ed41648c2a8a69834d7a2f5fd18c73d2fd1fae39","target_edition_id":"edition.r017.id-id.draft","target_line_end":685,"target_line_start":684,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[684,685],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76ba7189f1ab4bf91e49090ac85362ceb24e1e6713fdd31a0cc9da24a9130d55","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-110","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":110,"source_content_sha256":"a49a6d918d0ba3b3b22142d810db4d71152074f4c2b7700db931b9f97b012f89","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":686,"source_line_start":686,"source_local_id":"block-110","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":110,"target_content_sha256":"c479ac4d0a5c6067e22cf23fd45d7593ef1f9e30a3bbb965a988a1f4919c7bb1","target_edition_id":"edition.r017.id-id.draft","target_line_end":687,"target_line_start":687,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[687,687],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"43acc588520f452be1c7d68aac8fa8d7301dc8a732ffe242a1adc99230b1217f","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-111","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":111,"source_content_sha256":"9c7a7644a08b5f14711186b6cd33106e8402cb55b4df49ba84c012dad104438d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":688,"source_line_start":688,"source_local_id":"block-111","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":111,"target_content_sha256":"8c2963a6827d5bec396026bd789b55896c0e0ed22f11de46b9ca46b4ab3922e7","target_edition_id":"edition.r017.id-id.draft","target_line_end":689,"target_line_start":689,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[689,689],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ca1000192d14d6e73a595148b42483a9f1330e4a22a1517e86ff5d2caa223587","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-112","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":112,"source_content_sha256":"b1ed11dcfe2870da21884a4b90fa7ebdeea0300825af006e913095328f6d6291","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":690,"source_line_start":690,"source_local_id":"block-112","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":112,"target_content_sha256":"293e7dc04b35e1af8fef9fed954f3880c8df18bf73e9c087183d27da3a5ae674","target_edition_id":"edition.r017.id-id.draft","target_line_end":691,"target_line_start":691,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[691,691],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5339905f6df0f722ee044a3c39eed0dbf82ed8d8cab5dd6feec2703e5f826b2a","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-113","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":113,"source_content_sha256":"110a226d6dcdb3d0575717333446a980aff8697d21edfc1a11f35d833083d1ce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":693,"source_line_start":692,"source_local_id":"block-113","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":113,"target_content_sha256":"481e917c1957123510ffe8031238ff85bcb0e72062e0741c9fd15fdf298ccc5a","target_edition_id":"edition.r017.id-id.draft","target_line_end":694,"target_line_start":693,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[693,694],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fed5258c954ab288ae53195f229a5d81ce79e683147b907a52ee2d4534e336e5","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-114","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":114,"source_content_sha256":"6c1b63806e71b706ab989698376cadb7e74997bcf6445078763ccced1f28f9d3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":701,"source_line_start":695,"source_local_id":"block-114","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":114,"target_content_sha256":"e6581bc1be645ccc3779cb5cbcf4fafc610dff5dacf3db8aedfa3ec619bb377d","target_edition_id":"edition.r017.id-id.draft","target_line_end":702,"target_line_start":696,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[696,702],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5d1bca025c862febfd0752384a953bab12f5047205d424f08258120bf1cfbb3","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-115","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":115,"source_content_sha256":"de26d25f0def7b94c665b42e41400aa306c25f81f51bee75489a50dc7c5fcb1b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":708,"source_line_start":703,"source_local_id":"block-115","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":115,"target_content_sha256":"1abc0894598662f3a5753def093fae8bb7a0370b02e62d8fbd5ca319701bb77a","target_edition_id":"edition.r017.id-id.draft","target_line_end":709,"target_line_start":704,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[704,709],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"558db0aabe068e43784eb38db3527e86eb17cc1bf4781475336ac04454d5aba4","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-116","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":116,"source_content_sha256":"0dd1a2432f51c1c80734ece1b6ade0faa7c73d9628f00b4c5f6fea75e2bdac9f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":710,"source_line_start":710,"source_local_id":"block-116","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":116,"target_content_sha256":"8cb1bc977c85f6d97de5b472d5863912404b7428d2190fee256e224b982e8e7d","target_edition_id":"edition.r017.id-id.draft","target_line_end":711,"target_line_start":711,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[711,711],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4514b2dfc51ffe871dcb3693dc2b76bac8174c8877090cd269f0300f3d317dce","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-117","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":117,"source_content_sha256":"9a6f10aa2b324ce0ce3efa3d4d50a12abdad87b79c17b5c3328e1ff3e68e2125","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":718,"source_line_start":712,"source_local_id":"block-117","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":117,"target_content_sha256":"8bc047b6bb790903f54cddd7ee7f3480c0a097655cf3e78d262f5bd6032609ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":719,"target_line_start":713,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[713,719],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cfc8e4e5173a1464b1ca1d6c9a4307d25277f9d52ccc949bec03e221eec456f8","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-118","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":118,"source_content_sha256":"92e432fd4c50e042ff097f9640bc758065fc3871536b1b1a3d5dd3b4b173c53d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":720,"source_line_start":720,"source_local_id":"block-118","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":118,"target_content_sha256":"6767aadd4093b2bde8db000feb887f44688e04c834e42263064d558d16054bc0","target_edition_id":"edition.r017.id-id.draft","target_line_end":721,"target_line_start":721,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[721,721],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"93a0044703493ee16e15714d25af750cdb78bc034d45ab2f56b393aa5b135cd9","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-119","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":119,"source_content_sha256":"9380475a56dbf6d0e29df113edf8d549a09235bb21b8a57772cef86b79b7abb0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":722,"source_line_start":722,"source_local_id":"block-119","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":119,"target_content_sha256":"2c900a0a9919634bca3e745a7e600b6c981ac06682853f50e0b8907dc2573a42","target_edition_id":"edition.r017.id-id.draft","target_line_end":723,"target_line_start":723,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[723,723],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19f3a0cf935c8d7308e26cb290fa3243358606843796ea0778a7558271ce82cf","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-120","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":120,"source_content_sha256":"7f376c3701a24b059b30f4df105088ef01dc120ed63d63f4d751b2f39e7904ea","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":724,"source_line_start":724,"source_local_id":"block-120","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":120,"target_content_sha256":"579d31a89d3bfbdd643e7ae52a1c00bba3c3081ff9c2d34958caf905c149b8fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":725,"target_line_start":725,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[725,725],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2594f46ca8abc88d85495591bac069856a6b612cd25473a947c67c303ab7152d","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-121","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":121,"source_content_sha256":"f1fdc1e04988a27b1e3862bba9b9474c212c52472413985ae06ccce43b1dc102","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":730,"source_line_start":726,"source_local_id":"block-121","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":121,"target_content_sha256":"911f543c23358837702cfa99754fb82c53bb6b90b24b231b4d5da7f768ba793d","target_edition_id":"edition.r017.id-id.draft","target_line_end":731,"target_line_start":727,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[727,731],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7dc219f636a699447f68d3e4f503c49858bd12ef3f1421213938fced0c8cb8b7","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-122","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":122,"source_content_sha256":"37ae5de9f7d95461a6b5ef78e75b75c4ab6ca2ac5797d9fc0e7b16ba63d31b55","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":736,"source_line_start":732,"source_local_id":"block-122","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":122,"target_content_sha256":"12a7b4061968bee9d126fac7409fbde2333a99d1fde4bd38a2381a6f1dca7d2d","target_edition_id":"edition.r017.id-id.draft","target_line_end":737,"target_line_start":733,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[733,737],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f97f6fbadbfabe4ad9bb105b0912463a6af8e27c5ee231a65c3ad9944e86d732","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-123","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":123,"source_content_sha256":"e648309719ffd6a039b1e1e666547b40af86efcfab897355f1a66617746c5393","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":748,"source_line_start":738,"source_local_id":"block-123","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":123,"target_content_sha256":"163f6175e350d76fa3e0dcf94594a8cdb9d42a82a5c23ce7ebe0352b2beaac8a","target_edition_id":"edition.r017.id-id.draft","target_line_end":749,"target_line_start":739,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[739,749],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c643b2d87ccf65bebc4e1e6e94e35d62a6e5225e2bbbf4c45b9d87313d70dec3","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-124","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":124,"source_content_sha256":"8fc5b9e5e6bc955e31504aa03432a12c5bb87fe348980a36ad2ed60bbccd7a45","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":750,"source_line_start":750,"source_local_id":"block-124","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":124,"target_content_sha256":"fcb9dea00a87febc32b460d2946762af12aee70cdb59e0bd34c901ebb75b864b","target_edition_id":"edition.r017.id-id.draft","target_line_end":751,"target_line_start":751,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[751,751],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"50c46cefad7e7a41006736f7312c2c94bbaccca06b748d33ce22581a063dd6e6","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-125","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":125,"source_content_sha256":"f132e1908ebbd136584dd420f0c53e5f61f5fd16166125f8750d6ad7b2bedd5d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":752,"source_line_start":752,"source_local_id":"block-125","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":125,"target_content_sha256":"2a3123dae9b32dcd49c7f0fe8e4ab9c036170c4248dda008fb20bc4659ccd3ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":753,"target_line_start":753,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[753,753],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7b631bdf7494110ec658a2328e57cf14d43cbb013ea30c8f4a505d0c7c1c625d","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-126","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":126,"source_content_sha256":"689e7362cecdfa3322bac463c28e098f7257cea112d10107bf37d11c0c9008f5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":767,"source_line_start":754,"source_local_id":"block-126","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":126,"target_content_sha256":"7a1fbbc8161bce5b98341e770b3ae2e73923d0f99f6e6c9d16f2f348ec9cf1bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":768,"target_line_start":755,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[755,768],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2ad0eee1ec495be2591b216e4bc3cd1c903a596d1ea093a4cfee05848a4762e6","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-127","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":127,"source_content_sha256":"fe10d99e4de02f4f3a0ae52655e21383d388693fcfb89e92ecd41af2d838436f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":769,"source_line_start":769,"source_local_id":"block-127","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":127,"target_content_sha256":"bad42266e4b9990a122668448e4cb3bd1013671836d457bb94772fdfbab58fbe","target_edition_id":"edition.r017.id-id.draft","target_line_end":770,"target_line_start":770,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[770,770],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80c4e40c41d7fa6cbdd07b89a74bd4ec8833ede6ae8694a8c1c82374ed7a43c2","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-128","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":128,"source_content_sha256":"2e9092433028847d046a4eeec4457927cb9e682b20b42ef537b659b7a620413a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":785,"source_line_start":771,"source_local_id":"block-128","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":128,"target_content_sha256":"894b16a23f7d5f025004d496db5779cd18913b785f1c5a8532e7b4fa14b39df9","target_edition_id":"edition.r017.id-id.draft","target_line_end":786,"target_line_start":772,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[772,786],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b97ced61f90b11f48ec9bcce0d0c5897719b47133ca6e34ecf35bb32021cd29","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-129","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":129,"source_content_sha256":"7b2e1a50e34bea36ccdda9f62ff94a8f459d8016c8cbee8738ec056a2bc4cd94","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":787,"source_line_start":787,"source_local_id":"block-129","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":129,"target_content_sha256":"cc324f5a0c83ac82c3a8038eaac019f3a40af6c2b562e4b98e16aa1bc5390a4f","target_edition_id":"edition.r017.id-id.draft","target_line_end":788,"target_line_start":788,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[788,788],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9a2d153d4fe57908722d5ca0cb78eafb2c89e8e7192f7f4a9e033f0e3e1c95f","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-130","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":130,"source_content_sha256":"9a689d128bdca88b948b8fa5b59155cac03477e95e1b4e5a16416162627118e2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":794,"source_line_start":789,"source_local_id":"block-130","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":130,"target_content_sha256":"4abd9f1417db2b6caaeb74cdd718593123f3b3bdc33f493e7b9c2b0c597df1a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":795,"target_line_start":790,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[790,795],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"58b7139a6fc890bca409e1c644f320a3c0e7877186936816a26b89af448a14b0","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-131","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":131,"source_content_sha256":"0f6a89a295149f7cfe14a4a219c182178dd3a120893993af5f24a5ab7b2c09ae","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":800,"source_line_start":796,"source_local_id":"block-131","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":131,"target_content_sha256":"cc4e9386c15623b79adf8289cf02a63f52af82bbf01797564e2998af462801a7","target_edition_id":"edition.r017.id-id.draft","target_line_end":801,"target_line_start":797,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[797,801],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e4846c2230f4abdc3202dc986df4d707d1a460209bf306173797e67e2f93065","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-132","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":132,"source_content_sha256":"98f5882a4b2de7e5161aa36e3755c3cdbd3ebde4d8a48c268b58027558bac50a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":802,"source_line_start":802,"source_local_id":"block-132","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":132,"target_content_sha256":"98f5882a4b2de7e5161aa36e3755c3cdbd3ebde4d8a48c268b58027558bac50a","target_edition_id":"edition.r017.id-id.draft","target_line_end":803,"target_line_start":803,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[803,803],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"504229ee519360fb42d56450d9ed72f16fa0a9c6a93d7bf5fa33af7c0d96ef77","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-133","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":133,"source_content_sha256":"209877b5320287f1a82937cc9ee889a1e639dee4f05fc49a616023ecbacf6907","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":804,"source_line_start":804,"source_local_id":"block-133","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":133,"target_content_sha256":"41dc4932af479875cda52491715dc8ef0e4ebea32ec94ba393952939e13cd1f2","target_edition_id":"edition.r017.id-id.draft","target_line_end":805,"target_line_start":805,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[805,805],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9be2b2a576eeb520b2b119ce02c92061781f1e7b7ad555ef816181532b588df","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-134","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":134,"source_content_sha256":"3ca7f691efb030469d6653880c11595041620d85a27d8b0f420f295dd27ace54","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":807,"source_line_start":806,"source_local_id":"block-134","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":134,"target_content_sha256":"551861b96fecebcf8b8cfde9634b026aa943cc0ba7eafe535d0d30446c539139","target_edition_id":"edition.r017.id-id.draft","target_line_end":808,"target_line_start":807,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[807,808],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d702b2bd79bec7b52d6f57a607915557863d9f74707996686a3b80911954ea12","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-135","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":135,"source_content_sha256":"8a1dfcdcb90dc00a3ecf0c78f799103a2fafe294c39afae30315e6c3935f1574","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":809,"source_line_start":809,"source_local_id":"block-135","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":135,"target_content_sha256":"856e82b213d874d1466488582d43edf9107442c576b614f90dbf36d8b4165796","target_edition_id":"edition.r017.id-id.draft","target_line_end":810,"target_line_start":810,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[810,810],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b710d6fccbe7606b768cf4ecbf08f532e6c3bcfa546d6d612f1dcde92a12d8c2","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-136","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":136,"source_content_sha256":"c19e84b45d6a552225827879462a1f25abb6acc5f285b9f8570fa1635fb24bdd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":815,"source_line_start":811,"source_local_id":"block-136","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":136,"target_content_sha256":"5a5bc6da2081e124d5615af9dcd4c17dd9c7e6f1dc002b3b5e4e1eb1e751b92b","target_edition_id":"edition.r017.id-id.draft","target_line_end":816,"target_line_start":812,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[812,816],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"902019405ab940460bc942ce50f0922ab59c70027f9e09ba6aaef6f470b92f55","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-137","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":137,"source_content_sha256":"e76a44112597fc2a6322c440d662c794f3b3db8a82203955d12d78240241b173","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":821,"source_line_start":817,"source_local_id":"block-137","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":137,"target_content_sha256":"41ce7ca313ecf8d8a62100624c8ccb8081444691ebe984d492cbbff234254372","target_edition_id":"edition.r017.id-id.draft","target_line_end":822,"target_line_start":818,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[818,822],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c88a09b614e06f83cb6148669519d9c366081b1da829f27edcfa2f17bd20b2f","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-138","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":138,"source_content_sha256":"b3af6450cd7b2eb46db5cb784cbebafc2cbaf9be75eed97056fc56dee58f37aa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":831,"source_line_start":823,"source_local_id":"block-138","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":138,"target_content_sha256":"1c2a889e1203496aa7f18775298684e506b4cfdd7d46f5871a97f51b037b6b55","target_edition_id":"edition.r017.id-id.draft","target_line_end":832,"target_line_start":824,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[824,832],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0b18ace500845d872e9e728b20c6b2b020bc72c97b3604555de12800bf5bbfce","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-139","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":139,"source_content_sha256":"747661fc2394a057d60efeaf15b6d62c066d2ba4be8a425062fdfd68675af34e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":837,"source_line_start":833,"source_local_id":"block-139","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":139,"target_content_sha256":"747661fc2394a057d60efeaf15b6d62c066d2ba4be8a425062fdfd68675af34e","target_edition_id":"edition.r017.id-id.draft","target_line_end":838,"target_line_start":834,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[834,838],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae4c9e27aa45abd9eaee975ea0b29aee91184b8a69f6b298d6a557b03d31ebdf","concept_ids":[],"id":"segment.r017.book1.ch04.text-a.block-140","locale":"mul","parent_id":"unit.r017.book1.ch04.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":140,"source_content_sha256":"1dca9341837b218c0d15ffa4a3cc80a5e3bb3ac6d0fb03a1883592acf4132e3b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":841,"source_line_start":839,"source_local_id":"block-140","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":140,"target_content_sha256":"d744ef1c6df051dc35a2c51e04ad0073d14adc55ea039f14657f11602e1f1928","target_edition_id":"edition.r017.id-id.draft","target_line_end":843,"target_line_start":840,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-a","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[840,843],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"106a349ecbeda20fe54935d821086cd8bb63a8e559581f85e96c5fd4cbabc973","concept_ids":["concept.flow-balance-sign-convention","concept.flow-conservation","concept.graph-theory"],"id":"segment.r017.book1.ch04.text-b.block-001","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.graph-theory","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"fe26a5541cd9ea1dba1901bfa4aac2b292940295af68d5026946716969e482c0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"b24cf3df7055b89cfa038f2e95e135a8cfb9d5ced1a836a6a9d800f22e8ab1c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,3],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f613cb440d191ff049bf49f78abed08138bf81748abbdcf5f6fda06ad85e059e","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-002","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"06402d253b4f3fede884bd70781a0cb88cd69205bb954d1d50439bde18429818","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":5,"source_line_start":5,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"b3cde552bf549bca248f27f8059713b858e2f89755651522b465fc0f800513fd","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":5,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[5,5],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aaff5cd9618ebf1cceed1ec42d780076e4361200d2fef4820277ccc8eea52938","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-003","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"512027f3e0caebc8cacaa6b35eca397139d81e9ac3c5426bf237988c3ee1662b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":13,"source_line_start":7,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"26ecf4c74e11aa5efe65160e6b94b4e8d68d03a98143553b1b365a73864f9814","target_edition_id":"edition.r017.id-id.draft","target_line_end":13,"target_line_start":7,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[7,13],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90b590d47955acd2927dd86c9e94063984c2aec01c28ec55778b27171134adb2","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-004","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"4e4bbe55c191580431587c6036d1dd6152216cff8fa7bde2e299763eef52eafa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":15,"source_line_start":15,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"311df98d2c5195da6335c7c84bbca433fdb7897a0009fb5abd69cf1b71c26d0a","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":15,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[15,15],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f49ac1a5ac298d33c83a5bbdf7144eb1d81cf12fe67bf14af058a391bc6e79fb","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-005","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"618d66302b3a140e1aeddbe28e1f26cc89207130a3583ac86ceaa41f2a70e36e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":17,"source_line_start":17,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"56896093c4522cc813eba41e332ad45e0f9b886d6aa26c5cc9b948d7207397e5","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":17,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[17,17],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3bb1dbf3d1b76ca64ec6127b7e647d4970600b6fbd0604a33d2f3ca0add528e6","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-006","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"9dbb97a2647ad64c29d4d7fdef009a40cf75e03f42044f496c394c857333389e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":22,"source_line_start":19,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"20b1b02a59e6040cf31cbeda44d2e3d455506d39d6a38aa2e9b9cea293eb799d","target_edition_id":"edition.r017.id-id.draft","target_line_end":22,"target_line_start":19,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[19,22],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe5d07c32a97ca1925ebadafdab21560d02e12c123fd15b2830f0f86663f9ba2","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-007","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"996f309b2b882ae24030ee92c79edc0c0e1a32ce04fb847bc85baf0fe69b0d1e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":28,"source_line_start":24,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"3018956152d469d02445e470f56409a2f8dde0e814f4f11792d27a63247054ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":24,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[24,28],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10611d37fbc57a986233dc0b380b00f292c87ee62e76262b7de0b46ab551f1df","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-008","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"47cb0bf99559d5e74c973de9d0dc032c9a618d0ca6dd52a4abd20af7b3be241f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":38,"source_line_start":30,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"47cb0bf99559d5e74c973de9d0dc032c9a618d0ca6dd52a4abd20af7b3be241f","target_edition_id":"edition.r017.id-id.draft","target_line_end":38,"target_line_start":30,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[30,38],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc42e28d87c608d5234b0292e0ae766c05563cfffaddcd6fce6a3adeb019c626","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-009","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"0be6589143f66784adf74bdb7b52f7416e650bb8b384852bc1e76c8bac806442","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":41,"source_line_start":40,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"0be6589143f66784adf74bdb7b52f7416e650bb8b384852bc1e76c8bac806442","target_edition_id":"edition.r017.id-id.draft","target_line_end":41,"target_line_start":40,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[40,41],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"93f879ed013de5b498f6bf486bf4c5fbf328f95fb13516e95dc552cd2e1be036","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-010","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"107a95f923f7b4cb985624a5c4eb3246c2129fadfe2b816ea47236d2612ce645","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":43,"source_line_start":43,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"bde968b267f11249ba5bd0c58bf6e6f9d38a6ef632aad3e6cfba299e087ecf10","target_edition_id":"edition.r017.id-id.draft","target_line_end":43,"target_line_start":43,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[43,43],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b2d33bd26906c3103ee0a1fa5d716926fb0445472761747b561e06a71ea0a259","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-011","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":45,"source_line_start":45,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":45,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[45,45],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3eb73b3481955acb513acf7e018083358fb5e7c3f886cefe8204ca8f78ebc7ee","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-012","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"d789fd7a2a0ac699aa2d41e9d56cb1abc9a5c07f1e32083249b9f49832617013","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":47,"source_line_start":47,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"a2e3f8d5c56d76fb07cafaea19e3969dff84145cd0fd8cde38a7514529e819d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":47,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[47,47],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd2836c8e67a5586fcc71acddee6772ba76485e9a3a65e1ca6cc12d476079151","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-013","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"161b495511c5089d7fa08fc5cadf92605e58ecf5704bb37fc75e56b58fc2b5d7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":67,"source_line_start":49,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"2be9dcb411c116221865c194bb3cf473c64c3ddce5a59e8405b6b04d001a9014","target_edition_id":"edition.r017.id-id.draft","target_line_end":67,"target_line_start":49,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[49,67],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f8a71b9fde0d8d13a658e41dfc076c4880687fec6eb20722225243bc5e2247a4","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-014","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"017a976ef0a7ef7841506f3e5d9e8196e8cb5cf31fbcb94f7ecdd4e54b510bcd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":71,"source_line_start":69,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"01ed67ae14c3d00e39fdad0b2008f80098208fad56600164ced7697e6064e1e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":69,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[69,71],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7d4f41f1cc06b8cc535838ef3a5d3101761834d024c0a28b6b978f80d7fc1ff","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-015","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"16d0d789355e17971a31da790f81e099b6d77f02b12d232a670b2fdb79e87702","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":73,"source_line_start":73,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"a4759988402e9b3c923eaac616424535be7e698edfb9cc65d632e4dd74b6c82c","target_edition_id":"edition.r017.id-id.draft","target_line_end":73,"target_line_start":73,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[73,73],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8331fa1a2bb2e5a5ec1f9bf47cb092d6c20f74a44b8eb1ebe20ee740c1247d11","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-016","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":75,"source_line_start":75,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":75,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[75,75],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5425209e9dc7eca92b9bfd41bc899bb69e28aaa54f6ff4e2b5b1af79df40a9f8","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-017","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"58aa7d9e4a954f8661f5638607017196035dd2c7c2c26cd36dbbffbe7bfceebd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":77,"source_line_start":77,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"a70135b0cf12ce20555f9a2ecb8a102b8b45319000be45ba85a3144273298eaa","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":77,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[77,77],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"33b721b125f96412f8ba079eed8559680481f44ae1a3304af0813e4d777f9f9a","concept_ids":["concept.flow-conservation","concept.network-flow","concept.transportation-model"],"id":"segment.r017.book1.ch04.text-b.block-018","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.graph-theory","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"3d6d5f50acdc6e62185b68bfbac6195e079ed94450c944b15fe4d4032812d359","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":83,"source_line_start":79,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"6d88e16449529ff82758878c33465b84a359d59ff605ca21807f0790b14b6702","target_edition_id":"edition.r017.id-id.draft","target_line_end":83,"target_line_start":79,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[79,83],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df1d5109eac798904855da0b5cbc8c2af23cd2cff88f4c6955f085920766e44a","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-019","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"8b3ef56c3cd803aaa4f631662982a7fe308257d3407028abca9aacfcac08f161","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":85,"source_line_start":85,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"630c89883bd365a694d0d93a046b792a1eecc22c7067e975fae49c38fd186c9d","target_edition_id":"edition.r017.id-id.draft","target_line_end":85,"target_line_start":85,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[85,85],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6bee8f9bcf8bfbe921968b6975416727b94669319c236a12f34845e8f5be6aa4","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-020","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"9d0cd746c81e97e9c1e3be29397d72fb7322136bebfffbbaea4ddfcb46c5e141","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":100,"source_line_start":87,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"511af6517b147af7b5c673f8f58e4a1bae82000c2b2a54a39896cffe00330ba4","target_edition_id":"edition.r017.id-id.draft","target_line_end":100,"target_line_start":87,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[87,100],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2fed417565c96e1f8b8b890b2e375510f33f3ad84520129d73cc1e966235e488","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-021","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"f2747d33f6c5a21ebf2b409e55a5243dce6d49340b84c00fce3e170a95c8845f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":102,"source_line_start":102,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"e0ed8b5c84dac27a99114e2cf5bdfc79c82cdc51c2d5cec25071643be7c5bb8b","target_edition_id":"edition.r017.id-id.draft","target_line_end":102,"target_line_start":102,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[102,102],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a94b0ec443859bb58f129c01d43a2e79b7753a4294dbefd0a6c6295117f9845","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-022","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"7d1b5c5498e6b5e226e4213a02447980f47ea4316eec7141f9fdabedd8c94cc3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":104,"source_line_start":104,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"13f3d54d84a50ae416789846be2cfafdd2c4727d15008f39983fe4f970e63d56","target_edition_id":"edition.r017.id-id.draft","target_line_end":104,"target_line_start":104,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[104,104],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82b30dff9c70a8ea199e1ba4a340a30fe6dbba8858e1c0d5b0a20354f0e39164","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-023","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"4d99841715cc27df1e60394d9f43a34f799627d7f379178ad085e30aed98ffb7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":110,"source_line_start":106,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"8f19dfd4408a6f053e0389c5723e7ac78d5488bb74d98cacca961c1cd39b1a6f","target_edition_id":"edition.r017.id-id.draft","target_line_end":110,"target_line_start":106,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[106,110],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ba366e540e0327ed08324c1f2a7d523e7ab373eeb57b89c3850861a4c6b310e","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-024","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"932cfaeee8f25ac9811976d7f660afb0cd094af44440c21f95bea225611c95fc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":112,"source_line_start":112,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"a57ba1047d644b8b9ddea7fa60cbdc44934f4eebc1852a3d9a323ee5c2bf06b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":112,"target_line_start":112,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[112,112],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"01eee2a67e140c0afc722b805dd83d17c2027005240f17e94309e082a2908dac","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-025","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"64d53e9bd461252e6d5a2ae8ade470acf5b9fd6d2f22e291c75cb9a4ac999216","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":124,"source_line_start":114,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"6e55224db0b25a58e1e5f8af9e90980902c561675bc9944c305f7d49e8446cf4","target_edition_id":"edition.r017.id-id.draft","target_line_end":124,"target_line_start":114,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[114,124],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4667f6b942b0ec4087c83cd715f57d597826f2f91806655f5aab5773b88264f3","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-026","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"e72e711ded24db4f0c3b5c2e7dde13857688490805f4defc0a258517b86ac5c8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":127,"source_line_start":127,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"e72e711ded24db4f0c3b5c2e7dde13857688490805f4defc0a258517b86ac5c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":127,"target_line_start":127,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[127,127],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"509b54beeaf23fe7d4b50b5fadf96845ee41f38d327a16217a23ec89b14b536c","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-027","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"538c9e1e9c001e0d9e027d9e59e45f462b98f07158c6f86778e2492fd8981a4a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":129,"source_line_start":129,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"891591f4f4d7b0395e5347a696a5cc618434540793e146ce31eff3efdbfde85c","target_edition_id":"edition.r017.id-id.draft","target_line_end":129,"target_line_start":129,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[129,129],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae14f71ee4ebdabb639492e013b3366acffc660afe652347d06643808f109915","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-028","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"b13847ba0cd6d5138ebb41a69d3ebee3cbda8d257cee351982c80a42c5e153ad","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":139,"source_line_start":131,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"fafc9cdff9324250af7a02eb50c9bb91de37a8941e0b95518213801316d8db1e","target_edition_id":"edition.r017.id-id.draft","target_line_end":139,"target_line_start":131,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[131,139],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"accd06cc8a138be65f3baf619eeb4d09288cf6398e30e9c4abb491aece2ffd3f","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-029","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"860fddee90dd36120ab5863aab5cbbce80dd8a62e07cf1e966dae78398d4c262","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":141,"source_line_start":141,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"8dc4422af091f0a3e58292c0cb2fba9d4cb69f2dd9b35125d20c99864d82d90e","target_edition_id":"edition.r017.id-id.draft","target_line_end":141,"target_line_start":141,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[141,141],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c769c3e39860790885af2d14537db88023bf4c714dc6fab635c0a9b80400bb3d","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-030","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"606f20d8cd96842acd346bb5a9c3fd9a9f5b6411f13298aa46c0704c48c5637a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":143,"source_line_start":143,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"54d2b0c6caf8be5c09b572d5372aad718da80a207514b1d4921727f0bc624315","target_edition_id":"edition.r017.id-id.draft","target_line_end":143,"target_line_start":143,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[143,143],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d26b34eb68ba3255c8f7cb38dbfa4c819a0329596ee8554fb9ff75510647ca0f","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-031","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"08d6f963aaa90286c64b55f9b9763cc01d526ad24d0013f2f6896ae9d9e25282","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":155,"source_line_start":145,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"924e26446d01a8d836153c17aa7fb44abe8439d3c90c3c31415b5659134619cf","target_edition_id":"edition.r017.id-id.draft","target_line_end":155,"target_line_start":145,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[145,155],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7af42a7c57a305f5d84f4b07c2cc67938e1b326866fa39083b2baf92366a72f","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-032","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"f2a5f8677f045d5b02c08dbe590f7b56d0ba3af53f810465cc868c0ce074d8e8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":161,"source_line_start":158,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"b151f470bd69fd67527428c665149c0ea33b182d5b1bf3ff7036ffad1866ea83","target_edition_id":"edition.r017.id-id.draft","target_line_end":161,"target_line_start":158,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[158,161],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10f6fcd485fb74f95de99d934fdfd62dd2bd6687e7ba0af165ae8334bf3457d1","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-033","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"005efaf092f7296717bb33c1aa49ed68ba71a3b946e378e34f8e12a5e17e6e36","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":163,"source_line_start":163,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"0ef5e59b44b1c7a991e09458d22689601e57810efa865139980ec81c60d84ba2","target_edition_id":"edition.r017.id-id.draft","target_line_end":163,"target_line_start":163,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[163,163],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e5acfe13e4853f0a62b0f24df6603c54f4b4eac5c21b1e7536b3cdec1b2ba8c0","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-034","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"8ea7ad756561a7a181932536387498b02edafa3ad2176474fb56ac4b5e0a5038","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":169,"source_line_start":165,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"a7036a8170523a1dd39ad3c036d549498021c3005786186203e99e137cda72ca","target_edition_id":"edition.r017.id-id.draft","target_line_end":169,"target_line_start":165,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[165,169],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5579448347c0473ac9424ed1a1c7e91fbe5b94ac62d0b582b4eec4e37233e749","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-035","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"ad864ed9366b31cfd8ed859de791e9f8ea90f3bfd20f08cffb02d01aeba46a66","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":171,"source_line_start":171,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"499751d7b66e31d2f79b2e0024b0fe230bcf4cec0d7b2b07589356a5a8e6f44a","target_edition_id":"edition.r017.id-id.draft","target_line_end":171,"target_line_start":171,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[171,171],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f606dea530e20562321cbab495c4c740ea29891e35b100800a57ed514b481c00","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-036","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"f836d17ab344b66f0e5fe0ccc44756d301217943fbe2332dee05a30c6c152ed6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":174,"source_line_start":173,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"f836d17ab344b66f0e5fe0ccc44756d301217943fbe2332dee05a30c6c152ed6","target_edition_id":"edition.r017.id-id.draft","target_line_end":174,"target_line_start":173,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[173,174],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48c390538eb532747a1a55541707b28af819f44d8aa636c3874ca55473ebec6d","concept_ids":["concept.flow-balance-sign-convention","concept.flow-conservation","concept.network-flow","concept.transshipment"],"id":"segment.r017.book1.ch04.text-b.block-037","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.graph-theory","concept.linear-programming","concept.network-flow"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"89896974092748762e9db3da8338ac99895013354138d95848c3ca749953ff0b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":177,"source_line_start":176,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"7116be0b23a52f22aeeca1927612b9fd665fc2a82d3210a9fc1c6cfd44178af0","target_edition_id":"edition.r017.id-id.draft","target_line_end":177,"target_line_start":176,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[176,177],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee28eaa339dc48aa3025c7574cd4c58274de0db03f7823286c6d1bbc704a2eeb","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-038","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"ead03150de228f7e674c31666fc684715844e38559e70ff8a2704c326dbe505a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":179,"source_line_start":179,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"395ee7446e2cd68b1c2cfe351cba790b8ce82226bbc19a1dafcac3def15d7498","target_edition_id":"edition.r017.id-id.draft","target_line_end":179,"target_line_start":179,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[179,179],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d219fcb94dbf48d695d9df66bb681fdd79388e65498c5d14b1742bb760695904","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-039","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"220fc425d4e33c416ef7b97dd6dbc6c4360123e51213ac62c05610dbccaa9224","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":183,"source_line_start":181,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"f3e6e3063d6073f8814b1ad94b6d4f04b88bed89f3406380bbc28155bbf04d03","target_edition_id":"edition.r017.id-id.draft","target_line_end":183,"target_line_start":181,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[181,183],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"532f627680dd4d12e268b2b9f3b6a70f0718a88fed2e8c0e0d19315b1092a487","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-040","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"26f90b538bb0934e0f53a2d4ed39c34cd5c8fa49a8844791326f7cdb17c487eb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":193,"source_line_start":185,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"0ecc51ddb9193872401628f56acfd29b50b6248d4fe78de1feb3b41e4d2db7ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":193,"target_line_start":185,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[185,193],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3845b1f7af4e7705abfcb59045338b8ec721074d74d6c1391bceb9afe3d1d35a","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-041","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"c70fdad6d8b493f04927ce24e1889d9e869dd60a09f07f72608365acf87cdfef","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":197,"source_line_start":195,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"c70fdad6d8b493f04927ce24e1889d9e869dd60a09f07f72608365acf87cdfef","target_edition_id":"edition.r017.id-id.draft","target_line_end":197,"target_line_start":195,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[195,197],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"be0d8d18f8441c6375b684419287d1b30e88aa587e2f569a209b13b940683ca7","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-042","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"61f87de5581ef86073bdac4bf7c864a4bd1ebe4627e0f323c1473eb2d5aee5f5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":201,"source_line_start":199,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"9e8fbb16f35fece5d051ecdb3164fa01d98541b3e095600b447ca95e96e7b013","target_edition_id":"edition.r017.id-id.draft","target_line_end":201,"target_line_start":199,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[199,201],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"baf1f3a9038da148cbde35b33c4c0bc8e20c9b9e57b0cfa6b8bbca49112fed91","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-043","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"ac9a1d6c1b80357a9ba224a4e2f6594617bb3da995240335edb4f7cc502fd9fd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":205,"source_line_start":203,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"e4865f31870757884e048b07af30b00e9d0999a737a6dfe6a64ad94a30afd659","target_edition_id":"edition.r017.id-id.draft","target_line_end":205,"target_line_start":203,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[203,205],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"470b154896f896d69c39de50c526e7d7ad6f5401bdf4aa2db3b6ec8c998235bb","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-044","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"e83873149ce6e5ff22a93d5864263e24ff6d08c92f7ac719bb983cf14736571f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":210,"source_line_start":207,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"65bd8e02a225151150b887528f17a5ceb6bebd8b94c60ad43b42b8311d327267","target_edition_id":"edition.r017.id-id.draft","target_line_end":210,"target_line_start":207,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[207,210],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90cf78e50cafa1562b1d5b04bdc58c1533f37ec3e6137e8a9329d6a5f7af72cd","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-045","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"eccff33902489b61bde83332c0b3bb21d142bc5d6160f96a016448e9d55fc207","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":220,"source_line_start":212,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"7d04cc899217d1d3ec878fac78d957928df73b5ab49380652b35fe3ceab2bf91","target_edition_id":"edition.r017.id-id.draft","target_line_end":220,"target_line_start":212,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[212,220],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"100e13e07b3ea3e34e09d106f63ea55d92ad11cfbcb5dc071428be21a5931f3f","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-046","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"0b0c6f086b80cc7a6662d9332896683d639caebf0b5c87ca6ca0be26e6359cc0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":227,"source_line_start":222,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"13c2f6183fdf392fca2a043eb985c53c8a90f60a106bd6cfa8704a6987c878bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":227,"target_line_start":222,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[222,227],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b00827d602c8d14460f8feb40c4568a7f9804b8c91144658aae15d62d5271fbe","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-047","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"0b026f4af5ee3274bb84060ae66e9b2e755998cc35c5570bda63e205d829cc2e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":229,"source_line_start":229,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"867144e475a057179967bf49389572d107bf133e20c2d1c742cb2b4af9cfd911","target_edition_id":"edition.r017.id-id.draft","target_line_end":229,"target_line_start":229,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[229,229],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc58b1c5841509aed69401bb8d1ecb73cbe2094cb2b52343a07d7d02392e7d04","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-048","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":231,"source_line_start":231,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":231,"target_line_start":231,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[231,231],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ddb347ddf70a29aa83022e3ecad54607fd0a2b385f1c5d500ce03fdae443ecbd","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-049","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"ccb4c8876b6a1fa7b143582172f8775b29bd48ee9aa24d63cc0c8075b5adce01","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":233,"source_line_start":233,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"76301b0394d97aa665fd995da1b1168cce99a30cab3632e3f0a5d7c636e8648a","target_edition_id":"edition.r017.id-id.draft","target_line_end":233,"target_line_start":233,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[233,233],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f66ff2785e8336ff511fd9ba423005402947dfbeebe35724f9b6bc790b399d8","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-050","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"7822602037504284bbfeda8c726db9e6bb18c2b9cda6902f09f7b4e3f6cbf784","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":239,"source_line_start":235,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"357534d4056b9c9e9581b5d7c8140c3d53a5b9907b09b8c93f11ca20a5b4be3b","target_edition_id":"edition.r017.id-id.draft","target_line_end":239,"target_line_start":235,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[235,239],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"910619eca73638f11da1ccbe35df517fc639c7c8f6b13a1355949d300eda5587","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-051","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"b26a96b244b80bbfba373e12c53589533a4b273a06ec521965606c511265bb3c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":246,"source_line_start":241,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"ebe4e1f2e44c234d25bd083055f973df8d5a0db3c2bcedb04d866e6e3acfdd6b","target_edition_id":"edition.r017.id-id.draft","target_line_end":246,"target_line_start":241,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[241,246],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18ce25a8ede74d49694e6fdf7443c0d8f1227f6b7f51704e0ac678d268892244","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-052","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"740aa6c558b8215ba487d500176ce3a40445758fc970339a06f00d2a6a056376","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":249,"source_line_start":248,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"62e9a80332e5e01ab818847fa4f1894502ad0eac47bbfcdcbdc63ca7433370d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":249,"target_line_start":248,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[248,249],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"65a05b9e7c3a17859f65b8c99057d11322699b68bdb01b64c86c37ab27dd06cf","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-053","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"36ab81f345f4ab0e22b16b8ee4456ca0118001f65c49e687695810da60ddde3b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":257,"source_line_start":251,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"97d5ed7a50df17bec8e603563c8d2bf37e19a8180ba4c6f7e11f99b192266b19","target_edition_id":"edition.r017.id-id.draft","target_line_end":257,"target_line_start":251,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[251,257],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"85766e01b603f6767951ef1c3d2aae2f8eed1dce6de4a35fd0d246fa72abd3e8","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-054","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"617dcaf01c5eefb2b768894d965f7579e2e96d417559ea6f7338c3eedfb15485","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":265,"source_line_start":259,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"79dc5f04cd379bebe68935b1829b6be898a5e9dff27e06e57085eda46bbc6758","target_edition_id":"edition.r017.id-id.draft","target_line_end":265,"target_line_start":259,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[259,265],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee380a6183f788b70ffe40f895deeec2c614fb3f181ade9e5b3ff86bfcfe1f16","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-055","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"bb4989c0e1d9c570629721f7298585aa1b31bb19e4514a364db06cfa0fe431e1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":268,"source_line_start":267,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"d76dc79cc1ae1d9a653e823a32e1b43952521738131aae4e1359bd1e01bef0a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":268,"target_line_start":267,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[267,268],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cf88fc44e1c4ec26b00f0a27d2d201c5a619226b0fb794f5ff190b91c36f0a1e","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-056","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"bcfbc3c372442d77a21a99464c228f67cf71ee42fd86bfe3c3d6363dedd0578d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":270,"source_line_start":270,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"e0f4ca3c00b07f5ae04703c407ff08ae6d5e7ed76bccbfc46f76226a8e53a607","target_edition_id":"edition.r017.id-id.draft","target_line_end":270,"target_line_start":270,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[270,270],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b463d261f8b9d4d1df56f05e1e41996153f58e7ed093ff741bb7d452164af538","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-057","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"b15f27c2a627774a6dd97605edfbab8b7104bc4e5d2e77b5342e7ce1800b1c52","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":282,"source_line_start":272,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"76a265132fcc635ccd6eff24f9ec51dea0e09aac7893cc2471bb5ce428186b10","target_edition_id":"edition.r017.id-id.draft","target_line_end":282,"target_line_start":272,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[272,282],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee74d22b7b6650ef115ca5f9f4fa9d6456f73b196bc9276e4875f161b6952e5d","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-058","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":58,"source_content_sha256":"e07cde9b12bf9ea7c7e1986b18677e87b58f9d1e2979c5fd719e204dab1636c8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":292,"source_line_start":284,"source_local_id":"block-058","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"365ed2af10ebb11418ac3f5719171e8bab49dd59247608a889448d5efc6a8e46","target_edition_id":"edition.r017.id-id.draft","target_line_end":292,"target_line_start":284,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[284,292],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"010d914b43b4cdb73b7b389bc374808d5f638f1e7ed45eeee50e9438d2b18b42","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-059","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":59,"source_content_sha256":"358f01df9a59a80452460ab6b3bab8f0fc3e87c0e39b5fd00331f5780870a732","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":302,"source_line_start":294,"source_local_id":"block-059","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"d2185a55f7524fc1e4a84af94b587f1953ce97dae13668099e22df7b526809fe","target_edition_id":"edition.r017.id-id.draft","target_line_end":302,"target_line_start":294,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[294,302],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b6e0f9849e43395f49c47e07b84befc4b89738bd8fde8f9a41d974c741a3068","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-060","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":60,"source_content_sha256":"26f81a49c629089af7b6718b59bcf6d0aa290e23762b50a33a6b6cb8a97be129","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":314,"source_line_start":304,"source_local_id":"block-060","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"08a826f3b247c2beffc6b4fd90a41fdce00abcaf2ac0f6fc17753e81c3050499","target_edition_id":"edition.r017.id-id.draft","target_line_end":314,"target_line_start":304,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[304,314],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ca03a12267cf66de22f3048b6e908e7db164e980242353b17ce978dfbc7045a9","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-061","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":61,"source_content_sha256":"82cc2abfeb2c297b62e5b158cdb208cfb0b389cc1514185ed082c034d690fc4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":316,"source_line_start":316,"source_local_id":"block-061","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"618f95118f1eca5bebf927a9ae38e2a6a6dce2c6da5d1bf9078d7debf54c3535","target_edition_id":"edition.r017.id-id.draft","target_line_end":316,"target_line_start":316,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[316,316],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f6cc455978846ffec246e14778dd88f12f19c036b152de24021f5fe0e0f09df0","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-062","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":62,"source_content_sha256":"97f61ac39c3959a8d39ec57f17410d0897d7d779877609d5a192bb5799933249","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":363,"source_line_start":318,"source_local_id":"block-062","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":62,"target_content_sha256":"d5bfe911d4260cb8e34efa44f615ac1fc7ac4e9547cdac68dd73b40e7c7b915a","target_edition_id":"edition.r017.id-id.draft","target_line_end":363,"target_line_start":318,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[318,363],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a831d4c71f126f8d453c8170b18fb1b11cb052786e9e7095d463499540b6aeb","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-063","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":63,"source_content_sha256":"22c1120f0bdef0b7c4f4b5221d9d8a211c423b7c2a736ada80013889654d29b1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":369,"source_line_start":365,"source_local_id":"block-063","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":63,"target_content_sha256":"eac42b8b4ce3a9838da4b68a06358f4bba7ef3c92931dfea2c9a4bb44998145a","target_edition_id":"edition.r017.id-id.draft","target_line_end":369,"target_line_start":365,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[365,369],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"994a9fa7267f0eceb7dc279fd0acc9471e918ca710c18c6e783f4c597a8e2a52","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-064","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":64,"source_content_sha256":"7e75822cb6c6683412e5c056ca44e4424b4bd348c2b0ee78d1176e4082e34fcd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":376,"source_line_start":371,"source_local_id":"block-064","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":64,"target_content_sha256":"6b039526fa0d51b13192bd6ddb56a3218b3c6317e8036cba0791e1489bbae17c","target_edition_id":"edition.r017.id-id.draft","target_line_end":376,"target_line_start":371,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[371,376],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4abeda4f3333c132d3b9d4b4203ebe06e597f1425294cb75d2ad22f8c40d6fdf","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-065","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":65,"source_content_sha256":"139f4b74d0cc99017231858829749746491e4ef16dd732cffcf13f7c49141645","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":381,"source_line_start":378,"source_local_id":"block-065","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":65,"target_content_sha256":"fbe0e12cfb254426ba60388f0ad290eb86d8b98d0b1bd8bbedafaa70a24ecf34","target_edition_id":"edition.r017.id-id.draft","target_line_end":381,"target_line_start":378,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[378,381],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a1d5622923e9c599a7bc37dff92fa5fc5a9cd48064d2a9c7cb7382378b641489","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-066","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":66,"source_content_sha256":"ed285fccfb2d83595f8fe02c82efec773c82f0722830b3b80f22aa672c044578","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":384,"source_line_start":383,"source_local_id":"block-066","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":66,"target_content_sha256":"eb63c50ca84b6db85c60d7aacb5b361f93b0f0595dc74b04d8d7d2a0fb25eda4","target_edition_id":"edition.r017.id-id.draft","target_line_end":384,"target_line_start":383,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[383,384],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0873c1a59c6557e28a64b02890efffee32e9488d581323f65760025cb45c8385","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-067","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":67,"source_content_sha256":"3fa82cf81c4d26f4a291e17bf4222415462c57bfd7157fbcaaff5c74c8eaf581","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":390,"source_line_start":386,"source_local_id":"block-067","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":67,"target_content_sha256":"0498da387ceeed399fb37fd168f5bd546ff3ac598f5865077f12c505857642f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":390,"target_line_start":386,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[386,390],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f23808e70418ea5068ef79234d04b3a8d184cd563c655d0489723005b0e742e5","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-068","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":68,"source_content_sha256":"35e9efde03510d01a5855c372b40cbe81376b82491befe14ac7d41e3a22c9de2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":393,"source_line_start":392,"source_local_id":"block-068","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":68,"target_content_sha256":"8639e30e059320352b40a26197555fc3e17f4948d8cf0186d75d1fb91d96d7f7","target_edition_id":"edition.r017.id-id.draft","target_line_end":393,"target_line_start":392,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[392,393],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3808fe806f83fd9c28055e7fc1cfff10fa9611b1aa4a90f3f30319b43c6a770b","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-069","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":69,"source_content_sha256":"ea12b8e44f9791dd2431a716238b2079f689b00063e1f092ca4c27fee3929674","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":396,"source_line_start":395,"source_local_id":"block-069","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":69,"target_content_sha256":"9462512a37eb1a9e67b2fa9f378e81b6f20c646fb5352d2463bec9bc51fb838d","target_edition_id":"edition.r017.id-id.draft","target_line_end":396,"target_line_start":395,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[395,396],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b8ee61e911df9873e675f16526888f851efbd4df1db354d559e9a7a2eef1e20","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-070","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":70,"source_content_sha256":"8480d5e5ea9c28e7b88236b29301530325294ad2c73119f83249fb359524e9bf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":398,"source_line_start":398,"source_local_id":"block-070","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":70,"target_content_sha256":"8d4f2471ace3a4cc49f2f0cafee196040dd338a10a7761abb665a0a0754f27f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":398,"target_line_start":398,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[398,398],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d47c0a34d524e03b6c9aaea3f1ea71cffd865a672e95505f5cf5c5138c70b98","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-071","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":71,"source_content_sha256":"95c9c281432eb972bad4e56b0ab849f4bc209bc1144e118511bbe7ec2c909c23","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":400,"source_line_start":400,"source_local_id":"block-071","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":71,"target_content_sha256":"798b536c67d8e3093312eced197a593599d519163088eaa379e77a616381bf76","target_edition_id":"edition.r017.id-id.draft","target_line_end":400,"target_line_start":400,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[400,400],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd1101eb0cdf53d9994c7d6600e96b95ecd770a29a5598f7ab033a45e37cf536","concept_ids":["concept.flow-conservation","concept.maximum-flow","concept.minimum-cut"],"id":"segment.r017.book1.ch04.text-b.block-072","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.graph-theory","concept.linear-programming","concept.maximum-flow"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":72,"source_content_sha256":"b20d9bc28dc7b48f3ed873260198e9b34ccbfabdcdea01abf88fbf6388d6b6c2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":403,"source_line_start":402,"source_local_id":"block-072","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":72,"target_content_sha256":"7cd885a408e2ca318ac27240c11266acc87ddb1484990def66cac9cb7abad139","target_edition_id":"edition.r017.id-id.draft","target_line_end":403,"target_line_start":402,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[402,403],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e6f3fcb72ec980c2b449d27d328707b1f0448259f686de5e20ad962f808187e9","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-073","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":73,"source_content_sha256":"85cb7c85376bd17412ad9e8cc42de4c81e5f831b56b1141ff2390d6a8480ae0b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":405,"source_line_start":405,"source_local_id":"block-073","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":73,"target_content_sha256":"cd5a67866a240ef05dbc91f9afe48427c45018646997d80f2390e6e06ccc84cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":405,"target_line_start":405,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[405,405],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e52c3f842abdb409fb7c1d51086cb26245f88a3acab4585b201a52830674556","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-074","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":74,"source_content_sha256":"19d3cad7027a39a7dd06fc97e14d5a1e065a7a590f1d27bf0c6fe5b11532d0d3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":407,"source_line_start":407,"source_local_id":"block-074","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":74,"target_content_sha256":"f6345fa02256cfe7f62a9e52c51394112f1bd857829bcea538dd56621a40811f","target_edition_id":"edition.r017.id-id.draft","target_line_end":407,"target_line_start":407,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[407,407],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"06af57134171c7c6ac4fec510a4f6a132b65dad52dd9d889d6f7b3fe77350aa5","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-075","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":75,"source_content_sha256":"ef06a92c17d249b03ec66f8ccbde7369eb2bdf6fc12aafba45fedcee8b49242a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":409,"source_line_start":409,"source_local_id":"block-075","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":75,"target_content_sha256":"c3304e91789e70565770bcf8cb4473d777e858b2ec0e643831b1225e65cf1dbd","target_edition_id":"edition.r017.id-id.draft","target_line_end":409,"target_line_start":409,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[409,409],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"426df00ed5fd1ecc78bb8b36669018770ab9b3a5a0d4eb03a9d9ffd4f8064bc4","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-076","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":76,"source_content_sha256":"c2db7b73af3292a324bbd3f26251561de3ea59827302594430abb1f210a299df","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":413,"source_line_start":411,"source_local_id":"block-076","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":76,"target_content_sha256":"8856bbcaf3b4dc871057002b7dd5de6f23c233c5f195d75e167378d99f162d9d","target_edition_id":"edition.r017.id-id.draft","target_line_end":413,"target_line_start":411,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[411,413],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f0407bc31277c0cc9d6e014f0ce6e25d5851861b334a54d552b1af40ae0f35c","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-077","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":77,"source_content_sha256":"3a357f123b965dfe6fb43d81f936966789b72d1d4d9bc30d15d04408b52c0fd8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":424,"source_line_start":415,"source_local_id":"block-077","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":77,"target_content_sha256":"8c16bf79ecba394a6bf7843dd2667fd4e6f41f2826d7fea48089dfed0320ebbd","target_edition_id":"edition.r017.id-id.draft","target_line_end":424,"target_line_start":415,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[415,424],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"13cd68d6f39b78cf13ca9097f7f9ad9f6add21feaba6edcace3f7669ed862fa6","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-078","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":78,"source_content_sha256":"247a024f40f519c2fd375a7c2364de53bafe28103701f84a75943c93af017024","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":438,"source_line_start":426,"source_local_id":"block-078","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":78,"target_content_sha256":"d7fcb2f2409f6ebf9c3d95cf93e2fd57c6288b79b91554d8586d8455cd8de810","target_edition_id":"edition.r017.id-id.draft","target_line_end":438,"target_line_start":426,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[426,438],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20d4cca766880bedcfe02cf4636ba8d32484e926c6f241ea49e61fcba3c7fd77","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-079","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":79,"source_content_sha256":"455f4c5661f37de058395d1296d6a2b5d240c73ccc29ac138751820d289a5982","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":441,"source_line_start":440,"source_local_id":"block-079","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":79,"target_content_sha256":"455f4c5661f37de058395d1296d6a2b5d240c73ccc29ac138751820d289a5982","target_edition_id":"edition.r017.id-id.draft","target_line_end":441,"target_line_start":440,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[440,441],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e34de45cd79126622783cda6c97ea14cba540c9e68b1d17189eeaed85f36175","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-080","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":80,"source_content_sha256":"676e55f3aa281d4fb2f77989c8ec4c4e00bc08eb9054435f1b06d3928010780c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":447,"source_line_start":443,"source_local_id":"block-080","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":80,"target_content_sha256":"dec77719531392408d97415f52f3ad9006536b11113fab1916b2b950cb7b510a","target_edition_id":"edition.r017.id-id.draft","target_line_end":447,"target_line_start":443,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[443,447],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a60a4e549be107010e107dea9b6a228c2cf95cfa67c03ab0400de5d96674b526","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-081","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":81,"source_content_sha256":"15bb918b5ec67382bc19cdfe04933de0dcdf8553db9b13bb321bf0448c4b1345","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":457,"source_line_start":449,"source_local_id":"block-081","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":81,"target_content_sha256":"471a58d1ad34ed078d566ca8113cd45f7f5203e6b88b1926f883d351c05841d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":457,"target_line_start":449,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[449,457],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"224dabce0de96567e8d09fb7d8437acf1ac4026b18f023011545348f6eb6c1cc","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-082","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":82,"source_content_sha256":"654d762377ae10e85c393260e3a0532825399e4b7f2671f5645835b531aa6f82","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":464,"source_line_start":459,"source_local_id":"block-082","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":82,"target_content_sha256":"86d57eccc58eaa560466f32318cdd88b47bf42dd94fc8e5bc10e432f0501e502","target_edition_id":"edition.r017.id-id.draft","target_line_end":464,"target_line_start":459,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[459,464],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16b74ffb3a30996ea8f3a4e182162fb90bda98ec63d16f94da08b2ccfba334e4","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-083","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":83,"source_content_sha256":"d53910794ab7c3234a0977715fceef541ccc467b254db1d253ae02da6f87842c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":467,"source_line_start":466,"source_local_id":"block-083","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":83,"target_content_sha256":"81cf03d5f806768858a8ca51ed7856f52289894f7966b514aea7537ba5f8e558","target_edition_id":"edition.r017.id-id.draft","target_line_end":467,"target_line_start":466,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[466,467],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"649fc48a037aa6aa5ffc650040495511c10ab5ae21051b34b662ca82cba33993","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-084","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":84,"source_content_sha256":"bb7e0a918f257de0b4bf9e580a1a5c88b46bbdc6d28bcd75a156c5e483d08ec6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":483,"source_line_start":469,"source_local_id":"block-084","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":84,"target_content_sha256":"fccebfbd3afbe73a3e66b8951e08e08e85257140284b377d934c242d53d54647","target_edition_id":"edition.r017.id-id.draft","target_line_end":488,"target_line_start":469,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[469,488],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd264e3985e0e48096df12641fc6e31b97ad440230c25620e84e12fbc97604e0","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-085","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":85,"source_content_sha256":"ec103ce2c62a0348d302bc716c3b3b98a93db20ecb56e46dd9f39bb8c7af52f5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":491,"source_line_start":485,"source_local_id":"block-085","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":85,"target_content_sha256":"fa16e35dd94c7f3f0a072c2bf290200ca79bd06108ad1dea13741a11468c8dca","target_edition_id":"edition.r017.id-id.draft","target_line_end":496,"target_line_start":490,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[490,496],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6bc90ab178d16c64008d764797b8ee32d0d69ac6e2ca9f2bcbcbffb9f8a4ac5","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-086","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":86,"source_content_sha256":"816cb99a40efceb58150c5922e7ca003bca5458163a535c39266e4171da0d3e3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":499,"source_line_start":493,"source_local_id":"block-086","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":86,"target_content_sha256":"29401ebda4a20f8a62d3aa9335a72e8675fa3583b37a8543851913bfa0a8b80a","target_edition_id":"edition.r017.id-id.draft","target_line_end":504,"target_line_start":498,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[498,504],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"539365c42c0aaaf0e40be2cc676911167e44a5587d50080ca2fac86e17be826a","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-087","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":87,"source_content_sha256":"f404dd9dea23d48c2b333f85f241235dfe89f9990890ea4b2f80c184d540713c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":502,"source_line_start":501,"source_local_id":"block-087","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":87,"target_content_sha256":"1b7f375ea8e3e265134b10da96134bc2408b97b5209a2465ef817b2735a586c7","target_edition_id":"edition.r017.id-id.draft","target_line_end":507,"target_line_start":506,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[506,507],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"508b9a354e6a346730beb7dc129b115bd7aac34f4e3418130d6134d182788284","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-088","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":88,"source_content_sha256":"a2d7292ddf97608533d273b6f029b1e349e8407f38ea6a758345097cd22a4fae","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":506,"source_line_start":504,"source_local_id":"block-088","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":88,"target_content_sha256":"e8db46618d5a3cd87397462907e51829a1c698790cda36a9e733b26b14570447","target_edition_id":"edition.r017.id-id.draft","target_line_end":511,"target_line_start":509,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[509,511],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c0b5b9b45912495b98037dbf382f80c8216d86b8577d688ee19b3c93a3b54e2c","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-089","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":89,"source_content_sha256":"691dcc3aed0661eacfa6a95bea1c3f715286bd1631440b0986662a557dc65c19","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":517,"source_line_start":508,"source_local_id":"block-089","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":89,"target_content_sha256":"2744d9b37bee161ab5b541c11e659443c81af0b6e30b11a96cf4f41ace6afb60","target_edition_id":"edition.r017.id-id.draft","target_line_end":522,"target_line_start":513,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[513,522],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c39e15fb0c1fe1f56e128970a30e1411ceb845197a3c481ce92966be9dc679c3","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-090","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":90,"source_content_sha256":"15737da9d0a7aec60ab5fdfb7de6db0c8821638243a5a32ec078bfd0be287a18","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":525,"source_line_start":519,"source_local_id":"block-090","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":90,"target_content_sha256":"aa212dc7f30a138beafa665711cbc6659f952cccc0e987f35b176cdff6ca97a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":530,"target_line_start":524,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[524,530],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"35f41eb0a50e3ae4d3b3751694bb752da5aa4e9fa67888ca79788dfefaa7fdb0","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-091","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":91,"source_content_sha256":"81e2b7715b2ff4945a64aace358a682961d0b9db04a6c312ee58a9328dbb4e4d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":530,"source_line_start":527,"source_local_id":"block-091","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":91,"target_content_sha256":"7be04fa1ed7114bcb27bacf432dda13b4222c84d9ed805bbd5dc45dbea704c66","target_edition_id":"edition.r017.id-id.draft","target_line_end":535,"target_line_start":532,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[532,535],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7298cbd2cd28f4fbbd67e6bdfd43c790e94b3d8bfc99dab2b332a8f7647393f4","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-092","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":92,"source_content_sha256":"94d6b299d807b0d488849b2c9aaa5cd20f934b7923f9badbf720c580e541b9a5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":537,"source_line_start":532,"source_local_id":"block-092","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":92,"target_content_sha256":"21080a7636bb47062a9830c5868d9663ea3db0583bb8e5f2bb77f6cfabb7f139","target_edition_id":"edition.r017.id-id.draft","target_line_end":542,"target_line_start":537,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[537,542],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6b1cbc75f64f92ec7a436be2fdcda01f06b63aeb7d01c86f7d9bae8118df073a","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-093","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":93,"source_content_sha256":"42fd6d22899226460179f800ffb5f968be6d244758ace3cadaa30663f5b571a8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":542,"source_line_start":539,"source_local_id":"block-093","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":93,"target_content_sha256":"d52a828a29273e6846867862333cf4d75bcce3b500c6e5802607f7a8ae239da6","target_edition_id":"edition.r017.id-id.draft","target_line_end":547,"target_line_start":544,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[544,547],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f20102cf4e8b77e1612b45323996d5657c65fe1ea2cf979a4328ece426ab98cf","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-094","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":94,"source_content_sha256":"01706aebeab321cd02d9c00c5caf1661070bbe0af2f4969c2fe1c0936f72358a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":547,"source_line_start":544,"source_local_id":"block-094","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":94,"target_content_sha256":"3838eefc551e6e4b29d3763831774e009e9285ba8025634fe4c80622c903fdd8","target_edition_id":"edition.r017.id-id.draft","target_line_end":552,"target_line_start":549,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[549,552],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5047512f65dec5e15e200410aeb451437bcc5c9b3aed1a2463ded70e95db7f34","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-095","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":95,"source_content_sha256":"455f4c5661f37de058395d1296d6a2b5d240c73ccc29ac138751820d289a5982","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":550,"source_line_start":549,"source_local_id":"block-095","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":95,"target_content_sha256":"455f4c5661f37de058395d1296d6a2b5d240c73ccc29ac138751820d289a5982","target_edition_id":"edition.r017.id-id.draft","target_line_end":555,"target_line_start":554,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[554,555],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9fc6a16c3ffa118bd5535bf2a11126ff2659c6e557059151ca9ad3363af3b22a","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-096","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":96,"source_content_sha256":"2e363d22595ea2cb8926ef94611617371e386a8f1da12d32d942c1900772848c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":552,"source_line_start":552,"source_local_id":"block-096","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":96,"target_content_sha256":"1ce97baef3c8cf0146d95a3b0aaa28b3a87a296113a8dbd6806b8bae125fc089","target_edition_id":"edition.r017.id-id.draft","target_line_end":557,"target_line_start":557,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[557,557],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4da0a3eed22b37b9dd07e25bf7d2289b0c94c6cf9e0d9b5f695101fd6396354a","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-097","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":97,"source_content_sha256":"22c1120f0bdef0b7c4f4b5221d9d8a211c423b7c2a736ada80013889654d29b1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":558,"source_line_start":554,"source_local_id":"block-097","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":97,"target_content_sha256":"eac42b8b4ce3a9838da4b68a06358f4bba7ef3c92931dfea2c9a4bb44998145a","target_edition_id":"edition.r017.id-id.draft","target_line_end":563,"target_line_start":559,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[559,563],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c7d6ea9f35ff5154922e2b47c49dc85a3c565c07fbb82c1da320adb03ac4f52","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-098","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":98,"source_content_sha256":"81cd16600e2263efebcc9fb8f2439b50ab390682ff8cf60133daf84bc70f5aec","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":565,"source_line_start":560,"source_local_id":"block-098","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":98,"target_content_sha256":"ced9485412b7e8e916d20e9ba42ba69e9767991ff205e24b6d5e3402a36beae8","target_edition_id":"edition.r017.id-id.draft","target_line_end":570,"target_line_start":565,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[565,570],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0ad0a1be005720a66464ab69f06ddf482a315dcf6d1810aeae5064d7a17b466a","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-099","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":99,"source_content_sha256":"139f4b74d0cc99017231858829749746491e4ef16dd732cffcf13f7c49141645","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":570,"source_line_start":567,"source_local_id":"block-099","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":99,"target_content_sha256":"fbe0e12cfb254426ba60388f0ad290eb86d8b98d0b1bd8bbedafaa70a24ecf34","target_edition_id":"edition.r017.id-id.draft","target_line_end":575,"target_line_start":572,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[572,575],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d20b94732915175dbe39c9d01357e37c58cc4de3ffa24595bb029fae8da718f3","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-100","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":100,"source_content_sha256":"15297bed6cf6950131e16e7327a5515b92c3160f8f618a935fe9c10dfb056ddf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":573,"source_line_start":572,"source_local_id":"block-100","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":100,"target_content_sha256":"cd754d61f32214ad56eccc3b80855c694bf26bb73ec0457196d5e434e6ad4bb3","target_edition_id":"edition.r017.id-id.draft","target_line_end":579,"target_line_start":577,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[577,579],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14d2967c6d2cf198e8cadc19a8ae16be4cb0c033896b0de6781eac4a0e920d48","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-101","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":101,"source_content_sha256":"a0ea118cc563a939abf542ef6a9cc373ea8389e400c6c429fd5ee1508605c6ee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":580,"source_line_start":575,"source_local_id":"block-101","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":101,"target_content_sha256":"93476d5e168f147b5118ab732e5e2f1a4ea7ae042b478adf12670b295a3e14af","target_edition_id":"edition.r017.id-id.draft","target_line_end":586,"target_line_start":581,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[581,586],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1904c869e2dde5e5de2cd91744e9e66b651e525dc7783e7838f5a7fc4395f02b","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-102","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":102,"source_content_sha256":"f13ce1668fb7df20b9c176ff1746c91ca041c65923e4da4e69ec87fea291f0a3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":583,"source_line_start":582,"source_local_id":"block-102","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":102,"target_content_sha256":"97bc9fda5567459fa04aac469e5526d34a43d29cbcbb426801cc47cd0c472e8e","target_edition_id":"edition.r017.id-id.draft","target_line_end":589,"target_line_start":588,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[588,589],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe5f8da5b702ec391ba69d80469757fed3cebde4733a7f914a00768a83ec3f5d","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-103","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":103,"source_content_sha256":"72a5dc63a993155cd03c5fcaf0ef73b84a8286bba2eb3e89d4408ff3a4fe19de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":586,"source_line_start":585,"source_local_id":"block-103","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":103,"target_content_sha256":"c9d19e5b1ff873b88d46216671785171db93614848147455e2b7ef3fd583b089","target_edition_id":"edition.r017.id-id.draft","target_line_end":592,"target_line_start":591,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[591,592],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a43294135ed35bcdde94e10fc61fb7e79c03ae49447558e4ce3965b352c186dc","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-104","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":104,"source_content_sha256":"8480d5e5ea9c28e7b88236b29301530325294ad2c73119f83249fb359524e9bf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":588,"source_line_start":588,"source_local_id":"block-104","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":104,"target_content_sha256":"8d4f2471ace3a4cc49f2f0cafee196040dd338a10a7761abb665a0a0754f27f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":594,"target_line_start":594,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[594,594],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae4f03bfbc20ecde0f34dc36c7f7f7d18c7618abcfbcd070e240fd8c4bdb0759","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-105","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":105,"source_content_sha256":"0d87d5eba607f6a57f240779b4e4cf8f8330b070274d75a00273335b54b33639","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":593,"source_line_start":590,"source_local_id":"block-105","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":105,"target_content_sha256":"253dd9457790c0aca02f3d937351c70c04f2fd3237ad520a17afbe6d99774b18","target_edition_id":"edition.r017.id-id.draft","target_line_end":599,"target_line_start":596,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[596,599],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cda28de7a7a1a047b9e4a09f2ef2311851f4531f489bc84d3cf485d73de5bab9","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-106","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":106,"source_content_sha256":"3a357f123b965dfe6fb43d81f936966789b72d1d4d9bc30d15d04408b52c0fd8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":604,"source_line_start":595,"source_local_id":"block-106","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":106,"target_content_sha256":"8c16bf79ecba394a6bf7843dd2667fd4e6f41f2826d7fea48089dfed0320ebbd","target_edition_id":"edition.r017.id-id.draft","target_line_end":610,"target_line_start":601,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[601,610],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6b33e059c80dc546d3e41e1deedf8608aaaf597a19116394a399806176d1751d","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-107","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":107,"source_content_sha256":"8084b02515a65aed6d2ac311ffad237bf206934b1d263bc2858e5274b2ca7a81","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":606,"source_line_start":606,"source_local_id":"block-107","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":107,"target_content_sha256":"8084b02515a65aed6d2ac311ffad237bf206934b1d263bc2858e5274b2ca7a81","target_edition_id":"edition.r017.id-id.draft","target_line_end":612,"target_line_start":612,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[612,612],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d29f49e1ee79c456194ab948560c179fb782272ee405d966926e72d35507f090","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-108","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":108,"source_content_sha256":"3949b4894f84abe99404ceb51d02b605dc195ed95ea4e3aa98652d4df291f70d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":640,"source_line_start":608,"source_local_id":"block-108","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":108,"target_content_sha256":"472f2872b18e3759c0a92410a618fbae43c3ebf4a5023c8fec38b8881dacde65","target_edition_id":"edition.r017.id-id.draft","target_line_end":646,"target_line_start":614,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[614,646],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"631ef2e14619859f8bb2d0e5cbc8fd69113b2cb60fa2b0e568ed552e8e27664b","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-109","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":109,"source_content_sha256":"fddb3b250ea3108a81fd9da6b529f56c0d8a08b395aeed6e6caf9e9261139e07","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":644,"source_line_start":642,"source_local_id":"block-109","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":109,"target_content_sha256":"07a7bd4185f94e273f66d0833de8c2e18d4d31c7b83858e899a5992435008b15","target_edition_id":"edition.r017.id-id.draft","target_line_end":650,"target_line_start":648,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[648,650],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"941ba72a9c05e05f29d1f8211f25d72bc7d39307699c2825f92fb634dc3c2a3b","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-110","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":110,"source_content_sha256":"90afc583d01832a337a9b02bbca5f8e53f7416c950351d39a02e0a0b3a78c9c3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":646,"source_line_start":646,"source_local_id":"block-110","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":110,"target_content_sha256":"4eb9c4875bf3162ee543e0d27e62fa530c00fe0a0b251e4314713537bdff5daf","target_edition_id":"edition.r017.id-id.draft","target_line_end":652,"target_line_start":652,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[652,652],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d88b1082003d5d8af9218acae36d31e7a2438b562f54e735463f0fead8f973d7","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-111","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":111,"source_content_sha256":"2baefe2c49356c2c1559925eb8105865809a83b8c7bcb57bfbbfe5c6f494f26c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":650,"source_line_start":648,"source_local_id":"block-111","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":111,"target_content_sha256":"035ff3f3c75db19d6ebbf3294a9e8366f651cacc360420270bbc2e6e1976f433","target_edition_id":"edition.r017.id-id.draft","target_line_end":656,"target_line_start":654,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[654,656],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"95066e3fd485aa05e720568a4f006b4d8f8e4cc92597c20146ca42f82857564b","concept_ids":["concept.flow-conservation","concept.multicommodity-flow"],"id":"segment.r017.book1.ch04.text-b.block-112","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.graph-theory","concept.linear-programming","concept.network-flow"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":112,"source_content_sha256":"d94e5b2eddd75fa2ae69568d87ebd3bb27db6c9a8749118366c2ae8e5fc713a0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":655,"source_line_start":652,"source_local_id":"block-112","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":112,"target_content_sha256":"f4da57ac862701ff29a94c48f26bbddf8a3f76258969cc579c0ea56699454369","target_edition_id":"edition.r017.id-id.draft","target_line_end":661,"target_line_start":658,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[658,661],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5ad6dbfa32796ab8715178082ea2135cef19af1b930935a9065354a882bc448","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-113","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":113,"source_content_sha256":"9fbe703bdfeb4e0e6f2c2d3811c0610478df9108723b08e59a0233f63b20cbbe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":657,"source_line_start":657,"source_local_id":"block-113","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":113,"target_content_sha256":"969ecb8c3001dc969b908002288cec6edc786ff6bd09c5c2ec7013d3902350b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":663,"target_line_start":663,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[663,663],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"302d6b6f10781be87128504bac06dd48a9ae67833b4f29fb9df5498e147b327c","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-114","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":114,"source_content_sha256":"37fab2e56bbcb0db02cfc8bae4bb98c36cfb65be78b019157946a30abf7e1910","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":659,"source_line_start":659,"source_local_id":"block-114","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":114,"target_content_sha256":"5637c3d05098c41fcbd6207d7b992a127f6389dd0c46a9fac6cef3e40ac2235e","target_edition_id":"edition.r017.id-id.draft","target_line_end":665,"target_line_start":665,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[665,665],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e35ec1901b07894a9ebc0a7ebcd1692945449af463558182ccf7335cd79edad","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-115","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":115,"source_content_sha256":"4261ef49eb70b0a8a7fae62a5d22685a02f722429321a7df3fa495de13bca25b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":661,"source_line_start":661,"source_local_id":"block-115","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":115,"target_content_sha256":"fb480c001e019f7587f06003d7871c21817f02327baec98e5c697077e164440f","target_edition_id":"edition.r017.id-id.draft","target_line_end":667,"target_line_start":667,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[667,667],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7ae8fcdf9a5f2ad9d64b4182216d95625a5a4d7545b0d4c3f22dc3b707e68478","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-116","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":116,"source_content_sha256":"baa675d9cbf1dc0a408f4eb09ba17c0e6c140f192fa96a62e9cf811898c18c1b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":683,"source_line_start":663,"source_local_id":"block-116","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":116,"target_content_sha256":"980168a44723339ebb81239156a52caa0061ad2c5038878399daa02fe44de55b","target_edition_id":"edition.r017.id-id.draft","target_line_end":689,"target_line_start":669,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[669,689],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b0fe3bb9192bf922a7cc27596508e95090e77650011edd86ca95c4bf406a4415","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-117","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":117,"source_content_sha256":"68b823fee411aa6cf1a9fc02abe934fa29c6a9511b0b8b4ab748b77564bbbf3b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":690,"source_line_start":685,"source_local_id":"block-117","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":117,"target_content_sha256":"0d12a2908727f98b7f6be8872b275c00949940b45375d494b0d1e3712c64f006","target_edition_id":"edition.r017.id-id.draft","target_line_end":696,"target_line_start":691,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[691,696],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7efe94304b3b9e8e4fa60db219251ee1e5e1e1aca0550bc45c4f31bfa579d7a5","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-118","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":118,"source_content_sha256":"f9b81647d971ff8df70ca65d6af514361b5f1b96ffdc8ff5cba57065037474f3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":693,"source_line_start":692,"source_local_id":"block-118","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":118,"target_content_sha256":"a5e0c6dc68f86d26a2a0d0c2d88e2988746c012e64cbac01982057bdca75114f","target_edition_id":"edition.r017.id-id.draft","target_line_end":699,"target_line_start":698,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[698,699],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ebafa3d9bf3adf0364f344fa4e58433798a6018971c4b2c8ae45a6a3031c36cc","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-119","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":119,"source_content_sha256":"bcad665e9d148d5d9d5a98e2659e8aec3eceb784a277487ef45af7646035e474","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":700,"source_line_start":695,"source_local_id":"block-119","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":119,"target_content_sha256":"58ba12c277dd7adc1ea1aaf4d017287256be763a719c3a5be1195a34bce5fac0","target_edition_id":"edition.r017.id-id.draft","target_line_end":706,"target_line_start":701,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[701,706],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e0a4928c9093a7f351255e996b2cef157efe2d8d00a6d4cbebbe81100375822","concept_ids":["concept.flow-conservation","concept.multicommodity-flow"],"id":"segment.r017.book1.ch04.text-b.block-120","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.graph-theory","concept.linear-programming","concept.network-flow"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":120,"source_content_sha256":"a3f2de3280a7f86cd7b3eb23ba58b3049c02f50cdf0c023ca51cb996ff5b85b1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":707,"source_line_start":703,"source_local_id":"block-120","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":120,"target_content_sha256":"cb57d7674b54534b07beef18aec5f7c6a17dfecc532e83773c8d33e5557ea250","target_edition_id":"edition.r017.id-id.draft","target_line_end":713,"target_line_start":709,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[709,713],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7767b5bd05e9ae612e82ef432d8b9bdd2d4de59dbb486e9484455ce0498e737d","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-121","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":121,"source_content_sha256":"858124881a44fa00a94f409e6eaecaa189fd7d78033f96a4a8e8cca1154b6717","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":721,"source_line_start":709,"source_local_id":"block-121","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":121,"target_content_sha256":"774bafb749dfcfb3528d4ff35a2351b8c11aecae0c285b8ed44a65535d95d62f","target_edition_id":"edition.r017.id-id.draft","target_line_end":727,"target_line_start":715,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[715,727],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9aef8262df44a40460cf534e09abcbd49787af9a794fd53e9414fc2a1bc9a05","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-122","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":122,"source_content_sha256":"95a8b37690c8e790bcd107c76191bb98dbc5fa0c526fdfe40ecbeb5d01db31d1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":723,"source_line_start":723,"source_local_id":"block-122","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":122,"target_content_sha256":"76c47e701ab40996c82b51114c153f6b84c1e914019282929c9f1f5817c1070b","target_edition_id":"edition.r017.id-id.draft","target_line_end":729,"target_line_start":729,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[729,729],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bf1293f6166ff4a80dd12eb62c97d057121356bf9bfa01ba2e886acb35f04100","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-123","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":123,"source_content_sha256":"c3d3ee04c2cbb2d2594cfd313de456ead686434092f44d6d99f327ed801db4c7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":739,"source_line_start":725,"source_local_id":"block-123","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":123,"target_content_sha256":"95459e5f5cf5d643fbbe4bfd123031c3926dcdcbe6663c29e1fcdfed8e25fb86","target_edition_id":"edition.r017.id-id.draft","target_line_end":745,"target_line_start":731,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[731,745],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"77cf24037e1822dcb970ecb1817657a24180894dca0d179379ab31ed6d2374b8","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-124","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":124,"source_content_sha256":"40d27d1eb84b8e0ec38f2dfb506a855f39442ffd99bca339d2cd661b0d3bf4a8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":745,"source_line_start":741,"source_local_id":"block-124","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":124,"target_content_sha256":"3245be7e5f537c73bf46a0018f4f6acddf0df06bb75e08d498b7a8b867e3271d","target_edition_id":"edition.r017.id-id.draft","target_line_end":751,"target_line_start":747,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[747,751],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c794c8f384ef5ceec52b6ab77e4a7f78cd9aa7236bf89f2d81423fdba93e044","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-125","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":125,"source_content_sha256":"eba51ea250e314ae63f04ce61654d30e39450e10f18501bb42aa39a71ae3104c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":755,"source_line_start":747,"source_local_id":"block-125","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":125,"target_content_sha256":"47e00c878c5d83fd18f7c33641132dfd33ed1c45646699342829b77f90598c51","target_edition_id":"edition.r017.id-id.draft","target_line_end":761,"target_line_start":753,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[753,761],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ccefcf939007a6d14eb288e464982db718b977b185b97cbe001754b7520f7afe","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-126","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":126,"source_content_sha256":"f339b031d2a72372b585bcbf8a26e04b819823e298965d78607ac0109e7162ac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":768,"source_line_start":757,"source_local_id":"block-126","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":126,"target_content_sha256":"97227e249c48e8c057277812a8a6fb81fa0fafb878f7a79578328c54ada0242e","target_edition_id":"edition.r017.id-id.draft","target_line_end":774,"target_line_start":763,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[763,774],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8766d3f32cd94e0b974eeb44af1e575dda66030d4dc796c95f4c522ef3d7947e","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-127","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":127,"source_content_sha256":"2a39023e69aec9c0eead3f0375266228220d34923d627927eb2f2291b8111908","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":774,"source_line_start":770,"source_local_id":"block-127","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":127,"target_content_sha256":"afde2319447ef0dac86829031a2c65e42bdb2541a9b5dbde8d67bff34f05ddc1","target_edition_id":"edition.r017.id-id.draft","target_line_end":780,"target_line_start":776,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[776,780],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8f41d8d46f6f0e16b9febefb32273f91a3c76eaadf8838f06829b9be09a4311a","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-128","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":128,"source_content_sha256":"80161152f0acb85989a51e61714b914279b048403e143e2c8089d78224088c30","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":784,"source_line_start":776,"source_local_id":"block-128","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":128,"target_content_sha256":"c2427590ea3073291595aa5b103de54681aa7ae6103545392e1eb28cc40628cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":790,"target_line_start":782,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[782,790],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7db4e57f4c2cc7a7ee6fcb8431a808e5e5a11efe54ded39a369e631e093dd0ee","concept_ids":["concept.flow-balance-sign-convention","concept.multicommodity-flow"],"id":"segment.r017.book1.ch04.text-b.block-129","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.network-flow"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":129,"source_content_sha256":"943d31a2dc9045e9a0ec18214bdba0ac32a81d3a750e22535f273c03b38f83a4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":789,"source_line_start":786,"source_local_id":"block-129","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":130,"target_content_sha256":"b86148b7fa01f3f9839ec172f0db418f9fbe72cd68a54e34b536f884fb715c0f","target_edition_id":"edition.r017.id-id.draft","target_line_end":797,"target_line_start":794,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[794,797],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b688752b8f643d3353eaf8349e00024d1a99d1a7885b93d76356149e0a0a3594","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-130","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":130,"source_content_sha256":"376492f1c94fd8e6ef9fe4e08bfce4ca16193e32f89040391af57388816f8f9a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":791,"source_line_start":791,"source_local_id":"block-130","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":131,"target_content_sha256":"ec73396b71638aef9e5dfd82d878a6a48c1b1531b8b9257fb0976108864f68db","target_edition_id":"edition.r017.id-id.draft","target_line_end":799,"target_line_start":799,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[799,799],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0bd907d57b57c5b612d92748bc7562fb04c0ca5bdfd70dbf78740242c7efe012","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-131","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":131,"source_content_sha256":"a74d3c3d28c70d9e973ea9d078610b5735df82849b07e51ac8fcc6096bad758f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":795,"source_line_start":793,"source_local_id":"block-131","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":132,"target_content_sha256":"66d5bb25560417a02c6903af48a06823dae46068d36b147cd8cc527f589a07fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":803,"target_line_start":801,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[801,803],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10e432d0cb0bc2ed64480ba3c6d311f087463114b5d5e90ed99e05001ac77a99","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-132","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":132,"source_content_sha256":"0e07b0cef124b08fe678ba59363bda2de507c730d8cf9e88bcf7b7c24f643816","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":800,"source_line_start":797,"source_local_id":"block-132","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":133,"target_content_sha256":"b6f57a236ee48d0f44f77b4ce60a4e2c320f33355f677d424f5bad76ecd92a38","target_edition_id":"edition.r017.id-id.draft","target_line_end":808,"target_line_start":805,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[805,808],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"139cddd91e7c11fd3af7e4b34b2309d442b6377d86abb9e75bd3bb47a8135c08","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-133","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":133,"source_content_sha256":"ec70d8c1820ad9647295a59082f8f345dc3f241c03cc3381c5a377955e91492d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":805,"source_line_start":802,"source_local_id":"block-133","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":134,"target_content_sha256":"b5a28f2b794193c8c994893957bc9ebd321885a78214d4627f3be7984c322554","target_edition_id":"edition.r017.id-id.draft","target_line_end":813,"target_line_start":810,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[810,813],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3f5b3cb4300348c3739b9b23ec1f20535b5491719fad9cb6c2424c3ed1cd0080","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-134","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":134,"source_content_sha256":"584ebe0c03e183516a5f2303734bb14e853d28a0c7695627d06758a7d1736217","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":810,"source_line_start":807,"source_local_id":"block-134","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":135,"target_content_sha256":"ec0a9dfcbeed2629dc3910a333ceac2405ccd066acb18b6ce4402efd8b5deeaf","target_edition_id":"edition.r017.id-id.draft","target_line_end":818,"target_line_start":815,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[815,818],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ddd85a6c73dd04de95cbbdc6e522638a676661b9eb8afde487fba6155e61615","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-135","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":135,"source_content_sha256":"d10de682d48c5872fc677b20aeaef8c6febbd749f0408f658cb7702427af708d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":815,"source_line_start":812,"source_local_id":"block-135","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":136,"target_content_sha256":"46be7f18f34980a70339aa69275c8cb5dcf218c4223a1a38164f6081c25cfc87","target_edition_id":"edition.r017.id-id.draft","target_line_end":823,"target_line_start":820,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[820,823],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d14d964053d0a9f2673570b1c7ec23ddde395af40585f9559044ac52b105e224","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-136","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":136,"source_content_sha256":"ee0f1da11a7e4f34fb17261f61312e12e23aa0eb2239e0975dbde00ff1023d77","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":823,"source_line_start":817,"source_local_id":"block-136","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":137,"target_content_sha256":"09f17a37f11c5467791df3063dac93d6b2a7902b1bc193410c4ea6aa6e5b80d1","target_edition_id":"edition.r017.id-id.draft","target_line_end":831,"target_line_start":825,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[825,831],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61e11c98e62633dd21067ecd39561ae4be5c84ba5a908e7bb83c526f304e56aa","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-137","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":137,"source_content_sha256":"071a3dc492060a07a1edebe85f69d4af7c76f87d39568d98a9b3ebe577c38683","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":826,"source_line_start":825,"source_local_id":"block-137","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":138,"target_content_sha256":"91f5f5e54979fc071441e59ebb0470ebb961eb54328cb5b025c4bd641d9058a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":834,"target_line_start":833,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[833,834],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39c1ad34f8ceab21542b5ebbd9e50f5f35f5ba7c66a3365004c8a8cf24d965cb","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-138","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":138,"source_content_sha256":"db964f896cbfbf587355b0a2b284adec73ac64027dc4e067e0c4f480e7e39d28","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":832,"source_line_start":828,"source_local_id":"block-138","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":139,"target_content_sha256":"f59b42158368f46b41d06e5dc3e341b5c4846357a9cc2313dfb6034d418fcfbb","target_edition_id":"edition.r017.id-id.draft","target_line_end":840,"target_line_start":836,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[836,840],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a034fd4c41a67119d5e900ad6ef4f7b5fdaf39d49597e8deea6859aca90fc34f","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-139","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":139,"source_content_sha256":"d24fdc71bbca0184dde311ddccc2bd06f38c8ea4f2ab25ce27279066560a03cf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":844,"source_line_start":834,"source_local_id":"block-139","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":140,"target_content_sha256":"8583cd62e13a0313dba08e63d1dc9c3048bcf1e6c2e5f6567cfb6333b0afb982","target_edition_id":"edition.r017.id-id.draft","target_line_end":852,"target_line_start":842,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[842,852],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"923ac8964ef37b035ca5a5acb4ba45d136fada7f323f503583e6a0173b665921","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-140","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":140,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":846,"source_line_start":846,"source_local_id":"block-140","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":141,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":854,"target_line_start":854,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[854,854],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1eeb960cd8a5952c0f92fc5480c38c58f6a3910af1b5fce2b30c1fb0d70beed2","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-141","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":141,"source_content_sha256":"0bee7ef81d0eb7b67eeaeaded46bea31f6cd458c33b94238b7f305186cd05ef8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":849,"source_line_start":848,"source_local_id":"block-141","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":142,"target_content_sha256":"3e5641dd0f9652e82210702ef992bc75769ba42208385e2f87c09d2097ea68cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":857,"target_line_start":856,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[856,857],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3428fcaf8db1de8f3610c6eb71b7bb61e738f684974cf6d349fb1de120e3be0f","concept_ids":["concept.network-flow","concept.transportation-model"],"id":"segment.r017.book1.ch04.text-b.block-142","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":142,"source_content_sha256":"50455a6c85abc3b6fde3f5651b66d83eaf170e005fd36259a88b9ed4ddb0389a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":852,"source_line_start":851,"source_local_id":"block-142","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":143,"target_content_sha256":"75a66ffb1db95047442fd5327545959ed2e930dd9a84908241edd97f21d671e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":860,"target_line_start":859,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[859,860],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"41110c039764e533eb75da11d218da26fd966e6ecc118d44144a8b68bb4d15af","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-143","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":143,"source_content_sha256":"b77e3c4afd4fbb0a4a10406be5c4b170cf48e68c5f50584ab4ed3b4897ea6a27","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":854,"source_line_start":854,"source_local_id":"block-143","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":144,"target_content_sha256":"5f2e9fe4acd09684d74da88109eeb8e0713f28d67cfad4e63289ad97257154f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":862,"target_line_start":862,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[862,862],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"53c9f4bec3e425f9abe8f413f3694d18934a04a96f822a868173c557a2a4f1fd","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-144","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":144,"source_content_sha256":"b916a46c3b5675f5a2b2b7e952b19b305ce5ccee7082156a08f0fff85b675510","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":860,"source_line_start":856,"source_local_id":"block-144","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":145,"target_content_sha256":"b954b5d2db94b56b56fdd90e8b12e85117e43abaacb69ddd37e0e105556dec5b","target_edition_id":"edition.r017.id-id.draft","target_line_end":868,"target_line_start":864,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[864,868],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a61365d2266d32a282b0118deddb486c257ed9aa96899dcd51eb1274c24b9908","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-145","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":145,"source_content_sha256":"6bbf0777d09fcb25acae6b98f48922b84800b4a173bb4f0fd6c09344fff5cb9f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":862,"source_line_start":862,"source_local_id":"block-145","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":146,"target_content_sha256":"7954c24c811bfc9d0bc867ca26b817d282dfda49764c14af0d4cf32872f17641","target_edition_id":"edition.r017.id-id.draft","target_line_end":870,"target_line_start":870,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[870,870],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"17fb26fcbd0e3511ce01e0fd6b611eb51a30e47d35f784e660a03ae48cb5109c","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-146","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":146,"source_content_sha256":"70bc9f408f893a3dd42443f3b0d1d147ba6980769d4cdd0b26e411fa6eac6a25","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":869,"source_line_start":864,"source_local_id":"block-146","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":147,"target_content_sha256":"186ac56e84ac11faa17d7e640eab861beb9118ef48b0ad5c2b24f1a3b48d2ed5","target_edition_id":"edition.r017.id-id.draft","target_line_end":877,"target_line_start":872,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[872,877],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e3e89e124922d8ee5078347e7e08e93a8815145a7ae25d18bf34762bcff3612","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-147","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":147,"source_content_sha256":"58f84af5179a098ee4ca0562d7ae944ecc584066251f4eedcb1267a311ea2742","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":874,"source_line_start":871,"source_local_id":"block-147","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":148,"target_content_sha256":"3cc6e3fd90850abc5874b229f962ad16dc89af90c65a1e3498712ec6a4d6e5fe","target_edition_id":"edition.r017.id-id.draft","target_line_end":882,"target_line_start":879,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[879,882],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00f58f604e153cd38fc31f5020f1180fa3844cf56de33b39cf6cb43e3e544cf9","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-148","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":148,"source_content_sha256":"7d6fa653bd9e645f9b5b8d8ef8a2e665602e2afc360fbca83fc6dd3c20402bb8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":882,"source_line_start":876,"source_local_id":"block-148","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":149,"target_content_sha256":"69b5f7e698b0a3fa47775abd24c6f3de8888190d9077294e510845148aedc990","target_edition_id":"edition.r017.id-id.draft","target_line_end":890,"target_line_start":884,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[884,890],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"62e3984c4ddbc487c5ca10fa5940656e841dcf321859fbd9015390e09f6df5b1","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-149","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":149,"source_content_sha256":"914315b9561e948fe4dd9c762f5bbf53f613ee8eb5b0df780aaaa961bc929555","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":884,"source_line_start":884,"source_local_id":"block-149","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":150,"target_content_sha256":"7957a18f5cb57a1f640b9cfe142bd17adfb0a76b6d16e1d4945420c2187423cf","target_edition_id":"edition.r017.id-id.draft","target_line_end":892,"target_line_start":892,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[892,892],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3da91aa8cac7810df16bf845504e81ad4cbc5d48dfad104ca58e379e4ed01258","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-150","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":150,"source_content_sha256":"b51130b7437cfde2f3c54ead9bee30522d17ed7a8fca353f9eb8aa21f40c3906","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":886,"source_line_start":886,"source_local_id":"block-150","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":151,"target_content_sha256":"c19372ffdc8f292c843424912c2c6293991dcf80254b846cfc2776c2c4578112","target_edition_id":"edition.r017.id-id.draft","target_line_end":894,"target_line_start":894,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[894,894],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"554bb568a136b7829d31fe540445db7a9de204a3fd7461ce827c34e3a47c9812","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-151","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":151,"source_content_sha256":"1e3a8492f42fe85cc539c597d4c2bff9d695a1393ea429f507537752709222ee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":895,"source_line_start":888,"source_local_id":"block-151","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":152,"target_content_sha256":"fa61194812d12300aee40d7c1180bfa830009e5e4e00a1d19aab81fba607e1f5","target_edition_id":"edition.r017.id-id.draft","target_line_end":903,"target_line_start":896,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[896,903],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de2ec6492a721363a12b3945f531d0b3e3e0af2c29e6aa55a79f52bd3478e2e1","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-152","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":152,"source_content_sha256":"4d2f397871de3f831b91806c1e5ed7c8d42be7d8934b2c7960bd1d9d2758f598","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":903,"source_line_start":897,"source_local_id":"block-152","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":153,"target_content_sha256":"2bbd8c2aa731416c6c942e8bdb44ac5cabedd9c2575c161f5b803ed8196216e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":911,"target_line_start":905,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[905,911],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e8268db1b3cea99ad12dc78ab9c63a6f1788d127de0e4114b600ee6df29dae8d","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-153","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":153,"source_content_sha256":"32fabfb4024dec8f07ffb6872839d362d024604e5b3b54cf3b1c9d2411572f73","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":907,"source_line_start":905,"source_local_id":"block-153","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":154,"target_content_sha256":"17f035ca68630bb23ec8706600336d78dc350fc42b723bed91d91c43841cf944","target_edition_id":"edition.r017.id-id.draft","target_line_end":915,"target_line_start":913,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[913,915],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a87ed5ca051df2006f49fe453aef38d5c25e375743d53bd97438a46107a76281","concept_ids":["concept.capital-allocation","concept.multi-period-investment"],"id":"segment.r017.book1.ch04.text-b.block-154","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.capital-allocation","concept.knapsack-model","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":154,"source_content_sha256":"f171b08968b6258f22c7997ce84b08f8a59ddbbae8f5ed623de20299dcb7ce68","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":912,"source_line_start":909,"source_local_id":"block-154","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":155,"target_content_sha256":"ae2cf6f6ad4c4d95e699143b3466594d848d8677638530a75a38ac84b07d1582","target_edition_id":"edition.r017.id-id.draft","target_line_end":920,"target_line_start":917,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[917,920],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20e33923316c75e182ad99c0a7b5a8ca771f9828c96fbe7e77559fe39c65ee05","concept_ids":["concept.capital-allocation","concept.multi-period-investment"],"id":"segment.r017.book1.ch04.text-b.block-155","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.capital-allocation","concept.knapsack-model","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":155,"source_content_sha256":"09b8df99dd8861cd3645b99e2b467f40b63dd6ab56d53b5b132203f33c446597","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":918,"source_line_start":914,"source_local_id":"block-155","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":156,"target_content_sha256":"9af133716ccf965c70a5903b87702020105cfa1c384bed0c61ee8c3b6db029cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":926,"target_line_start":922,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[922,926],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39e85d78524b41cfb67b5dfdb705043f28a0e328691493dcebc7f6c1f2f34cb8","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-156","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":156,"source_content_sha256":"babc65f56303feb55ed52b7cb2f9a467881bea8c443c0b8bdc1e6b0872964ff0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":920,"source_line_start":920,"source_local_id":"block-156","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":157,"target_content_sha256":"2dde0bf6707feadad665446537a48934e24d3458d95d194e35a89959639ba996","target_edition_id":"edition.r017.id-id.draft","target_line_end":928,"target_line_start":928,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[928,928],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"736003bdde8e6469bd4b29a952e0b01a1f7236738a240f5db52f91fe4280fd2a","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-157","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":157,"source_content_sha256":"8d719e72e67b700db976b3d8bc3e6f109ed0183f8af8fa2aa8d4dd78e9d5bfd8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":922,"source_line_start":922,"source_local_id":"block-157","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":158,"target_content_sha256":"a0294410ca0700fb49e36be45d7ee2a249b8dd061bfff56b388fb37ebd372771","target_edition_id":"edition.r017.id-id.draft","target_line_end":930,"target_line_start":930,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[930,930],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c015ed98f040a09093ea2550a02b79fc82cd3e61755dd8cd803a19c3b4a4e20","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-158","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":158,"source_content_sha256":"47b5761ba87d8a00260a213c6943542ce10ab8ac821954c9894cbd9751babe06","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":924,"source_line_start":924,"source_local_id":"block-158","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":159,"target_content_sha256":"47b5761ba87d8a00260a213c6943542ce10ab8ac821954c9894cbd9751babe06","target_edition_id":"edition.r017.id-id.draft","target_line_end":932,"target_line_start":932,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[932,932],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aefd426305bef0d2561ec79385d7cba5f3e95a5078d9e2d0af1a606a0758ecde","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-159","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":159,"source_content_sha256":"3901d948175caf4513bff568ac1c9ede465ec5c193c4e289404df4deb4be4557","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":952,"source_line_start":926,"source_local_id":"block-159","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":160,"target_content_sha256":"c69fb0724a45aeff04745758eff958a99c3e8d49712526535cea01ca7a979667","target_edition_id":"edition.r017.id-id.draft","target_line_end":960,"target_line_start":934,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[934,960],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"42a92469d996da86bfc9acf5e79cc4aa0011fa362decf246a80805c35229988f","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-160","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":160,"source_content_sha256":"bdaa4fbddc95f6ae8de127e12b2b19e392a99a332ff6a49fe1e80162bde527bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":954,"source_line_start":954,"source_local_id":"block-160","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":161,"target_content_sha256":"bdaa4fbddc95f6ae8de127e12b2b19e392a99a332ff6a49fe1e80162bde527bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":962,"target_line_start":962,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[962,962],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b56592e5a6a22607d0bd62d7e2ef05f566c8d06b311b3e52fe67ec04921aa56d","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-161","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":161,"source_content_sha256":"d17a317e82b9b615ee6ab5c8cc05fa6d9d24771e3f9216d1ad0e81e608b5cc95","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":957,"source_line_start":956,"source_local_id":"block-161","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":162,"target_content_sha256":"bb60b0926598a3f9b25900650b5a0baf20c2156b1cb56ec8970e60a1c1a356b2","target_edition_id":"edition.r017.id-id.draft","target_line_end":965,"target_line_start":964,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[964,965],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c1ef7746b072f27144a09689b0a4c694d1aa946848428e1015320904a5776a04","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-162","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":162,"source_content_sha256":"b83e3cd661100d9c29cc861cdf7868e041404c8cc3e2bdf8add3d87cde0cef9f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":961,"source_line_start":959,"source_local_id":"block-162","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":163,"target_content_sha256":"07bbed7873bffd9922ae51b5a8932c79697442928f8a3da5a139752ba08f8266","target_edition_id":"edition.r017.id-id.draft","target_line_end":969,"target_line_start":967,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[967,969],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eecf3961dec2073c032cb1bdcc603b9c644fef739af7a2efd3831b3cce632546","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-163","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":163,"source_content_sha256":"efa03316f1cb8e13123848b5677ac9533d9fe15d656f8ecba8f5e6a62d75b529","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":966,"source_line_start":963,"source_local_id":"block-163","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":164,"target_content_sha256":"57f1e1fea75acef6873a4220d0b6dc412613961ee09e42c26c2ee411decdd65d","target_edition_id":"edition.r017.id-id.draft","target_line_end":974,"target_line_start":971,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[971,974],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"43a1f6be499c687f5a0e2a290cbe50570d9deecf63958f21f0e88ccf6434cd20","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-164","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":164,"source_content_sha256":"9732e169791bf0d349dd1192e61868016d3198cbfb4decbdb69680c71a0110b6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":990,"source_line_start":968,"source_local_id":"block-164","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":165,"target_content_sha256":"81150198c5d7d39cb8f73022a4fa3e32473a50abc6751e19db3b88987a8ea01c","target_edition_id":"edition.r017.id-id.draft","target_line_end":998,"target_line_start":976,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[976,998],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c66637a93154dd0896b5343885dd75fd372ef830e02994ca31c2553390a76ab","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-165","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":165,"source_content_sha256":"bc563e0caa4bce9e58092bae35fdab00e71c7940de6e46def695a733e8065911","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":995,"source_line_start":992,"source_local_id":"block-165","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":166,"target_content_sha256":"59bd2594f76fc8e56760d30afc9da03592ff0b9c2a7b89d3a01b554435d7a621","target_edition_id":"edition.r017.id-id.draft","target_line_end":1003,"target_line_start":1000,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1000,1003],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"04d615f4fe41cd56505e113102053fe59ccde81694a9275544713b1cbb62c3b5","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-166","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":166,"source_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":997,"source_line_start":997,"source_local_id":"block-166","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":167,"target_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","target_edition_id":"edition.r017.id-id.draft","target_line_end":1005,"target_line_start":1005,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1005,1005],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"527f0d080e3139d8e11f271472f5a7f03190646505a880ab97d5ecb43f6e3fdc","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-167","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":167,"source_content_sha256":"0b4fb2adfa514d8956bec84058b3793f11cc244c8bb49f9c426b8afedddc6664","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1000,"source_line_start":999,"source_local_id":"block-167","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":168,"target_content_sha256":"ea798c3e6058eeab13d935429a8b8bda200da17105d7f007f58819ea1ae9ed90","target_edition_id":"edition.r017.id-id.draft","target_line_end":1008,"target_line_start":1007,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1007,1008],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a520ab29699575f4a79c614d3e77f40f43dc03a5501b14d41b2248d689d46e12","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-168","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":168,"source_content_sha256":"19ee3e5f3bfc764dd30bcb06771194710bcc8434e22871f070119fffeead9fae","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1002,"source_line_start":1002,"source_local_id":"block-168","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":169,"target_content_sha256":"d6f24c4818cf6c3fb860bdacbd4db1c1706a41b6574ac29348dc829adca74698","target_edition_id":"edition.r017.id-id.draft","target_line_end":1010,"target_line_start":1010,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1010,1010],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57071d32cf79043d9f36c89e95d66b8ecf10bb1f72b2d75898a9a277b0b12d12","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-169","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":169,"source_content_sha256":"80c78d1acb3a6bab4e49e5c146a9b71bf583a1a80bc87d6f63e5149ba7dd08aa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1005,"source_line_start":1004,"source_local_id":"block-169","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":170,"target_content_sha256":"b1d6b282ba2174465e8df0514ec7b1a877785932b9658ca42c992403bd1cac8e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1013,"target_line_start":1012,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1012,1013],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a8d8e4b41b5ece326177cf475feb052dc71993c4dba83e60a81d82845d9a295","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-170","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":170,"source_content_sha256":"99bd3958b562bc8c684c7eadce434b235ff57d12905e58761bb783d81f4fb1ea","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1008,"source_line_start":1007,"source_local_id":"block-170","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":171,"target_content_sha256":"661cb26577573d21b31278003d16b70f9f09414cbdaf99df67c7c1ea6171914e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1016,"target_line_start":1015,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1015,1016],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f54cd4b22eb7712df0ff48d8864361e5900c6fdb3479072c572d9c1ea6c8a8f","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-171","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":171,"source_content_sha256":"46ebdd79e341ba06ef264a665878627f6edab0e1191b6e5d8177d7a0970f4fb7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1010,"source_line_start":1010,"source_local_id":"block-171","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":172,"target_content_sha256":"3d2dbfab43a321a1dd93c6661d9f156609cf767c9af00ba10eec3ac845fa38f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1018,"target_line_start":1018,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1018,1018],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57f89981af251270e2ab2bc133329be58fd80997f1358bd22d88e0e654cb5254","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-172","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":172,"source_content_sha256":"73c675306e498b364ffd9000467c8871129ece7f2d5f5d4e7c44e460d1f71401","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1017,"source_line_start":1012,"source_local_id":"block-172","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":173,"target_content_sha256":"055531087a1da1fc5a32356a80fb410717b4c6bfdd02792a3c6781f19e4a4be5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1025,"target_line_start":1020,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1020,1025],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e1d249caa1b1f09992d28ea7bdd0e917fd25898cdb76cd0dcc17710196a96507","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-173","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":173,"source_content_sha256":"58452844aa1d8880aa7e232312735e8bb5ee29fa85cb949ee7739c4ab96904e4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1023,"source_line_start":1019,"source_local_id":"block-173","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":174,"target_content_sha256":"44d01b71e4a7450490285fc7147f4d31bf57a6d057ca617bca37ede6fce64aa6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1031,"target_line_start":1027,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1027,1031],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"06a0700332ce3778e247d750ad42071ab7e5cab1e1a16e66aea319a2148882ad","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-174","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":174,"source_content_sha256":"ea630c1404b92979836fcdfe27380b1bfd36edde162fdfa99b3a7bd7ee2b0a53","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1031,"source_line_start":1025,"source_local_id":"block-174","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":175,"target_content_sha256":"14141552933057c7cfa7e5f96fa80e0fd818b7475e1cd8df7c22ebbbaeaa43da","target_edition_id":"edition.r017.id-id.draft","target_line_end":1039,"target_line_start":1033,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1033,1039],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c3bf8b956126ba6fabb14740d9c4f515fb43f27765a2ab6a396092e77f7c12d","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-175","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":175,"source_content_sha256":"0434c2615a2ab03cce269f6c99c6b8c2729554bf61b54f9828c290b952dd7d75","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1033,"source_line_start":1033,"source_local_id":"block-175","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":176,"target_content_sha256":"a506cb2b2986fea863f3242eb9adcda6fbbffa07b5b5448fc14f8bcce53697e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1041,"target_line_start":1041,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1041,1041],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4dcfdd2052a78a1137c259564ae211e2b93ac49cd0248efbf2f7cd408098818b","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-176","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":176,"source_content_sha256":"f72dcb5aefe711db2c48127f15baeff506cc62e3260bc0da29b82d783f45e942","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1039,"source_line_start":1035,"source_local_id":"block-176","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":177,"target_content_sha256":"92dc807a7758d4b91524c4e534a79c70c2875bb0ee796fda61bb9a55dd8d1bb9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1047,"target_line_start":1043,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1043,1047],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"54ce7c314dfd913607fe95739dfc11fb7fda00bb876735e5a8e60bec71e871da","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-177","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":177,"source_content_sha256":"30a62fcda06e6895b8c2727e1cba90a3bf1d1e20987c9415e51b88154133b3b3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1042,"source_line_start":1041,"source_local_id":"block-177","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":178,"target_content_sha256":"a78ccd06795863e7e3f06b3f5f86aa0a3c8b4109f6138b89f557aa0d3e32c198","target_edition_id":"edition.r017.id-id.draft","target_line_end":1050,"target_line_start":1049,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1049,1050],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a9710db10f7f4cd6505862ec82b6c84bc60556e00f8472daa2260a626d12ce8","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-178","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":178,"source_content_sha256":"41698d09f65544fec97ef416726f2f677967f6a155136796a1037b12f28f31e2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1048,"source_line_start":1044,"source_local_id":"block-178","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":179,"target_content_sha256":"bcb8d702422d214a59a7999fc993f6eea74bb7ce5e3a46d4a4085bed509f0685","target_edition_id":"edition.r017.id-id.draft","target_line_end":1056,"target_line_start":1052,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1052,1056],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e5cb2b25195ee4dda12a89d22ae2ecff67e5fb2c24b41f0fd44063747ea74145","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-179","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":179,"source_content_sha256":"1e4ccc9ccba9038d35b6d9ebed7b22602bc3cbe77fc62260abb1d7f124da6cb9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1050,"source_line_start":1050,"source_local_id":"block-179","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":180,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1058,"target_line_start":1058,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1058,1058],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5905039cc1c49a8b7cda31b1a8efd603378cd4a5f0af77b774b3800888f462d6","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-180","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":180,"source_content_sha256":"a6c18cd910118035e9ea010f2ee79c798b3efbc009700c989db4ce6c1d1e71cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1052,"source_line_start":1052,"source_local_id":"block-180","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":181,"target_content_sha256":"e40764d945e5d26b34a5af5d1b871064a1f010d030194a8d28699f94ad890886","target_edition_id":"edition.r017.id-id.draft","target_line_end":1060,"target_line_start":1060,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1060,1060],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a9831e04e0e8c4c0f2282fab625ae17f0151edc326a68fc54c1c043e73fc8d6c","concept_ids":["concept.compact-indexed-modeling","concept.inventory-balance","concept.production-planning"],"id":"segment.r017.book1.ch04.text-b.block-181","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.inventory-balance","concept.linear-programming","concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":181,"source_content_sha256":"8da8fe9ae292fe13dd0c35e80a35547d942bdea0cb26b706fe8f87d5629fc9b3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1063,"source_line_start":1054,"source_local_id":"block-181","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":182,"target_content_sha256":"ea6b45965219abdf0b905f5c8deca37fb6a03af2ef4c05843e8ccc7cadf2958c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1071,"target_line_start":1062,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1062,1071],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa9d45276c3fedb8db55f798d7694776aa5cbe47418ee764a66e08e4c8ee7015","concept_ids":["concept.assignment-model","concept.integer-linear-programming"],"id":"segment.r017.book1.ch04.text-b.block-182","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.binary-integer-programming","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":182,"source_content_sha256":"e60a903c3c90d1e99bcbe90815059f99f7c8f5d653df744c1b19a1273c91235e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1073,"source_line_start":1065,"source_local_id":"block-182","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":183,"target_content_sha256":"54426e458cf36c18865c907b55c0e3b11eb94e37162fed6ac4642e379be2d22a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1081,"target_line_start":1073,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1073,1081],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82e4006e733bc0e2d9fdeb6cc3710d693a8bdc563e8266b3e99614f95fe4442e","concept_ids":["concept.flow-conservation","concept.graph-theory"],"id":"segment.r017.book1.ch04.text-b.block-183","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.graph-theory","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":183,"source_content_sha256":"b8ebd64a02a5e7c9c7ca612c7f229998f9ee5398048c4cdb4187faf503f64935","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1083,"source_line_start":1075,"source_local_id":"block-183","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":184,"target_content_sha256":"c548e1f4000c9acf9d6afbab80d7f1fd1fa27568229878334bbe099f73fae6d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1091,"target_line_start":1083,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1083,1091],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"462a1ce1d51c713aa880ce5c088f7057251cc6fbf3af6e239f54e95fc63e4379","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-184","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":184,"source_content_sha256":"befe6892ec44e33f7b364305fbcec8fa778e09b9cb39adc300c1dd14bcf212c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1085,"source_line_start":1085,"source_local_id":"block-184","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":185,"target_content_sha256":"e3f87b06f7a641556fe14f6828c82cf2c975b6a9ee5826c46c7cbd0d343ca7a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1093,"target_line_start":1093,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1093,1093],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a364b8ddf8a313a08ee149cc1b1e907c123d842eaea200d354077f69f2274916","concept_ids":["concept.assignment-fairness","concept.assignment-model"],"id":"segment.r017.book1.ch04.text-b.block-185","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.assignment-model","concept.binary-integer-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":185,"source_content_sha256":"2e688b5c847c20b840296b2105e41ed4858adbcc99cc7bb97d440fc546ea3155","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1091,"source_line_start":1087,"source_local_id":"block-185","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":186,"target_content_sha256":"26ae14e004ae0a688003da0953c1fceb813edb5187fb6367d3aa63c12e316b64","target_edition_id":"edition.r017.id-id.draft","target_line_end":1099,"target_line_start":1095,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1095,1099],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e8863b6b9a20cf485a92d627a7174b59b4b2a35f579589e1b0d2797db314de88","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-186","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":186,"source_content_sha256":"ec7dda620f53b1cfd156be2a8c916958560eaaa75ee2104b3f80b5e400f29b57","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1093,"source_line_start":1093,"source_local_id":"block-186","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":187,"target_content_sha256":"2f931926e7af59960f2f2563d0bf2fc1027ef54b0d35f3e06acaa049fd3f96fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1101,"target_line_start":1101,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1101,1101],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d52dbc73a72770032e5e7a97425c566f54986ef0a5c7ce543b1e38b7f90f462f","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-187","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":187,"source_content_sha256":"2ad73686bd121069d5a28e53bfa232bd6816101a8d01ebd0900b104148b5d3af","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1099,"source_line_start":1095,"source_local_id":"block-187","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":188,"target_content_sha256":"34f1298fe34d1aa3f03534232f77d4a9ee4d8e52bd385b609e0de3a4011f118b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1107,"target_line_start":1103,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1103,1107],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4dffabfd24752c4b79928ddd65c943a9398df223d442e76f78352fe98fec1f96","concept_ids":["concept.flow-conservation","concept.maximum-flow","concept.minimum-cut"],"id":"segment.r017.book1.ch04.text-b.block-188","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.graph-theory","concept.linear-programming","concept.maximum-flow"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":188,"source_content_sha256":"1f429b26d10db3fbd92545ab9771e18bb72a7dc19a18f6cd1936816375b0fc56","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1103,"source_line_start":1101,"source_local_id":"block-188","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":189,"target_content_sha256":"ddbcdc33e96ba240eaba2fb70d14762e3c1a9558c2db4565685d2a99dd19b8c2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1111,"target_line_start":1109,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1109,1111],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce6dc6e4a9bf7ef9a5f2fde1e967fa5b1baafba4890a340747497461c4305908","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-189","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":189,"source_content_sha256":"4f68dedbbbf946a6c600e90a940524e27aba8e7c92c75d1ebb8b245f460a0aa6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1105,"source_line_start":1105,"source_local_id":"block-189","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":190,"target_content_sha256":"0c80f63f13e4721e6dcdc7a85e7690d3f76638d319cccced47cf32132d7ff6fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1113,"target_line_start":1113,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1113,1113],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b749f225ffb4535cc6c341eb70b871309276bcff83a0c97e82d89fd236569144","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-190","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":190,"source_content_sha256":"7a3b794219e3cf4299cb05dbace4fd54609599cdf14c1a7dd84837262eea68ac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1124,"source_line_start":1107,"source_local_id":"block-190","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":191,"target_content_sha256":"44c3b92bbb27fcfc0db5c2d606de9c5bd0b9311d830402770410e6eaf81a5aa4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1132,"target_line_start":1115,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1115,1132],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a18e1e2008074f7f33b732eeac18e79c6f16daf20e03c036badab54bbff88c42","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-191","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":191,"source_content_sha256":"80a3ba2723fb2bf06c15dfdf10fbb3c76727b39f8ea668752a09e945d79b1fd5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1132,"source_line_start":1126,"source_local_id":"block-191","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":192,"target_content_sha256":"80a3ba2723fb2bf06c15dfdf10fbb3c76727b39f8ea668752a09e945d79b1fd5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1140,"target_line_start":1134,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1134,1140],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14b67a582a22c2da76ae873f9e49c1bacc666fddcbeeb2c2f3fb510653f5037e","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-192","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":192,"source_content_sha256":"463182316f7660c1007dc196af992ffe8e289e7392d02d7840f3652bfa5be812","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1143,"source_line_start":1134,"source_local_id":"block-192","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":193,"target_content_sha256":"41bf72ac4626736d1f8fcb49ed83c4d99f90f744f6a881e4496bff1bcd069e85","target_edition_id":"edition.r017.id-id.draft","target_line_end":1151,"target_line_start":1142,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1142,1151],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e221f708bec4f0a27cfea261fa9b015aa82c284b2822847978740d791b9b887","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-193","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":193,"source_content_sha256":"997d88c63f7cf499afa236805db92cebb2eef68401d12d423084897199669fe2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1156,"source_line_start":1145,"source_local_id":"block-193","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":194,"target_content_sha256":"088bb23ca42fa22cce2f70b5e76ebe8570fe008e482cef3ee67036a893c58424","target_edition_id":"edition.r017.id-id.draft","target_line_end":1164,"target_line_start":1153,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1153,1164],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f1938986eeab6dc18f3f77228a82669531562baf4619e946be9e709ea546960a","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-194","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":194,"source_content_sha256":"c8ad0045f0836df5afcc144c02d31de970f63736557fbc2b3a4fc56cfeb0087f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1160,"source_line_start":1158,"source_local_id":"block-194","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":195,"target_content_sha256":"c8ad0045f0836df5afcc144c02d31de970f63736557fbc2b3a4fc56cfeb0087f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1168,"target_line_start":1166,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1166,1168],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e6823308a44e9f9b25c4eb7a6a71e23eb6e9d88c805caedaf07379ce2574c1ec","concept_ids":["concept.maximum-flow","concept.minimum-cut"],"id":"segment.r017.book1.ch04.text-b.block-195","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.maximum-flow"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":195,"source_content_sha256":"61b63639609320c98cf8994a3b3f50021946596d4051638381bcaf594a8c6b0f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1165,"source_line_start":1162,"source_local_id":"block-195","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":196,"target_content_sha256":"7eddd3d9bbe3fc85df7fd5456c5cbb46457c7995d7c3909f94d1cdeeca18c929","target_edition_id":"edition.r017.id-id.draft","target_line_end":1173,"target_line_start":1170,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1170,1173],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e8f7785b78e90362eb3bf05870cbe267dccfe1a3698c488c52cafd39d150c7f","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-196","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":196,"source_content_sha256":"c6682545ea6893800e728bf7ee9e834b022a9481f0232d43bf9621faecf9f83d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1204,"source_line_start":1167,"source_local_id":"block-196","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":197,"target_content_sha256":"c6682545ea6893800e728bf7ee9e834b022a9481f0232d43bf9621faecf9f83d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1212,"target_line_start":1175,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1175,1212],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02e17d15769b76c8dfffaaa28b92e3bf22c8ebf1b2ec8a800010d05aeb1d2148","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-197","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":197,"source_content_sha256":"6cb33a9fe865431c39966948e4911ca2991ccbd9695966030045117ae4324a9d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1216,"source_line_start":1206,"source_local_id":"block-197","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":198,"target_content_sha256":"8b5b0ea2915b08ac7f199daab0184765436bf0101a6f2ad4db6cfa2af7f90c14","target_edition_id":"edition.r017.id-id.draft","target_line_end":1224,"target_line_start":1214,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1214,1224],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6c9abe38d2bf33224cc1daf291aae0cc8ba26d6497f88812a8b607dd92a793d7","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-198","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":198,"source_content_sha256":"f06db8779a53c639d87fc0e802b2480cfbf7616b7fd4922ac3eac59b49acad96","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1220,"source_line_start":1218,"source_local_id":"block-198","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":199,"target_content_sha256":"1fdf0619ff30b1e0194c01057c29b685e9956235925d832f3ffa66d743c9a6ed","target_edition_id":"edition.r017.id-id.draft","target_line_end":1228,"target_line_start":1226,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1226,1228],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"174ef76cca2d4f98bfda759b9f4a669c60d7a396398264f47ed303b6f342c3b7","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-199","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":199,"source_content_sha256":"cdca4b3abcb0bcffa45a812459b64cb12ed1c6c5150c8acd7dcf353285aba170","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1225,"source_line_start":1222,"source_local_id":"block-199","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":200,"target_content_sha256":"e4b3aefa24f6b2ca824f86d4689afa8c4a0e9b90ead2c7daa5a8719524ce57f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1233,"target_line_start":1230,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1230,1233],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6292b560ff983b28d9f3737b0e65679684d24cd07c1720f5e8fffd0fe6b6eee3","concept_ids":["concept.flow-balance-sign-convention","concept.network-flow"],"id":"segment.r017.book1.ch04.text-b.block-200","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":200,"source_content_sha256":"c08bb4651ac52fc65261fb0fa5c3d2145cb043bcc44d6a2ede102168ce1c5c4c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1235,"source_line_start":1227,"source_local_id":"block-200","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":201,"target_content_sha256":"6d3768c54c5ef86fb8bd1542e0f75e521fc29400757c9b080a134dac7d0e78bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":1243,"target_line_start":1235,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1235,1243],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df9ac9ed17e43d1bccd9c4912f0f1e3d9b1a6307f553eb5e426821cf4750ee9f","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-201","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":201,"source_content_sha256":"bc52615ed861363eb7aa2189e9091aa4d4bab8dadcb5ed165728bd14756ee69b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1274,"source_line_start":1237,"source_local_id":"block-201","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":202,"target_content_sha256":"bc52615ed861363eb7aa2189e9091aa4d4bab8dadcb5ed165728bd14756ee69b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1282,"target_line_start":1245,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1245,1282],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"511cfcc618d1c3908715b02a4f381563d1cc0ea714c751f6ade7f6f073306584","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-202","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":202,"source_content_sha256":"c34fbc7e9bf9468e68bf60c01f2793764ccf9477f50f9918e093542274fef400","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1287,"source_line_start":1277,"source_local_id":"block-202","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":203,"target_content_sha256":"e7d113e8d054c2d2ea53ffb23378efc7dc7e2009e75d5aecb2405c15e5897110","target_edition_id":"edition.r017.id-id.draft","target_line_end":1295,"target_line_start":1285,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1285,1295],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4aedaba8578f34ed1848475e2dcc5fe743c77f4e645a1b04ec13353529659f1d","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-203","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":203,"source_content_sha256":"f47d3d8195eba21156f505ae03cf6a30d92cf5d92199984a8f3e327807a66f28","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1297,"source_line_start":1289,"source_local_id":"block-203","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":204,"target_content_sha256":"413537f8c238ac89bd70dd8f16a6375b6af2994662af1ef1215154690a27082a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1305,"target_line_start":1297,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1297,1305],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2dc310fb81bfe48c2f506afe2e3904e8f54a38137c4596759ee016b85a1d3c83","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-204","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":204,"source_content_sha256":"106b400254eaa0c435cd4165579109e5f4332319923fc428f66015cd616ed934","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1301,"source_line_start":1299,"source_local_id":"block-204","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":205,"target_content_sha256":"5c476f4842b7f35734bb422942db7be652c1b358b1bd602392a07807ca939603","target_edition_id":"edition.r017.id-id.draft","target_line_end":1309,"target_line_start":1307,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1307,1309],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e74d388f6088680235fc712b4ec579b1fa753211c22572b01f63cd65ccbaae84","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-205","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":205,"source_content_sha256":"acbef4176c3217f2f713e62a3a73f0e332a59ceff957945c805ddade7db9dec8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1305,"source_line_start":1303,"source_local_id":"block-205","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":206,"target_content_sha256":"acbef4176c3217f2f713e62a3a73f0e332a59ceff957945c805ddade7db9dec8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1313,"target_line_start":1311,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1311,1313],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc450e64fa3521b5adc39fe5a1df3e05a92ca810a26e29149d1420a571b07fed","concept_ids":["concept.flow-conservation","concept.transshipment"],"id":"segment.r017.book1.ch04.text-b.block-206","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.graph-theory","concept.linear-programming","concept.network-flow"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":206,"source_content_sha256":"793711d8bedfda3a0ea891348d189312fcbe609c4b23ed652a82af67f55f831b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1324,"source_line_start":1307,"source_local_id":"block-206","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":207,"target_content_sha256":"1cabf3e86f47d6a5636fb820d0d59ca907442169bad6d823ef74ac7c515b3c04","target_edition_id":"edition.r017.id-id.draft","target_line_end":1332,"target_line_start":1315,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1315,1332],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cbd084d4a87cc6ae63d0e2c381a087a27702a4533cc66583d04101f468eb5782","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-207","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":207,"source_content_sha256":"66c93cfbc1f96b6d3735e80f49c16c1caaceb41a9d3fe0b88c9b1564d3534bc5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1333,"source_line_start":1326,"source_local_id":"block-207","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":208,"target_content_sha256":"69e5c1ef606f25dffbbd0bd4ed629c5077bca5823d11d97b5c2b290ab059f78d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1341,"target_line_start":1334,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1334,1341],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2e623005d5bc9fadf05eaa1dfbae3bd43d1b9c1ed2ec0119b8019f9f125e4b9","concept_ids":["concept.assignment-model","concept.integer-linear-programming"],"id":"segment.r017.book1.ch04.text-b.block-208","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.binary-integer-programming","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":208,"source_content_sha256":"07995e6613773cc0531ce1db46c3b285e7686f3ff94f188a89de9309cb31d961","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1354,"source_line_start":1335,"source_local_id":"block-208","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":209,"target_content_sha256":"e916693cb2bf15a2b4b862e644fa0f414c5cccee2e737fc8f9b0e42f37912484","target_edition_id":"edition.r017.id-id.draft","target_line_end":1362,"target_line_start":1343,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1343,1362],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"54a4b4518dd21fcb3d419e091f33f8d5433766c26ee02769c4bb16c017ba13c3","concept_ids":["concept.inventory-balance","concept.production-planning"],"id":"segment.r017.book1.ch04.text-b.block-209","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.inventory-balance","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":209,"source_content_sha256":"b434091b150ce6b427f50902b79ce7dd0a5717ea7bf1b4b7df7ef9d013332704","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1365,"source_line_start":1356,"source_local_id":"block-209","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":210,"target_content_sha256":"b15474db7ae27de6725b4d1f97560de1036c00732aa3684a8536244641b261a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1373,"target_line_start":1364,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1364,1373],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c253812e5a8253e53f203cb81d095cdb3c489c04336e6b7974cd638f40c75c5","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-210","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":210,"source_content_sha256":"c8e278add1d6c18f659152466edf4e82568ebad5aaddedeaeb2d654335866d4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1367,"source_line_start":1367,"source_local_id":"block-210","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":211,"target_content_sha256":"5a7c51fe019c052d866e25f75541baf5ff511cb9d0d48737b288dcbb3fd56de0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1375,"target_line_start":1375,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1375,1375],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ea0b1817d8ad63f132df256a4400cbc8723c3dca47a3b0068efc0a35bb794432","concept_ids":["concept.flow-balance-sign-convention","concept.flow-conservation"],"id":"segment.r017.book1.ch04.text-b.block-211","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.graph-theory","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":211,"source_content_sha256":"95b39d6ee91925122e2fab06bc235036a45e42a25921f5c3f2aabe99a4bdadef","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1378,"source_line_start":1369,"source_local_id":"block-211","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":212,"target_content_sha256":"0106716a0c75f1abf687fa80b6e0d961bb12ae76b04784484f2efb683844f6e5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1386,"target_line_start":1377,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1377,1386],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"06ae05c83e84b41932d9c792e0f877402d05faf055178cdf92fafc8272912122","concept_ids":["concept.assignment-model","concept.total-unimodularity"],"id":"segment.r017.book1.ch04.text-b.block-212","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.assignment-model","concept.binary-integer-programming","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":212,"source_content_sha256":"59f737dc319e3be61310b34c555a3fec3abc8c87b59c427864951ba4262a59de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1389,"source_line_start":1380,"source_local_id":"block-212","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":213,"target_content_sha256":"2a6c6603ef143079c789d2d9c423be1fa6b96867b40a79672374fb39de34fc55","target_edition_id":"edition.r017.id-id.draft","target_line_end":1397,"target_line_start":1388,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1388,1397],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8f4c9f81b80a387dca82f810cbe0b46c0e429c747946ba2755e94de4fa32083d","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-213","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":213,"source_content_sha256":"4be7db13a50a6cf69022429255b203425a63979cca3cb7d03e8476641e361703","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1391,"source_line_start":1391,"source_local_id":"block-213","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":214,"target_content_sha256":"7c4176f9ca89c18c50f3aacc3b3a978ec2d874e6385a52e4b13e5c4d0a343459","target_edition_id":"edition.r017.id-id.draft","target_line_end":1399,"target_line_start":1399,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1399,1399],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"086c91ccb6d14519bcbe7cd79071436a05b0bc52881fc4add1a421140aa86026","concept_ids":["concept.flow-conservation","concept.multicommodity-flow"],"id":"segment.r017.book1.ch04.text-b.block-214","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.graph-theory","concept.linear-programming","concept.network-flow"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":214,"source_content_sha256":"7dca92c7fd51762d23c94406a2968d711bc7ba96d1a86738f321564137cc122e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1402,"source_line_start":1393,"source_local_id":"block-214","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":215,"target_content_sha256":"e128b8cc370d5baff205d73ce8b55783e67c4e877c25ef5782514c391d93010a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1410,"target_line_start":1401,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1401,1410],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"532736492d81a06fd1bafab363ccfbe8f7417fd671824a0585a4e75a9d68c5d7","concept_ids":["concept.assignment-fairness","concept.assignment-model"],"id":"segment.r017.book1.ch04.text-b.block-215","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.assignment-model","concept.binary-integer-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":215,"source_content_sha256":"0ccb26d6ff2f03e0f5f104ced3c3a5d2e98a3cf48056110488ac0b9fcd2bd5ab","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1417,"source_line_start":1404,"source_local_id":"block-215","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":216,"target_content_sha256":"e300fbe775b0aa93a03200f63f5a32eab5660d99a7c8d8e17257c38186356121","target_edition_id":"edition.r017.id-id.draft","target_line_end":1425,"target_line_start":1412,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1412,1425],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a0ee147a2c498c8c3d57998bf790a27417ddebceff2c993f8d4c5f2e6f25fd64","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-216","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":216,"source_content_sha256":"070c82f595a58c404017d08d60ef7ee4b27c5877e128e391ddb9e2145cbe6910","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1419,"source_line_start":1419,"source_local_id":"block-216","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":217,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1427,"target_line_start":1427,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1427,1427],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19b2059898466f6281e92c2f1586db44a4542e3f7b34d02bad70ef2174ed0eab","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-217","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":217,"source_content_sha256":"4ebc4b3dc847eac52c1ac36a1b516c4780dddf6459e963c7e38aea37a3e41345","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1423,"source_line_start":1421,"source_local_id":"block-217","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":218,"target_content_sha256":"84524f6b14f979e28201f815a8dd1b18d76a50f728b49a0c72f297142f3c27c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1431,"target_line_start":1429,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1429,1431],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d98aa2bb7e3b3d6dcc4846780644cbf65daad71c80639757e0bd3cd8317868b3","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-218","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":218,"source_content_sha256":"dc3e10d714bd50830819118372c9eebe96bc4236b9a75d10d88f7b4d309714df","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1436,"source_line_start":1425,"source_local_id":"block-218","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":219,"target_content_sha256":"c91b3650a768298f63a9c1efcbeb078981dd1a02a4ba668bcc0865937aba765d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1444,"target_line_start":1433,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1433,1444],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d2c58dacf749d8eaafe8336fbfbe518d2512b45fa9591d4af7839bd4c80e7352","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-219","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":219,"source_content_sha256":"e25d413e8dafcc4afc59a895a18f6d47be652d544234fbc173d227e081d75104","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1451,"source_line_start":1438,"source_local_id":"block-219","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":220,"target_content_sha256":"bb35586a3264b03ad4f6cb63329c3fc4eedd055b2b24e86a2b6930def3fb7a30","target_edition_id":"edition.r017.id-id.draft","target_line_end":1459,"target_line_start":1446,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1446,1459],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b60789ad25b33e81f7f88e6cf0183d2eb14e9d660c2f66d687de832d49953bb4","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-220","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":220,"source_content_sha256":"ba1e504538f2857293b8486f3ce2deea89745577a7da4ff68f0764a83d450367","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1464,"source_line_start":1453,"source_local_id":"block-220","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":221,"target_content_sha256":"87a3fdd51d4f6549929aea47a9a113069ebd37d4184c485a045373ca586d5034","target_edition_id":"edition.r017.id-id.draft","target_line_end":1472,"target_line_start":1461,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1461,1472],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"858b06fe42ae7818c04d4dbbdf0ce8ed648df1c92ccf791f9b68668935f5b910","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-221","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":221,"source_content_sha256":"895888b8be2db61566fd8abdd76a0dc746149808870a78be54e1424eaa3e31ef","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1472,"source_line_start":1466,"source_local_id":"block-221","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":222,"target_content_sha256":"817270458123b994f41fd3c07b312882ce489659986bb6a3edace387ffeda823","target_edition_id":"edition.r017.id-id.draft","target_line_end":1480,"target_line_start":1474,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1474,1480],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"520b03ad23e817cea91accf81451602b1cd08100fbbfa7bf8ceae3c1101ef831","concept_ids":[],"id":"segment.r017.book1.ch04.text-b.block-222","locale":"mul","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":222,"source_content_sha256":"dd03a3e9c600115e8d2bc301110cf8c544e1dbc269150ea1719f7556fc3dbb68","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1480,"source_line_start":1474,"source_local_id":"block-222","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":223,"target_content_sha256":"3997f93eefc75183d83641033bf7257c4315eade70355aaf8522f9dbc1e52309","target_edition_id":"edition.r017.id-id.draft","target_line_end":1489,"target_line_start":1482,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1482,1489],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ffd45936ebd49b8cbfe39a4288c8f1a67dde4c5476485ae6eabc9c5cb1a9a2bb","concept_ids":["concept.flow-conservation","concept.multicommodity-flow"],"id":"segment.r017.book1.ch04.text-b.target-native-multicommodity-routing","locale":"id-ID","parent_id":"unit.r017.book1.ch04.text-b","prerequisite_concept_ids":["concept.flow-conservation","concept.graph-theory","concept.linear-programming","concept.network-flow"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_edition_id":null,"source_local_id":null,"source_locale":null,"source_path":null,"source_target_relationship":"target_native_correction","status":"verified","supersedes_id":null,"target_block_index":129,"target_content_sha256":"7bd8447b08f3afbcebe8c3c6d959e0aabef4101e49146f87c03f463f7fa301fe","target_edition_id":"edition.r017.id-id.draft","target_line_end":792,"target_line_start":792,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch04.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[792,792],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/modeling-sums-continued.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0c4600c7203230b81614f590e9d34cba6ccabe8a25be34764fd0b457736c4948","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-001","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"de1571804c5d13f2554296aaa603b325b8fa9dc0a967c4e5e8deb4a6991c5cae","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":7,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"83839a81e62ac40568a1bb60363bb9e84ba9ab3f76d245de77993fd36de031e4","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,7],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5f670de299250b8039094e5b40f44c18a4aeef19f55468e2d598256ae491917","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-002","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"c2719c80bcd3b379666aebc69a8b0f4855e32422c7d4c0670e60336f1c799060","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":9,"source_line_start":9,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"a43583c8fc17d5353cae0aa43340ef1e874017731af2485ea9356346ab79e054","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":9,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[9,9],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"253e66c9e509b3019669bb5b68431f46660be58c18f6a6fd85b1fda385c206bb","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-003","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"6f529e527daf97c5fad965edd6ccf2dfa452b9d511bb2a3ad89cfad2f17b43a7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":13,"source_line_start":11,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"ed88bd5f1178363504ab5bd71e717adc7583386b120ad08baf893d02c161d2c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":13,"target_line_start":11,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[11,13],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"720481d7bf82d34b33a218aaf1505edc72fbe0eb2357a9add1119a5dbe5ec157","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-004","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"a52b91f548e9fe3f76e4af2aed8ad778c62e9731e9e8d3f94d5ce7e9a9c919a2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":16,"source_line_start":15,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"a2572bfc9b5f1cdc8c32543c83fa1baac7eaf1da51cfa51a458959059b57bcb3","target_edition_id":"edition.r017.id-id.draft","target_line_end":16,"target_line_start":15,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[15,16],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8bfecfabb17d5282ea4e3d1e655dcc80b6f23536b2decca712618da0a24add5e","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-005","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"20c9bc4a9472dfaf94ec773781d522ea3a1ded63d5d4966ecece94969e73cf5c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":18,"source_line_start":18,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"5d8da7af4fe791e238010f16c3e5de84ed9f8f05992e192544030b5696290da4","target_edition_id":"edition.r017.id-id.draft","target_line_end":18,"target_line_start":18,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[18,18],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee58c313578659effb779633a602e55c2d8a4b08188aa00429dac6a952225a88","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-006","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"a73332862ce7c1041fe2b7095ac25982b7e4b2d178c7d8a473219140bf85a14a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":21,"source_line_start":20,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"0beda4b492c3458703f99ed9c9f18add3608831226c2ae1a055550d321e1d1f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":20,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[20,21],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d490429819dfdb284a37d21e86a5f114fad87eb1a1f5cd68b495e8206795f5ba","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-007","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"999d80c6ca9ef25208a31719048a57769850da78f8f6efd3d9f49ffabdcb5009","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":24,"source_line_start":23,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"442a17ad3f1890054bef75af23e20a059e644f19f0a5b639b2d5035981c99903","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":23,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[23,24],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a45ac36a8573ff4fe4e6716320420da366090887981edddbdf140321210a49e9","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-008","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"4f2e566a75919de72b0d4a2c93865538b2b0ff3254637977ded7abcebb3399ae","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":30,"source_line_start":26,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"7909828ac42667c27fae2ecc8810826d64567c9313a957f9279f4ad99f66b921","target_edition_id":"edition.r017.id-id.draft","target_line_end":30,"target_line_start":26,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[26,30],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4df186363116d19f6ace8889d113b2c0b3ad5195af4756bbea85d0459032e4a","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-009","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"53afa703fe3ba370386de085db53f3eca888b91b1c3db84b449adb349f66a41a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":32,"source_line_start":32,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"ef0dcc1e97313c7ef41072e574f8aa682bd1dc10f3517709f63a73ffbc20a86e","target_edition_id":"edition.r017.id-id.draft","target_line_end":32,"target_line_start":32,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[32,32],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"50959ade6bd8b22206132bf9fc72aed14cc43c3c0c108b735564471e0de43b03","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-010","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"5043dfca9e2ec5ae5db65c4c16ff3d097fb81919dd521109707ffb215820f8bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":34,"source_line_start":34,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"7b352b4f446fddd6e1c656abee5a18e4fa27faf5ad37cc3ff33bdcf82c272be6","target_edition_id":"edition.r017.id-id.draft","target_line_end":34,"target_line_start":34,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[34,34],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"03fbb10f9046c5fb95773c6baec84a718cfaf482bd146e810b556d111dd00d70","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-011","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"4a6a6244789d2475cc0b876c036e0e7f8cef2613bc2852479383f34e15f1129f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":36,"source_line_start":36,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"d671a8b07a89b39c304b1c154dcee992bea5269ad889883db2eceecbe99d4f23","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":36,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[36,36],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"562fd94c759ad45ed1e03866df357726730caa8a2b13de7814dc92d3f4fc8e55","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-012","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"3fa19d186fd475d1389b71c54a5ded2b26d990f3e127fd1adaad3c15bba59b46","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":43,"source_line_start":38,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"db7566a732a96158bf5c9483dca73cb3b30c66db603d70372f5982da4e0392be","target_edition_id":"edition.r017.id-id.draft","target_line_end":43,"target_line_start":38,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[38,43],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec83f7e7f9900ad7e7aeca0d2ccf9d4f9344ce644c904a63fec4299fd5352b8a","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-013","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"3950990bed63afbbf218c4fc797ad3f3519af618fe4d1a4c0aab5658d532b0cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":45,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"ec61cbf2312c52d31d224e181b83c2244b24ea41436595f30a2b97d1fc20b1a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":45,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[45,49],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6a2f37771b320408692a983e4b9f1bf667f534a5deb9ee0d3bb319d19935a21e","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-014","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"fab02dc643c5093b3290eaea16a8cb6eeba947920c12e27a958d023ffe4729f0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":52,"source_line_start":51,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"01cb7bce2dab8a44f4a3ce7cc131d6ca6fc45c5ef22826fa8b4d768db712598b","target_edition_id":"edition.r017.id-id.draft","target_line_end":52,"target_line_start":51,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[51,52],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d2abf3e3d4054e9b530daf9e2e5be07a24c9c6257c8b2e4d73b88595499f2c2","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-015","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"1dd4b04657bf8ed725ffbf2c9dc6de32319a34d34703aa8e7b77fdc56bc14d06","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":58,"source_line_start":54,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"369b7b9c72322f1aba0492b02674e100a6b4cafa9d1c913a2be7184ab0f75c60","target_edition_id":"edition.r017.id-id.draft","target_line_end":58,"target_line_start":54,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[54,58],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"123c610e306048aa45f1c730539255bb4a7f4ce75ee3103b73fa7ac40558bd2c","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-016","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"da5495742481d5941cefbb356a0f8bf7869bfb7a0dd7c203ad0899244bab02c3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":60,"source_line_start":60,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"4a3f4c37f83c29cfc9da6841ff2ead19376b200cf2dbdd0b364f32ebc4eab122","target_edition_id":"edition.r017.id-id.draft","target_line_end":60,"target_line_start":60,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[60,60],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f565f4d09bf1a8cca3aadc39de182fc02ac067291f952fcc681c6aba776d00fa","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-017","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"ebee0b68adf3bb0e51fb307b0b2dc85209fd3d7a2d985b2f6aee2267f66f4c01","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":62,"source_line_start":62,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"2ef56e2d804ae277ca8fe8bceb62a82a30ef6ab3a3a81347b5b71e4d1c9c3dac","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":62,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[62,62],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ecd6246d43d5e6f22824febb9a0950ae231c2681a8f650afa2c0277c199c01b4","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-018","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"2576474b674c21cfc52e39acce9f0065ae27eb48cb1beeb37f82261682cb5ff5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":65,"source_line_start":64,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"8ed8739332998849499b9727a382f3dda048c188b1699bffb5ca3b2bc819b10f","target_edition_id":"edition.r017.id-id.draft","target_line_end":65,"target_line_start":64,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[64,65],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"91675bcc2ec0cffcc0fb6050c006ab4f70a5184a74fd3a49ae3b0dc2c9b05892","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-019","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"df2c9d46493fe740f43075a4504ccdb9858177604de3be19cea6259a0f3a095f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":67,"source_line_start":67,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"23ce9382c9357aea74d7a3eb35ecd637120c88fab2011eab9cf7e7cbe572edca","target_edition_id":"edition.r017.id-id.draft","target_line_end":67,"target_line_start":67,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[67,67],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ba512363a503cdf929ef120cf30abb1b94b50e8bda7ca86294269b22f029659","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-020","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"e28b6ce56f6cd9a3b000a14704cec46cf5ca423d9cfbf16366b5ae14cd4657c4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":70,"source_line_start":69,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"31b19b2f827b5240b9dd56559ea949932dd6ad0a89408dc7421305ca1563cff8","target_edition_id":"edition.r017.id-id.draft","target_line_end":70,"target_line_start":69,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[69,70],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7df5986691cf923dd9d64165fa47c2996a9204128caee1f957957c5a3f90fdbc","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-021","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"2b18712acec57c6aeb1ab63ffaf590360950e42e5c102904417a6c49176ef53c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":75,"source_line_start":72,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"7c69ed5ed6ad22b5572b0daa5a1f54478f6c1d8e8c360acd91d5c453843470ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":72,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[72,75],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8710799ff7c31a7b37eb2877cf3758cbf21ef3f4364aa7798d196d467d7106a4","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-022","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"c0dae9dc35f80519cacee17cae464c21152317eeb8225769defe5ee9058be4da","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":81,"source_line_start":77,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"ee228bef0b258eedc32b15e13fb3bd5b35f2388eeb941272fee5312a85209fb3","target_edition_id":"edition.r017.id-id.draft","target_line_end":81,"target_line_start":77,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[77,81],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e16bab7407ebfeaba64f88e4b51d12bf9e88b2509a5f8d5728f9940ac6fa9bab","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-023","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"eef315bbc84fb6ad65d6c57be294f7373914528d4b54a4f8ab413dcb43dec9d4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":84,"source_line_start":83,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"6e939ecd4170b96ec73f882c0ccc769ff40186d17c9c813ed22dda0ba38f64a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":84,"target_line_start":83,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[83,84],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"68e6de2057690d2af4af741d31514758942c49d0021eaeaab9ccec938496611d","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-024","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"cb9cb7a45b71330bf646ff30a724e943813a94ef3bbbc64ffd939407e0751e57","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":86,"source_line_start":86,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"4b8e31505bb45eb1aca2ce6aa7eb855061c49e0ac30de00e6b7104321bb2a216","target_edition_id":"edition.r017.id-id.draft","target_line_end":86,"target_line_start":86,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[86,86],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26d58372b77e647c2cfd2b04c2c3400a14b22578483f1e8e04ac4d786d737a53","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-025","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"0ea3ec2a3de5ce5ba3d996568322b4378b73380926a994fc1b0309603c1a4fa7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":89,"source_line_start":88,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"6cd632b787159a2e5ea1b713bf8b64f06520b379f78d33221ab4c903289bc5af","target_edition_id":"edition.r017.id-id.draft","target_line_end":89,"target_line_start":88,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[88,89],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1fb5f641deafc6b032399243db44cd1729270a2cecd4d9a2cf936289c17440cc","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-026","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"23f3457d1d0a7f5901229f79a2fdc0f2b4f56fa6055877cf045656326f21e6b6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":99,"source_line_start":91,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"5ac4e8a252d3fe6b304d4d2ce00a96f876e7915a214dcead59a5aec9d3f2c8a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":99,"target_line_start":91,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[91,99],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e3018b4347bc49ba2a933a825df56017b4afb8fbc01e62778e5b443229e4c062","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-027","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"2937cd020192d9dc541beba28fd784e908dbc314d59e085af853aacad453ee3b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":103,"source_line_start":101,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"4a017bc184d8eda9ef62620ed8b20bea3787a045d2144130607aeee4f12c13a9","target_edition_id":"edition.r017.id-id.draft","target_line_end":103,"target_line_start":101,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[101,103],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a51415f5ab9061521e6ebb6379de5730d90a60e9d255a50da40727177447b4be","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-028","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"5c0df0255e2af1dd748f6221da7b8c48f2304bf211cdea131dd9140d65ef6951","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":113,"source_line_start":105,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"62beb8a253990578f8dc7fff449ea756f762bc4534ebe4c142cf0e89096e17ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":113,"target_line_start":105,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[105,113],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b422fbd78c03c7ec7cf1950a1bbd0eef46f3c3e7a2beb049190c75edfc9f465a","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-029","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"0d1befeae781d5b74de1c2d147900358dec9bb9f57217a94f1713540f6b1ba12","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":115,"source_line_start":115,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"c73a3f1f328f1aab224864f004d31163326f686f21e23f38150fa97fd88eec3e","target_edition_id":"edition.r017.id-id.draft","target_line_end":115,"target_line_start":115,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[115,115],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f3feeb4776a0b5629ce855b326ed41c207ddce7a5068882a5240cbe9a79d5b42","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-030","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"7d7f7be20ab0f6fbbee079660be494498780227e5f1a7c7090e2faf028f1b778","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":119,"source_line_start":117,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"712d66bd555ed89fd282c472ee50df36109d067f9c60a66ea38c2a51b9f3d9d2","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":117,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[117,119],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"301c66813e68e6d474a5d08a94b37b440d3b949c1ef82d20c6e47475c11c4607","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-031","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"6ec1fbc6bcc03cae35a6a74c7408d1f279fb0e8fdd7dee185156ce0c1cbb1c0f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":131,"source_line_start":121,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"4e5268d9f1058f79b0affd752d24fd33879b97efd21e66f959c8c8ef53162b35","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":121,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[121,131],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"769d919fc92f52aac2e2afb9eb13a70b839a642e56e61f69c548b9fb18b17b95","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-032","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"f497fec0d146496037f2e45bf91b4cccb0bf9206d3c31faec8f776b72c2de7bf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":134,"source_line_start":133,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"e47329c4bd22abccefa5a00df7e8486a9e18664f032c9319de44a6451fd587bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":134,"target_line_start":133,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[133,134],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6fbbfce37a10c84e803948c88a8d6e47dbf57ca323a8947b331c55dcb02c1330","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-033","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"33bc283ab14db22546ecb7cf9185bce61989870205ffd0993e52a7f990205b54","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":136,"source_line_start":136,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"176c4fc74eecde609e3402ecf394721718e43a611e8b35c1cfa653d7367fd565","target_edition_id":"edition.r017.id-id.draft","target_line_end":136,"target_line_start":136,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[136,136],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec7e82c4451b6350fa331fd166d1db834e1cd75513cc32d1241b7e5c3b1f29e6","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-034","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"b3d66dcef7ccf2c1bba9f68126bd2bedf6895f9559b1b6990fc35ca54f514b76","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":142,"source_line_start":138,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"1686ac67e5091788b6b501f188bc5085b7053d8b441b7c54798d9f491edce45c","target_edition_id":"edition.r017.id-id.draft","target_line_end":142,"target_line_start":138,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[138,142],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8038629e73e9f171dfd14ffa254ea6c1cfba6ae9e5eb3d0ee8511b3c9f1f1765","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-035","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"603a6d5f1e44328780e357ccd15aa1783d63422bbc92084d0b8fff7f698e3a3f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":145,"source_line_start":144,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"6ab8cb7560d962e25a5778e7f894f1be896339c73e83835c1919a1dacc07b694","target_edition_id":"edition.r017.id-id.draft","target_line_end":145,"target_line_start":144,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[144,145],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e05b61566900578ef2edb4d9a6333124db060a156dc77c9010bc99d5a27aa16","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-036","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"9e07f3e814f8982086d57d06fcf04287275a0024c756443eb6636f75ff368f58","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":151,"source_line_start":147,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"83ebae524741dc11084384a9856a03af4b513f06e9eb654b5382d76c33de14c2","target_edition_id":"edition.r017.id-id.draft","target_line_end":151,"target_line_start":147,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[147,151],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae22526bb3f3d5b0f6a3a5bf30f67c39a166bd1a7ac6f80f4c61f4369e808b6b","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-037","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"45cb5ea42f9219e2cb69ff5cd4e3f58c878cacb7de6eacf8b4c825ea9f295a53","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":153,"source_line_start":153,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"412fab08811742f5bebc12e7359f83af5f1afa0703f1c0b6f529094ab3de4e6c","target_edition_id":"edition.r017.id-id.draft","target_line_end":153,"target_line_start":153,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[153,153],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"832b3fd2cd076f5277621b729e31286376b9160312aa1f8abef4a456a81c58d1","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-038","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"52eed106ecf54bc43e1a70b6bab1a7d191ee6d4f46c43665d0396086d0878991","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":155,"source_line_start":155,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"812fc88e201a913466bdbeb32fdca428541feaca9b5cff18f1856a1e00aa014e","target_edition_id":"edition.r017.id-id.draft","target_line_end":155,"target_line_start":155,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[155,155],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4736ddd71aa625b7238833c8b3da4a32414e1ef0df6b23bed1dd41a129c35f93","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-039","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"eda467600b890cca90a95b81b21e55af6d7298bdd5bf44382f2d0e110b2252e8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":158,"source_line_start":157,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"daaec9d0b14bdea353acdb401d766b258519dd47064177b2f65ceffcd79b6c7e","target_edition_id":"edition.r017.id-id.draft","target_line_end":158,"target_line_start":157,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[157,158],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f71b841f9057af098199aaff54b1e36e57b485fb20592af3748363a0ca6f5ab7","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-040","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"58cdeba6c4e5a0ffbbcc592943714590a9cd9d692d64c5eff596f00a4c67e77b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":164,"source_line_start":160,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"29a9c44ac01ceccaf3f4f5392455653ad5d6beb2a59a8f7189e81e5e30ce723f","target_edition_id":"edition.r017.id-id.draft","target_line_end":164,"target_line_start":160,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[160,164],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2a63e2d6c67b6f3b03251bd123e19edd12326b989724018812b0a09a82c55a94","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-041","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"2ad4f58b4bb41057ad626983bc7cfe52f42630aab2197f8a363b2430db2295cd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":170,"source_line_start":166,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"31e359e60dd8056ac882b3673a089598cf22d3a5ca16504d365e657fe5a389ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":170,"target_line_start":166,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[166,170],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1022813bd801f40f0fe1ad5f2fd425fe28107bc0513c8becda1943a8c6609a3e","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-042","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"5ea94e9e8922808fb2cfa30be7d16eaa897cfaca8f4be3a94cebd070bb8dfd2b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":193,"source_line_start":172,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"5a01ac3f570ba3e64b59727262803225df7ffb8e6096cf5a0d8d6d4f09caa93c","target_edition_id":"edition.r017.id-id.draft","target_line_end":193,"target_line_start":172,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[172,193],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6b3bd8a7f796262d876fe9a79c6a18d562c0733f77562fac854e2921ecf229a2","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-043","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"946bd6fe9cb4d4c0f56cbc0bccd627479558d8053f69722a0998f1b1ab2ad2bf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":216,"source_line_start":195,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"88800fcd8a436e7918934e296008ef9076e2c4ba115333407dd9359bbbc4865b","target_edition_id":"edition.r017.id-id.draft","target_line_end":221,"target_line_start":195,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[195,221],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3105cab9de8f416f927db10a9be092deed47ee2817e125709f17b22d49d316e6","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-044","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"2f45c54947026610dd75465938640dcb4c87026a44a52bab17a4b69db1e04231","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":220,"source_line_start":218,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"17363fb956847c5d56859762c110a8614fa3c0bbef20583666d631b1d7a6acfa","target_edition_id":"edition.r017.id-id.draft","target_line_end":225,"target_line_start":223,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[223,225],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a15dd55545805c7b3de39b85bdd63eff9a190a0663466e9df0558257bd61248","concept_ids":[],"id":"segment.r017.book1.ch05.solutions-manual.block-045","locale":"mul","parent_id":"unit.r017.book1.ch05.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"b414fdfc46318412cbe17c049860530f8a5c6ee7546e24734cabacfe4c702523","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":236,"source_line_start":222,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"5aa3cd2be03341d6926d35ead90c6b79b2b1674352ffef1ea30295e603166595","target_edition_id":"edition.r017.id-id.draft","target_line_end":241,"target_line_start":227,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[227,241],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch05.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d52bf455bed483ed9503f2ed463168cc88a64c261e1cfd9bb53a2007e1a76849","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-001","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"1735de9f668b78c7004d5ff12a05aa5bafa8c47dfc7a129f5f9f046f56c79a70","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"14f94a2ec66277b1e7fa96c2328ee8d1e5510549408faa477c6d947a44ba829c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,2],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7073b607ec47fa29302b8f2a4d7c0991352b873bb528f95a7f13d9f075c76ada","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-002","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"ed89c6576723d7b5aed6e5667d30430c0ed6dc9f7acedc27746fe2a4c13620cc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":16,"source_line_start":3,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"0906e64eb4b1730af7ff3425bfe9941a1c0e12f46a144ce34759cd71068c3547","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":4,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[4,17],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"62f1e4492ce2b32f32e69b8ec50c18f575317d91a6b0e91e0d8a5f6176907d9a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-003","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"80acd49b57b6eeff6fc75d082ce9b7c70edb37f07f10db8534417496c8b44a7a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":20,"source_line_start":18,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"c98862608d71db6c743d79f0313b54e33ea5314274750615f9e61aa98b7ceab9","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":19,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[19,21],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1be665683e1a2cde55a3a91409c0f8b43e2105d8ab33e691fd5996afcd93e711","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-004","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"8e426db32a0811c01f01e7181d857294a40de172566c6740220845d91a2d9e89","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":23,"source_line_start":23,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"2effc61ea23fda93bdcbc83874d3318bbc509dcab0f0407e367624e3ae3894b2","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":24,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[24,24],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f782be5f9618ee50063da44da36df1d3fe18150b0368ff28e14b647fa3cb6c2a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-005","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"9aead96bb5d2b28571e096409ac18d66e8447c39adcae6acc07859a0b14e323a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":25,"source_line_start":25,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"3a30c5e41c299e4f11292691922fb07772967e3ca7bd382a4b6f79d6189eb6ee","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":26,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[26,26],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cdfe71f594bc0088f91b400896257e3691de9641c2e2e347f2877d2080a49a9e","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-006","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"0125039be079dac7fb1b4ea8b0bf327e93e5bc92cc984c8a5fc81fa821ebd99d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":27,"source_line_start":27,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"662920cf37e525d4c90c288c7a9c09510ef649731848d62b2d5ac8670821c6ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":28,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[28,28],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8257500b4b559010939939ae0e2f86f796cff492a86c722a163684a755e5bca","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-007","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"f0077687a08834691ffca6380d34f8c93a26667dfdd1f8fdfd59f39a98509b50","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":29,"source_line_start":29,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"f10905e4827bdeef1fa570378bdbcd047a440e60bd00308c0d269f82c884874c","target_edition_id":"edition.r017.id-id.draft","target_line_end":30,"target_line_start":30,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[30,30],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5ccaef29b7037dcf0122f2e12c8a26d493e43ab91ed46794ce9ec760e7bbe4e6","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-008","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"5276c1af08a452a5cc9b61605a0aedfea19fe020f504940fc1c3971cd76b44e5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":38,"source_line_start":31,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"aeca11c1da1007fcdcdd60d1ad024311066189004757e72463db3f2fdcc1f45d","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":32,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[32,39],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f691a5c1050112cb46edecaa41b18d08ad25fe2d897b3138d789dbfbd860b4f8","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-009","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"b372e80bfee12c2983724c93f5dba8d917da44b4a5ee30320d9fb4d051b60d5d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":40,"source_line_start":40,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"92ada25c8383d21b79a04e03ee18c8b102c5063562c28d9d40f8cc3bb260b712","target_edition_id":"edition.r017.id-id.draft","target_line_end":41,"target_line_start":41,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[41,41],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"35ee9a63e8761a7208eb395392e4f919b1c2979d8fb4c9736cc81e5a6328e7c2","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-010","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"59f59e8439d6064649b7b9ce0450a4f5e0c8f537cc055e189ed7479fb2188c0b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":42,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"ab11f2cb565c7e287cb95c8a1efdfa93641c0d55b6e38dde65d05a474926786d","target_edition_id":"edition.r017.id-id.draft","target_line_end":50,"target_line_start":43,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[43,50],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b591e28d8988383b001590ea0e2911be94522d82d6c9c7333415b6113b5949e","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-011","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"70f9642a718604c8d5b126b8fdb42f15d51c2a67b2e6a527a4ea8b4945d37064","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":57,"source_line_start":51,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"0367aac02548d5bb5f4030a815c4ff963cf1229afd858a92eeafa5bfe78fd623","target_edition_id":"edition.r017.id-id.draft","target_line_end":58,"target_line_start":52,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[52,58],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"354605f40e0b3d54396d93b47922dfe1c186990d7be520717148d028d5d33333","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-012","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"e08ff39e64f491f1db89dee153e1cabbda9c21370fc612b6a43b2256cbf9a4a4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":61,"source_line_start":59,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"cfe1f85b50f093752aa230fef9bfaf4a975d6c34c92da2822eb7c61733e2894b","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":60,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[60,62],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"27ba25d58e49c0825b67d9f5aef796cf5b8afb2812c034c33ae7925322b2b89c","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-013","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"fceb4f0156cf7db65c3ada0ec2eec94cfaf3afb725aaec165a5e8bfbb0d830c9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":64,"source_line_start":63,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"6af982571036f0ff9514d73a5dc9ebf2dff4005630b88cb4f1d144065cd03f0f","target_edition_id":"edition.r017.id-id.draft","target_line_end":65,"target_line_start":64,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[64,65],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e90e0fb066389ef6c011a0ab790f1cc981154c3d7303eca3216f786cc20136c5","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-014","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"b2cf5092fb315365e3a312e6ee7e520f028c7bd51a546748e6f8637b7cf6020b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":70,"source_line_start":66,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"fe7a70a02f2cf7ff0afa6e7d9aea1fb8ca11dcaf1754780870588ce9939d7dcb","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":67,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[67,71],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9f30560ee76fc61a2ed7686121d3d79f73c5c5081ea43396a21c2feca0c980e","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-015","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"ad2c90c1164d6ad23e47bb7c7c4ee040db5f72e0849ff8a6abe262e995fca3d7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":76,"source_line_start":72,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"0594789bce04619a58dc7e3f7ed018bd9125647db58207bd3446c458e8991b4e","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":73,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[73,77],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c8f250e342e43c15a980e4e5e67e329f8d60201b065fe308a193409f84bdb46","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-016","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"2b1bceb92ff30e058fd4b887ad87a049705bff0a9b5655c852e667b17d45eaf5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":99,"source_line_start":78,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"d412d9c0fd5f73e5f3a8e536cab5d83702a81defbdf56920fc0ed73b9852cb96","target_edition_id":"edition.r017.id-id.draft","target_line_end":100,"target_line_start":79,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[79,100],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb19972acc3771895ae58dc8c83b705daf7e7cd0d957bcff5013ebc28f946149","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-017","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"1d90d8ebb873b0d306edfdccc478f7b96ba459069e47f582061e16b5398843aa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":101,"source_line_start":101,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"26017c280ce92d1e04303d9e6490727a444c6486c9071b3f57c944a669448465","target_edition_id":"edition.r017.id-id.draft","target_line_end":102,"target_line_start":102,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[102,102],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"230cd6abe451105c4a891aaf3b511e63a536d2ad39fcec042710fe36fc9a5757","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-018","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"96e6d9dcc4960a4b432715cb7611f17256170ce9cd362852a619a0cea0251101","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":103,"source_line_start":103,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"67ebe813a17e853dc4b5deea904059cdcdae48fd7dc4f713e5629a0c504a7507","target_edition_id":"edition.r017.id-id.draft","target_line_end":104,"target_line_start":104,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[104,104],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4529a4b763502064824a57f6d9cc09e2b5c136cb7a6a6244ab825cef93b06252","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-019","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"a0776a96e77316d964420d30a36ef58fa4ec97d53bbce512985f6d8d0eebad9c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":105,"source_line_start":105,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"91b9d0c6ed7a8a56041ed09adf1501aaff629bb39800ddc3d57a90f267e620db","target_edition_id":"edition.r017.id-id.draft","target_line_end":106,"target_line_start":106,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[106,106],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f77c53b7c6dfc0489782ee13d43cf2e597a53ae6363bfe24cb386023af157add","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-020","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"e3a7ed3ed3410f7b8bec39cfe5d86fea43ad4f074361c7439653411f9a78829d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":107,"source_line_start":107,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"1c1912c2f74e22d34bbf98459583ff9ac269dc024a5085b373e0286d478c892f","target_edition_id":"edition.r017.id-id.draft","target_line_end":108,"target_line_start":108,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[108,108],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70fc38bac95089c9cf21db985b8691a7db97b55a96aa9d84823f029e4fd366d2","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-021","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"278eb407683ba3f6782fa9d83041950a7b1a6b3e839d6b8a5b14ef48f81ef382","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":111,"source_line_start":109,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"b7e559e53d781369e8ae20e6589bc1ae00c6cc6e731f513c6d93394cc0649148","target_edition_id":"edition.r017.id-id.draft","target_line_end":112,"target_line_start":110,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[110,112],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e26d1ac6fefe3ee0c4a0d548419289c87ad8e0fd213b3a057f5bf135c34e6d56","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-022","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"ccf23f8e659483dd0d6a23bbe8ed04d97d0bee6ef4dee02e31db48f366fec7c7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":129,"source_line_start":113,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"cc9eefdf041a978653ba3d414989053e4a06461aa26d154dec93343e841f8736","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":114,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[114,130],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d5cb50d31818ae60fc27552d4a89619392b11f71f964e21b423d3c7f898e68a5","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-023","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"79b7a249819b26c8ce6f2e90618d897729fdc0076d119210300995566d15dbaf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":131,"source_line_start":131,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"7bdedddab187a98dc50411c9c1eac49feb930fc3f990211ace4d80a016e43104","target_edition_id":"edition.r017.id-id.draft","target_line_end":132,"target_line_start":132,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[132,132],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19f3ae8f9499c739461f04dd10460258586fd869b8478659fc45eecc9be0babf","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-024","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"72aeeab19b4b059ceb57ccea1d2fa1d91d9ebfd6e81825fd7e903ce74760c6d3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":134,"source_line_start":133,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"ba885e5e00991f84c94009d4f70079af915a7a38f43260fa0b214b4adf108203","target_edition_id":"edition.r017.id-id.draft","target_line_end":135,"target_line_start":134,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[134,135],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cbf2b8fa773deb8c402d19ffd8d03ad4bc93b03a1e98e5aad2db8582bd06a6d7","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-025","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"a7c6cf1bcd5452b8320fe6c883a3869523569219cb7c07768d38d029b312789a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":137,"source_line_start":136,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"c0fc4d76fb8cc9285402ea1e60dcbd5f3aff2ffa9cf61d7671af71c41a09137e","target_edition_id":"edition.r017.id-id.draft","target_line_end":138,"target_line_start":137,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[137,138],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f2e2d4d3bc056ae1ad0f4257f7f9067214e93c833c886ddbf39571ff22744c0f","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-026","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"ae266f1f9d9c510d5bea81e6af14de97073a281aed2ed3377ff4089080967faf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":151,"source_line_start":139,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"b809c2d71b3047b7162ed3632ec91095c8dbee7b4d9b99261b3afb17400e00fd","target_edition_id":"edition.r017.id-id.draft","target_line_end":152,"target_line_start":140,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[140,152],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64cab629b3325ddb6f0650bed53c03e8c47b911919e74b8448dc4bade7ec6b2b","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-027","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"cf0a6e7f701d1a879d08a15e97eab62001cf6bf3a2ac67f4fa49855d73127697","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":153,"source_line_start":153,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"dfe20aa015e69aa20c3c02c9c46e8d968cadf2a7a128b2fb629804257937aed1","target_edition_id":"edition.r017.id-id.draft","target_line_end":154,"target_line_start":154,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[154,154],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02c58b4ec134a750faf650dc920e0f0e15b030708b616889f40f97e063a8acaf","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-028","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"8cf4a5889eca5d7f4820689786451aced336cbbd8a255e136dae8d1ebd8347bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":161,"source_line_start":155,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"0d5146ee7deac1e1ede158d06849708adf9e5b7b9655c47ce03deee8bfc281f3","target_edition_id":"edition.r017.id-id.draft","target_line_end":162,"target_line_start":156,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[156,162],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a1e93cc22ddf65b99156509a3a53cd7c50d9607fce0911bb7d085523fb878bb","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-029","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"2812babaab960ece8233e5039191ee442274075b6086a903feceaa68cac23e7c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":165,"source_line_start":163,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"dba207d63383b9562f43321b3546eac69f8a6cffeddcd51ae6e5871fc44cf3f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":166,"target_line_start":164,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[164,166],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee53e0b580b73b9625eec0337080d728de46936b9e843e41810774f85148f96b","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-030","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"9e131a175568127b4b7b94861781b83deeccefe0f6b7f44ac7a61081319579a7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":169,"source_line_start":167,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"a84b9468b16abcc2220e20b997938e3fe8e8c60075876e36da35d352ee9fbc34","target_edition_id":"edition.r017.id-id.draft","target_line_end":170,"target_line_start":168,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[168,170],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed846dd1a70e6a091772e8cf915522506c4a308b68046d63dc9a15f413588871","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-031","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"594d0ed1741005e019d5aec55c9118db9943a448aac14e0f7435d747e5e703c6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":176,"source_line_start":171,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"2ccf494563930007ff2153a1e4f511466bd14a2b8a36d41a90a731bd5a778e79","target_edition_id":"edition.r017.id-id.draft","target_line_end":178,"target_line_start":172,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[172,178],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d6faa9ebff386b9634b97391857766dcd853010aa93c538dc202d976b48294e4","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-032","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"a5ec30a033af3a25af7d5190a30b29cd602014fa29fcdb7d9286781e563d99ce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":181,"source_line_start":178,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"6df1910e86c5c0340220c929b74a612e286aacdf10f3c7bf427ccf469c770cde","target_edition_id":"edition.r017.id-id.draft","target_line_end":183,"target_line_start":180,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[180,183],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a9aeec8ef79ac54ef6da6515ab6b89db62ff30e12b726de3528f7bbfa3b532a7","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-033","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"9f2971d01874c7c8b336d6eee83047d1ff30d5347993bb72ab27561d6cff916a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":187,"source_line_start":183,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"43d0790be4a9fe04c90fa283190d43a3581a26b535e566e8f23ed7971ab176a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":189,"target_line_start":185,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[185,189],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"95d3f5c62e0508a7d5d19a02ddd60b90f553620d8f7e417386945fdf4c4f81e2","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-034","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"8373db73084731ac5fd57d828e65d9523425ca53656d0745a6d892401cc9d31b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":193,"source_line_start":189,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"5fd17e2f0c467f91a37fc91a6ef905152ae1b19dd199152a452746b7fcfe97bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":195,"target_line_start":191,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[191,195],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"15836a99ca04c829404cb04efec9c8488be5b6109a31b8dfe2527397a0236eb2","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-035","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"80e2994dbd0d64d454321d9845542f67cfcb0c5d558033451d81f849a6ad6f85","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":200,"source_line_start":195,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"8736151d05f67e457f3269b1ff255c6db2c492ce5b0e002852f10e7cacd4f63a","target_edition_id":"edition.r017.id-id.draft","target_line_end":202,"target_line_start":197,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[197,202],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"663df0cfb56dbb5d15d0681b8b19b70707d80ecf69d9364473362e57ee4aff81","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-036","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"532e4a3a773485f3645d536c9946d45798f1a1b5b99a24af4de14062f6f3de76","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":209,"source_line_start":202,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"3a0903ff62e42d87826b3080bb55cf55869edfb2950d1213008f2b2f98c73665","target_edition_id":"edition.r017.id-id.draft","target_line_end":211,"target_line_start":204,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[204,211],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d63ae6dd0a8bdb4aa27f9fc409be60223d03ca6ee11645ae57c99d073091d17","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-037","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"1c2f9b2ee98ce095c1096640428a71454a2520b7d41e8f2ae5cbeb62aaca219c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":211,"source_line_start":211,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"b5d62ecaacb0ff8a8f265207afd7d9ab303b6c8255052bc6dab86ee2378865c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":213,"target_line_start":213,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[213,213],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90d55aabf8626bc1ccad1c58c9df784cb9d5fb23d97024889db60d6c1613eb98","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-038","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"ea93f8a78cd0cb295ec0bd748884308b22748d5a176fdb8cf2fa305a0341394d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":214,"source_line_start":213,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"7826556d317302a534c76de9d99e8024c87335231ce3fc0eb9d652bc6b1cb3c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":216,"target_line_start":215,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[215,216],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"47ea3ec9820e220a6564b701215fa7faab0aec6e2cfa7820e6fdd2d1d9da4594","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-039","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"7879a1034b6dd515c0e8bfcda5c55fcffdbd7b483237b46a05c71085fab5525e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":224,"source_line_start":216,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"91c3d46c08be7b5a7e2c3cee2d388d39c876b4ff3aa5cefb243e88f09173d498","target_edition_id":"edition.r017.id-id.draft","target_line_end":226,"target_line_start":218,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[218,226],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"736ed9040fdc3b7978e1627ee3bfae405253d7804d42912753716e821b6f7fd8","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-040","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"4f14ae29ac56a591c7097274e5c38c933657d7ef9e4b33165422704dff19bc61","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":232,"source_line_start":226,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"a64b99c3d519e4e18bad141019dc4aec93ac030c46bac6425cc43867022bee48","target_edition_id":"edition.r017.id-id.draft","target_line_end":234,"target_line_start":228,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[228,234],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3791597c5b8bb83290b3333db5dcd1d4ae9b149ebbaab1f04ec7acc6b6db8c73","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-041","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"01e50e5d2202e2559c9e759f793db51729097bfcab77ad3a1818d36cdd750cec","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":245,"source_line_start":234,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"7daa7b0c558336c7addb0b7bfa2f097dedadb8c7879ff86f298b59ab6e535856","target_edition_id":"edition.r017.id-id.draft","target_line_end":247,"target_line_start":236,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[236,247],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a26be127df018e1da8c2ab3acf9ccfa655f6eac56ac24deab1d20ed02a4c58fa","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-042","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"26fccbd8e89369e8ba8515e47f05d31e05bec4f62f9b56576b4c719126ef0c06","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":255,"source_line_start":247,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"e49b4944d2486ada5f83d4b4effe13d5c3eaf58e54a7cf6195c29e31adb84b12","target_edition_id":"edition.r017.id-id.draft","target_line_end":257,"target_line_start":249,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[249,257],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ac600e11276559158f36e1a645b995367e5f1e6caa0d2f9f7e0cd9b687715d22","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-043","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"c2210a76538fd560274834896152125ba7d27ac4f15a628fc815a44fe0c1e357","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":270,"source_line_start":257,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"290f7e8b02d0a3127de015e47f20cfedfa5c1adb345455a5e8bb801d38971f85","target_edition_id":"edition.r017.id-id.draft","target_line_end":272,"target_line_start":259,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[259,272],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"344bcdb3e3c0dab7d36800bdfdffaff471137a66875aa0cd26d89351d6e7bb06","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-044","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"0d1e40c0d0a86dc2f329cef2285abc42712a8cfb51b82a5171a66e3fd99e5f7d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":278,"source_line_start":272,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"d2afdbd541466c69eeb232e479bc243e31040daaa72b8e8d3fb2627a648a6e81","target_edition_id":"edition.r017.id-id.draft","target_line_end":280,"target_line_start":274,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[274,280],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed469826ac4b0a3ff2f2424c4f15aec4b554fa68383bccb19bb243ebbb411b26","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-045","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"b0c17ba6140bc213ee793b74aa2225965d20a842fa291886db969d3782040ba7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":282,"source_line_start":280,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"6cf23b03385bdd0021fa53f392935488cf65caff7df063f57571c288c0c4a055","target_edition_id":"edition.r017.id-id.draft","target_line_end":284,"target_line_start":282,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[282,284],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5778e98ff64636489d07a892eec644eb48330fae48a802556f605d60bc11606a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-046","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"e225ff5d323f3948b3207c037279949403d12ed35537832f32abf6a84629f9a4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":285,"source_line_start":284,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"5da9cb009f305bc6ca5477e6c5a4b90207298c360d3008e33dceb33d16ef3ffd","target_edition_id":"edition.r017.id-id.draft","target_line_end":287,"target_line_start":286,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[286,287],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a82c55268c1daff3c9caf604f027951fafe403edb4b12c5d7e130aa8778d5e1","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-047","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"704d09b17421a772d33ba1546d36951c3c9bae940fedc61331786a0c71208cfb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":291,"source_line_start":287,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"32d7ad7e14e2524268c8f6c4d90266bf2a46228addc369e54c8f762ca61f0c11","target_edition_id":"edition.r017.id-id.draft","target_line_end":293,"target_line_start":289,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[289,293],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7a8766d8ae6e60b6572f7400da0abd506c43dfcfad80a4802844125784be6c5","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-048","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"180d86e0a0b55e629b9d6d84922efbfc79ad3367747f8861ce2592ad4690d089","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":298,"source_line_start":293,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"3469c679d87fe9cacd26033d5cbb1e41d21902a1566a2767763eface481ff719","target_edition_id":"edition.r017.id-id.draft","target_line_end":300,"target_line_start":295,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[295,300],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6bd194a513ef8af4fddd7915c0805eadbdf60b074eb9222073b687784a8fc8e7","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-049","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"01e558b28f02a0a451b0ea24a3c43b46f9287f1356972f63ffd4e38169e1a3bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":301,"source_line_start":300,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"2c0d0f5ad797485f41668505be213ee47cdf4d049db03ded2a63b076bc5737be","target_edition_id":"edition.r017.id-id.draft","target_line_end":303,"target_line_start":302,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[302,303],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ba1ba415a21eca013c4196142191cb1a74d7751640ee659e0b586b5c1a939d6d","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-050","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"d7303df9ba157f14b73b338efe91d944a20e55ac2f84ae2a85355ffb7163dda6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":303,"source_line_start":303,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"d7303df9ba157f14b73b338efe91d944a20e55ac2f84ae2a85355ffb7163dda6","target_edition_id":"edition.r017.id-id.draft","target_line_end":305,"target_line_start":305,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[305,305],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7fa305113ebcb657894af6e7f855ac938d82c5ff6db33c5414fc16936caa177d","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-051","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"49c28bd7a902779f08968c6b3dcd020e6746c0861df918469ebb6fafdfe3e25e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":310,"source_line_start":305,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"73ad41cff40aee3a74e90e2e1d9668020e342cb7ace24ce2264d9e7860d93e36","target_edition_id":"edition.r017.id-id.draft","target_line_end":312,"target_line_start":307,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[307,312],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d07f9f954f336d575aff788afff3e63a4dc628863ff8c1cafc234759c600fa1b","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-052","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"4dc6c9a4536c90abf54b26d6a009ca203566e4458d3513ef25079fa9227ca0e5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":343,"source_line_start":312,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"e1f792b11636d7d2b89d7c0b17ba301a0acff55bef68d0f7be1a4f541cc84a8b","target_edition_id":"edition.r017.id-id.draft","target_line_end":346,"target_line_start":314,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[314,346],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b025a70cb9c837290462b317962bdec41ff62ef5909e11dc8e2084802625a436","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-053","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"49adf2a709a92483b9fc3a056d90eb122e1bba004c4aee30162befc6daea9d49","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":348,"source_line_start":345,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"adcd92fd7ef8b7adc230e15e851d4c0e2b081ce0ef7926701184c82a7b5ad602","target_edition_id":"edition.r017.id-id.draft","target_line_end":351,"target_line_start":348,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[348,351],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bc3f6218ad03d973c1c15636aeaad027470126d4506e3a2bee2dd7d20596c3b5","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-054","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"f310f4331262c88accb1e2321ce3a080a9763850d2f08f5da43249f87327bde3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":356,"source_line_start":350,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"62e8155d3ad474037eb711e03868514f6082e42431b400ecee0c6ba43e8bf698","target_edition_id":"edition.r017.id-id.draft","target_line_end":359,"target_line_start":353,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[353,359],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"34a4b8f2e97e4cf52494864586195540bbfdc877788485ba51fb28c028ddd331","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-055","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"74997fb175bfdb80467b4f06f8857a8178bc2317b8b488611759b1a7b08a524d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":364,"source_line_start":358,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"93affd8903b91034d268104e37d428e37f89d40fedb98f9c2d647870797416d0","target_edition_id":"edition.r017.id-id.draft","target_line_end":367,"target_line_start":361,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[361,367],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57c52346214ee5b1207773415838c4b4d913c749b8fd42de4a20816214b02dd5","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-056","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"e907343eb036b3fc5ecfa2cf356133df6564fa220cc869961eee56445ea6f034","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":366,"source_line_start":366,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"9aeaa131cd9a14a7932c6dfdf83b7d7d0e5cf2d89f2fb81372d81a0db651bbe7","target_edition_id":"edition.r017.id-id.draft","target_line_end":369,"target_line_start":369,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[369,369],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5301f6c782b67762f1b3872daa13809c1816011400116ba1358b0aa65e2a687","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-057","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"56095c4785d6c49be20dd58ee84cc58ef1fa123ea76f0c3b380a09ecb50851f1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":368,"source_line_start":368,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"70d084603b6485cf00032e69ff48b0aaf78991141516c3277ce466f33b01b4b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":371,"target_line_start":371,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[371,371],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"375f8aae46714359ce5c289a7d3431888e7774610c0e5edb746eb0da0d88d2a0","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-058","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":58,"source_content_sha256":"db8cdfd0cc73b0c53a90acda9e44622a068e37430d7637e99d35dcdcfad44b39","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":370,"source_line_start":370,"source_local_id":"block-058","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"55c7830800a6879533cac03312cf20c5a1fb93e060eacafb114ff086635642bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":373,"target_line_start":373,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[373,373],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37a39671e02dbecb275886813e7928d7c07fbb4e1a20bd63c32a3f624c72b21a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-059","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":59,"source_content_sha256":"e4f400b6af559a7d65fa72ff67fabd55e4b9558496735b8f391f9a45adfbcc10","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":384,"source_line_start":372,"source_local_id":"block-059","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"0c2b2917bcbe95d9d254c01cbe0222d7ba0bb9cb4c6c3a300534bd9d7af67fe2","target_edition_id":"edition.r017.id-id.draft","target_line_end":387,"target_line_start":375,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[375,387],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"674ad82e8889eaff0f32b83baa97b28deeb3f08f23cc095698567fbce6673d65","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-060","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":60,"source_content_sha256":"175d3058a9dbd0b9223b5bbb88bd2c4890b420667f4d3c1a90c40e346c83acb6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":387,"source_line_start":386,"source_local_id":"block-060","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"ead0c16de4a44b83c8bcbc216bb26054040912f3fd9cf5106bbac648546ddf92","target_edition_id":"edition.r017.id-id.draft","target_line_end":390,"target_line_start":389,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[389,390],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"819f110ae79459ee51d909d837767595471d7371369e70f34e5eb6079088d474","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-061","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":61,"source_content_sha256":"8cf4a5889eca5d7f4820689786451aced336cbbd8a255e136dae8d1ebd8347bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":395,"source_line_start":389,"source_local_id":"block-061","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"0d5146ee7deac1e1ede158d06849708adf9e5b7b9655c47ce03deee8bfc281f3","target_edition_id":"edition.r017.id-id.draft","target_line_end":398,"target_line_start":392,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[392,398],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d879f1bce9dc0e93047e24dd5e9de0dfe98d5f3c7f310258b42267087e32678","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-062","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":62,"source_content_sha256":"335a9818c50d01e1f3930a47e3f8eb232fadab32363e94ed4fb4b64056c5f8c0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":398,"source_line_start":397,"source_local_id":"block-062","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":62,"target_content_sha256":"335a9818c50d01e1f3930a47e3f8eb232fadab32363e94ed4fb4b64056c5f8c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":401,"target_line_start":400,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[400,401],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"68f278c41d8583e6a24c8234316d4a21d815a738ea27b4efc9d093067ca89c13","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-063","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":63,"source_content_sha256":"1d111513ec2fbd7b486dd2f70d06f5de130c466375dc65ca96b8567eaf8d783b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":402,"source_line_start":400,"source_local_id":"block-063","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":63,"target_content_sha256":"fd8bc55b5516609b734af739f61f21b717ee8f5ec54f5773c5a9b5a996373cb7","target_edition_id":"edition.r017.id-id.draft","target_line_end":405,"target_line_start":403,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[403,405],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dac6f36b346c34f20debe01575a9c3ebdbb9310cae883c381f4f5192bbc34b11","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-064","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":64,"source_content_sha256":"1d85a11761e09e3f2be3a496bdd00bd458e02087bef2eddea6ed40e5d552818d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":407,"source_line_start":404,"source_local_id":"block-064","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":64,"target_content_sha256":"2ccf7fc166354d83fc09b5f9cf8443187d6abbf77c72fd045477481781dde293","target_edition_id":"edition.r017.id-id.draft","target_line_end":410,"target_line_start":407,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[407,410],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3bd264ece4325a12cc56ae493d81e30fae404fa66522ae00771979de74eccebd","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-065","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":65,"source_content_sha256":"de3b5db7e5d44e4ddfba33f114ac096cec5591122afd17073434aee258d4e509","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":413,"source_line_start":409,"source_local_id":"block-065","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":65,"target_content_sha256":"5f6b8bebd4bd67e798778a8a6429c3fa6138ae96327129b7ccd7080a6abc0451","target_edition_id":"edition.r017.id-id.draft","target_line_end":416,"target_line_start":412,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[412,416],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3394fe8b0bc66295dc6317c6a56a74ae0b7264e437b2b2d8f479906b6a862c84","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-066","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":66,"source_content_sha256":"c0d921c9d9513cd030dd1047a65e535b02fe00e8c1956ffe8460f5937b04a890","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":416,"source_line_start":415,"source_local_id":"block-066","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":66,"target_content_sha256":"d095b7e4cdd9c434e907fad4f010d6825f3ca8462514f2a9ea9e586fb8fbe426","target_edition_id":"edition.r017.id-id.draft","target_line_end":419,"target_line_start":418,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[418,419],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6b24b438b49470e7ec5523bda5d1bece4d0d4c62b9aac874a91f9e3b93cff985","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-067","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":67,"source_content_sha256":"7a305aaa74555195f07900650ec4ce79b2ecb1116b74aa2219e181ab5a12c025","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":422,"source_line_start":418,"source_local_id":"block-067","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":67,"target_content_sha256":"822d2508491215f80bf0095181683011ad7222df65ddb5deb9894c9b2f370efa","target_edition_id":"edition.r017.id-id.draft","target_line_end":425,"target_line_start":421,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[421,425],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e9cd85b17067d394c1cc10b2dfa2294f59d2bfa636221f03a1ba142e040ce57","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-068","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":68,"source_content_sha256":"1628084198607e6f91bbb86b2019fd9834464024cf47341ed950a6a18150b1b5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":425,"source_line_start":424,"source_local_id":"block-068","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":68,"target_content_sha256":"1628084198607e6f91bbb86b2019fd9834464024cf47341ed950a6a18150b1b5","target_edition_id":"edition.r017.id-id.draft","target_line_end":428,"target_line_start":427,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[427,428],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"93241cecbdd927d59dc8421bb8120ad72fd2b5370e21f6f77ef8eec8a5cc1c6d","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-069","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":69,"source_content_sha256":"63a95ad14c44b632045615430505b5b83fa2fff964e19c290f66f385cd3b3554","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":431,"source_line_start":427,"source_local_id":"block-069","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":69,"target_content_sha256":"d2eb837f22891d3bea7e76ceb2d03b0092847018e5943ac9645b437a35522ce4","target_edition_id":"edition.r017.id-id.draft","target_line_end":434,"target_line_start":430,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[430,434],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9bda7649b056fe793f9f2bca18221a9f0f43fe94ea9549cdd5d9b7601e920fe7","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-070","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":70,"source_content_sha256":"ba0ca3df5fee460db8a50eb20d0424855d87e68dc47d04d14d656a94980f6ce6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":435,"source_line_start":433,"source_local_id":"block-070","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":70,"target_content_sha256":"6500343b8834fa2dbfd60be7f578361b21eeb0a3670bb610c5f9f63ccaa71c34","target_edition_id":"edition.r017.id-id.draft","target_line_end":438,"target_line_start":436,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[436,438],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9598e0d01870015281832bdca6ecf0d42a5b761537dbadf8451c01fd8cea3ad8","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-071","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":71,"source_content_sha256":"503796df71aa6d02fe504597a69543044fea4cd06b3dcdf38662bdccfbaddee3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":446,"source_line_start":437,"source_local_id":"block-071","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":71,"target_content_sha256":"14f39c1888c75a4fe2694bb23e9e3b01ca58998dd61dcd55a6c08737c489f59f","target_edition_id":"edition.r017.id-id.draft","target_line_end":449,"target_line_start":440,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[440,449],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c976dfafdab0aecaba2eb8364fa39e0484e6a66a81d4e4d083e3ab8e001c170","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-072","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":72,"source_content_sha256":"9e20fb923696781dadf90dbabd0035cdc2ee585317bcf60eb93ea81763956a34","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":455,"source_line_start":448,"source_local_id":"block-072","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":72,"target_content_sha256":"b1dc777d71a4de9f070c095e5985fc9da397bff220394f1b79f8547652db7c0e","target_edition_id":"edition.r017.id-id.draft","target_line_end":458,"target_line_start":451,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[451,458],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02db38e8be37f3ed7b9a6a292e14a9789943272fc821d035bdeee162ebec9a2e","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-073","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":73,"source_content_sha256":"ea4ef36eced13f14d1d4a89d46ade60c184e71608aea565d9352c82ce5da736d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":459,"source_line_start":457,"source_local_id":"block-073","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":73,"target_content_sha256":"3efd8858ab962ba32de576993755b64e7c0a430194d9f376a619ece4f9ae43df","target_edition_id":"edition.r017.id-id.draft","target_line_end":462,"target_line_start":460,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[460,462],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"686ca61f55b7d79575507df400581c417474c0525b24f05d7dfbaf8571e0e46d","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-074","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":74,"source_content_sha256":"057db1e21be9ae0c3be03abc79fc7ef8cf007a277f76dbb995145805e7444b9d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":462,"source_line_start":461,"source_local_id":"block-074","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":74,"target_content_sha256":"b315dfcc3bf193ed9f9f4cdeeda547b8c3dfb1aa844f72fa98163f5aef84dc85","target_edition_id":"edition.r017.id-id.draft","target_line_end":465,"target_line_start":464,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[464,465],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6639bdcb9854e4fd1e04c7f20ba9ffdef282f9ff08082d34757de13c5647ed02","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-075","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":75,"source_content_sha256":"9167b5d1d47dde7adde2f180622053121744bcc6ffcc7fd10841098e9619e6ca","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":468,"source_line_start":464,"source_local_id":"block-075","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":75,"target_content_sha256":"2a1447a79f8649d08b724a5d26605e96219300904a72d4795f23770ad1129f53","target_edition_id":"edition.r017.id-id.draft","target_line_end":471,"target_line_start":467,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[467,471],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"909c20c76fd5eb9d094e59e9fd950926c725c39471098308a75791521483ab38","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-076","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":76,"source_content_sha256":"7afd226c6b794b4b07d9dee2d765060761272e5d62f285269b20f26f6d374bdc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":475,"source_line_start":470,"source_local_id":"block-076","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":76,"target_content_sha256":"1333c7edabaf0fe5b363ed5b0af0a7549bb176db2369dd692ac9647fe4f7f069","target_edition_id":"edition.r017.id-id.draft","target_line_end":478,"target_line_start":473,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[473,478],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14b30ca95e559d1a6f2b82289bdc381d5ae19fa6c322f0b3a767b2ade84ca4e8","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-077","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":77,"source_content_sha256":"fe4f023776fabeb558b1819fffe9e93d73cbd7462a9e6d32bfe20d5031a7feaf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":478,"source_line_start":477,"source_local_id":"block-077","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":77,"target_content_sha256":"3e502bb9eda808290e55fff2641a5ef5fe537fc988aa20b23f9836479514c638","target_edition_id":"edition.r017.id-id.draft","target_line_end":481,"target_line_start":480,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[480,481],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a448aa8df0057559ad84c338a8894a6edfea847ae6815e63fa45f6db711997e1","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-078","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":78,"source_content_sha256":"017ee971da0d20e4a6c51c132b33ebfb425f4f09bb34f9600285a9a3a6eb5ffa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":482,"source_line_start":480,"source_local_id":"block-078","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":78,"target_content_sha256":"017ee971da0d20e4a6c51c132b33ebfb425f4f09bb34f9600285a9a3a6eb5ffa","target_edition_id":"edition.r017.id-id.draft","target_line_end":485,"target_line_start":483,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[483,485],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37919678c46e1bf313a1a4d60c21d2452c3ca637f131bf690564cd90c24c49f0","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-079","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":79,"source_content_sha256":"e82cc50b065f2d2a3a598a64800b524158c1ba96d8edc1343a744dd64d1b75f2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":484,"source_line_start":484,"source_local_id":"block-079","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":79,"target_content_sha256":"d17d68ff94b4b73536938fca21e050fda8e05d4cb16dbccdffe3ae2548732449","target_edition_id":"edition.r017.id-id.draft","target_line_end":487,"target_line_start":487,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[487,487],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e7db91d7eb7c99c349a9c9b388d080f2127b1565041b841a5ee9a7527ecba33","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-080","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":80,"source_content_sha256":"19d93c58311d9a35350d381c8c01602d4eea09c0e58f39c61fdc9e177a81318f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":486,"source_line_start":486,"source_local_id":"block-080","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":80,"target_content_sha256":"5455429f90c99dec1c374c360b6f46bb7975f3e3dbbc1961430d09d31dd6c31b","target_edition_id":"edition.r017.id-id.draft","target_line_end":489,"target_line_start":489,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[489,489],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f4fc898b44690829f60b90e869173d1b38f795eee5ae59be0779bfbea41732e0","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-081","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":81,"source_content_sha256":"b4b3637331321d6ce3bae5f2ab29380097d5b7b7c5d8064a6b5d023150aceefe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":502,"source_line_start":488,"source_local_id":"block-081","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":81,"target_content_sha256":"8d96662c587be7ea4c0b2fb47e1275ee6aff824f26c5c607995e8bdb71a6a2a7","target_edition_id":"edition.r017.id-id.draft","target_line_end":505,"target_line_start":491,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[491,505],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9d855aa1e4ac14ccabe8d1666fca26cfc3292d7f10a7c01e4d06e4b48cd3ec8","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-082","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":82,"source_content_sha256":"60c41e78c1d93ee7cb0cd7f87b27999c914e28b4b39d10e47ba2ad071c8845ba","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":510,"source_line_start":504,"source_local_id":"block-082","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":82,"target_content_sha256":"e214a27b2315665b29551c9acd5dd493a96198f3600930f5c019d0fe0c0274f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":513,"target_line_start":507,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[507,513],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"25189521da5bfcf3e52bb46c381ff7841057c8279b0a90c8050ee1d0692a8582","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-083","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":83,"source_content_sha256":"be6c8d99c40c12d99b4db4e2988ab7dadb458924fd66599720e784a96bc55188","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":513,"source_line_start":512,"source_local_id":"block-083","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":83,"target_content_sha256":"be6c8d99c40c12d99b4db4e2988ab7dadb458924fd66599720e784a96bc55188","target_edition_id":"edition.r017.id-id.draft","target_line_end":516,"target_line_start":515,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[515,516],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0398641095bd1f2aef5c92877d14c230fed689d9a5b15982363e32b20abfd261","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-084","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":84,"source_content_sha256":"f05676643029981f68012a6fbb3b8597eed7dc8f8f3e33cd0814a4c5c5a22ea7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":517,"source_line_start":515,"source_local_id":"block-084","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":84,"target_content_sha256":"6b4a704d3ee04a914ffe2f7cdff27b6ba58dafcee4dfd486e1b449665b17ec9b","target_edition_id":"edition.r017.id-id.draft","target_line_end":520,"target_line_start":518,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[518,520],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81a136faf9c1ea4dfed218e6bf912125a31448990866e98040e1dd50c32812a6","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-085","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":85,"source_content_sha256":"6b612aae25914c890365677f68facb43137b048ca1181168ab578ca18291b04b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":523,"source_line_start":519,"source_local_id":"block-085","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":85,"target_content_sha256":"b3a93fe91484cef31c17ff8db545412588b4c3e04713b6d7945748810a8274db","target_edition_id":"edition.r017.id-id.draft","target_line_end":526,"target_line_start":522,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[522,526],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f02ecc0ff6eccdc8d85ed2be891f39c1b6744916c35473ad7fc31ff6ab847b96","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-086","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":86,"source_content_sha256":"13a853100ba3f8ef4948ad2d37cc79de04afdadbc2bb3cf4273ce5500dfea1e9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":527,"source_line_start":525,"source_local_id":"block-086","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":86,"target_content_sha256":"1280d53a1249691cd8cb6b261cc8c295b419f04f88c510dc383e1749b9dc8f73","target_edition_id":"edition.r017.id-id.draft","target_line_end":530,"target_line_start":528,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[528,530],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f74225b71b20e8886b9005d765fee6c454562025a0ff319a8bf2a2b197ccb5fd","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-087","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":87,"source_content_sha256":"c3febf52eb193a92f92a04f11fa86af6bfbd5d46ec0c1a8b1caa75cb511cab72","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":535,"source_line_start":529,"source_local_id":"block-087","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":87,"target_content_sha256":"8cb888e5f02341414d0f11748c461e8fdb2d5de51ce09c64faca1baf214620ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":538,"target_line_start":532,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[532,538],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"12f7d349f5df6ac74b83e8aacd52ded570b03f72235e88cd73c18d057b02425a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-088","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":88,"source_content_sha256":"4674c04987a75c6ec5edcb162da098cd39a072965a74bdce7b9a2fa3ceea2ea9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":540,"source_line_start":537,"source_local_id":"block-088","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":88,"target_content_sha256":"512c1478c613b7048a58ea6fbb420c57e5c1a588c9341272235cf44d27206df9","target_edition_id":"edition.r017.id-id.draft","target_line_end":543,"target_line_start":540,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[540,543],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37feddd47b1a0883c0f28073f53db15119f0686a794eb119282db46df2a686e7","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-089","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":89,"source_content_sha256":"b243ac1ced1a5c4a524949c6f433a5e708452a058b598fa30b01693226dba95a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":542,"source_line_start":542,"source_local_id":"block-089","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":89,"target_content_sha256":"56351a016415bf859d8b16f124a1786c6b566955f6056855845ce7d5040c3145","target_edition_id":"edition.r017.id-id.draft","target_line_end":545,"target_line_start":545,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[545,545],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d3515128cc0b1a5fb4fc9d7119f7e490a13741cbc7bb270036844a38a6e4387c","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-090","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":90,"source_content_sha256":"8a1dfcdcb90dc00a3ecf0c78f799103a2fafe294c39afae30315e6c3935f1574","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":544,"source_line_start":544,"source_local_id":"block-090","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":90,"target_content_sha256":"856e82b213d874d1466488582d43edf9107442c576b614f90dbf36d8b4165796","target_edition_id":"edition.r017.id-id.draft","target_line_end":547,"target_line_start":547,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[547,547],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"22ff74d5b3e7ec73b42ee5ca48f6839fe0a31175f0cf0ec7c8741c050a0804b8","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-091","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":91,"source_content_sha256":"cff7cdd549f8e66ae42f2ee92db01d0ba1b630aaef366e01121941522e4319ae","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":552,"source_line_start":546,"source_local_id":"block-091","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":91,"target_content_sha256":"103ba19f4be264072de3589ccbb279e8c14771d76b285fd5a0789a0d4ba5e299","target_edition_id":"edition.r017.id-id.draft","target_line_end":555,"target_line_start":549,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[549,555],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"07b4cdd6dda37749e69e6641794cd165cb8549bf47b0f9a01a5e00b8d73d774a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-092","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":92,"source_content_sha256":"0374a60dba2f2f2d9915e3a6587e45de153cb3672b0d7bcc87b53987f77ff7c0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":556,"source_line_start":554,"source_local_id":"block-092","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":92,"target_content_sha256":"0374a60dba2f2f2d9915e3a6587e45de153cb3672b0d7bcc87b53987f77ff7c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":559,"target_line_start":557,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[557,559],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5786268fca72cfef005f5c8e6b82fb5230bf5d94bdc155d1848aff304589fd9e","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-093","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":93,"source_content_sha256":"030c2ec123fe155b9e0caa5a5265b91cda9631ff6ff90a7b75d88989efc2b32c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":560,"source_line_start":558,"source_local_id":"block-093","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":93,"target_content_sha256":"dff853b262fbf63bf8c3607bda24b60e9f08b7cb994125f7855c7fabfc1567f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":563,"target_line_start":561,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[561,563],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"305d649ec4523fff62d930f5e56e3167d85216cd2d080ae4a3819c783a881724","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-094","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":94,"source_content_sha256":"82eb0bc2aaeb90519c5f5e87e04a0a24ecb09f8764e443e13f141121725c42f1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":564,"source_line_start":562,"source_local_id":"block-094","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":94,"target_content_sha256":"9b557350e40350ed4f5c05a8abd4865bfa3e53e440c2ab9d4f42030980c2f01c","target_edition_id":"edition.r017.id-id.draft","target_line_end":567,"target_line_start":565,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[565,567],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e56765e1b7007688de84c51b3241bdc60006391fb584769ca543e6092128e0a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-095","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":95,"source_content_sha256":"7ef83fce96cce6b54e4628a25779985a8e6cd1161b4d0ed30abcdf0a64f37ebd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":569,"source_line_start":566,"source_local_id":"block-095","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":95,"target_content_sha256":"fd5226a72b2c38171db981339c316bcbc860dd5fff6363337809fee59591d008","target_edition_id":"edition.r017.id-id.draft","target_line_end":572,"target_line_start":569,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[569,572],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5c0b63d9bc97aef00521a48909fb80f89dc2aa84ec85a29b3625607df62b376","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-096","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":96,"source_content_sha256":"fd3a4f07e7317457f49456dcf8b542461d019f8142eff4f0a6ba1645002da379","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":574,"source_line_start":571,"source_local_id":"block-096","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":96,"target_content_sha256":"188ff85378b35fdfa229b088024ec12f5ca76feb7220136f0babfe34aba8c7c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":577,"target_line_start":574,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[574,577],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"738207d371e6a632d83f5fd2fb395092c5149eb3084016959c67886402821c9f","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-097","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":97,"source_content_sha256":"2b2190fca5a202ec8132b6f649b8c605cae3223932125b5b72e35b19bd97921f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":579,"source_line_start":576,"source_local_id":"block-097","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":97,"target_content_sha256":"dc0c40f30dfb4f69e5106a71ae7319d462a15f093c1f8f58c268b26b25dbc4a3","target_edition_id":"edition.r017.id-id.draft","target_line_end":582,"target_line_start":579,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[579,582],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e959a40dc49e0f76b567543be1fbedd5df32b6a319b2b0a47839e723b9198809","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-098","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":98,"source_content_sha256":"ec452b979c7b09a425d1e7481c3ea6f060c204fba0b4c89866122fb66e27e02f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":583,"source_line_start":581,"source_local_id":"block-098","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":98,"target_content_sha256":"9f265582323a565b4f350576a34e07f73ea0e01fda71daa17e431e3fec25347d","target_edition_id":"edition.r017.id-id.draft","target_line_end":586,"target_line_start":584,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[584,586],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d74b827d35408273ecd8ea41aeddcf58b62b1a2a952cc8c2a4b340d5bdff087a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-099","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":99,"source_content_sha256":"068f3bc9d158effa397303ec5ca227e228934deadfe61b3d2027bd1c16f4f618","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":587,"source_line_start":585,"source_local_id":"block-099","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":99,"target_content_sha256":"692fd799bf32b2d25130aded99d6832da044a174553e551468ca57961c2095eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":590,"target_line_start":588,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[588,590],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"315c0dbe68ffa56bfaf074e1a4b1aa15a4177ab353850d344a677786d269e851","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-100","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":100,"source_content_sha256":"4aa6933c69902d3f825212f8a82ef5098f0069f19db1cfd5432787f0bfa3c6c1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":590,"source_line_start":589,"source_local_id":"block-100","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":100,"target_content_sha256":"962c35d9d35f8d0a56912f5c603f5ae9efd3cb8ed4fae1a3dd9155196553c5f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":593,"target_line_start":592,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[592,593],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1771fb401e5c9ad03cf71fc854795c1e61455dd51a1e19d83785ec17f2df5617","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-101","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":101,"source_content_sha256":"04ce30ab6b0e64ab2e2e0c7a75393d3dc5799c8bec3bdb2b88f13edf0105c2d7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":594,"source_line_start":592,"source_local_id":"block-101","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":101,"target_content_sha256":"893b3a1b60c7306353c4628d100adb7bb84da4898eb62e482fa4811206f63c68","target_edition_id":"edition.r017.id-id.draft","target_line_end":597,"target_line_start":595,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[595,597],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8ea49aa50cd6cef4f876e18ee294201cc2d7957b85428936d3f6b22a7d8dea60","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-102","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":102,"source_content_sha256":"950ddb68138917d916a9691290ca67239ad6cccb900586feaa90b5972191e66c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":600,"source_line_start":596,"source_local_id":"block-102","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":102,"target_content_sha256":"43f747d77ed1d1ca0721c8064c763686bf049a37dc33f1aac7f86238f8e8095a","target_edition_id":"edition.r017.id-id.draft","target_line_end":603,"target_line_start":599,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[599,603],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2472aff0605f7bc85f770bf4d85b995d3c860edea4d9680e6996c22f55f62647","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-103","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":103,"source_content_sha256":"455f4c5661f37de058395d1296d6a2b5d240c73ccc29ac138751820d289a5982","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":603,"source_line_start":602,"source_local_id":"block-103","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":103,"target_content_sha256":"455f4c5661f37de058395d1296d6a2b5d240c73ccc29ac138751820d289a5982","target_edition_id":"edition.r017.id-id.draft","target_line_end":606,"target_line_start":605,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[605,606],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6acb79312b96358cea4a083a279faf574b502c91926b2a2a11598c7850cef91b","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-104","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":104,"source_content_sha256":"7fcd7958156e29eb2d24963987554a8265e6fa308a531d4ed457c2848e1496f9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":605,"source_line_start":605,"source_local_id":"block-104","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":104,"target_content_sha256":"120c8306eec0fe8603545a3a1b0a30ece38f9b28f7b00d772d41b0d8316995e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":608,"target_line_start":608,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[608,608],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c01e8c9244aa4dd729a4d82691e8e2f92b4f5da0bcf6542da4d2956b94386ea8","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-105","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":105,"source_content_sha256":"b592056930f6e0e12dbb00c58a0dc0f17c170c9fbe9d7f267196dcc8c6915e7d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":607,"source_line_start":607,"source_local_id":"block-105","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":105,"target_content_sha256":"931bde10ae92ee634cbdce9c1517bd2f68837fde300d1bb725163feb623ab352","target_edition_id":"edition.r017.id-id.draft","target_line_end":610,"target_line_start":610,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[610,610],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d228fa5254f72d979adc3fcf5d43381c0f592ede26b781be2d836a0dc032314a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-106","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":106,"source_content_sha256":"e4e6de99f4f679525d00cecd08bcce9bd612a3993ad682e2ca397eac2f6d765e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":613,"source_line_start":609,"source_local_id":"block-106","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":106,"target_content_sha256":"6d29485730b2a4422925669a6304132871f6fb8fadad698566ee7e3975859842","target_edition_id":"edition.r017.id-id.draft","target_line_end":616,"target_line_start":612,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[612,616],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81f0de76850ec16d939641a68fee6754b0b093df22d896de88847d81dc8c3127","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-107","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":107,"source_content_sha256":"2fbc2802b4b2bd169d4ee7897cf5a8601990681e2ebb889f480db2da27c2ebb6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":622,"source_line_start":615,"source_local_id":"block-107","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":107,"target_content_sha256":"fae1a1b89e1e5f3d133a404403ed0d0abefbf0b2da58b561fb218e84ce94c5ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":625,"target_line_start":618,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[618,625],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"32efceef005b402dd00ef89bb4fd525534baf013653ddf7ddad4e238325395de","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-108","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":108,"source_content_sha256":"75d012a2ea766c6358ed4c7a62b6cb6cb1b583ac137286433ff571bd27504f2a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":626,"source_line_start":624,"source_local_id":"block-108","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":108,"target_content_sha256":"99cfda3892469cf29712f086995485507ec1e52c6404837ee5efc2e7e9944c8c","target_edition_id":"edition.r017.id-id.draft","target_line_end":629,"target_line_start":627,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[627,629],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ca3503bc411dda293880f86902dde3a45e292b50108e30d0c9f02b8639d5423","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-109","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":109,"source_content_sha256":"6f374bfaa24e8b9d7f3b3c4e64d102a5bb0e38df71ec03a0318dfe83a73f443d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":628,"source_line_start":628,"source_local_id":"block-109","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":109,"target_content_sha256":"09ea617d9fec85745a9816eacb9863a3e2f99cfbfafe4be910fa16adf8090f27","target_edition_id":"edition.r017.id-id.draft","target_line_end":631,"target_line_start":631,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[631,631],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b91b6ab0fb6c14f982b97bc4adae0fcd1f535f910dc1e4c3a53c786104995e6","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-110","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":110,"source_content_sha256":"4f32c62abe8b2182067ea06ee6cd47cab4fe6fdbd54d88745f9049d5b266198d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":642,"source_line_start":630,"source_local_id":"block-110","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":110,"target_content_sha256":"6cd584263754b9904b8a20258d5485d7869ebc5eac97d67ab88d642356958fbb","target_edition_id":"edition.r017.id-id.draft","target_line_end":645,"target_line_start":633,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[633,645],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a8c5886c81e69b8e20c16fb330f7a6d24ee3d7eb2e83be8f9035796f042b06b7","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-111","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":111,"source_content_sha256":"54f714c26ab6663168560e4ebdee0cf9ef7fd589c89a3b5d97cc408b7fc1b2c3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":649,"source_line_start":644,"source_local_id":"block-111","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":111,"target_content_sha256":"54f714c26ab6663168560e4ebdee0cf9ef7fd589c89a3b5d97cc408b7fc1b2c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":652,"target_line_start":647,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[647,652],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a215492ce154f2892972d137db6f83a2b7880038bf818c388bbd1babd869d873","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-112","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":112,"source_content_sha256":"684132be6f34f9dd97932946641134c1927e6b0e2848edbf80f74d32ab47125c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":652,"source_line_start":651,"source_local_id":"block-112","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":112,"target_content_sha256":"684132be6f34f9dd97932946641134c1927e6b0e2848edbf80f74d32ab47125c","target_edition_id":"edition.r017.id-id.draft","target_line_end":655,"target_line_start":654,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[654,655],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d452a8a959e9235567480fc844c8188a40e1f88e937e92a9a9d934200dd3fd60","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-113","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":113,"source_content_sha256":"f7ed60c12368a100dcd5c0e6dd77980f5d00b5b9a8c0eef9020ce2a3b1856ecc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":656,"source_line_start":654,"source_local_id":"block-113","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":113,"target_content_sha256":"3a76efe01ad0a47649050c9a192fde99b6c0a7b4cf767ef0a34d0dc78f962381","target_edition_id":"edition.r017.id-id.draft","target_line_end":659,"target_line_start":657,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[657,659],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc71730cad8f83ba8a2507bd620570683da1fcab11ed3dda0b087896f4d5e271","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-114","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":114,"source_content_sha256":"16401bd2348b9baba7ac9a1011f416d67c1523536be58cf3ff45f0f8b353ea15","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":661,"source_line_start":658,"source_local_id":"block-114","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":114,"target_content_sha256":"e6120518549d20d84dd55c3bac6f5617826c0560fd98a8349c0ce3dd84e0d788","target_edition_id":"edition.r017.id-id.draft","target_line_end":667,"target_line_start":661,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[661,667],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"768f0246a7e127c383b85d2b1b80791e2548773e87c89987d971ffe35dfbdda9","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-115","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":115,"source_content_sha256":"284d569e7578ffb310c8d99c6673bbcd41f8af0e339ab193b9fb29ae99dc8bd3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":668,"source_line_start":663,"source_local_id":"block-115","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":115,"target_content_sha256":"b055d71a34dc85fd66340bf3fffa16a9975311253149f02be080c05cc408115f","target_edition_id":"edition.r017.id-id.draft","target_line_end":674,"target_line_start":669,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[669,674],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b02e8ab258836e6957e1bbacbb419af0334fc334b9cec7a0138a1dad25955a2d","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-116","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":116,"source_content_sha256":"578c6b01f7893d0a64ee98fae7c6e6485cdcfc4980238d9d8efef4fb76eefe51","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":670,"source_line_start":670,"source_local_id":"block-116","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":116,"target_content_sha256":"578c6b01f7893d0a64ee98fae7c6e6485cdcfc4980238d9d8efef4fb76eefe51","target_edition_id":"edition.r017.id-id.draft","target_line_end":676,"target_line_start":676,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[676,676],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c58c5f7c6c44c8b8e8f095a9e04a91b01359458c23bb27e91b8897089d5a57b6","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-117","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":117,"source_content_sha256":"63a0a22b7ca676abd6beab5f64d40ea46617e8987d03ea20ce4e618ab29820ce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":680,"source_line_start":672,"source_local_id":"block-117","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":117,"target_content_sha256":"d6b3af7ffe6bdd097d3669cd08c14639b3cd18e0cb57b18e5c46a208d95f935e","target_edition_id":"edition.r017.id-id.draft","target_line_end":686,"target_line_start":678,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[678,686],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d0c86e9571897f5cf656d94e25f6bdc15e6c46a325ca1b74eeac78d28a78a7dd","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-118","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":118,"source_content_sha256":"9d9327e7fd17e300b791d0125fa8f195d174328b35a6471793c04f06b30ec332","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":683,"source_line_start":682,"source_local_id":"block-118","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":118,"target_content_sha256":"c2b620eb9e6034df263b6513c6b36fa0f05c35f00a9ec29e2824a529b8b13f45","target_edition_id":"edition.r017.id-id.draft","target_line_end":689,"target_line_start":688,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[688,689],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82747723495d07d6650edc37f4f103d4ae374f9d6fe022d9788e2498a354dc02","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-119","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":119,"source_content_sha256":"9bd8b2073d4ae5754e95d33e0945c7739524ad485544bb05cc19840372204142","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":685,"source_line_start":685,"source_local_id":"block-119","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":119,"target_content_sha256":"ebf449b36ff850f67f9d69c7681d9dc914a41deab1309360217f93156364cb80","target_edition_id":"edition.r017.id-id.draft","target_line_end":691,"target_line_start":691,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[691,691],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"86201a0ad5c989677dd0fcd8834da5624acb5729e8f9916b789d976aa4b9fd98","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-120","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":120,"source_content_sha256":"7eb828dcee725145c67d17c1fdf4b4460890dfa1c680f6da607004e9d139f558","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":700,"source_line_start":687,"source_local_id":"block-120","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":120,"target_content_sha256":"224bff3e7b90a7c9bfbae9bba57514dad9676e518b468a03a4edde6608c0f43a","target_edition_id":"edition.r017.id-id.draft","target_line_end":706,"target_line_start":693,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[693,706],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a3210c2bb0f2d279a79e727c2b5e09bdd6177b624809bfebbc32136d970c52b1","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-121","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":121,"source_content_sha256":"54f714c26ab6663168560e4ebdee0cf9ef7fd589c89a3b5d97cc408b7fc1b2c3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":707,"source_line_start":702,"source_local_id":"block-121","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":121,"target_content_sha256":"54f714c26ab6663168560e4ebdee0cf9ef7fd589c89a3b5d97cc408b7fc1b2c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":713,"target_line_start":708,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[708,713],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"333cff27616fb4778eeae68d11ca9396ee4f27bf20bb484ef3d2de04254cc5ec","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-122","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":122,"source_content_sha256":"684132be6f34f9dd97932946641134c1927e6b0e2848edbf80f74d32ab47125c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":710,"source_line_start":709,"source_local_id":"block-122","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":122,"target_content_sha256":"684132be6f34f9dd97932946641134c1927e6b0e2848edbf80f74d32ab47125c","target_edition_id":"edition.r017.id-id.draft","target_line_end":716,"target_line_start":715,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[715,716],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"78c22d6bd58b47468a3973f9ae6c640b32741f1bba88350b83800e6d4ebb0398","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-123","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":123,"source_content_sha256":"3e8535964f39c8e00de1916e01007e41a5c5a87e32c9dd12147bf91fac9d1615","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":713,"source_line_start":712,"source_local_id":"block-123","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":123,"target_content_sha256":"96b4e05ef0ebbc82c3c4a488e59aacdbc3f0d6ecee2c17b77e21c1f1916c9c98","target_edition_id":"edition.r017.id-id.draft","target_line_end":719,"target_line_start":718,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[718,719],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92969a30d567acb9051884e64cff1b6a8e27211210bd85719d505d2c308ab6c0","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-124","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":124,"source_content_sha256":"fa5f2144da68ff0552965352bec2276d8130ed7ad7c66844955f495eabe034dd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":718,"source_line_start":715,"source_local_id":"block-124","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":124,"target_content_sha256":"a12049f315a7ee228acb93f6fd53d9169309fa3d1f311df864cc7adff795b0de","target_edition_id":"edition.r017.id-id.draft","target_line_end":727,"target_line_start":721,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[721,727],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd92ee8a34f6a73628a4e495f1ff7f593d9fb336478f334b3c9156b07d52ac1f","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-125","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":125,"source_content_sha256":"891989d9df3fea04047e93091d7eedba7aa2ecc6e72412be2e1c2359610c9e49","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":724,"source_line_start":720,"source_local_id":"block-125","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":125,"target_content_sha256":"bfdc2c65e4d34d488a6569d26d815e3a86a76c14fe77cf1cd43649e4d50cf5f7","target_edition_id":"edition.r017.id-id.draft","target_line_end":733,"target_line_start":729,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[729,733],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7aa63dc6b4ad28b86f8ccdd333c49379830504fa3f754569f4eb40cecf1fc105","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-126","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":126,"source_content_sha256":"37526388c0c23650cf6a93bc31fdea969920670a99e256e0ab31d64ba9eb76f6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":726,"source_line_start":726,"source_local_id":"block-126","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":126,"target_content_sha256":"37526388c0c23650cf6a93bc31fdea969920670a99e256e0ab31d64ba9eb76f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":735,"target_line_start":735,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[735,735],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6f18bc6b62b8574f658070c24cf7afc165df8742a1d43ca73dc14ec357276878","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-127","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":127,"source_content_sha256":"77779da8c02584de09b42092fd093e81266a9cfd070413983e1076452caa6e32","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":736,"source_line_start":728,"source_local_id":"block-127","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":127,"target_content_sha256":"92d13de2bf9b20ce0534d2a0e649e22bf2bafa597980aa89cc34dfeed2da1d69","target_edition_id":"edition.r017.id-id.draft","target_line_end":745,"target_line_start":737,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[737,745],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"79aea9f3f9fb99e20b4dd9a3acc8fef1b20436905eb3521c19504766fb16a915","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-128","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":128,"source_content_sha256":"dae9ca8728fe0e284a5d6bf4b583d4a5a72d5d06a33ba0e9b98acf806d8f2298","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":740,"source_line_start":738,"source_local_id":"block-128","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":128,"target_content_sha256":"010831379d9834507e24108068aca7e627e384a5e4d792a5bfa36039cc25f823","target_edition_id":"edition.r017.id-id.draft","target_line_end":749,"target_line_start":747,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[747,749],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c548cf64f2b3a145fca3fa65a2ab0c139f06656a26d861d0189b8a6cedf657ce","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-129","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":129,"source_content_sha256":"e2fb2416825047be5a487ef6e2f3046526d4c0cd4c9131dae1e2360908b615fb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":742,"source_line_start":742,"source_local_id":"block-129","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":129,"target_content_sha256":"54803037931a0c58b217a1a582d113f0dd51e47355af6d82309a0ec46b9f95af","target_edition_id":"edition.r017.id-id.draft","target_line_end":751,"target_line_start":751,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[751,751],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"066a9b72f26ae38cf5101d70c29d4d9bd241d4ec54bfe761d1701550f376c6ee","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-130","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":130,"source_content_sha256":"419bd321d9a4856a955c6bc73ec1bda1c66a10cd8082b8e71da2369c0d9c15ca","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":761,"source_line_start":744,"source_local_id":"block-130","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":130,"target_content_sha256":"54596e441375d237ab7d645fecc79a62ffe9612b7e496356f79d3200e325d70a","target_edition_id":"edition.r017.id-id.draft","target_line_end":770,"target_line_start":753,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[753,770],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ff0a7f72dd275a476dc7b6fd8b2f3031873ba1943b7481bee8e61e4793a5a37","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-131","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":131,"source_content_sha256":"94f4686f566188d767448955bddafefa7e745781d7afdfafcfed07fd7232deeb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":763,"source_line_start":763,"source_local_id":"block-131","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":131,"target_content_sha256":"94f4686f566188d767448955bddafefa7e745781d7afdfafcfed07fd7232deeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":772,"target_line_start":772,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[772,772],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ca0dc98c9b798cdb8bef9eaefe3df8a612091bd692eba27e3df50cfa6acbb137","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-132","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":132,"source_content_sha256":"e7c6cc31b647bd9c10fa5b828fba96463bbd8b931d6d8f5141b08dac40e24e18","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":766,"source_line_start":765,"source_local_id":"block-132","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":132,"target_content_sha256":"04f7875b602b8c91da7fc790d530d582f96e96b3bd6bed592da6eba4a7a23e65","target_edition_id":"edition.r017.id-id.draft","target_line_end":774,"target_line_start":774,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[774,774],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"db3d13b02522f096a9ab4ad38c3f436811051072e94517bd680ee07e9d82e3c4","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-133","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":133,"source_content_sha256":"a6c18cd910118035e9ea010f2ee79c798b3efbc009700c989db4ce6c1d1e71cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":768,"source_line_start":768,"source_local_id":"block-133","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":133,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":776,"target_line_start":776,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[776,776],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70adab3cb29739fe71b37a5fc7d236db027f0cd2b1f7855c71068e249010f292","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-134","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":134,"source_content_sha256":"4830a9c65e2737bb801cbf7f7cf642fa834963c59e20c2154cd846a1a135b637","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":786,"source_line_start":770,"source_local_id":"block-134","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":134,"target_content_sha256":"438ee03a973b6196ee134b8c35e8f712ba5d13ce0b4c17e557332b712b455336","target_edition_id":"edition.r017.id-id.draft","target_line_end":794,"target_line_start":778,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[778,794],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"46150265867ed4df134bebceca0230863667786c9c71da2d0920d17a00308209","concept_ids":["concept.feasible-region","concept.graphical-lp-method"],"id":"segment.r017.book1.ch05.text.block-135","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":["concept.constraint","concept.feasible-region","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":135,"source_content_sha256":"b319cec4ac9dbcaa96a9716c0f0aeb7c0c75f7f23e4c51b67aea6c6a71434073","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":795,"source_line_start":788,"source_local_id":"block-135","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":135,"target_content_sha256":"00206b079975c41cfa6ed724aa330aa8e15f6ee181c6010b470830d2cbe18a2f","target_edition_id":"edition.r017.id-id.draft","target_line_end":803,"target_line_start":796,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[796,803],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e03cfed2bc6140ee1a523478ddde50e2fc3166c01c52f509ed6879760612e5e","concept_ids":["concept.extreme-point-optimality","concept.graphical-lp-method"],"id":"segment.r017.book1.ch05.text.block-136","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":["concept.feasible-region","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":136,"source_content_sha256":"a15cf5442c2f8ac6a786bb8ce87e1311c71f36d8eb3aff6fafcf8f1c5bd412b6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":807,"source_line_start":797,"source_local_id":"block-136","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":136,"target_content_sha256":"660997781b9f98ee9660b0b907cdeb9b74dab6658b71bf0b24694d42ccaaa010","target_edition_id":"edition.r017.id-id.draft","target_line_end":815,"target_line_start":805,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[805,815],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"44a5235c0a4968534aff4f4fa9cc891a044261f1495763e5d3e0cef5129b78a7","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-137","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":137,"source_content_sha256":"7ba34feeb79e79111f859156f3df6af4d9bdda7ee3fc31ab8afd465a9fa58900","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":812,"source_line_start":809,"source_local_id":"block-137","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":137,"target_content_sha256":"c185913061dc4f03b8d589d8fda72023d1b5c641a5230e987c3f2f59fda42744","target_edition_id":"edition.r017.id-id.draft","target_line_end":820,"target_line_start":817,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[817,820],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"556dad19d68effb0abe77d5be8bebaee1899665ca583d920e41e6840f7d0f0ed","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-138","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":138,"source_content_sha256":"befe6892ec44e33f7b364305fbcec8fa778e09b9cb39adc300c1dd14bcf212c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":814,"source_line_start":814,"source_local_id":"block-138","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":138,"target_content_sha256":"9ad07c5b9d960bc48e3b3bb32cc99e77e076528647c60e56ab65e6278a0fcf70","target_edition_id":"edition.r017.id-id.draft","target_line_end":823,"target_line_start":822,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[822,823],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b7312677b54e2bbf7a56b80dca885092e6690ca2fc20a597b248aa56b93c455a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-139","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":139,"source_content_sha256":"30c8e154f5395404f2b28d7ed060f78f8c68f98679b2be23e14b5f060a5ef3bf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":825,"source_line_start":816,"source_local_id":"block-139","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":139,"target_content_sha256":"8d1b80242e2512a4fc8df9c79b0ae335d10ca4606728d8a5854df016be066fcc","target_edition_id":"edition.r017.id-id.draft","target_line_end":834,"target_line_start":825,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[825,834],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8ef20327e64c3ca17a8d1e01bd9425ff0f2af803dba8641debd797023efbc0c1","concept_ids":["concept.infeasible-linear-program"],"id":"segment.r017.book1.ch05.text.block-140","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":["concept.feasible-region","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":140,"source_content_sha256":"41ce7f56e6f0b746518238a9db7c0b49aabdaced212b72ac994ecb20e5a8c7c8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":838,"source_line_start":827,"source_local_id":"block-140","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":140,"target_content_sha256":"c4ccbaa4760906c5cbc49e33fb5753ff7b7fc400df9254aeb5f24a96e195ddf3","target_edition_id":"edition.r017.id-id.draft","target_line_end":847,"target_line_start":836,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[836,847],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3cc7e07f7f98b899ba0a4b686d94d1f5ca90dd1b60d46edea15772b02be2b756","concept_ids":["concept.extreme-point-optimality","concept.graphical-lp-method"],"id":"segment.r017.book1.ch05.text.block-141","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":["concept.feasible-region","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":141,"source_content_sha256":"77cd88526fa3ddadb71d023e8426ce642fac9ca5042c8d1bb60fc65012b8d3b6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":850,"source_line_start":840,"source_local_id":"block-141","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":141,"target_content_sha256":"6f24eccf1f221c57fbbfde58c3bd52eda366d306b104b3854b47e3ffb58a329a","target_edition_id":"edition.r017.id-id.draft","target_line_end":859,"target_line_start":849,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[849,859],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"49a2f65182b699615de532902c4629681c292e49dcada27653e3d42705f934c7","concept_ids":["concept.recession-direction","concept.unbounded-linear-program"],"id":"segment.r017.book1.ch05.text.block-142","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":["concept.feasible-region","concept.linear-programming","concept.objective-function","concept.unbounded-linear-program"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":142,"source_content_sha256":"c86858fad6a28a464c18cea3f479106f4d76344b173a0f9eb2aded923f7b868b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":863,"source_line_start":852,"source_local_id":"block-142","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":142,"target_content_sha256":"aea36425e46a6669817f38dfa20c01d9ed165a561008346c032785113bb3a254","target_edition_id":"edition.r017.id-id.draft","target_line_end":872,"target_line_start":861,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[861,872],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f4571bcd0c553f512aa05a133770ca6e6eff1c3937c524150b888519dfc0804c","concept_ids":["concept.recession-direction","concept.unbounded-linear-program"],"id":"segment.r017.book1.ch05.text.block-143","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":["concept.feasible-region","concept.linear-programming","concept.objective-function","concept.unbounded-linear-program"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":143,"source_content_sha256":"10287c26df15dd728b1d80922a8006d871475a72bb19650d91b31b6790b4853b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":868,"source_line_start":865,"source_local_id":"block-143","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":143,"target_content_sha256":"977b9a0a2f48642b9daaf932d053eb8320b9104337c49a71b3e5f36611fc781e","target_edition_id":"edition.r017.id-id.draft","target_line_end":877,"target_line_start":874,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[874,877],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e36dbd80b0f0f2922da0e6f39b1ab1a986dca7e9af4ecbe9677f38a6f1b4d8ec","concept_ids":["concept.diet-problem","concept.linear-programming"],"id":"segment.r017.book1.ch05.text.block-144","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.linear-programming","concept.objective-function"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":144,"source_content_sha256":"4e57c362d820aff6da9277a8fc64381df56a75d29a0a549c72922d38daca7506","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":875,"source_line_start":870,"source_local_id":"block-144","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":144,"target_content_sha256":"a8792c081a32a8e4bf10282164e87bb41aeb8932d1e350774451f10fece4246a","target_edition_id":"edition.r017.id-id.draft","target_line_end":883,"target_line_start":879,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[879,883],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d71cb9fe7a77d2d5262b227c49a4fa6d26f13f97feab5343711d239200ba2fe","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-145","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":145,"source_content_sha256":"629ccf41a8e4d9ef712c56b266f496e68ff2033885bec71b578a5aca0d6d5655","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":888,"source_line_start":877,"source_local_id":"block-145","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":145,"target_content_sha256":"e9c94bdae0aa4263338da2df5d7b8cae88841d5839363b1c7b1a843d4ae2b2b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":896,"target_line_start":885,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[885,896],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"29d2c1d223d426299fde865c398cc308283aae5cc42e294aa07983e53a43dffc","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-146","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":146,"source_content_sha256":"7b48fdea0752c17bd96f37028cc50ad4b905886eb87b2304d1170789d7f08abb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":895,"source_line_start":890,"source_local_id":"block-146","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":146,"target_content_sha256":"bcba16e454a300e6dee2edc6b3788522c1c89266549988aa8428e7a75042e839","target_edition_id":"edition.r017.id-id.draft","target_line_end":903,"target_line_start":898,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[898,903],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"15e3750c224d6b8ef3d5f0bfa4759be8c5867f1d0285360d4b2dafb0ca6a91a9","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-147","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":147,"source_content_sha256":"c8e278add1d6c18f659152466edf4e82568ebad5aaddedeaeb2d654335866d4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":897,"source_line_start":897,"source_local_id":"block-147","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":147,"target_content_sha256":"5a7c51fe019c052d866e25f75541baf5ff511cb9d0d48737b288dcbb3fd56de0","target_edition_id":"edition.r017.id-id.draft","target_line_end":905,"target_line_start":905,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[905,905],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"13bbe35ce5e27921d4c4bc96b01fd87ec90b6ad81ddc098884712e692af620c8","concept_ids":["concept.extreme-point-optimality"],"id":"segment.r017.book1.ch05.text.block-148","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":["concept.feasible-region","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":148,"source_content_sha256":"51056fb7779cc754441b734b3004241093f1b7b7cfae6b99c81eda4d6929f413","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":906,"source_line_start":899,"source_local_id":"block-148","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":148,"target_content_sha256":"273e5cac058acb8ded4869f5633b6e1eed1ef1bcbaf7e3a5c1abe470c65c6393","target_edition_id":"edition.r017.id-id.draft","target_line_end":914,"target_line_start":907,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[907,914],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5796b8fbf74a130c55efbd1e6390083f4b8e054748ebf209c16ef55c05bfa801","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-149","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":149,"source_content_sha256":"6abbfc3462bdbe5ee3d3a2fb41a1f6083bd3d7b473e7f764e2639bfad465ebe3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":911,"source_line_start":908,"source_local_id":"block-149","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":149,"target_content_sha256":"2bbca037238a987a5133920357c96c24897f49d800fa7be64672d8d8dab6da8d","target_edition_id":"edition.r017.id-id.draft","target_line_end":919,"target_line_start":916,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[916,919],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d8501cb2541acba372d773c7b8f360d833354fe929ac762d101d068537b1b761","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-150","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":150,"source_content_sha256":"53bfed1d5d2796329833e877695e61ff01a6a8c9a32aa0e22861432b804f6db8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":916,"source_line_start":913,"source_local_id":"block-150","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":150,"target_content_sha256":"1e3d109901dfb72893fa2c77950982af2fca4fb3c44eb4b6a3e63f52cf3eced0","target_edition_id":"edition.r017.id-id.draft","target_line_end":924,"target_line_start":921,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[921,924],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"45ece839ea921b460663a8202f32cca7be5db56713b3403f94ac24d48360ede9","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-151","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":151,"source_content_sha256":"410f2fdcd3562dcde5ec51734dcf315dd8242ec00b097a772f0f4169a7e095bf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":919,"source_line_start":918,"source_local_id":"block-151","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":151,"target_content_sha256":"219024e035db2d61e8313270fe0ea4f600f85b8524182fc809b5b0c465cf3106","target_edition_id":"edition.r017.id-id.draft","target_line_end":927,"target_line_start":926,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[926,927],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de63cd7914be167bca4afa572578828cbddf9c1c28d7eea0dbddbc7e412cdc31","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-152","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":152,"source_content_sha256":"a729df428d35a63706662388a1239a974bad2211106755ca91db0e8af403aa4b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":923,"source_line_start":921,"source_local_id":"block-152","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":152,"target_content_sha256":"afcd250dded18ee10d91a46469a49054ac8ef84b0271aefc990ceb6a23e8583a","target_edition_id":"edition.r017.id-id.draft","target_line_end":931,"target_line_start":929,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[929,931],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3b2db70c3ad34e40662ef46256e1111fdf372e5020e77513f4ccec98f8ffa6d7","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-153","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":153,"source_content_sha256":"4be7db13a50a6cf69022429255b203425a63979cca3cb7d03e8476641e361703","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":925,"source_line_start":925,"source_local_id":"block-153","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":153,"target_content_sha256":"72e4da672c3eb55ee78e155fb6ef35c3c790797487172b8922dd2eb08097b278","target_edition_id":"edition.r017.id-id.draft","target_line_end":934,"target_line_start":933,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[933,934],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fcace05290b8f2d4ab4e3010cf29ce5bbd1462131045225dd5833a842317d045","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-154","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":154,"source_content_sha256":"08428d99795367cdc4c98e86b481cdfc5311450939d7256b349edf7394f81b42","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":937,"source_line_start":927,"source_local_id":"block-154","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":154,"target_content_sha256":"c9392e07f35cb33226bd7c56890d8e27283405019161e49bd791cf2a2729e58b","target_edition_id":"edition.r017.id-id.draft","target_line_end":946,"target_line_start":936,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[936,946],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2875c40a713fd21ffc481f13418fef9a5225e576b2b21fedff1c5e7dde9c4c9c","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-155","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":155,"source_content_sha256":"800a0643af4b4cda0af53b3c17a2afb3aa4da0975e24b5e3b636e0db6895153f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":944,"source_line_start":939,"source_local_id":"block-155","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":155,"target_content_sha256":"98487d046d6430afc7ddad0a3c4ef5bd69c4d8e1977881ea408d5c163dc60c16","target_edition_id":"edition.r017.id-id.draft","target_line_end":953,"target_line_start":948,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[948,953],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e70f0256dffb5826617eb73ec75622fd766d367aac1b1b7850fd35586fce2359","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-156","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":156,"source_content_sha256":"226e9ceb6512386965455c22640dd961638e28d11002fea5d33ca9dfdf3433f4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":952,"source_line_start":946,"source_local_id":"block-156","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":156,"target_content_sha256":"3df35392d35788ceda0e435897bc42dde7ad12eafd2fab29e32184981e4c7354","target_edition_id":"edition.r017.id-id.draft","target_line_end":961,"target_line_start":955,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[955,961],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"508de3a12990b747a646ded8e52065c8e3978d01570f050e9431e1f1d29a098b","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-157","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":157,"source_content_sha256":"35c5d70aa039a3731359fd50b24be7ec80773157a176d0aee78f3c8cc17d5cee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":955,"source_line_start":954,"source_local_id":"block-157","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":157,"target_content_sha256":"a2ebfc453acfe53a688425eb9b8a8cac08dc0e0d4d944fd0f1801ade5fc85a5c","target_edition_id":"edition.r017.id-id.draft","target_line_end":964,"target_line_start":963,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[963,964],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eedca4b4ce9a0c011b28ac0ed119421e590689bcda634448b19c2852ea8b3d96","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-158","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":158,"source_content_sha256":"6d85a494fd5e672b3d3283eb4827b6e70ece5187f72f8544166710ad54afe293","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":966,"source_line_start":957,"source_local_id":"block-158","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":158,"target_content_sha256":"59b5513f2b7526e44a770c26519334de02d218fcfd69ad5a6a7107bddf6f9867","target_edition_id":"edition.r017.id-id.draft","target_line_end":975,"target_line_start":966,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[966,975],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"609ff4f85cc59fbcafdee6e0f400ad1f126231abfebd5cdd1354b9f885ff9a5d","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-159","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":159,"source_content_sha256":"7cb58e5ee5a66a81f3cf7ae34d8179abdf3dae10f22e04c8d468ef38d0397ee6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":968,"source_line_start":968,"source_local_id":"block-159","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":159,"target_content_sha256":"7cb58e5ee5a66a81f3cf7ae34d8179abdf3dae10f22e04c8d468ef38d0397ee6","target_edition_id":"edition.r017.id-id.draft","target_line_end":977,"target_line_start":977,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[977,977],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6bd816243df70dd2553e43ba5b22e9303b8ed00cc275473b69b45cc9d3a2ead8","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-160","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":160,"source_content_sha256":"b4540369f2b940a224ad9deca0143f91dc7a317061d9aaf1fa92029c0450c45c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":970,"source_line_start":970,"source_local_id":"block-160","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":160,"target_content_sha256":"120f4dfc10a14b0d00fb9c1dad930cc09dd1ca2546392f0180d6c8f33f38ee1c","target_edition_id":"edition.r017.id-id.draft","target_line_end":979,"target_line_start":979,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[979,979],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c1c73c5afbd4b497c61ee4f49223fe167c37c67c1e7efdd85f7f5e8056e9c071","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-161","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":161,"source_content_sha256":"91e927745bd5fd4cd7251d7a7e35d9abf53d858ea87c832e7d812202004c2f09","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":976,"source_line_start":972,"source_local_id":"block-161","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":161,"target_content_sha256":"f00217cf2080895957469acd68437011913ebd06c3c4fdbdbd5e3cc7594fa9f5","target_edition_id":"edition.r017.id-id.draft","target_line_end":985,"target_line_start":981,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[981,985],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb3b9996871cdf225731f6395cbf21fba23e3055dd63ef558e4b35a08c5368fb","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-162","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":162,"source_content_sha256":"1b291707ce047bc1c5843b235711f2c97f86c729daa7ebaa2a751f3d6f858285","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":982,"source_line_start":978,"source_local_id":"block-162","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":162,"target_content_sha256":"cf63f837da70643b1c825f989ef2cd88629893377a19cccb0a06d040028c6b7c","target_edition_id":"edition.r017.id-id.draft","target_line_end":991,"target_line_start":987,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[987,991],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eff80476fc725475e8f360b394e3ecac820757910d98b9ef7c833fd86bd0dd55","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-163","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":163,"source_content_sha256":"e2abe58d4b747ddc663aa0e307cda73be9a3fce5e945fc35d426fa24ae59837b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":986,"source_line_start":984,"source_local_id":"block-163","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":163,"target_content_sha256":"e2abe58d4b747ddc663aa0e307cda73be9a3fce5e945fc35d426fa24ae59837b","target_edition_id":"edition.r017.id-id.draft","target_line_end":995,"target_line_start":993,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[993,995],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"540efd0f578cc180ef4debdcf78bb660a6831d57eda34a031186cbde4c4ac732","concept_ids":["concept.alternate-optima","concept.extreme-point-optimality"],"id":"segment.r017.book1.ch05.text.block-164","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":["concept.extreme-point-optimality","concept.feasible-region","concept.level-curve","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":164,"source_content_sha256":"a90ecae6f154f58c35bf572f65ea360f84a110868f00270f62108f97a142c4e6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":995,"source_line_start":988,"source_local_id":"block-164","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":164,"target_content_sha256":"4bf710a166dd187a0715be49d197075c0ce3a852889648e3cca7d0879dceaaf2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1004,"target_line_start":997,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[997,1004],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2cf9e14e7d18c38d438bc1a92a66f86be899bad232cc47947d2b669c33495c7f","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-165","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":165,"source_content_sha256":"2d84fc86067c7a9d796f7f6440a99e41e53812797c80b1e12cee78c9f2d1f8cc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1003,"source_line_start":997,"source_local_id":"block-165","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":165,"target_content_sha256":"44716fb6e53cfe4398779768662fde1fef465590c9834f9a4128d9738555b50a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1012,"target_line_start":1006,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1006,1012],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76b9934c69087d51b9f5a38180099083f13ec7b0fb7f040567c1767c894660c4","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-166","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":166,"source_content_sha256":"60bb9f26abad33976f5069574a43d9c815e8d22668d2565596a25c0812911163","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1052,"source_line_start":1005,"source_local_id":"block-166","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":166,"target_content_sha256":"7fcc70a50648f639ad217ee0b7523eb7398b9ff6781a12cb06daf9d5f13aab6d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1061,"target_line_start":1014,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1014,1061],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"652ad548adfcda72acd89fc4ec5c15d2b63d7a7663eb384bdeb2714c1de6f50d","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-167","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":167,"source_content_sha256":"415bce54b4b08128b091801de8e6d85156340e2c9ce4012607c5a7196a588312","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1058,"source_line_start":1056,"source_local_id":"block-167","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":167,"target_content_sha256":"7d6a9a4e5a0d226c665e8230057936b667cce57a8a43636d33784869ce432c39","target_edition_id":"edition.r017.id-id.draft","target_line_end":1067,"target_line_start":1065,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1065,1067],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae88cd03b35b58a2282d3401744ca86191b2e18c6359d5fce0dbeed59a2f60d7","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-168","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":168,"source_content_sha256":"da744febf4624ee74aa92275a5df7472a8f721cf16afe86e0191d6761f07b618","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1062,"source_line_start":1060,"source_local_id":"block-168","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":168,"target_content_sha256":"18c8de9185ae69b1de48d7d05be890f05267e90513b84795639336912786a33d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1071,"target_line_start":1069,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1069,1071],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9a1269e8636e9ae370b0f7402a40c8b8cdd2fa9f3ff0468da52cce57ff88921","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-169","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":169,"source_content_sha256":"70a7443cce8b7610f7601c2a81638b824ae2d68743a1f823ee9a00ad43b715e0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1066,"source_line_start":1064,"source_local_id":"block-169","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":169,"target_content_sha256":"598ee9772cceea7a7cbaf7c562cec9c77f3ab0fbb94bb00a5df1d18498ae9ecc","target_edition_id":"edition.r017.id-id.draft","target_line_end":1075,"target_line_start":1073,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1073,1075],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8941b94ca81f2ace3f0b13929e901d3718e913c0a1b353eded5246cd61d5c469","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-170","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":170,"source_content_sha256":"bab2136590e2671098b66dabc4bdfb3be5577bfa56fa6219fea331ba5e2980fe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1068,"source_line_start":1068,"source_local_id":"block-170","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":170,"target_content_sha256":"95f344954547de15d70a92acf28f662d3a7cd543b4a45751a91c699492e72e22","target_edition_id":"edition.r017.id-id.draft","target_line_end":1077,"target_line_start":1077,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1077,1077],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"97093cdf760c2300597bcb5566fd74a0cdeaab18d37ea86dc8e5e88e80040d88","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-171","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":171,"source_content_sha256":"063274bc061e2662000d63b3c913ab1c3f8033ec5d7261c5517ea0053334cff5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1072,"source_line_start":1070,"source_local_id":"block-171","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":171,"target_content_sha256":"549e00c4e09d19407a5b32b39a729710b125b3e06beca87ae5bcdebf3431a8e5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1081,"target_line_start":1079,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1079,1081],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f59eafe98aa1e659b6d32a43a2c2f47a7924a71c87c465952dbb797ebaeb4f5a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-172","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":172,"source_content_sha256":"7998cda79466817003664dee41e4648f3f00123299ce6777f38a44825991b5b6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1074,"source_line_start":1074,"source_local_id":"block-172","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":172,"target_content_sha256":"7998cda79466817003664dee41e4648f3f00123299ce6777f38a44825991b5b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1083,"target_line_start":1083,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1083,1083],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"97e14c4a0a48551ed3a3c7ba12f0334a5af5667e150483b3580b4f4b82cfb82f","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-173","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":173,"source_content_sha256":"ff2a42497ce522862e600d111166d61b4cd3709d6cd6bf62110913e91aadec2f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1079,"source_line_start":1076,"source_local_id":"block-173","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":173,"target_content_sha256":"85ea9226badc1ff83ab5258964a55a3881393f91a85bc0f382053eb38f063c89","target_edition_id":"edition.r017.id-id.draft","target_line_end":1088,"target_line_start":1085,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1085,1088],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f8bec6271b2dfa9812ee889e8a2216f3c69f8bfc9340917fc41018c3db55e577","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-174","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":174,"source_content_sha256":"cc3bb89f88a99a87bc2ee41a379a117a192beb1a79689dd4ba36c24c96ff2848","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1084,"source_line_start":1081,"source_local_id":"block-174","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":174,"target_content_sha256":"cc3bb89f88a99a87bc2ee41a379a117a192beb1a79689dd4ba36c24c96ff2848","target_edition_id":"edition.r017.id-id.draft","target_line_end":1093,"target_line_start":1090,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1090,1093],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80ee12c0093be0e01f1a533b7cb5e285c4d2c98af61660b3dcd119c98685225b","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-175","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":175,"source_content_sha256":"4e63e153947218eb269bc6f07ca89d587d554380527aadd306785ab2e21aaccd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1086,"source_line_start":1086,"source_local_id":"block-175","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":175,"target_content_sha256":"ee702214670f60fee65188e772090c80416fdf4621b29c1a99e65b0a1c2b1b7f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1095,"target_line_start":1095,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1095,1095],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd419fe6f55ee04d7e6a3fc5ab09034807410eb9b5fd303345c5459429b754bb","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-176","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":176,"source_content_sha256":"7698b697e99a32102b160491a2519a91753036f0e626066f6de1578747f71600","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1091,"source_line_start":1088,"source_local_id":"block-176","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":176,"target_content_sha256":"7698b697e99a32102b160491a2519a91753036f0e626066f6de1578747f71600","target_edition_id":"edition.r017.id-id.draft","target_line_end":1100,"target_line_start":1097,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1097,1100],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ff25ec262bf03b0272ffd3b93f8f5df60fe6347e94585ef8cb373fa488508736","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-177","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":177,"source_content_sha256":"1b778dd24d9623917746036aea48d2cd632bb4f29ffb4ca1d4cce0789c3501f3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1095,"source_line_start":1093,"source_local_id":"block-177","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":177,"target_content_sha256":"2ea2e694b3a1e817a9a8ac4ba458261f02e38a726e36ca66a66b2a8a0e270802","target_edition_id":"edition.r017.id-id.draft","target_line_end":1104,"target_line_start":1102,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1102,1104],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ca16917e04c6739141c2334a4f6d3db5f1c7ccfb209756dc11c80462fcfc527","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-178","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":178,"source_content_sha256":"5848a8b96ab57feae89240e2d7d21fde0938317c777ecc20646d172a7790ff7b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1101,"source_line_start":1097,"source_local_id":"block-178","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":178,"target_content_sha256":"37b83696b2998dc9b826dbe246ecb74440e52dc77c969d2b6c6f331451390485","target_edition_id":"edition.r017.id-id.draft","target_line_end":1110,"target_line_start":1106,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1106,1110],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9cf3f995fffe14338e3222deaeecaee771f0c28fffb2f531528ba005612633e7","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-179","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":179,"source_content_sha256":"03b8c4aa4e53e451378b9dd064df39ba4b1dbdd02105955ba57b3059ea0d08ba","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1110,"source_line_start":1103,"source_local_id":"block-179","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":179,"target_content_sha256":"a4a3a78c33e931bcb95d7c6fc30bf9d223f0a4c90605719b1ecedbbe25481c7c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1119,"target_line_start":1112,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1112,1119],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"69af5cbf9f17900fcf08ed9b56d39f0ed88f034a82f0a6015fddb86b08a1e4d1","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-180","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":180,"source_content_sha256":"f8ebceb653c9c4250e2e31780ae1436b4a99a736f725be10da54ad56c81c6d37","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1117,"source_line_start":1112,"source_local_id":"block-180","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":180,"target_content_sha256":"428aeac9e9d9fcb8cfa2e8f0fb7c9439b95ed45e1e4357ca418775eac16720b0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1126,"target_line_start":1121,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1121,1126],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b3ecfbdc88abb158355b4354199371cc25c0ecfa338f06d60921625fc39b748f","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-181","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":181,"source_content_sha256":"1a285f9edf9a1d74af19c9ef8c65c6c5d75fa080951783f25ead9337698ff7fd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1121,"source_line_start":1119,"source_local_id":"block-181","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":181,"target_content_sha256":"c39ee32819efcf3ed109acf95befeb20569e27dd06e5f69470dda149b196de27","target_edition_id":"edition.r017.id-id.draft","target_line_end":1130,"target_line_start":1128,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1128,1130],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"85eaedbda15cfefbd5ba665a5cbb759918393d4b1f5ce09337e0ee2689394bc5","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-182","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":182,"source_content_sha256":"0bfeac28741a36c4ed2632b2d36e76f0fbf48c4626909057f3ae5dbafb85b46c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1130,"source_line_start":1123,"source_local_id":"block-182","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":182,"target_content_sha256":"e55e0673c63ca95ccad31a20241cd58deadd3b1434a829b082c59c27448e31ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":1138,"target_line_start":1132,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1132,1138],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2374559af08b7c115502bbbda591e59e4e0ff6001011ff04cdb79ca788c8e29","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-183","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":183,"source_content_sha256":"d2b3e1326c58a52f99d47462a9d286e0f046ef45b464f81f886e4d4a3a8f2c6b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1143,"source_line_start":1132,"source_local_id":"block-183","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":183,"target_content_sha256":"de9687690c0ca78a60ff5164624214f13154274abaef5f3d1d076f35c8890566","target_edition_id":"edition.r017.id-id.draft","target_line_end":1151,"target_line_start":1140,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1140,1151],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bee3ab895fcd991a01a54c017c15c7c7fcc0412e1c1829a6b1e54f9ec567e569","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-184","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":184,"source_content_sha256":"902eff0b54bbc1be43966aec82679914fd1a885043ac520a209a25df3888cfbd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1157,"source_line_start":1145,"source_local_id":"block-184","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":184,"target_content_sha256":"ba907aaf7950f3d65afa01ffaa3789cb6c83a2958354992363b8c967da62edcd","target_edition_id":"edition.r017.id-id.draft","target_line_end":1165,"target_line_start":1153,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1153,1165],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f091eb9a5db07a01746152103b14301deb5d1d1b0a8e232a647b7bc0d072ae1c","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-185","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":185,"source_content_sha256":"f6fe57d3ac670a71d42b9518045041af30fcb61f93716699f21b80750efeddd5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1159,"source_line_start":1159,"source_local_id":"block-185","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":185,"target_content_sha256":"3b69dd1833db457ec8f6ce0e2c40052209e1cd29a1a825281391d7accb8b6d31","target_edition_id":"edition.r017.id-id.draft","target_line_end":1167,"target_line_start":1167,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1167,1167],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"734bba23b72573e4e7059fd73645702acd693e3b46584a62eae4ec983327ff47","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-186","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":186,"source_content_sha256":"c5fad16416d4455e07ad48db93a787aa21bfa2b86f70d8bb8803dd58b8859931","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1161,"source_line_start":1161,"source_local_id":"block-186","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":186,"target_content_sha256":"22337fe9d9ee925911c7327ae7bd54bfcc093e029d299330f9a101644546ce49","target_edition_id":"edition.r017.id-id.draft","target_line_end":1169,"target_line_start":1169,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1169,1169],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"54320f72e71cc8fb8f1d2f4b43e5b6142bc3c829a281a0ad96789d5157b842a0","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-187","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":187,"source_content_sha256":"9de8631216affc61c7657033cd01c595544cb830752e59ac09773ee586665944","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1176,"source_line_start":1163,"source_local_id":"block-187","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":187,"target_content_sha256":"7c262b267c356c261accc6d90ed4947e41448af2ba7d7cf8a37a09fc2ac83a95","target_edition_id":"edition.r017.id-id.draft","target_line_end":1184,"target_line_start":1171,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1171,1184],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84f27dcf9d9329279d6abc1634a1c33d76abc9028545942a911fc0fa59f452ae","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-188","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":188,"source_content_sha256":"112a0aed8027107fc822eab06440717334acc79d800f7c8a99c42c9a228cd788","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1179,"source_line_start":1178,"source_local_id":"block-188","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":188,"target_content_sha256":"112a0aed8027107fc822eab06440717334acc79d800f7c8a99c42c9a228cd788","target_edition_id":"edition.r017.id-id.draft","target_line_end":1187,"target_line_start":1186,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1186,1187],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e65e8356ec92cfaaf586a2bcdd7839a88fe0cae80e38dc61e16f064aec500dc","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-189","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":189,"source_content_sha256":"761abbcc646eb5a94448ab8e0f847f2a9c7a504876de0c148c455258a4087c53","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1181,"source_line_start":1181,"source_local_id":"block-189","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":189,"target_content_sha256":"761abbcc646eb5a94448ab8e0f847f2a9c7a504876de0c148c455258a4087c53","target_edition_id":"edition.r017.id-id.draft","target_line_end":1189,"target_line_start":1189,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1189,1189],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"50cdfff48423cae2b9ad53665a1587ca9f29d35d8de56b6d0b1948dd29df782e","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-190","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":190,"source_content_sha256":"583f950ca78bbb6b727659e490950ff2cb9a1bb606dd5b55795b05fe79f911bf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1185,"source_line_start":1183,"source_local_id":"block-190","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":190,"target_content_sha256":"583f950ca78bbb6b727659e490950ff2cb9a1bb606dd5b55795b05fe79f911bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":1193,"target_line_start":1191,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1191,1193],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c84c7aad991f5001d4d207dfdc0378b32e21d1eee610ad7e8930982e9e7685f","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-191","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":191,"source_content_sha256":"0c26b84e1aef17babca65cb026dad3a6830058100d9be7d99f3854fd8fa87a76","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1189,"source_line_start":1187,"source_local_id":"block-191","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":191,"target_content_sha256":"0c26b84e1aef17babca65cb026dad3a6830058100d9be7d99f3854fd8fa87a76","target_edition_id":"edition.r017.id-id.draft","target_line_end":1197,"target_line_start":1195,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1195,1197],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"137040469b3e2ce9d28406173d46da9abf07708c380765742a3a478f08322d3d","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-192","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":192,"source_content_sha256":"ce1f2b3d616c5af883980e7d2c61e3244f68cb85812bb4569ea0e7577496c58f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1196,"source_line_start":1191,"source_local_id":"block-192","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":192,"target_content_sha256":"ad6f89ff0281fa2d622552577f8304da09161ed0b546ef2281eb8ca535213110","target_edition_id":"edition.r017.id-id.draft","target_line_end":1204,"target_line_start":1199,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1199,1204],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2236d4137412d62a610cbfa2dfc9abf74bb1093578fe49003d911167e876d610","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-193","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":193,"source_content_sha256":"4e467ee961ff4a4db8d193ab4ddca60cfd9257c1c8e63b58261e80e104e44626","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1201,"source_line_start":1198,"source_local_id":"block-193","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":193,"target_content_sha256":"2a1757002d7a19df68d7cfa908bd6879a94801ed588dc8ac73916a1bc6e746da","target_edition_id":"edition.r017.id-id.draft","target_line_end":1209,"target_line_start":1206,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1206,1209],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"417dc4c1a1a4a576839cbaa5c516bb089a47d663dd57b88c0882687122a9eefa","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-194","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":194,"source_content_sha256":"112a0aed8027107fc822eab06440717334acc79d800f7c8a99c42c9a228cd788","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1204,"source_line_start":1203,"source_local_id":"block-194","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":194,"target_content_sha256":"112a0aed8027107fc822eab06440717334acc79d800f7c8a99c42c9a228cd788","target_edition_id":"edition.r017.id-id.draft","target_line_end":1212,"target_line_start":1211,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1211,1212],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"72270744929b95cb4247444ee74e47d7c4b808ed3695bf9d91a12cc9009c6aba","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-195","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":195,"source_content_sha256":"761abbcc646eb5a94448ab8e0f847f2a9c7a504876de0c148c455258a4087c53","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1206,"source_line_start":1206,"source_local_id":"block-195","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":195,"target_content_sha256":"761abbcc646eb5a94448ab8e0f847f2a9c7a504876de0c148c455258a4087c53","target_edition_id":"edition.r017.id-id.draft","target_line_end":1214,"target_line_start":1214,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1214,1214],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e3a5185dd5417ceaee49c32e74162ddb5d52cbdac6711a6fee9754cdded76a4","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-196","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":196,"source_content_sha256":"5126a78e4b99f16c1082a305e157ba45eb4e1ef2b24c5705006e7d676ca4819c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1215,"source_line_start":1208,"source_local_id":"block-196","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":196,"target_content_sha256":"5126a78e4b99f16c1082a305e157ba45eb4e1ef2b24c5705006e7d676ca4819c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1223,"target_line_start":1216,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1216,1223],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c205588da48a299ce5763738ae118d199a65678177fafc15398ae1788c898d20","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-197","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":197,"source_content_sha256":"4ebc741c001f51711d006e62be2e31e39d6dc148641e1b918b8f08c8b38b2d34","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1221,"source_line_start":1217,"source_local_id":"block-197","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":197,"target_content_sha256":"538d32543f700a364e4ab4478859f54606aeeae2e644fa7b96ead1082df116e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1229,"target_line_start":1225,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1225,1229],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2b7c5efb43c20d271bc7eb9f57c3d2f8f89b653bba524572390d3e8ca94d3b12","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-198","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":198,"source_content_sha256":"53bb2a510cbb2763a793e04089f798078e5be5a6161d7df1de0e7c6c7a0cd6d7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1223,"source_line_start":1223,"source_local_id":"block-198","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":198,"target_content_sha256":"dd07224870632835cd594bcbb4714a2ece9f985067de24373af79defc5b8c1e5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1231,"target_line_start":1231,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1231,1231],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab498c85514b84578640faa9fa3e3a3eb55585d523949d2aa5d5038e0c99b510","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-199","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":199,"source_content_sha256":"6c435e85e6adec966deff9e4924eeb864331febbc05db3d0cd5562c81542b1d1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1225,"source_line_start":1225,"source_local_id":"block-199","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":199,"target_content_sha256":"8213ed0549659645afec18bad7c56f83c4d5937e326044c5e84df9d14fac1a13","target_edition_id":"edition.r017.id-id.draft","target_line_end":1233,"target_line_start":1233,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1233,1233],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"11847961b8d55cf968cf084f838a561fb8850c762b6d20f70ef6a689b59fb70d","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-200","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":200,"source_content_sha256":"3840bb02da9d3e582d9775424a4709cde1f8e3fa683f4e8395fc0841dc9c2a93","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1227,"source_line_start":1227,"source_local_id":"block-200","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":200,"target_content_sha256":"36f4cb50eb6a12a73d520ff004623037b1c560cab1b218d7d006e4f3eff43154","target_edition_id":"edition.r017.id-id.draft","target_line_end":1235,"target_line_start":1235,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1235,1235],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81388dc8a5c706a4970dc0ec7f4720cf88b7c5ad02566c6c6a1a236c7ea98276","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-201","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":201,"source_content_sha256":"b8e600711366d9de6fee91aee9182a48d7d1355797417197e475ec7965c6511a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1229,"source_line_start":1229,"source_local_id":"block-201","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":201,"target_content_sha256":"bebacb7ebb83d2a5e9f3fcb3d173d491efbf093700621a3ff22ada54fd8ff28e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1237,"target_line_start":1237,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1237,1237],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef0abe629e55256a2e39cd217707b140cf7dd55bf1921e2048ce8f8c14ab9877","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-202","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":202,"source_content_sha256":"1e05e92bef2cfffa3143b0e535a8267008453f0ea1d523b7f05ac8a18aef4483","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1245,"source_line_start":1231,"source_local_id":"block-202","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":202,"target_content_sha256":"8ff4929c74d623281974ecbc68dd0000f6c6b0a66d8f901e4b7726cc3ce55bf7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1253,"target_line_start":1239,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1239,1253],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37daccece4a24b8de902847ddbab91e18d9cd93459cec61115d2d18cb2dd85a0","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-203","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":203,"source_content_sha256":"8c93ed1ab27fab8821f48e8d9ba4db1a264a7f8c68b792c0db9770dd912f4b18","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1248,"source_line_start":1247,"source_local_id":"block-203","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":203,"target_content_sha256":"8c93ed1ab27fab8821f48e8d9ba4db1a264a7f8c68b792c0db9770dd912f4b18","target_edition_id":"edition.r017.id-id.draft","target_line_end":1256,"target_line_start":1255,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1255,1256],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b1f3704a42894fb4d702674fe81c2375b5c482ce4ac4532604682a8a16d4e41d","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-204","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":204,"source_content_sha256":"7953823f2d3e2a54500669aa5c97a1bad99d9416133a85aef32b98a74ec45036","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1253,"source_line_start":1250,"source_local_id":"block-204","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":204,"target_content_sha256":"7953823f2d3e2a54500669aa5c97a1bad99d9416133a85aef32b98a74ec45036","target_edition_id":"edition.r017.id-id.draft","target_line_end":1261,"target_line_start":1258,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1258,1261],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"98ddaa31b1780d984e22e0080d93a0b18c927da715723eacd7b08825e2427fef","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-205","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":205,"source_content_sha256":"fd9a090bb7f5e1ccf7a34de10fb2113c85a75d899ee5e06794cd25fffdac725e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1258,"source_line_start":1255,"source_local_id":"block-205","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":205,"target_content_sha256":"d527456f944ccfc0faad94e3d8ecc806dc195ef4d02645a67ea754f63ba93334","target_edition_id":"edition.r017.id-id.draft","target_line_end":1266,"target_line_start":1263,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1263,1266],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"574bcc2e85bbd3d8d1558122420f87bcfb3d8c22375ccf74c93fb16ae19a9d88","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-206","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":206,"source_content_sha256":"44f16fef4a2df14dbb04a8063ddbc50db4efbca8f6503f054e35b38d627eeb5a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1263,"source_line_start":1260,"source_local_id":"block-206","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":206,"target_content_sha256":"bf39b1391414c9d9871dbd8e273cca39ecfd89d0c1b26c69548e1693043fe3d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1272,"target_line_start":1268,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1268,1272],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"926c7c2cdd854e64acbd37a42772afdd9f5b431fb8e484bea897bd469f577a32","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-207","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":207,"source_content_sha256":"8c93ed1ab27fab8821f48e8d9ba4db1a264a7f8c68b792c0db9770dd912f4b18","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1266,"source_line_start":1265,"source_local_id":"block-207","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":207,"target_content_sha256":"8c93ed1ab27fab8821f48e8d9ba4db1a264a7f8c68b792c0db9770dd912f4b18","target_edition_id":"edition.r017.id-id.draft","target_line_end":1275,"target_line_start":1274,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1274,1275],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7617d9b6987fa4979fe20c1d6bb4ac4ca0952d0f91e18b2ae84442fc0732c5da","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-208","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":208,"source_content_sha256":"7953823f2d3e2a54500669aa5c97a1bad99d9416133a85aef32b98a74ec45036","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1271,"source_line_start":1268,"source_local_id":"block-208","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":208,"target_content_sha256":"7953823f2d3e2a54500669aa5c97a1bad99d9416133a85aef32b98a74ec45036","target_edition_id":"edition.r017.id-id.draft","target_line_end":1280,"target_line_start":1277,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1277,1280],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"806a4a3a627f55b137b02a7dab0ddc5515e762c47c3bc36713c78ba1f87560c1","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-209","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":209,"source_content_sha256":"a38ac900f7d6b5952dcadefb81cfc5199b7117073cc256b16c8c1676392cc502","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1275,"source_line_start":1273,"source_local_id":"block-209","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":209,"target_content_sha256":"a7817172cf01a4cc26234f2e06265c3e1b65fcfe67797d102e44b082272caa07","target_edition_id":"edition.r017.id-id.draft","target_line_end":1284,"target_line_start":1282,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1282,1284],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"abf938ba3205d59a542be4ecf5494d25f5c975879132b7ab9a2db556c0b9754f","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-210","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":210,"source_content_sha256":"a7daef12d7a4bf12c7f946fe727e5c3beac384b22be48a74c03af9f315524dde","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1277,"source_line_start":1277,"source_local_id":"block-210","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":210,"target_content_sha256":"ec0890356e8856756860193c335627886fea13585446b5705367136842d1eea0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1286,"target_line_start":1286,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1286,1286],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a167a377e26b4e8100a63f38974444c6c1045e08349414f7a9ef8ea1cb214435","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-211","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":211,"source_content_sha256":"80503719bd070bc40deb826dfac2bbe27bcf26270b0f025a8bcd52a3000a62a4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1282,"source_line_start":1279,"source_local_id":"block-211","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":211,"target_content_sha256":"cc54fe9185a83a21b010395b3501df94257134a6e65128185e03e406f0ef489e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1291,"target_line_start":1288,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1288,1291],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6fe9372eb0da74c325a0c5ea3459b3199e78b2bfacf44559579510934ed9bc48","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-212","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":212,"source_content_sha256":"cbf0f8c763c4e7866bd2906c826b814ddd3983379bf600e854637a98d5dd648e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1285,"source_line_start":1284,"source_local_id":"block-212","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":212,"target_content_sha256":"cbf0f8c763c4e7866bd2906c826b814ddd3983379bf600e854637a98d5dd648e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1294,"target_line_start":1293,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1293,1294],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cdfc1cf008ee911bdd47c95d7717d4c215a4a4285982bf07fd7ba499ec4375ed","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-213","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":213,"source_content_sha256":"d0ae1726f5d985a174ef3ed0feb8aab5a5e25e155b298aa8f1d20fb77d9365a0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1290,"source_line_start":1287,"source_local_id":"block-213","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":213,"target_content_sha256":"d0ae1726f5d985a174ef3ed0feb8aab5a5e25e155b298aa8f1d20fb77d9365a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1299,"target_line_start":1296,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1296,1299],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a3c762f2f1942bbd43071384e142026b4e79198de4a4333b6cc8b159f831f087","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-214","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":214,"source_content_sha256":"044a03220c112cee7be53aa09b7beb763dd96c3b29d25dbe5709c91810188acb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1297,"source_line_start":1292,"source_local_id":"block-214","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":214,"target_content_sha256":"ec214ece030a7bec3dcc6b61ada7f7dae5c6af0a4b65a44380bd58077ebeeba3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1306,"target_line_start":1301,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1301,1306],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16d69fb137bac578202d4568e5b7374f27a1b2dd55d93df3e466b59ea282893a","concept_ids":[],"id":"segment.r017.book1.ch05.text.block-215","locale":"mul","parent_id":"unit.r017.book1.ch05.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":215,"source_content_sha256":"2b74be99aa4db84250a69aecf7b8c736950e78ac81e1d062957374c05adb85a5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1299,"source_line_start":1299,"source_local_id":"block-215","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":215,"target_content_sha256":"0d213490b7ea483afab0b56b9a70371f42c2bc8762b5fcc40d929cb8e6aa859a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1309,"target_line_start":1308,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch05.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1308,1309],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch02-modeling/Section2.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c29f088ab96ccb70dc24bbf9951fb5a3907fb5ee79bf7e1d983d40add61f2e8b","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-001","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"cdfc69904c212c1bd144a1f0fd350f8324506185cb9f013dcfd5f7592b911db0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":7,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"60e6eca4c1a26224557e7b240de37f9224478b4f3464b76506ef964d8c2f3039","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,7],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e913ad59fd566141617872bae8fc88e13f1ba8e8a79e1b939200bdc51b4e23dd","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-002","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"d3c373019b486b947b1675163556c2822afbaf881f92d652036a0b53ff8d2360","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":9,"source_line_start":9,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"23697c095d7402fb449fb9912f17ff0415c76ff0807f3c3e721d2a7cd32b597c","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":9,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[9,9],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d5ed0004751b7390f7b2cc188c35a4d0131426ace878b160c859c703051a254","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-003","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"36ac5fd3a8a5ca30d3731f869a954f130a2871ed5fe45c16cf4f1a3d29dab0a5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":17,"source_line_start":11,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"88c70b206e6ec4c901bf467a652167e967ac460178e1f12546b6f1e436795fec","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":11,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[11,17],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"faa473a4e9cbe2e68a4ed785a61c6e8c3dffbd2b557dc141609ee4ea223d8666","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-004","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"3b26e037bc199716333a1eb35ef5f5b8705198176a9ac72745140bf65a8a28d5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":33,"source_line_start":19,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"9b6fb9e543ebcaf8436d15e81b7fae980746f3c1ba6650b0fd0dbbb9e3833e5d","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":19,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[19,33],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"db45a75c6386e492553c886b1822e70e078596d40ad15e751cd7e020ca33d2eb","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-005","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"5bb45d33ea41210014d3fb3f8c4544a56a61d7ffab9162b926dbead6402ce63a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":40,"source_line_start":35,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"c66cc52fe5b238d56ced138bb7b747237acc091c569fd7e4af50568a97e8af8c","target_edition_id":"edition.r017.id-id.draft","target_line_end":40,"target_line_start":35,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[35,40],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7e7cae2c2978bafaf523ba4a6df214f8167bb94acd8eb52dac0080d1b630cde","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-006","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"83567a797ce00ce9f29647ff04099d33de3a494d10874e3aaf1e0fd6caf3fb9f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":48,"source_line_start":42,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"751f63a682ec89337a71cef972cc95cc482b55bce648959a81901f1ea49b5277","target_edition_id":"edition.r017.id-id.draft","target_line_end":48,"target_line_start":42,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[42,48],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"032f574a7775447a5098425b77bf5554fd260f2c13eec3e70f9f9e2d865c18fd","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-007","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"d25b3bb0b0d947229b12aff6ddb0267cb6ea128ee5b88273f02ab01e7bb825f7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":57,"source_line_start":50,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"8e0362306049a12ba7f8682e943bac2fd8494addb505b8bb91c52a25655ff669","target_edition_id":"edition.r017.id-id.draft","target_line_end":57,"target_line_start":50,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[50,57],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"32a56492d230f9ca44365abfc2573c0451fa5eca1f2622cb8593a90c029d0beb","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-008","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"f814e105a5f65ee0b7d9765ea96d273e985c67dd89c2640ef60fa7f001ae3456","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":64,"source_line_start":59,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"1248ff4d7979f2ba0d708c5b6ac276e58d7ea85f623e9236bb33d98295b48057","target_edition_id":"edition.r017.id-id.draft","target_line_end":64,"target_line_start":59,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[59,64],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5f2b2489d95f9ce59e9ee64379596a8694b2fae8ced9220101bcf3fd7b740767","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-009","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"c2c2c8a5a3b47bd73a5e030e88bda02f99a9424137802b98bc93f5d731e45431","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":76,"source_line_start":66,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"6f022640371785136a809971a893391024222d1936f0044e0474ef538cded469","target_edition_id":"edition.r017.id-id.draft","target_line_end":76,"target_line_start":66,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[66,76],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9daa69909c564aa5866459f8bffdacac1194efb7907709162e3aae4848ccf5d1","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-010","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"66c19d743a3e4dae947283efe66dba38631a040e482b5dd45a05eacf00aa4472","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":83,"source_line_start":78,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"471de74d1bc8ae1eaaedbd3972998e8cbd341e055cd4cce0f8133aa5022b3354","target_edition_id":"edition.r017.id-id.draft","target_line_end":83,"target_line_start":78,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[78,83],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24f3515bef34888b6ad4eb22e7390013e19392e249dfea09e01675cec262fdb1","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-011","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"e6187255ee4e25fe24e15168104246ed1617192a1db0a73a5f124fc10bebdad2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":98,"source_line_start":85,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"37c269064a7dc59dfd440506c66df1592aee7d89764f920a4ad6eec170ce7e28","target_edition_id":"edition.r017.id-id.draft","target_line_end":98,"target_line_start":85,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[85,98],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76e03622421a375cc8a71f2cd085ad80b6a1b00993ae3e27b70b16b6fbc8d918","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-012","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"ad0959999d4ddceadee752d903705d0fc468c2891c27feec114431af133a10a0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":105,"source_line_start":100,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"d72eca2f52f4416c0881d51a6d1ac418ef7e4eb7ddf390e7f35f7a134ba29930","target_edition_id":"edition.r017.id-id.draft","target_line_end":105,"target_line_start":100,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[100,105],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4edbce71d0dedcc4e57845ad283274cffc6f5a7ee203453dc0cede5abaf9842","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-013","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"620f107b5f758475e4fc259715910033bd019d63fb89d55cd37622c2c3e8f70e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":112,"source_line_start":107,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"9f7f09ab55f49b766c21282e212cd672a3fd90dfa451281e5b1d511931c8c95f","target_edition_id":"edition.r017.id-id.draft","target_line_end":112,"target_line_start":107,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[107,112],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a0a61a84817661ef15900e16d408350832ef2aac1d6a4236cc4f70da85b3504","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-014","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"19f265a8405720d9661956101ba2c855fb9a9441094af69f3522d29a3bb61ef0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":117,"source_line_start":114,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"06db7c60d624c395502176ebd22a6b001fdff5afd3968b61a30073b807e3e6b2","target_edition_id":"edition.r017.id-id.draft","target_line_end":117,"target_line_start":114,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[114,117],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b963c0d9b295c4a8cc0ef26b7cea1e4f60931f41858daec26ec2b417b4858917","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-015","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"73d253b9aaa4f7efa034712225b70f0e40ad5fda59af6ea703b913f64921175e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":119,"source_line_start":119,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"4816d9b4d39a8fac79ec3ce3af65fc17dcfaba28bf18a08d6a2873a720ffa52b","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":119,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[119,119],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20ac4b3ac9dff0a7bc944a5cc7570d2476334af28fbe89d0c1bd4cf06368f20f","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-016","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"b2135e387706c2399c21c3ffe331612bb6115a054967779ab04260ef1f473e38","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":121,"source_line_start":121,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"a9aa0f734c1a1736c2e2e638ef995b0f1f570e96ab239685c5ea8e4772ed904f","target_edition_id":"edition.r017.id-id.draft","target_line_end":121,"target_line_start":121,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[121,121],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a401febdbd0d1b24c7f35eee6ac59ad8d0ff05dcfe195b3423bbf9d8b37a4670","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-017","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"c579e14d3871996e9567d742e12360c7c2c66d963abf00be07eb08e4ae9e3969","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":124,"source_line_start":123,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"b08bb8901f04cafc77c1edbc0e18477b7fb268db4e857267f260deec6f3d96ea","target_edition_id":"edition.r017.id-id.draft","target_line_end":124,"target_line_start":123,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[123,124],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b27cf09ad45bf2f3dac8b00b22b63a6d3c48fe3bcf4e4844ba2f3274c4a11498","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-018","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"3d665adb91f746f4b4ef3e5dc1673d1812018a06914f7b2876f929b7b0b11102","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":127,"source_line_start":126,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"c6b685f7048138d333d5ac3ca9ca91e37434e6312d7519fe3a56f64d416db9d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":127,"target_line_start":126,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[126,127],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"425bc92f30513570dc1a7770a5a8e45ce2569a40fa1a3b6189263006920e16fc","concept_ids":[],"id":"segment.r017.book1.ch06.solutions-manual.block-019","locale":"mul","parent_id":"unit.r017.book1.ch06.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"3d4bf204fbe7c970df5d241d48a55de7acf768f405355e4efcf441198fdc10ee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":130,"source_line_start":129,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"3fad6747eb48d6d360d55d4a12b418152210c121d0f5ba7319ab49cd2b3c119d","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":129,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[129,130],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch06.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"43ebdc403599d9efd87d681a43a585e52c998cb624305136e43f1c6661d82337","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-001","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"389eb38294c1e3e0a1b2d4794507389c8faf6aa212f32a93f142a36b6f536709","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":8,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"6771bd1faead66bc4e9b7c71870b39d8021487ad7e5279c3bbbbf482379c1104","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,8],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4f476289f303a4d27701c62ae09fa168217170be6a54de96ff5d12c62e6210e5","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-002","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"2d428780397daa7af66867a4d44e2f1e08de42bd5d5eb6bf5fd8046716539363","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":12,"source_line_start":10,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"a4cc968f78a39a984f15bee4d63b9579588b783a73b1ec64466b62ed79dbff95","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":10,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[10,12],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"408e3441ea73130cc24fea2877fc23e5580ea0ae1dd90df57ffb68c67615d9de","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-003","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"cb419c9515e98a76a4a63def2a1a790d35cfc4960e4b6e23407d7d53172847e3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":14,"source_line_start":14,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"771c0ad6188ce8f28df9a6203d438474255da7fc69ba3e2825e99137aa2df6a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":14,"target_line_start":14,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[14,14],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c9dbbeb71c102b8586c72fac97eb5f0f1c4f9d9b7502d579ed3f2b3b500f7c6","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-004","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"3d0a36134f20aa7bee172cf4ce512671d367b992d9fde27347226b0476be7061","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":18,"source_line_start":16,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"fdbc255975c79d80e376a1e4411e1c8c9d569f0fd47ef4b7193d5ea78849c724","target_edition_id":"edition.r017.id-id.draft","target_line_end":18,"target_line_start":16,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[16,18],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"55f5e971bbb9dc9c001467fd37c63586e3fa9a788ab9db9ebcdb9c352169db2d","concept_ids":["concept.linear-combination","concept.linear-independence","concept.matrix-rank","concept.vector-operations"],"id":"segment.r017.book1.ch06.text.block-005","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.linear-combination","concept.linear-independence","concept.vector-operations"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"1fb62639f3b21f1cdfdaccfeb6cc9614bfc7f37edc526bddd34f7ce63f5e55dc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":20,"source_line_start":20,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"a5b77e1a3cbea606dbd951a48aae1032c1b76999865cd5027fc2d270fd3c0b72","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":20,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[20,20],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0c16d33f5fc912cda7cb9236b5a4db8aab6c5482162997d40288a26a716e9f7c","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-006","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"bb0b5b9c6eb778bea3c453acdb1740ef0b77a1e0d30a5daa99ea24eb2411d9f3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":22,"source_line_start":22,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"92e1e791891a3e52eb16af40c3ead554ab51b104c15ae343f940dc3b7cbd2b08","target_edition_id":"edition.r017.id-id.draft","target_line_end":22,"target_line_start":22,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[22,22],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ff658edb74374f9c394b7d164d026573af7fbea93a47bdaaa9413bd797dc109","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-007","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"615cdb197ac71da0569f08e11d2ce04172b85c3dedab236725e8ebd0795c60ca","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":33,"source_line_start":24,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"728390a405535453a64b1839e2ac171e972a4a6540668add97a3851f6df06532","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":24,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[24,33],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb73b87cf656946c8d80cde8199cbb9cc175424e4cb9593d06f3d7c3e476f33e","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-008","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"a52bbd1a76092920782a9d9630f7838fad89fc6aa22b5fe4bc5a6e1b6bc07e00","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":37,"source_line_start":35,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"950222449b2ccddcd72b7cb6bc79aa26f453bb5e36b3c7dbf8f595b2d4d4347d","target_edition_id":"edition.r017.id-id.draft","target_line_end":37,"target_line_start":35,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[35,37],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a536b1b679648f85120e5b6f5e43b9883c97f4625c1133bdd005ccab23b0e26e","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-009","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"aa397edf4c26455575c1726281abecbf6ac1c25151d2c1ae65df283d368c5c9c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":45,"source_line_start":39,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"67be4732e59f408b93ab97a6740eed063187b9282eafdbb386aa9a024fd8662b","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":39,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[39,45],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a317c330c72c7fed9788c216314a42c3269bda2fd9c809de66d6e9964e2e457","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-010","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"d3d06b99879df747554fdc5db3d13b22dd402934eb1881a2cced418c0dba1ccf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":52,"source_line_start":47,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"0cd4c4e1574818ac57e7e2cc2cdeb2c16a9ca2f86d2f5a2a81ab65a68a739403","target_edition_id":"edition.r017.id-id.draft","target_line_end":52,"target_line_start":47,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[47,52],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"41580dacb163f3a7f9c52b13bc4a1cccb90053ab1e55b072e91328e7fe7197f4","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-011","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"a09b996d1e1a7b35627ebf2a484e2fda1f060ebe499e1315bc473d73eff79f6e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":64,"source_line_start":54,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"3ce332d5d91e77a9d0f10c44d12b0b590f799a2fe123705718c4014258337cc3","target_edition_id":"edition.r017.id-id.draft","target_line_end":64,"target_line_start":54,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[54,64],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"77ad43d810c15b24d4fb22b163c394a446cc70bcb57b4432fd86ef7fef0fdba9","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-012","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"44c0fb6e1ded133b324ce19af57d893d3b18b49ad7cfef612921d67f9c08de9c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":66,"source_line_start":66,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"7c99469eedf9ae794540097d2f978abe6dfcee90a2aa0915108d8adc280c124d","target_edition_id":"edition.r017.id-id.draft","target_line_end":66,"target_line_start":66,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[66,66],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7e8f36a70cd91541fbeb4dad44b7927c3318fd64a906e888d82e670100c57ea3","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-013","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"e51e91bec5286917e06c072ec6f13a60ea8bf2226b672c30a0f6c8d2a614cda4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":73,"source_line_start":68,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"ccbfebc9dad058688d0e0d9d6449f9fb4af9c35b3d67f70ede5cf336b779994c","target_edition_id":"edition.r017.id-id.draft","target_line_end":73,"target_line_start":68,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[68,73],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2b4d665f0fa81fd0ad93bf5a03c64bbbbc42d560e89aa23de6852382523f1657","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-014","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"7ca63a0035f24e4489b5220184adc1df8b6df88b752f2ada5243220b9fb834ed","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":80,"source_line_start":75,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"3019a2de0ba1dabc55cb4ebdc9b041cc97da6f3fba7366b74fa964f748f161d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":80,"target_line_start":75,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[75,80],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b71a3e15a21e74ee36de12bc1c9fa966d89b3dee3c1ae51e5ffe10830d10274","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-015","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"945b824f1c1a0e68d7ddce65924bb3dd3aae14cc15c3e81e65ae99fd8b51ab62","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":83,"source_line_start":82,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"29c4caea02f6b582d062a6cb4aaa0d248ef17511f82273ccbc3b9b92dc884859","target_edition_id":"edition.r017.id-id.draft","target_line_end":83,"target_line_start":82,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[82,83],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"588edf9924cca744fa229dec42d184a20cbddbe3ffb5994fa38acb492bbc1d4c","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-016","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"cb6e61061d3988484aee2bf439bcfaf058240773c07c6008e70aca376a96e4f1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":89,"source_line_start":85,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"a64ba18c52bb9be0004ec4b07b461831aeb9f4a19ebb34a19768fd27c4db67b2","target_edition_id":"edition.r017.id-id.draft","target_line_end":89,"target_line_start":85,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[85,89],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6169d80339bb18558a94d1e1f5aee2954939411000e9c28dc1e72a4511a25ef4","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-017","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"d84b77dfd8700c584a53df5b9b32db72be3b7137e1faba40ea6d363346e78e35","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":91,"source_line_start":91,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"d84b77dfd8700c584a53df5b9b32db72be3b7137e1faba40ea6d363346e78e35","target_edition_id":"edition.r017.id-id.draft","target_line_end":91,"target_line_start":91,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[91,91],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3cfa499d56fe6e280271ac3d0873b469bc19be532d7bce826682671cea9e6215","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-018","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"1d22c64ba92710b8bbf67020033d5dae27406003f27f4b695fb1e952a585a98b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":94,"source_line_start":93,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"be6a494572eed6871da7b25bef6d0298e664a4155d90ba7242f5577025991b88","target_edition_id":"edition.r017.id-id.draft","target_line_end":94,"target_line_start":93,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[93,94],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f694c14e17713b93f18dee6662a6eccbe5c515f1ffb5047641c4ae9cd0fe5582","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-019","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"112f7c7c693d26af3fa59c1564ea96dc6476def1f4af9678bafae69723995915","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":97,"source_line_start":96,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"faf4c96a3547038e7938d926bb7b9cf1105db80b6912a50db3e72e5c46dd8ead","target_edition_id":"edition.r017.id-id.draft","target_line_end":97,"target_line_start":96,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[96,97],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7acbe16ce975eb8b5386596601fb0727eac94402954c56b824c3c71b575096b9","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-020","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"7195ed2416e27079b18f39298a1b9797ddde7c28f498930a0f8836b2a70578b5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":99,"source_line_start":99,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"876c1cb00303e723e987835fba307e5f297175e46479dafe3b03518a12e7709d","target_edition_id":"edition.r017.id-id.draft","target_line_end":99,"target_line_start":99,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[99,99],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb44e4fee4ea0682c43a5200ef25b33fd7214473899c7ba401ab57a22f8234db","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-021","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"bf9cbdbbab6684125af4809c80deb8f8efdb41a11b2b6ffbfa0d8db81f8cf741","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":103,"source_line_start":101,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"b36dd255b87831d43cba9e2b66657d2c774656870f6ecc7c1768f4dc0fcaf9be","target_edition_id":"edition.r017.id-id.draft","target_line_end":103,"target_line_start":101,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[101,103],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5c89c694a58ff47f8123f65bd9654390ff13e888f42085ff5117106e5f1fe05","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-022","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"1f214f1535fe61dd51d02d91364f229f38fc46cc033010e14b7bc036636187aa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":109,"source_line_start":105,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"f13f8d1b5ef1f4177b19ea01325207ddd5817b843245d8f6eafd25f9b9b2cff6","target_edition_id":"edition.r017.id-id.draft","target_line_end":109,"target_line_start":105,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[105,109],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"034215968af583199f5f690fc325ced9e29b979c581f7b83cd7fd2700a3ccc33","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-023","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"d84b77dfd8700c584a53df5b9b32db72be3b7137e1faba40ea6d363346e78e35","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":111,"source_line_start":111,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"d84b77dfd8700c584a53df5b9b32db72be3b7137e1faba40ea6d363346e78e35","target_edition_id":"edition.r017.id-id.draft","target_line_end":111,"target_line_start":111,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[111,111],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b210df4ba89cc10b98034edcc0538ba97b66061dfb0f119a9c2fb4a0d16db63a","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-024","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"ff71b2503d8a54424016deca39908706a3f14e1b3096971a1397b2768e01c835","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":114,"source_line_start":113,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"a76b7d67d94d8c37045eb9806bc6883f0091db23584e3ae3d250c2731cb449ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":114,"target_line_start":113,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[113,114],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"51970f7832fd249eb5c62aa40f0e580d574ed4f6ccaa6f92b83c72fdd447f279","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-025","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"14b6e25e7ac611e808e07361668dde157a7f85139aa1023b0fe902b38da3d576","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":123,"source_line_start":116,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"884f5d1e456951a8c5e16baa44f9074852d4d4c895269d548758c967c508ac7a","target_edition_id":"edition.r017.id-id.draft","target_line_end":123,"target_line_start":116,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[116,123],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b2bf1ff28be8e94ccaadd28b27048220094632fea5ffc7f1e803b5a643800d2e","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-026","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"024142e719f45dc83b18d23ad812e67e1de2756bb267ae279a6ef3c08b7cbcf7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":129,"source_line_start":125,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"dd20f9cc692da73241f425b298b2f15fcc5aa301301075ed1aba71ca1c9503e3","target_edition_id":"edition.r017.id-id.draft","target_line_end":129,"target_line_start":125,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[125,129],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"565f51e0ba1696b87f7c3c6e680f084739c53b8582705f116621b54e9f5a7e2b","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-027","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"d84b77dfd8700c584a53df5b9b32db72be3b7137e1faba40ea6d363346e78e35","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":131,"source_line_start":131,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"d84b77dfd8700c584a53df5b9b32db72be3b7137e1faba40ea6d363346e78e35","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":131,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[131,131],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"afa79cdd6139bb24e2f82a58a3361ac079f66df5d0ee4aa040bc0183b71ad8fc","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-028","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"ec4459638cb55f4414144fb32d34de1ef47a0e13a8f139a0235f8651693f0268","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":134,"source_line_start":133,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"10dfacd3cc5168d8f0c6b53a40b88a04f382b64ee33ed48231c9765b074f394f","target_edition_id":"edition.r017.id-id.draft","target_line_end":134,"target_line_start":133,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[133,134],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c79172bb012056f5184ef1f25ff2a7de34fa3b7c5b408bb35eae9bbcc9da913","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-029","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"045ee910618a264735de835aada42589149937245e91f524add5985579512e6f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":141,"source_line_start":136,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"c6a2d9105b306720b71c1c7d4a4ed490a11c5d3e2620c8f8d24650b0ffc1eb78","target_edition_id":"edition.r017.id-id.draft","target_line_end":141,"target_line_start":136,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[136,141],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee311b6fc03089fa6a98f776b16e44a9eefc32926b3e7e42bc2dee8232388973","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-030","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"d835fcdf1ec58f072a14b7456d0fc8f72941f530cceef9c4e95f90caf3c603a2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":153,"source_line_start":143,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"391a5f9f4895a99eeec600566cfb056edc3871ea172e4b9bd427cd9a59d79f70","target_edition_id":"edition.r017.id-id.draft","target_line_end":153,"target_line_start":143,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[143,153],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fdb112e5a5278830f334b2131bd7e10d4313648700960ad12eff07b7b004ddc5","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-031","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"8314347e23c29043590432a22a275f9e3fa46fd94b207872737bad81cd60ec42","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":163,"source_line_start":155,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"1d96048931c8cd047d405bfeaa27fbb6d5737d7e5d68bd6a38d1a61984f6d77f","target_edition_id":"edition.r017.id-id.draft","target_line_end":163,"target_line_start":155,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[155,163],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"acffdff4fde53d913cf92916709f4aefb498ecb6f9bee1a9d3fc7d6c68fed945","concept_ids":["concept.corner-point","concept.extreme-point-optimality","concept.linear-independence"],"id":"segment.r017.book1.ch06.text.block-032","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.feasible-region","concept.linear-combination","concept.linear-independence","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"f4905757132e74e2830d7e5cc083978b296a2941288abbfc8c7ca7fba26c77f2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":165,"source_line_start":165,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"1a816decb1e70923cda9f14c49fbb39523092d27f4e531158a9489a4b0562006","target_edition_id":"edition.r017.id-id.draft","target_line_end":165,"target_line_start":165,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[165,165],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"97d83fd8bcc768fd3a25f57dedcbf9567036119bbeb87751414eee0d843202b0","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-033","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"04743e16525685023bbf92e86f8b6136d7bd6f4bdac0cb631e62d382b6528463","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":176,"source_line_start":167,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"a00a74203091bf3b0f3595792f47be901ec6b5ce8e75b12ddedd4438f39482f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":176,"target_line_start":167,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[167,176],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00d39cff1918c7477367b744524b5365a0a3055dea97433769c719bc33a43d19","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-034","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"35c70fe7ba5030971c24284eff10302828d350f144393f1c53f073ef73d3cef8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":181,"source_line_start":178,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"6ea4e634f3a6a7b6372a5a7f12371f91f2b46613b0967d2278482bd6784fc091","target_edition_id":"edition.r017.id-id.draft","target_line_end":181,"target_line_start":178,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[178,181],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ca80473cc4cff1b06a30ef8f617fb0501de7823e3802fb9d8532baa8bab24ec3","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-035","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"b442a42f291d700fb956b3349892b926f5cc3c9e5229229b37dcc1c4f4cbf3af","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":184,"source_line_start":183,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"1b19abb0b24c6a2555cfcdd490f8b1c8eda1e3d1cae50d062456d45701509448","target_edition_id":"edition.r017.id-id.draft","target_line_end":184,"target_line_start":183,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[183,184],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d3421e303de943cdd12dc9db3ba37e69287817626bdfc3b3bfed5228a86f9d5c","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-036","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"aca30d776d9bf8b140a56df39e06783d7080b36ac920c9da3ac23008fa446023","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":190,"source_line_start":186,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"be7246c7b2f7ab1b6284cca655f950900142eb5396015400c46ea484569a031a","target_edition_id":"edition.r017.id-id.draft","target_line_end":190,"target_line_start":186,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[186,190],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"97d16818615c1ccc2a7e9db558dbdcd5d84f9dc4b3ce9d30ad901bf2621536e8","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-037","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"eaf945dc38f74d95638bf82c7735ad191ad4e530f86a6ecd4ec9234f91fdb1af","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":192,"source_line_start":192,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"a8634f687e565674f81c09a6989c9db3f6ce3192d42ad381ddc22472672ff8ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":192,"target_line_start":192,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[192,192],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e87b549dc169a37e6f393e7c693d7c0786fa6a982d96aaf8af51f624663c24f","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-038","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"94208fda9f15cb3862e72d55fac035412daa483c9a3070cbedcc79a9b0774a36","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":198,"source_line_start":194,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"7063c0cdd7fe3b7bf9cf197ca656d1fd901c36d6884148c912151e89d4ce4792","target_edition_id":"edition.r017.id-id.draft","target_line_end":198,"target_line_start":194,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[194,198],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0c7c4c5e913d275a2cef1cc49f08ed6d73c6615c47c01b14506bbc7bec0e5ba9","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-039","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"cd95698f23ad39759170475ca458a7846d6ef7e2406a1363e2a586aef022b0ee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":200,"source_line_start":200,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"90fbfd50d987e7b6bfdda3f4e4dbbb95f021e246256759f78f1705ea39cea208","target_edition_id":"edition.r017.id-id.draft","target_line_end":200,"target_line_start":200,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[200,200],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce218c34b99e36ad0e0b83c8efd42d0f120bb7991d9fb8552cd989c0a6beb165","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-040","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"aa553624ed2202350ff068867e3d857c775e8d45f3df0fdd7d540e00ce76cdf8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":205,"source_line_start":202,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"57f825ff4477f8c26d97338a525d471109387ab3afa158c61706881e7b073f5b","target_edition_id":"edition.r017.id-id.draft","target_line_end":205,"target_line_start":202,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[202,205],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b1c0d8bb04a55bc79af040f514d633f14a2c11d61e868fc4afb12e56656f8a05","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-041","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"fca9fcfacc6c485f6978819302a3fa2c2e676cbe1db36f1cf778b3a0251537e3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":210,"source_line_start":207,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"9821c3f11ee61fc52f048dfe784028eda4b8df04e41aaf2ec20edc175c25339b","target_edition_id":"edition.r017.id-id.draft","target_line_end":210,"target_line_start":207,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[207,210],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6b3994cafcb31e517de3ba5eb58cffb6b566fa86161569903fbc74965b829b4a","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-042","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"33a6cace4af8bf63d9f9646dc2a83020beddc44c15b1507bee391dd30c8701b4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":212,"source_line_start":212,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"1bd292bacd1eb832177369e446474de09ed6ebb4a01b1bcb0d52019d5765a058","target_edition_id":"edition.r017.id-id.draft","target_line_end":212,"target_line_start":212,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[212,212],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb7cc570f7bf510d6a38335edae3ffc0cb92a54c1e3ef4f8eed5a3765ddc9960","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-043","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"ade1a4eadbd7c8f0ac3c4557e7f494a89b7b0cb8dee25916044e019489965fa1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":215,"source_line_start":214,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"21f4ab1266dcfcd223e6131dee2dd021b1a3cb1e778b984207736df5510b06e3","target_edition_id":"edition.r017.id-id.draft","target_line_end":215,"target_line_start":214,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[214,215],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7754d49a968ec20c4fb3f971eab500489c29f6b0e72c2338828d6e364d0799c2","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-044","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"88a750a28efa7368d7724e97c00ee3a95a883c2b98fc396957a8c57baafdf702","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":217,"source_line_start":217,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"a8a3f82cb0ff045ff57083ca3a0780ebbc617ccb89dd11b8370280be873a0570","target_edition_id":"edition.r017.id-id.draft","target_line_end":217,"target_line_start":217,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[217,217],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0ae962cc158f8cec0d0ad7dd237c044179d7cc1ed03679dabb55232525fd35a","concept_ids":["concept.convex-combination","concept.convex-set","concept.halfspace","concept.polyhedron"],"id":"segment.r017.book1.ch06.text.block-045","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.convex-combination","concept.convex-set","concept.feasible-region","concept.halfspace","concept.linear-combination","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"56bbc32c61db8e42ecad58e84a5d29a93b8ba73218afbf6016f9ac5c02459ffc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":220,"source_line_start":219,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"9392717fb48e5e576dc649f7afe60ab0439542ea3fa4456ce6e6093e2f5003d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":220,"target_line_start":219,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[219,220],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16df1019f9c74ba47a5cdcdf8ec37532f42735db6a283aad2803e19b0b262a2f","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-046","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"0db97c67ea76d7a1eeece30f7fb2e6e73d4f7d4de350a2bdea8e8b96dd5c0e24","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":223,"source_line_start":222,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"84ba29044c1ae3dfb1e88301cfcc66efe84c5a839c6150e4a093a10283c10794","target_edition_id":"edition.r017.id-id.draft","target_line_end":223,"target_line_start":222,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[222,223],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a9962d405cb5eb583a0a27182742fce920921ed064212dfd1bdd2f49ce926cfa","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-047","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"518e72a2c92a4d247f6e370e5113cc8fe1cd85b4f0d122a94f1581c30e01840d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":227,"source_line_start":225,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"f50527b56c9c3c5ac703e3a9467d979904ff27acd032800d8fecb5bd35b9e601","target_edition_id":"edition.r017.id-id.draft","target_line_end":227,"target_line_start":225,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[225,227],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ad2c34258aba9bbda1ea8b0e6357125f1fe1417f35c3701202a1f9c8da3a5b22","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-048","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"4c5abac4ecfdbced2e9329a06b841c695ff36e5147065ecc6c8592f0fe0b4c1e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":231,"source_line_start":229,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"4c5abac4ecfdbced2e9329a06b841c695ff36e5147065ecc6c8592f0fe0b4c1e","target_edition_id":"edition.r017.id-id.draft","target_line_end":231,"target_line_start":229,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[229,231],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0c74f22546b3a029a28e4a02b0d864f1acbd7241df8d4c4b0cc9379f88d9d046","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-049","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"1bd89559fb3deaa1956b6e74bf3a6d6de77b58bf99a84d4421f7e637c9fc7f18","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":236,"source_line_start":233,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"d2d6f6fe34ea4bb58e9a1ee4556a2403a16c91edaa8f44cbf3bc9edab3bc07a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":236,"target_line_start":233,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[233,236],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"adc811efdddb708bac25e7de6df23725277c2ad217a3b2df71a3993752e8f278","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-050","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"f0d28a51b48d352cbeae8bbf342d04bdf02203f91abbdc51febd856e99a0b201","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":239,"source_line_start":238,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"9b013cf2b85291d220725756ca90ebe9917633706e36a359a3a102b645df858f","target_edition_id":"edition.r017.id-id.draft","target_line_end":239,"target_line_start":238,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[238,239],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3e4444f0c8fc0e89389f411e060a2c685a310db286a17e27f11e15068ac59244","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-051","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"b767747d9316da4028c738732ccb21f9d5a2f2451b391ee9e8dcb11a2953c6fa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":244,"source_line_start":241,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"2a1335b668e5c02bf2472bafb13d9aab4fb0feda9eb77b7a33c8291ae368ec57","target_edition_id":"edition.r017.id-id.draft","target_line_end":244,"target_line_start":241,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[241,244],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd484912e3e99fb2a8c60772931eea1d0de3b07778b5332324f319bf5bcbe85a","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-052","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"823161c7d2c4ea640ef3c361e57dc6c1539a50910701924edb6fd752966e9e35","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":249,"source_line_start":246,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"6b4a5c04d689c411d0e73ce12e0401044c593b276f1f9d6be3266f94b502eb3c","target_edition_id":"edition.r017.id-id.draft","target_line_end":249,"target_line_start":246,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[246,249],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc0efa049e81514f8b922fd279070da2d5a6dd04c80f82a2ca0aba3ec9947d0b","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-053","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"fc8b5ad323f72126b03fdfbb38f5ee1475b9d4184fa36c0366a8fc0feac3088c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":253,"source_line_start":251,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"5c3c7ee70903f6070970e216ccd9be0d3d3a3bbc60bc4c41883082b1a9cff363","target_edition_id":"edition.r017.id-id.draft","target_line_end":253,"target_line_start":251,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[251,253],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e46148d971048514b7a2fd2056836667e917fba72b3d3653116d7b7ea43e54ac","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-054","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"70483243e6e25e05fa1bc4f34b17ab734d3c5becb5fb0110dd1b95cc98263ab6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":282,"source_line_start":255,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"15c0635e577b5086c0dd812047125cdb5275af28427972f6797b4f56a7d63c4b","target_edition_id":"edition.r017.id-id.draft","target_line_end":282,"target_line_start":255,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[255,282],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3e25167a8f451e65f67a3d82dd5f96c0ef493cfd78b06abc7577ca1db6ce9984","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-055","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"ba523ba2ead92e31c4a1f87c5417d55023b718ae9a483abdd8caa680afe96708","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":291,"source_line_start":284,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"3895dff73da00dd7abd25d8261b18bca599f532c89b52be1273d9cc296588fe0","target_edition_id":"edition.r017.id-id.draft","target_line_end":291,"target_line_start":284,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[284,291],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f6f634498d9ef764994f85d5e256c581675ac647b9fdcea33cb3342bdbd8cd1b","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-056","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"aec53e246f621cef610b7b3868da0f33a772348a666072e2e34c083e1509d184","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":322,"source_line_start":293,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"48e9dda23c65d74ab4a8389c3849d5a7ae42dae05dc633137f0abf62130177c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":322,"target_line_start":293,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[293,322],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20509031625ff76bcec0d1f4133a9e9f852ee9f51f02802d1f30595e284cb1e9","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-057","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"075f54f49fb95bacb8651c92af03fe191770a809947a88c479d16cbf70712f4c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":324,"source_line_start":324,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"075f54f49fb95bacb8651c92af03fe191770a809947a88c479d16cbf70712f4c","target_edition_id":"edition.r017.id-id.draft","target_line_end":324,"target_line_start":324,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[324,324],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e426dc28767691773b1a896f93838242b38906ce37a96580eb90cf10590532c","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-058","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":58,"source_content_sha256":"01d387fd9420e124e9e78cd4953b11337550bf770b113bae2823471c4fcbdd94","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":365,"source_line_start":326,"source_local_id":"block-058","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"6bc0fda38a743065706c0d10d650868b9af4b1a1fc6f553168a8dc74eaeea2d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":365,"target_line_start":326,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[326,365],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94e1929288c38ab6f786c8355b24147141ed60255051fe01eb16d60ff4da5fac","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-059","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":59,"source_content_sha256":"1a486bd620bc3d90447fa99625a2545705ad86f4d861e04f4d0b3a0e9d727eb7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":368,"source_line_start":367,"source_local_id":"block-059","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"02e58899c42ec29c7e3cc0614a883bae0b35124ce65aed15c39a656e6fdc4340","target_edition_id":"edition.r017.id-id.draft","target_line_end":368,"target_line_start":367,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[367,368],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9bb2ea707402090b3906ef9f3da19577e672b5da43a8783dc39a2ce5e8db1b2","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-060","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":60,"source_content_sha256":"a4496481cc059941d0ac291f45b1c98fc8573df7d7935c7a42228cfc58c710fe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":375,"source_line_start":370,"source_local_id":"block-060","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"da137fc45ae213faf60c7d3840d48852ca987772609ffc472a9ec0114ffa703c","target_edition_id":"edition.r017.id-id.draft","target_line_end":375,"target_line_start":370,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[370,375],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6da172cc51afdbe297ef11985a5a0ff97a287511396b0e75d2b6a2a8b0f18e16","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-061","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":61,"source_content_sha256":"4c5abac4ecfdbced2e9329a06b841c695ff36e5147065ecc6c8592f0fe0b4c1e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":379,"source_line_start":377,"source_local_id":"block-061","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"4c5abac4ecfdbced2e9329a06b841c695ff36e5147065ecc6c8592f0fe0b4c1e","target_edition_id":"edition.r017.id-id.draft","target_line_end":379,"target_line_start":377,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[377,379],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"89131883a5aac062cb43040cd42e230666fa285b85a0676071dccd1afb9f3593","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-062","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":62,"source_content_sha256":"ad90850fd25c9378389ee1be3321c7bbb65e259b52aeff9d2b306c5468aaf246","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":382,"source_line_start":381,"source_local_id":"block-062","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":62,"target_content_sha256":"f5f7e949744413fd77f1a9cf18f3d98434cd954a3a86fdb9abcaf3a23bbb6b95","target_edition_id":"edition.r017.id-id.draft","target_line_end":382,"target_line_start":381,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[381,382],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b8351df25fc0bfe19065b8130dd1ac78efb24487ff608397fbb3b195cdc1e9a","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-063","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":63,"source_content_sha256":"b2d04bb93b58e2ad17b6fee098bc0ad640ffd43d45c58af8fd6ac9866d10d5ee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":385,"source_line_start":384,"source_local_id":"block-063","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":63,"target_content_sha256":"3582a224df0b3549bf6e349d8691ddcd8edd52b1b0eb20f3af42c5cc002c312b","target_edition_id":"edition.r017.id-id.draft","target_line_end":385,"target_line_start":384,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[384,385],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"95e38711b0776d468645f99a5ad17c7afb99835bf4be2e7be18ee9fd268aaf06","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-064","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":64,"source_content_sha256":"e6874a5e71be8d7e9715dc0615cb2145f82e38ead0f7b8228cb4ed75eeb482c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":391,"source_line_start":387,"source_local_id":"block-064","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":64,"target_content_sha256":"658546aa5cb4c2b3e133c3deb670d4a8c1f64b690b20768907104c4918e49567","target_edition_id":"edition.r017.id-id.draft","target_line_end":391,"target_line_start":387,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[387,391],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8d16f2f5fb4b5372181a666f60e470a45c297212902fa57090d081f47a9645f","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-065","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":65,"source_content_sha256":"b0a589afd50d263d90383b902bae55b6fe973c0b88f900e7dd05aaf4269b796a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":395,"source_line_start":393,"source_local_id":"block-065","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":65,"target_content_sha256":"655b1486a05a9b7d65e0435c6d83765d15c771b5cfaad417a1fcfdc5792f58e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":395,"target_line_start":393,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[393,395],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9844d9fa41e4c8782285703c1fc6f930b85a8065eb0153f5ab563213b82d9b2","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-066","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":66,"source_content_sha256":"5fbbb57912f580945b11d436f2a7c821742c0bcd5882150d192406c815be963d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":400,"source_line_start":397,"source_local_id":"block-066","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":66,"target_content_sha256":"f1b5eeb137de78322f98d29afbc54098db23ab4d2f6448bf2946c644e64f1fa2","target_edition_id":"edition.r017.id-id.draft","target_line_end":400,"target_line_start":397,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[397,400],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b004a743e77cc270a490867a031cc20307cc215cc34b89bfa359dc3ec4d57500","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-067","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":67,"source_content_sha256":"f0d28a51b48d352cbeae8bbf342d04bdf02203f91abbdc51febd856e99a0b201","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":403,"source_line_start":402,"source_local_id":"block-067","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":67,"target_content_sha256":"9b013cf2b85291d220725756ca90ebe9917633706e36a359a3a102b645df858f","target_edition_id":"edition.r017.id-id.draft","target_line_end":403,"target_line_start":402,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[402,403],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d239ca85cd61677c3c095883ac17f5de99ace86a7aa147750655d43adbc9c30","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-068","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":68,"source_content_sha256":"5e1452c7ac1bf88a7c08edbcaa42683dd58294a44a3a9ee656ef8513fca66547","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":412,"source_line_start":405,"source_local_id":"block-068","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":68,"target_content_sha256":"d772041f8b54f716cfcb9159c6d8cdf9a167ec5adb5a54870ebd1bda267a6ea0","target_edition_id":"edition.r017.id-id.draft","target_line_end":412,"target_line_start":405,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[405,412],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"01fd0382664f24a6510750dddf55fda63ae653733c069a19a99fc49d94c6a997","concept_ids":["concept.convex-set","concept.halfspace","concept.polyhedron"],"id":"segment.r017.book1.ch06.text.block-069","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.convex-combination","concept.convex-set","concept.feasible-region","concept.halfspace","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":69,"source_content_sha256":"92e1083f182c560cec5b7fef8a7ad3aecb2c72d2b55fa4ceb29ebee2fe17c398","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":421,"source_line_start":414,"source_local_id":"block-069","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":69,"target_content_sha256":"b253755757041863f9169f45a1b122885110745fe0a0dc9459c262a31904d3c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":421,"target_line_start":414,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[414,421],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c335e98c5182059ce0fc3424b4c1a620816871e3b49e18ede999df645576007","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-070","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":70,"source_content_sha256":"e01d50c4f1067394e97a2fc33c3686916133a8945628eee4dc180144048ce67a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":427,"source_line_start":423,"source_local_id":"block-070","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":70,"target_content_sha256":"d4d9838f035ab53b8255d01f87fd67d333a52558e5055ab1ab0a3ed87075584e","target_edition_id":"edition.r017.id-id.draft","target_line_end":427,"target_line_start":423,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[423,427],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"956428025cc299454fe8d4c307d9db1d0d3cbabde28bf66dacbcb32febb792bd","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-071","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":71,"source_content_sha256":"300b899fecf3538eae5f4696657aadeee172798521705c48fca3341a77b99040","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":433,"source_line_start":429,"source_local_id":"block-071","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":71,"target_content_sha256":"99dbc5e45ec3bdd89f24d4d4864dc4a3012f85805d3d40f6d1b75f7f4084ab7c","target_edition_id":"edition.r017.id-id.draft","target_line_end":433,"target_line_start":429,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[429,433],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3bc7f483ae9658a9f131beba95dfc305c181779ddadaa3faae4cf9bd1da6747c","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-072","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":72,"source_content_sha256":"5f988235d9467871fdac2879d324bc22ceeb4b519bf73649abcb5d5fae4576d7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":447,"source_line_start":435,"source_local_id":"block-072","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":72,"target_content_sha256":"502a19a715e18b5a66f9035c453ddd19b9728e186e81784c1ae25567a0c847e7","target_edition_id":"edition.r017.id-id.draft","target_line_end":447,"target_line_start":435,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[435,447],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ba720b264f8db3b9ad4ea252b44b7feeb7c50b564ca2f38a043610ef1cf4bece","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-073","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":73,"source_content_sha256":"8607b85704fcc3f390b232f4434ba44f22b78171afce441c59cc594e0e0bfe16","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":452,"source_line_start":449,"source_local_id":"block-073","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":73,"target_content_sha256":"0ea19a19087c115350461745ac98ee2e666449f053483f66294e5c23ec0d2c99","target_edition_id":"edition.r017.id-id.draft","target_line_end":452,"target_line_start":449,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[449,452],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cbf4dafe5ef30b5419aa927e1d2a6d1b6fe9b6d381529ca3943be08c0a447edf","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-074","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":74,"source_content_sha256":"80e62f2bb1eb6c141f093f57f9bbd5e0c39ded456895044a4af6762584be1dac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":455,"source_line_start":454,"source_local_id":"block-074","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":74,"target_content_sha256":"e025e679514a3fc1a5bf2a7e8948ad42af48fd328f548ec754126be189736bc2","target_edition_id":"edition.r017.id-id.draft","target_line_end":455,"target_line_start":454,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[454,455],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2aa3fb7aec47d4df73fd9e59f844253a5151bb9b57670bf3d212dbbcdfb8809a","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-075","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":75,"source_content_sha256":"7fcbbe070d71e379bc59c74c67a087e4485b72e611f855e1ba71177e9f4fa0a2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":463,"source_line_start":457,"source_local_id":"block-075","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":75,"target_content_sha256":"e960f3cc2f5a53fa5e0b0e73e9f704f2ec329b2577defa84e3c8e4c4eab58a35","target_edition_id":"edition.r017.id-id.draft","target_line_end":463,"target_line_start":457,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[457,463],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"380245c58133895ba91eac2026f47644ff83ccbcc085e87858d66fc02b080ddb","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-076","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":76,"source_content_sha256":"91b44f9ec2bb2fad7848f2c5e49bdc7f4dffc4f425b3de24449aaaaae6a631fb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":466,"source_line_start":465,"source_local_id":"block-076","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":76,"target_content_sha256":"13dab888344f74ffccd077d3e064b8c16f4fa2cfc56fdfb1de62f2e120af2d82","target_edition_id":"edition.r017.id-id.draft","target_line_end":466,"target_line_start":465,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[465,466],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90876bdb843b29efa38b35c75861e54707ca60c778427d736bf9d519f5c1ccbf","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-077","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":77,"source_content_sha256":"aca71636c9cc10aab94d52a12098e5dddd2d61f28481ebf45e1985889331bdc0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":474,"source_line_start":468,"source_local_id":"block-077","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":77,"target_content_sha256":"c7915d544ae11431c45124fe3e455469ba0f8c9d64b92168e24bc70e5ac71101","target_edition_id":"edition.r017.id-id.draft","target_line_end":474,"target_line_start":468,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[468,474],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a91a1337d45d1a696779e787e2c2aad56f7512a459aa947e1fbd1072f596ec9a","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-078","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":78,"source_content_sha256":"9c096ef4894b8bc611ca61b145ef941a6ef70625c432104c903c0c5627f13c3c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":476,"source_line_start":476,"source_local_id":"block-078","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":78,"target_content_sha256":"40df697686aa6cdaf33495359cdf84dade5053aa9cdc93cb851a7226cc0edc96","target_edition_id":"edition.r017.id-id.draft","target_line_end":476,"target_line_start":476,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[476,476],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef37b1e1b22ef5031bb9f4381c2b648a2a706d1041499b3135e57ccd463b3cfa","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-079","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":79,"source_content_sha256":"c418fae7407b5ab6651ea9d6a3f11187596ea47c79a4eb6a4e7621c3da4b7967","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":481,"source_line_start":478,"source_local_id":"block-079","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":79,"target_content_sha256":"9ac6f09fe3fd133bfc6ec85d08264c0c9c0cb19bb4af3e388bd5496815383f6c","target_edition_id":"edition.r017.id-id.draft","target_line_end":481,"target_line_start":478,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[478,481],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1cc093d6f0e79852bfc0dc1643234bbbb03a2aec91cad0c5dfc50e8e36cac7d4","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-080","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":80,"source_content_sha256":"80d43cff0d375ef7c38a1d12db01bc28baaa2089245dc90cb5d4b33251561ed2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":485,"source_line_start":483,"source_local_id":"block-080","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":80,"target_content_sha256":"ccd91a8b74d1899c52c910b407e3b2fbda67ff7d33dd2bb84871aedd715b2793","target_edition_id":"edition.r017.id-id.draft","target_line_end":485,"target_line_start":483,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[483,485],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1be35a17dbe9eb7dfd726ec7b78b5c3f9fa8d22c88c147eaaba0af3b40ea16cb","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-081","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":81,"source_content_sha256":"1372d25f6bd17e735f5606c546cef45b2461655ddbf52c653b369e25cc16368b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":488,"source_line_start":487,"source_local_id":"block-081","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":81,"target_content_sha256":"4d8eb634bb5494cdbc3d9fedc7129f034e7bd9974f8d871aa69656e6f0b51a32","target_edition_id":"edition.r017.id-id.draft","target_line_end":488,"target_line_start":487,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[487,488],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d0ccc772a60986c26b3df1c71920e53ca737f20f2c15b12708a30cb5cc9e85e","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-082","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":82,"source_content_sha256":"bd31ef6ab59f84a0de0561436c0502ff078e6cb730188ebe31e7380f267150c6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":492,"source_line_start":490,"source_local_id":"block-082","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":82,"target_content_sha256":"40ceee8527cf8fe25675d204dc70dbd5cd14cf02edb61704382a7443f28648ed","target_edition_id":"edition.r017.id-id.draft","target_line_end":492,"target_line_start":490,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[490,492],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d57349506b5fff42c8758b4c3c8c41fbb7b40c133321be3ae1d8cb600042d385","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-083","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":83,"source_content_sha256":"6ec30a5b5ca97df39b8a7b3f73dee590318f6780bd9e4550dd89cdf3f6e6570b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":496,"source_line_start":494,"source_local_id":"block-083","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":83,"target_content_sha256":"4c40ec5975114e167820e066acc765f5a1ac9b8779f36877c5fbf93791cd56d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":496,"target_line_start":494,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[494,496],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1934466a300144d577c1935d59d9469643eaab3c4881c816282ad0a0ef2f8f61","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-084","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":84,"source_content_sha256":"fbf51583b426fc03c9660645840e02e69927805266b5545025b8480427f34021","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":499,"source_line_start":498,"source_local_id":"block-084","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":84,"target_content_sha256":"87b3fffc150b0df2bef5a75fd1c3b5238c3b407325387e6ab7548585a558b0ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":499,"target_line_start":498,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[498,499],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9268139a998c711c7afe035592d4871722088164b32afbe0c0a98409050a14c1","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-085","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":85,"source_content_sha256":"d62073add0f6f11c5ba593e1ccd5d69d774336e3fb7ffa66deb8460c87291d5a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":501,"source_line_start":501,"source_local_id":"block-085","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":85,"target_content_sha256":"263a04ebaf705457fb916a2d6b6a74a370fbb2ff094cb71f71dbae8d9c8b85db","target_edition_id":"edition.r017.id-id.draft","target_line_end":501,"target_line_start":501,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[501,501],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"028d457e4326c0e37a7eff97049961b4717642b6b32ae5e9c7dbfca92555a4da","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-086","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":86,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":503,"source_line_start":503,"source_local_id":"block-086","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":86,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":503,"target_line_start":503,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[503,503],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6bdecb0b78f3198e87f24609405a26bc40439fcf2136b543a6c5da4573178198","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-087","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":87,"source_content_sha256":"76dbeff01d9988220e9d52004b01a18ba8d78c9f8b1372b619a030da387e6490","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":508,"source_line_start":505,"source_local_id":"block-087","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":87,"target_content_sha256":"459e69ec0563f95370569f02f43d25fffeec7084fda1eb28f485b3ddb695c7b5","target_edition_id":"edition.r017.id-id.draft","target_line_end":508,"target_line_start":505,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[505,508],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5973c32abe42f7f3bfaee6c252c49db859910bb2327f6b6d625117aed7f4faff","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-088","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":88,"source_content_sha256":"1f2d646a143d47455ea299a68c06b133bb422579448aa023cb483fa94dc0cc3d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":511,"source_line_start":510,"source_local_id":"block-088","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":88,"target_content_sha256":"32e586839da2b0c848e0aa9db1f23e787289518608c427b22ab8ac45c06a9b35","target_edition_id":"edition.r017.id-id.draft","target_line_end":511,"target_line_start":510,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[510,511],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d968405551a6d6085bbec3194c90061e567504456878c17b4647466952fc78fc","concept_ids":["concept.convex-set","concept.extreme-point-optimality"],"id":"segment.r017.book1.ch06.text.block-089","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.convex-combination","concept.feasible-region","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":89,"source_content_sha256":"ef3dee83ec01bfef0ca2a665a089a40cc1f37cfca57eb92af9630804ffd86989","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":516,"source_line_start":513,"source_local_id":"block-089","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":89,"target_content_sha256":"358298245b76833113e72f58f8fe37fb378dd176d56a7108006e948b7db9d506","target_edition_id":"edition.r017.id-id.draft","target_line_end":516,"target_line_start":513,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[513,516],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61039bb01f72425c0111fb12cc238d052b5f1ef65b170e85f3d0cf286665b016","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-090","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":90,"source_content_sha256":"8e60e1645b6ecb8b155ca5d111c8bd2910459b481d8f5cdad1df0a6e84450e98","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":522,"source_line_start":518,"source_local_id":"block-090","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":90,"target_content_sha256":"70b4b2088591c4d4c56da4a1d806b9c4f8514a4499973841e1a1a0ca8031d119","target_edition_id":"edition.r017.id-id.draft","target_line_end":522,"target_line_start":518,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[518,522],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"74cbae5e655b846312de8e4f49cc355783e20f14f103d941dacfc45f44d74103","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-091","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":91,"source_content_sha256":"7516b7fd8cd6f1a892489df067a39899b0ec165fa13a3f38c2ad24acc3885244","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":527,"source_line_start":524,"source_local_id":"block-091","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":91,"target_content_sha256":"bca238261dd164d53d6932de012a52eaa86fef3354f0354c7728961d1687517b","target_edition_id":"edition.r017.id-id.draft","target_line_end":527,"target_line_start":524,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[524,527],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14416855c844a5e2fb0c449e17fcdc9c09f8fb14a761488112a98ef3b926c7f2","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-092","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":92,"source_content_sha256":"78698817efb704e82a1ee77e309f89bd50d4e0a9e10a2e8ee69c3c91336c6931","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":532,"source_line_start":529,"source_local_id":"block-092","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":92,"target_content_sha256":"68ee8f2e73924a1bc473cd85f7ab91a23517419e74a906f7d5ba36ca9fd03a6e","target_edition_id":"edition.r017.id-id.draft","target_line_end":532,"target_line_start":529,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[529,532],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"682aead4f3270afc54440c93d2678ea1f8df5450cef17ee930534ece58107367","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-093","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":93,"source_content_sha256":"d4ea247e87b634c0a9f5c32de9775c5c41d7130ccaa431b108b630497fd4d08e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":534,"source_line_start":534,"source_local_id":"block-093","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":93,"target_content_sha256":"3aa91de16e26af0c41cd48f69fbc513387e6cbae8c3d8c4ad27a2c614459cdce","target_edition_id":"edition.r017.id-id.draft","target_line_end":534,"target_line_start":534,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[534,534],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8b3dc03b3c313d98e1118cb426ef545282f2109e339e6fa0da15db02935b486","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-094","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":94,"source_content_sha256":"3edcd2c9fc9f90ee8802be20c53d873374eb009db446f2106a1fe4a64df08321","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":536,"source_line_start":536,"source_local_id":"block-094","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":94,"target_content_sha256":"9ef6ab30e0e7e26636dd562852367fe492ac63c12b5e4e25b32dbaa09d07382d","target_edition_id":"edition.r017.id-id.draft","target_line_end":536,"target_line_start":536,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[536,536],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76f4dff48a34524367df3d0e729a5454fe0a7152ca85553ade716c7d4a4d4b75","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-095","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":95,"source_content_sha256":"b2e15b3ae44075b64867962563dda3a6c5e2ac3a1de89abc2834de8c901fa4c2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":539,"source_line_start":538,"source_local_id":"block-095","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":95,"target_content_sha256":"76f327bd71f47d8fe54757dceac734964b982d6ce9a5bed195c80ff02ac8a597","target_edition_id":"edition.r017.id-id.draft","target_line_end":539,"target_line_start":538,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[538,539],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6facb002d8f5928bab37ba090d33338e9953c5a9f46c74edfe0fecd9f23952f","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-096","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":96,"source_content_sha256":"6a86796c3145ab26b201cdce8ab90b90e52786150a0a3ed5f2ee8b7d1f390d00","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":543,"source_line_start":541,"source_local_id":"block-096","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":96,"target_content_sha256":"e88477ced5c8b93d2a2eb1d1bd77b02d62096c300397cdecca00e61e692f1a37","target_edition_id":"edition.r017.id-id.draft","target_line_end":543,"target_line_start":541,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[541,543],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"35760fb551b9ec12da92a1008f19bc884eeecf714209a5a9da495f4a89462d96","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-097","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":97,"source_content_sha256":"b7f935133d2fa6d658bdbcd53db579eedc44833afd29191c409a7ea1f77293dd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":546,"source_line_start":545,"source_local_id":"block-097","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":97,"target_content_sha256":"033980a4506443e3e5e439b7e3f97d93b5963adc2082ae29ed6d4eaa9e04d1ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":546,"target_line_start":545,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[545,546],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6cb7b9997ffa5157da1f3341a51bca61754ad266155a792ca33a6da27ff92f83","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-098","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":98,"source_content_sha256":"0e69cb7cb4e438cb68d215eae8c4e4461bba8e9d25f565a84610f97fa6b21732","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":551,"source_line_start":548,"source_local_id":"block-098","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":98,"target_content_sha256":"258bec0f9d0f4038e2bd1f4eaccf6b38f696943697fa070536bed056686672fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":551,"target_line_start":548,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[548,551],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9dfaf75cab6c2becfe2e001d2a74cf57852522be021d60686f07eff3910c1959","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-099","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":99,"source_content_sha256":"361f6731dabb29c524d921fa20d38a557a8f08e4ed5f7afcf93b3adf8a01e0e5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":557,"source_line_start":553,"source_local_id":"block-099","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":99,"target_content_sha256":"d6c2203090d41d99a0a452df355daebaa714bbcec64368077a1cffc364949347","target_edition_id":"edition.r017.id-id.draft","target_line_end":557,"target_line_start":553,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[553,557],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da5bdede9fe1d6b904707b82747164e8d5dd35b1232cb530e95e6743d945ae70","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-100","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":100,"source_content_sha256":"e1aa268b8e653af8c34595e14d9538990a7ca3fa79f30b51977adac1d8cdf0af","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":559,"source_line_start":559,"source_local_id":"block-100","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":100,"target_content_sha256":"26308da73e50af2cc190c8cad8052ad1e488d80098077273bf1a202764c863f3","target_edition_id":"edition.r017.id-id.draft","target_line_end":559,"target_line_start":559,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[559,559],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a39c0e131c6da6a460ea4bfb8e03cae0ed0e82c84fb9011bac6cda8acdc5cf9","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-101","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":101,"source_content_sha256":"bd6e8072abe7fd0cb64b94f2f21c08551df40d90813fa43fa95647b44b351f85","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":565,"source_line_start":561,"source_local_id":"block-101","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":101,"target_content_sha256":"310e9059f9920c4f07fa27cfb21ee3ce16fd36006e801084bec93435d1c73cd6","target_edition_id":"edition.r017.id-id.draft","target_line_end":565,"target_line_start":561,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[561,565],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e70745690351c0fa91cacb3684173b1771800edb2ed630e2567a5eadc07587f4","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-102","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":102,"source_content_sha256":"d5975295c965f0b58bd39997f394218a96f6b80cc2c6bcc784e5dc06377301ed","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":570,"source_line_start":567,"source_local_id":"block-102","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":102,"target_content_sha256":"4d8b5ddae4a48dd300a1f5703cf895b96738338cd4c05fa6742e60b1401443e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":570,"target_line_start":567,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[567,570],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d12b6a28e8d0df9823e174317f2843f696f9bbc756a457e077dcb089d3ef4f1","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-103","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":103,"source_content_sha256":"c4a7714e6d34c9c78fce5f21a8cbee1fc93c08e48510e889f5d1e5167c391fac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":573,"source_line_start":572,"source_local_id":"block-103","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":103,"target_content_sha256":"5ef10848f81ad40eceea90cbc900e9508dcabdbb2e67f4932f431daa6216bfe5","target_edition_id":"edition.r017.id-id.draft","target_line_end":573,"target_line_start":572,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[572,573],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1156e23a19f0a111dff8ea615693ef17074f9781195ede3ed4103577008f22b5","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-104","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":104,"source_content_sha256":"b191c56a139b7f7662f9ddfc29992dbc52c3efdfc32704012df6ded3ec96944a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":579,"source_line_start":575,"source_local_id":"block-104","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":104,"target_content_sha256":"2dad44de4981db167c881964f799c0e6f368a1949901eed19e42712bc4bb9cc7","target_edition_id":"edition.r017.id-id.draft","target_line_end":579,"target_line_start":575,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[575,579],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"96641bac3348bbb885684da9dc25ca905e0d597401b98df5b806bba5ba575d12","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-105","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":105,"source_content_sha256":"aa23f922ef4c50f7aeda3abb6b6e2e52ed46ee39914ff5f6eb115d01c2ed887e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":582,"source_line_start":581,"source_local_id":"block-105","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":105,"target_content_sha256":"1af68d5a850c71943705ccb6241f099a2171a9afe9ac8636deeac7ee786d6283","target_edition_id":"edition.r017.id-id.draft","target_line_end":582,"target_line_start":581,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[581,582],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ecd6b18de31cf61bd72005b423159abd00a5c51aaddda09a3d65970028dcf871","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-106","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":106,"source_content_sha256":"7f7d901800a406125a36aa6674c3287af69f4ad89f55e47075980521c686209c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":586,"source_line_start":584,"source_local_id":"block-106","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":106,"target_content_sha256":"32ea5e8ff99a26bf536ad5c6b7eebb96f066dcf183f2ad69dfad265b223613ed","target_edition_id":"edition.r017.id-id.draft","target_line_end":586,"target_line_start":584,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[584,586],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"528311cdce77e08866fc604d2d23cfea40971cb8e22225497889b688c50d5380","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-107","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":107,"source_content_sha256":"6c0cc410be6064189dddc2882c57e3f6d8e001b2ff002133c558fe020adac8c6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":589,"source_line_start":588,"source_local_id":"block-107","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":107,"target_content_sha256":"5119281ad61aca12fe6f34a1c903ee650cc1459cc99400ceee9dbd0811c29bca","target_edition_id":"edition.r017.id-id.draft","target_line_end":589,"target_line_start":588,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[588,589],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9339e189d82f2598f02e873d7c854559cd49ad83af718f2a4de60a764a21949d","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-108","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":108,"source_content_sha256":"5661212d21bbe871602b72b93f6804297f456e8c94e80b17434b66edc1a42883","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":593,"source_line_start":591,"source_local_id":"block-108","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":108,"target_content_sha256":"a5c61fdafa11e5c92755e3be61c7507d8f2b77d875d7f3674913c2ca63e5ba9e","target_edition_id":"edition.r017.id-id.draft","target_line_end":593,"target_line_start":591,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[591,593],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7241f8a2315ca33e895449278f6f855dbc48e63bf0d40d30d1953a3371ce1cf4","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-109","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":109,"source_content_sha256":"7772fa17419bac73c446eb5e69b761f5600dcd107f9253016c35337bd568d4ad","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":597,"source_line_start":595,"source_local_id":"block-109","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":109,"target_content_sha256":"a1440308ef8fe12cb5a0a60c1fb88fa0bb92bf474fd014cde31fd6a967a23cf0","target_edition_id":"edition.r017.id-id.draft","target_line_end":597,"target_line_start":595,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[595,597],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a5ca2897b964155976728d1ae407ecf0868ae6605cf79139edd4d98439f9d09","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-110","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":110,"source_content_sha256":"1a848560baf1807094b34bfd80d13ee7253e53c5a7952cfd1897fe76b37f9bd2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":599,"source_line_start":599,"source_local_id":"block-110","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":110,"target_content_sha256":"daed5baacd6c5a7261ad1b91923a892b53585785c571a96b3750fc276fe4170e","target_edition_id":"edition.r017.id-id.draft","target_line_end":599,"target_line_start":599,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[599,599],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"889b36a7bbdf2bc1d2c274c146899e8f9fd886ec8ff1ad56dc11fc1d4ae4fc96","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-111","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":111,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":601,"source_line_start":601,"source_local_id":"block-111","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":111,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":601,"target_line_start":601,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[601,601],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc09b18056a16c2fe98a59bd84cbb4eb1952e2062c7dd9dfbf87a391fe479e6d","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-112","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":112,"source_content_sha256":"ddf6926ca9ffb6813cbded21bdb8cbcea9dd5f0b0835d311449f0f6372621cd7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":603,"source_line_start":603,"source_local_id":"block-112","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":112,"target_content_sha256":"52b9c57921e044bfcc264ae1b7d0012020cf86ca51e472ad41225a54b36e9cc2","target_edition_id":"edition.r017.id-id.draft","target_line_end":603,"target_line_start":603,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[603,603],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e179f4d1e902b2d8ed01b1ea3905fc2872d1cf2533b824e9ad9734df4f0925eb","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-113","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":113,"source_content_sha256":"7da2a8128cec32d35f3462341d55d992c82428afc04c2b38917d7ed48fbae641","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":605,"source_line_start":605,"source_local_id":"block-113","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":113,"target_content_sha256":"74506387b189d355dac4f5f04290ee0fb406a2889f187208dbfcbfd306c4409a","target_edition_id":"edition.r017.id-id.draft","target_line_end":605,"target_line_start":605,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[605,605],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2a7e8b9f4f3b65a077d5137af1d1608ae137b99296dcc5b155d25a07ce9fb31f","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-114","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":114,"source_content_sha256":"adc0eb2d9a6d83e9431eed663cb2d53e9d3c9a27983af7b7d7833a3752ae7133","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":611,"source_line_start":607,"source_local_id":"block-114","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":114,"target_content_sha256":"1ef22d55ac7470dc27b704f0b4117cc6107a3fa7c5842e93dd0c26be6ea70698","target_edition_id":"edition.r017.id-id.draft","target_line_end":611,"target_line_start":607,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[607,611],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"699084942a969a5b464d7608db5e5028441cad9dbbf8a253ae4b61471a663f67","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-115","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":115,"source_content_sha256":"dad1e01be5a9bbbd24de6fb8b3f5de45fce0cafac2ca4b356300a464c059de38","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":622,"source_line_start":613,"source_local_id":"block-115","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":115,"target_content_sha256":"849b10ad1d98fd078a1c62aa0f1395b19d01470b8bb0d3e6bfe856dc29c833d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":622,"target_line_start":613,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[613,622],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f6f712083bcb42d91aa7ee8087c12bb42c9e7e58ab0b512dfb6bda33ccae9b93","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-116","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":116,"source_content_sha256":"ac973c34f5b25fad35501fdb34437363af526bb1e24b6f6242b4e02dc2ffc80f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":624,"source_line_start":624,"source_local_id":"block-116","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":116,"target_content_sha256":"825c349c5f59f24eb6b9cfb6da0178621aa28cab8b11253cd990058d18537c46","target_edition_id":"edition.r017.id-id.draft","target_line_end":624,"target_line_start":624,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[624,624],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bceeb4c2b722b40094b6bb5f051c3aa05090f82511f44f9fe60ea8f3ed30b47b","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-117","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":117,"source_content_sha256":"da89b4ecce2e9c901dc2371d1dd477d91ceaeb1d94406943f628dbae9cc0561e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":626,"source_line_start":626,"source_local_id":"block-117","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":117,"target_content_sha256":"5f29ed2dadba1f6fb9bff43fa194de3ff62be967a491e9e646169d08d507996e","target_edition_id":"edition.r017.id-id.draft","target_line_end":626,"target_line_start":626,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[626,626],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4cf48f94903f47ed15ae0284a174574d9180fb44fe5be057ea650ceada425d0","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-118","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":118,"source_content_sha256":"0a4a0175b418e996410b0e1371ff3fa3118da00267de40fa395ca2dd9bf127d7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":628,"source_line_start":628,"source_local_id":"block-118","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":118,"target_content_sha256":"687d70df7561bc53cb9d89d049a5c625e1facfec4bcc3e29850ffbf61e58aaa5","target_edition_id":"edition.r017.id-id.draft","target_line_end":628,"target_line_start":628,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[628,628],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a1add37558c56003030822a3d13b8cce0e926096f4e2ff5919d15b0455e2b734","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-119","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":119,"source_content_sha256":"58cdb5a2d32697240dc0d7746f4c6caf0e2e9cc82a9a050b04df071ed2ac3133","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":631,"source_line_start":630,"source_local_id":"block-119","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":119,"target_content_sha256":"6a065132334c12d9e90fb61476c2a1b3b031729457d86acafd84819bd5520fd3","target_edition_id":"edition.r017.id-id.draft","target_line_end":631,"target_line_start":630,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[630,631],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3fad8d45c9b6bcf55f39e15da780ba5d45f8f047baae81f00c6a67ab57e49e53","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-120","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":120,"source_content_sha256":"e4e78b333715f92e725cda24b366bfd57a5e1a4cb5f025d7fd1f59ed69b43bee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":633,"source_line_start":633,"source_local_id":"block-120","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":120,"target_content_sha256":"de8c1b3d2922bff9d064feee1107542dca4ffa716e87e0e312d9a37ae6968f78","target_edition_id":"edition.r017.id-id.draft","target_line_end":633,"target_line_start":633,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[633,633],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d6e6689ec57318bbe65302d25a461d2414dffd68194fae26a844c0915a51c2f","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-121","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":121,"source_content_sha256":"07c9174512956e0373afe9dab91210d81727c8abc60cf7c3610fb7f9a49c5034","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":640,"source_line_start":635,"source_local_id":"block-121","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":121,"target_content_sha256":"ef8a35539ec9114cff8456b1242d5bf4ced05780a693697a7c0083b34dab7832","target_edition_id":"edition.r017.id-id.draft","target_line_end":640,"target_line_start":635,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[635,640],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2a6b9f112eb3ec05ea13146b3469ea25d7601d2df8a781efc26e1e62772b012c","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-122","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":122,"source_content_sha256":"c7d83edc92163f5ee6c9395a32c836f6f21ae80598f6923b1fbaeecca0d22a9f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":643,"source_line_start":642,"source_local_id":"block-122","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":122,"target_content_sha256":"96d988b031d97ccff75942b77d4f7222d06ecfaf784e60d1241685b6c3d7ef4f","target_edition_id":"edition.r017.id-id.draft","target_line_end":643,"target_line_start":642,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[642,643],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb86d02432ce79ec9bdfd650c54b2b3716e1dc7816c4e90ad23cd7ab22b9ae8b","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-123","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":123,"source_content_sha256":"caaaa7d69274dfbf5975160d96a4fb85c29ccba1f761d08380c335c42c84ded5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":646,"source_line_start":645,"source_local_id":"block-123","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":123,"target_content_sha256":"95ed0c3f3e18abf89deabd2163a8516cfc3a2ea07171ea3db965bc42772be510","target_edition_id":"edition.r017.id-id.draft","target_line_end":646,"target_line_start":645,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[645,646],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"300b535cebdfcd57642bd813b3a3c4922a251244c5aa53ff43fd8c9207531e08","concept_ids":["concept.convex-combination","concept.polyhedron","concept.recession-ray","concept.representation-theorem"],"id":"segment.r017.book1.ch06.text.block-124","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.convex-combination","concept.feasible-region","concept.halfspace","concept.linear-combination","concept.polyhedron","concept.recession-direction","concept.recession-ray"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":124,"source_content_sha256":"102e9cc12f0c4587a362917e9a1d52b16c1379b7b7e09d608dd883d16fa21fdb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":651,"source_line_start":648,"source_local_id":"block-124","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":124,"target_content_sha256":"f86f7a4b8d16b98cd944b6223978aafaeb227e14346d87a12843e78cbac2bdc6","target_edition_id":"edition.r017.id-id.draft","target_line_end":651,"target_line_start":648,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[648,651],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5186d8402723f4d0824a1823e71ee8185c7f9478b293cb0fba538e9995c43408","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-125","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":125,"source_content_sha256":"cca07ae5a9eb2789a6ea45270eb774aa5fde185bbc76a5e6407b697d43143035","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":653,"source_line_start":653,"source_local_id":"block-125","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":125,"target_content_sha256":"1389b5d45a4c6ffdb2599bddc36a3e73d59478f1631333f1094088f3e31ac31f","target_edition_id":"edition.r017.id-id.draft","target_line_end":653,"target_line_start":653,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[653,653],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb41a2b98790c2eaac70f79492277bfeda49f65a568b99ef20e246aa7de9c4d6","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-126","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":126,"source_content_sha256":"9de8631216affc61c7657033cd01c595544cb830752e59ac09773ee586665944","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":668,"source_line_start":655,"source_local_id":"block-126","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":126,"target_content_sha256":"7c262b267c356c261accc6d90ed4947e41448af2ba7d7cf8a37a09fc2ac83a95","target_edition_id":"edition.r017.id-id.draft","target_line_end":668,"target_line_start":655,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[655,668],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"506a80567bddc7dfa6d87f2780f363b0858edc5656597504904e087813dcf59e","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-127","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":127,"source_content_sha256":"112a0aed8027107fc822eab06440717334acc79d800f7c8a99c42c9a228cd788","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":671,"source_line_start":670,"source_local_id":"block-127","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":127,"target_content_sha256":"112a0aed8027107fc822eab06440717334acc79d800f7c8a99c42c9a228cd788","target_edition_id":"edition.r017.id-id.draft","target_line_end":671,"target_line_start":670,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[670,671],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"db11de95b607a04b3e326b1e60bbeccbd6bc7fd918c6e2ae0bd79bd52b1c93fd","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-128","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":128,"source_content_sha256":"761abbcc646eb5a94448ab8e0f847f2a9c7a504876de0c148c455258a4087c53","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":673,"source_line_start":673,"source_local_id":"block-128","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":128,"target_content_sha256":"761abbcc646eb5a94448ab8e0f847f2a9c7a504876de0c148c455258a4087c53","target_edition_id":"edition.r017.id-id.draft","target_line_end":673,"target_line_start":673,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[673,673],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"767c2ca65db39bfd5c7816db9d6a1e9e9f7ee440881139526ee82b87fac47589","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-129","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":129,"source_content_sha256":"8f6829d2d5f40ad9cdce02c177e48395aa5304a70f8b2d9f60d37f91c84cfe77","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":680,"source_line_start":675,"source_local_id":"block-129","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":129,"target_content_sha256":"8f6829d2d5f40ad9cdce02c177e48395aa5304a70f8b2d9f60d37f91c84cfe77","target_edition_id":"edition.r017.id-id.draft","target_line_end":680,"target_line_start":675,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[675,680],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2003d18a0ce4e583da52d90566be5979ebd8e3aaf3c6619588e2fc70f2bbdbe","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-130","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":130,"source_content_sha256":"a476e4926abda97f0f040210204a77f2a18586b7638498f6414e34fe9ccd2faa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":687,"source_line_start":682,"source_local_id":"block-130","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":130,"target_content_sha256":"edc1973518eba0507f826bf619b50c91cbdd5efaa1bc553cafb9360915f3fbde","target_edition_id":"edition.r017.id-id.draft","target_line_end":687,"target_line_start":682,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[682,687],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b90a02265063a324207c351b13ef2af93779d22ceb4d56ec4b56ac241eeab3aa","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-131","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":131,"source_content_sha256":"7e4de3f630394fe0b3469f746e6e1fd2791412bd790c5436ecae66c974229438","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":689,"source_line_start":689,"source_local_id":"block-131","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":131,"target_content_sha256":"de94c64bd0db200370ef6a064813dab5228afa1f2a5eb4349f07478dd2ca8bd8","target_edition_id":"edition.r017.id-id.draft","target_line_end":689,"target_line_start":689,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[689,689],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa510f4f16fbfc78a48f814eeea1a3484ae51ce1ceb0af9039d8e2b1b89df2ff","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-132","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":132,"source_content_sha256":"af22d1425d44906800dcb593b82933dbdde70a09beeac86280f18252b5bed60c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":711,"source_line_start":691,"source_local_id":"block-132","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":132,"target_content_sha256":"af22d1425d44906800dcb593b82933dbdde70a09beeac86280f18252b5bed60c","target_edition_id":"edition.r017.id-id.draft","target_line_end":711,"target_line_start":691,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[691,711],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0dc98176502695ec0d3973d7a6bca921484880b271eae702242716b8c5de5f8d","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-133","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":133,"source_content_sha256":"06122e3f4e834aa9d2ffed1f9cf834a3258ed3de4109f4b4984622cfb875233f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":713,"source_line_start":713,"source_local_id":"block-133","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":133,"target_content_sha256":"cec909884d7b76584d6608f8fbd89da69bfb6b64c3ee4383c4f58a087cd09496","target_edition_id":"edition.r017.id-id.draft","target_line_end":713,"target_line_start":713,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[713,713],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e8d1c675ba54daa8ecbc7b90a21b5b1c1d0594d76e579af1f1fcb0a6eda3a5fb","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-134","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":134,"source_content_sha256":"1e4ccc9ccba9038d35b6d9ebed7b22602bc3cbe77fc62260abb1d7f124da6cb9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":715,"source_line_start":715,"source_local_id":"block-134","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":134,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":715,"target_line_start":715,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[715,715],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d7271a70bf97f954392813f791923a600ac354d9d4825a4fe527a4cdb2dd599","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-135","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":135,"source_content_sha256":"a6c18cd910118035e9ea010f2ee79c798b3efbc009700c989db4ce6c1d1e71cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":717,"source_line_start":717,"source_local_id":"block-135","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":135,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":717,"target_line_start":717,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[717,717],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cef96f27932e972413fbadb8797d4a0d7c022bcc8d2fe75f2e8b026f1f21d374","concept_ids":["concept.vector-operations"],"id":"segment.r017.book1.ch06.text.block-136","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":136,"source_content_sha256":"5d47b6467673ef39dc80dc2ab46af4e202f410f65a809c5edba1c45f6c4be8bf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":728,"source_line_start":719,"source_local_id":"block-136","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":136,"target_content_sha256":"4ea08ed27f9a0c54e62125ec8d58d577c23b6302658dc5f71a67a4882befd050","target_edition_id":"edition.r017.id-id.draft","target_line_end":728,"target_line_start":719,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[719,728],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"72df33fde17d101be1f9a5a5e0bec4cfd533155dc4edaf0c1647fa074a3dfdba","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-137","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":137,"source_content_sha256":"b83646caf08ca230627f620592b0dfdde9a48b285c21a8540367106a43ae858b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":731,"source_line_start":730,"source_local_id":"block-137","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":137,"target_content_sha256":"80605d79b6e7517a39f562746cd588837c5e3d258a0a73263201102e18a0cb71","target_edition_id":"edition.r017.id-id.draft","target_line_end":731,"target_line_start":730,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[730,731],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f6606fc4e991a8dbdaa9258f60aaa362d1921a332d86520f0887d73d5f99523f","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-138","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":138,"source_content_sha256":"c340aa91c9487e28d4920875f67e4ac601dc563b055901815160abdd5f322abb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":743,"source_line_start":733,"source_local_id":"block-138","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":138,"target_content_sha256":"dec4862e31a336d57b689046896db6a927371a81cc1c911821b43922d7fcb62c","target_edition_id":"edition.r017.id-id.draft","target_line_end":743,"target_line_start":733,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[733,743],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"105e1148ffbf99f72304c323eb7ffb59f114330c11dcd344db1f08c930146b9e","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-139","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":139,"source_content_sha256":"97d419f9a6134c6ebff1ea9e0c5260fb5ff95c00370dc0e14f08e8a23f13e7b2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":753,"source_line_start":745,"source_local_id":"block-139","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":139,"target_content_sha256":"1fbdc579386b1fa5df55f52de90542f81e20135f10f9a2f0ede8486b3f8c6e92","target_edition_id":"edition.r017.id-id.draft","target_line_end":753,"target_line_start":745,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[745,753],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee181a60738780b1e6991c2a5059e3b3801ff1d70c46552e74ba2ad331734554","concept_ids":["concept.convex-combination","concept.convex-set"],"id":"segment.r017.book1.ch06.text.block-140","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.convex-combination","concept.linear-combination"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":140,"source_content_sha256":"e69411df9212223053f7b1f13b72e5891ce8aee200b6b60ec96cb6c2e8ccdb22","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":765,"source_line_start":755,"source_local_id":"block-140","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":140,"target_content_sha256":"a8f2cf2fc9c1e0369d4ca48d0da1fd47e0d0842917d46db53d8ae6f2767c4438","target_edition_id":"edition.r017.id-id.draft","target_line_end":765,"target_line_start":755,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[755,765],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16e1f24d723f2e142e4e159c8ecbb323dc701aee188b5697bd377499002e83c3","concept_ids":["concept.linear-programming","concept.matrix-rank"],"id":"segment.r017.book1.ch06.text.block-141","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.constraint","concept.decision-variable","concept.linear-independence","concept.objective-function"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":141,"source_content_sha256":"dbf30102911b3b9a0976bb842abe94c4e007c3b2199097aa47ef1287732d15d1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":778,"source_line_start":767,"source_local_id":"block-141","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":141,"target_content_sha256":"7abf500d748297cf6e20c6d5aa6d84d1263045c7f58ef1454e861e6a1c2e7aa6","target_edition_id":"edition.r017.id-id.draft","target_line_end":778,"target_line_start":767,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[767,778],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"852aad96b65550e972b52146a73a38e3c8a6c61622304c070cb469b4ef1e3987","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-142","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":142,"source_content_sha256":"befe6892ec44e33f7b364305fbcec8fa778e09b9cb39adc300c1dd14bcf212c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":780,"source_line_start":780,"source_local_id":"block-142","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":142,"target_content_sha256":"abf2c5e5a256d0173a5339eead0c2401c0fab3f053abd8ea94a8fd736024fa64","target_edition_id":"edition.r017.id-id.draft","target_line_end":780,"target_line_start":780,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[780,780],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fee1bbf16d1f2e317bb3c5ce45578d9154d13491fafafff6071cb1b086d49d99","concept_ids":["concept.convex-combination","concept.convex-set"],"id":"segment.r017.book1.ch06.text.block-143","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.convex-combination","concept.linear-combination"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":143,"source_content_sha256":"15eb36ad9a1cec95cfb24766ffaa71f847d177c48c48aa0a8a33637a645ff3a8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":791,"source_line_start":782,"source_local_id":"block-143","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":143,"target_content_sha256":"2ae59258986b9fcd9aec143fac81107fc31fb4a402eb7fcf785cd76be25b5e7e","target_edition_id":"edition.r017.id-id.draft","target_line_end":791,"target_line_start":782,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[782,791],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"317df9149cda27df545c43541aae0ef7d523c0da028a5442d43dbbf660afca9b","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-144","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":144,"source_content_sha256":"6292d783ae638e0df35fb6e7ab3609befefd99ee8a73305a8907e02f9ef9b647","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":801,"source_line_start":793,"source_local_id":"block-144","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":144,"target_content_sha256":"43bf74d038b574f547b9b88a1556f2f33c603f881f604b72d47b0c390160e094","target_edition_id":"edition.r017.id-id.draft","target_line_end":801,"target_line_start":793,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[793,801],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6216f20ecd68d866cf2cf67bd56e964add19dbb4281c97a3b1422754323dd923","concept_ids":["concept.corner-point","concept.extreme-point-optimality"],"id":"segment.r017.book1.ch06.text.block-145","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.feasible-region","concept.linear-independence","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":145,"source_content_sha256":"ea25d292944173d1efd2a30b517faebcc270ad12ea82b3a12b271c72ce02859d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":815,"source_line_start":803,"source_local_id":"block-145","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":145,"target_content_sha256":"a2860849c3e6ce731c0a325d0e81decaa6b13caac4a502b94b33375b55103b74","target_edition_id":"edition.r017.id-id.draft","target_line_end":815,"target_line_start":803,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[803,815],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9ce1d0d67d66f00b188ddc3d89b3f03ae7fcad984f628f8f2725d3e59af66b6","concept_ids":["concept.convex-combination","concept.representation-theorem"],"id":"segment.r017.book1.ch06.text.block-146","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.convex-combination","concept.linear-combination","concept.polyhedron","concept.recession-ray"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":146,"source_content_sha256":"5c84e30fe51eb76f698e2f2c3dccb188929a19138cbf52c957467ff394a45485","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":825,"source_line_start":817,"source_local_id":"block-146","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":146,"target_content_sha256":"7b05f3b982e40ca174c34f17cc8600c16c9747ef535aee01a9dfd03f207cd25a","target_edition_id":"edition.r017.id-id.draft","target_line_end":825,"target_line_start":817,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[817,825],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4893a9c9c708f594c5b19309b208d151e89dc72d74ba445c579ed2b2615aa7cc","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-147","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":147,"source_content_sha256":"c8e278add1d6c18f659152466edf4e82568ebad5aaddedeaeb2d654335866d4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":827,"source_line_start":827,"source_local_id":"block-147","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":147,"target_content_sha256":"5a7c51fe019c052d866e25f75541baf5ff511cb9d0d48737b288dcbb3fd56de0","target_edition_id":"edition.r017.id-id.draft","target_line_end":827,"target_line_start":827,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[827,827],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a089f3434f717a97d8900fe36feaa8050c960139d220fdf48ae4f8b1189c17cf","concept_ids":["concept.convex-set"],"id":"segment.r017.book1.ch06.text.block-148","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.convex-combination"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":148,"source_content_sha256":"161a47eb2d863b35390fdbbe36fe84420a69b48c7b4e4f3ebe41a04d0ee3176c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":837,"source_line_start":829,"source_local_id":"block-148","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":148,"target_content_sha256":"2960d93e28489898e5fb567d765352cd0d4dd9993182de6bd9fc50c541c1b7c5","target_edition_id":"edition.r017.id-id.draft","target_line_end":837,"target_line_start":829,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[829,837],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2320402820cc6167dc41f45716c280d69a237c46430f736b1c6476c3203e92b4","concept_ids":["concept.extreme-point-optimality","concept.polyhedron"],"id":"segment.r017.book1.ch06.text.block-149","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.feasible-region","concept.halfspace","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":149,"source_content_sha256":"b538cb4743990ad552ffe96200e74fcab301744064dc794397669a6426f5d9e9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":847,"source_line_start":839,"source_local_id":"block-149","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":149,"target_content_sha256":"2ea95c401f387eaa2d694494c07bac6ef2ea3c3159fa49a45e349a40abbc4ebd","target_edition_id":"edition.r017.id-id.draft","target_line_end":847,"target_line_start":839,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[839,847],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b26361cd8d30b47a2efd23b21eab2ea733a81214df63fac65af51db214b6ee8b","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-150","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":150,"source_content_sha256":"4be7db13a50a6cf69022429255b203425a63979cca3cb7d03e8476641e361703","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":849,"source_line_start":849,"source_local_id":"block-150","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":150,"target_content_sha256":"02bc411158e8112c9dc4199c8d99675c3a91d7015f2998ee73306674c0d2dd8d","target_edition_id":"edition.r017.id-id.draft","target_line_end":849,"target_line_start":849,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[849,849],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"970843f561bd9aba20563b1d09d5175f6597a0eb0d8a329995c90499a798ccf2","concept_ids":["concept.convex-set","concept.halfspace"],"id":"segment.r017.book1.ch06.text.block-151","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":["concept.convex-combination","concept.convex-set","concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":151,"source_content_sha256":"fc2abd56978fb9eb6c3a384ad9c71c81284f4f958ac0e089c1f5417a750b5a50","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":859,"source_line_start":851,"source_local_id":"block-151","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":151,"target_content_sha256":"abb74df0bd8c3bd74647f6645eeac60437966c4fee3c48965f1b2307a261856a","target_edition_id":"edition.r017.id-id.draft","target_line_end":859,"target_line_start":851,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[851,859],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48c1c1f04a119d32b4992ac5e4de0287a16b1403b854886b4d22896cf276ba29","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-152","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":152,"source_content_sha256":"070c82f595a58c404017d08d60ef7ee4b27c5877e128e391ddb9e2145cbe6910","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":861,"source_line_start":861,"source_local_id":"block-152","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":152,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":861,"target_line_start":861,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[861,861],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1698aae8a5a32c4b72d888052582e20403267bc53dc94122640a53078ba042d2","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-153","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":153,"source_content_sha256":"be5e82faba3f9ba450f5353685670b40fb9ea0f593c13f8bc7a7e357f882bf8b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":870,"source_line_start":863,"source_local_id":"block-153","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":153,"target_content_sha256":"7bf0447031db0b3962443010cb362ccddeae91e69b69ea68aa2cfb664d112e9a","target_edition_id":"edition.r017.id-id.draft","target_line_end":870,"target_line_start":863,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[863,870],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"51209b90a20b7581cb168388662d43747fc2505c4ca7e80381b78fdb07cd3a01","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-154","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":154,"source_content_sha256":"ac472a795655894b46285af3d13d11d0cb45899dbffc2a6f03d5660da0298de2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":873,"source_line_start":872,"source_local_id":"block-154","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":154,"target_content_sha256":"93763127ff782742ea6eadfce3a59ee87595c64d183f0abaac6fb4e27b0ebf1d","target_edition_id":"edition.r017.id-id.draft","target_line_end":874,"target_line_start":873,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[873,874],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e41b1c3ed0b09a3f8e478650c1e4d346374c021fceccc8aeea0c76c01e5cf6b","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-155","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":155,"source_content_sha256":"25e920d34c24972d5e5508e11449780c093832be83d35a338dc50f87aa3b7913","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":884,"source_line_start":875,"source_local_id":"block-155","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":155,"target_content_sha256":"e72f2a53f3f8960d0da8ab1fbc7a2fdf260d28c58d7ece5900fe11693ce4206e","target_edition_id":"edition.r017.id-id.draft","target_line_end":885,"target_line_start":876,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[876,885],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"056bf3ee3763dd63c8ed4ad3e0ca3f693d955c5e88363a21a2c0020560e92c93","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-156","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":156,"source_content_sha256":"20504ffe6db8b290cefbd91af460e104bb4cdb0cefdb7956a2fbfc612fa335a3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":892,"source_line_start":886,"source_local_id":"block-156","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":156,"target_content_sha256":"cd168e1374ba8126be4e3a6ea37759d55880c184dc007e35fee4a00dac95c588","target_edition_id":"edition.r017.id-id.draft","target_line_end":893,"target_line_start":887,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[887,893],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a04812760beec5b9c1bd3da2cf1b6a4ff507a073502384f2c1f6d32ae9b4d64b","concept_ids":[],"id":"segment.r017.book1.ch06.text.block-157","locale":"mul","parent_id":"unit.r017.book1.ch06.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":157,"source_content_sha256":"b85e129240b09cff33e3b3468660a0cc374ee92b837985d873c018b94dd18ed2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":899,"source_line_start":894,"source_local_id":"block-157","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":157,"target_content_sha256":"a632454bb8e53ba55763838741dc95a76174a4d2e86165d7b28cb530b9f02d36","target_edition_id":"edition.r017.id-id.draft","target_line_end":901,"target_line_start":895,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch06.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[895,901],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch05-lp-theory/formalize-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"474e88214908b3481dede6d6a9d46d8f6e4be0b55abb01120411021437f2bc18","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-001","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"a5ae24ed55ed8099659cf46129e69727929fab9aa68c35b52d35bc8f018336ce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":8,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"3fdb23fdb86a2eb6da371baefc9ae166d412de412d050a05e7946fbd56410f1c","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,8],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4917a8970eff359bd9eea0e4bf16bbee4c0f88dc68657ad17b149b6f3b8d7811","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-002","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"6005bffc7407ddf37431ef02af3f8713683c715cb5c677eea8aec33ec28f852b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":19,"source_line_start":10,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"34e0f169809d92d8c1841a3052132ffb1fe1bdc9f6341493379d64f8b00da1cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":10,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[10,19],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"12d1fa1185a8a48eafb2928b702aa9442eb51ce4f408e641dfa4d3e0e1dce576","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-003","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"00f64d040d32bb79b9a38f5d845c04ee0f0e7e406f2dda64a1383652a9245880","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":21,"source_line_start":21,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"6862f2f792945f731ba65ea9a3e1031bc0916be9304213a738770553e187e691","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":21,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[21,21],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8496c0094e5744f23e83c3cf9334f6aa37397969f81369f9512c6335311b7f57","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-004","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"d5da534ad55fc4e23f108f46f2bed4b6ca3fbc80e3900c39636ae92a8d879077","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":31,"source_line_start":23,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"c311b4568e312474a14e73c29c0c51a315f51ab0485d65e2ae5236c169d60f50","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":23,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[23,31],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0c4909f6416399311471b34423b13ede89435e9c46bf08857753e56889427e62","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-005","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"9d5b5d80f9c2e5da56640e04360a542b1d6bb851bed50ae761a31c5282f448aa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":42,"source_line_start":33,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"3f470404d95136c3aedf5e722d6a2bb0e464b4d1637a64f01ed28361fd0069a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":42,"target_line_start":33,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[33,42],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c4a158d33c3d095b9ee5ec2c63d44b1ab2e1647f0dc5bf058f1e8b968a75b491","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-006","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"8ceb2fb22a0e60b88c5101222e843b3cab5f95d7d52dd09b47f8d32af5e4431a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":46,"source_line_start":44,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"f1fb491f42e0a943f1fc681a0bf5f2d5d48ba1e39a113adbcf2b885ba3312ab3","target_edition_id":"edition.r017.id-id.draft","target_line_end":46,"target_line_start":44,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[44,46],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2ce32773355a4bd6ced4fbb54ac70be148c39b7f249286438a222219d48594fc","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-007","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"f76d182f22885de92f8b87232eb4c003f156d570262c5d52bd992008d71ba4b1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":48,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"4d120289bd8d4de674ce55d62fd41dad7838e30d4c0e13616ea37a2416b163cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":48,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[48,49],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"793f2448ec5ad3a7686c42b022437925db70d8c19aa07c4a9aa70e8571eb2202","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-008","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"49476497b5f070476ba65e0c9982f5e571495f0cafbc9800520a4ad38ef07672","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":51,"source_line_start":51,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"3d2abf48003a92e96bdc9b13c6025098b98ecbe68290f4a38a709ffa0c53acf2","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":51,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[51,51],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2019bccf1a7dccd83718bcc2eabf52f5b9ae8e6bb1af45c4de672446242d478d","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-009","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"54131197e496535e4ebc306be52836275bfc4163f1e26fc99dcbb3b27ef364ef","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":63,"source_line_start":53,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"210db050084fbea109018a811184366473ef6b7d49ee79cc96dbd1650f092198","target_edition_id":"edition.r017.id-id.draft","target_line_end":63,"target_line_start":53,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[53,63],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2226d79db82d8f94cfad125a52dc2500380158ea683a99ddfb1d1aefa6ea8f74","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-010","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"acaf66cdfd33ebe85a24fca09a090df657273a8603330e44d933b47abb9654a0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":65,"source_line_start":65,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"876e901e74f445427d63b84b4f37377b32e3c7c4293e2fdffac8f6f65e4569d5","target_edition_id":"edition.r017.id-id.draft","target_line_end":65,"target_line_start":65,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[65,65],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa21c9c10e78bec4b6ee6625f411f59b623657b01a8a013d09f813474e9b6d8c","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-011","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"1d11ecff51f6370ba04aaafaf55882ef16ca54228e6aacb351e42f78296193dd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":78,"source_line_start":67,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"f9f73228417d24c1b47f523ca3dc607526cd2033ad7eed8ec6f5544a671e69e9","target_edition_id":"edition.r017.id-id.draft","target_line_end":78,"target_line_start":67,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[67,78],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7cf63e6b5090e4e399bf4af0674e88cab4b3d65428b280d0974c879cf8344cb5","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-012","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"7cafff088de20c11c0410c776f07429142d7503326c9f06a7bb4523637e7ca26","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":80,"source_line_start":80,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"8e1e3477eb61bc1efbc3b066c671273305c3e0c590b7029c304aa55f18dec346","target_edition_id":"edition.r017.id-id.draft","target_line_end":80,"target_line_start":80,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[80,80],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bc44edeca036123c984d0c4a68b94182018837beab0c9be6d022990f0f45c1ba","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-013","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"1d1ad5f6a471e927ab107b0cdca584c4b0c4525fe81ee44d195746f8f721c221","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":95,"source_line_start":82,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"52983716e80d1995d59d4b3d7ba241875120841ca748fc79ed4c92687ee2c9c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":95,"target_line_start":82,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[82,95],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4937e57822f9176cf56719af78278b1fc3b77c402407d1ef979adb34cdce9316","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-014","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"ee2d30d2f32d219662e79cba6c1bc041dc6e25bb84aff61915a4a4f87812837c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":97,"source_line_start":97,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"9148a7e8dde1f3a15396a24a98ad79e79939f628714ad1ee1f7ba95cb704eebb","target_edition_id":"edition.r017.id-id.draft","target_line_end":97,"target_line_start":97,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[97,97],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"885265ec3af069f6dd98e7cd2f4260fbb97d775dd0510b0372951430f9e8574a","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-015","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"fb384dbdca62ae64bcee620f86e81983c94e0607eb96cc94c1493d399916260b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":111,"source_line_start":99,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"ce4d55a69af904d460b2ff0852ac00c01d0bd6867b855332a3e83b758ff4fb43","target_edition_id":"edition.r017.id-id.draft","target_line_end":111,"target_line_start":99,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[99,111],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"443bb1a509f1f5aeca687e2c51fcb562e447ee3c910c1627761673a267149442","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-016","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"b472d70bbf39e4b3114f5a89d7e6961d8a8ab3690c3cbd1c2df15328828dfba6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":113,"source_line_start":113,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"382fcf8b8769733c97af14c4390974612296efdbe16ecb40a30dbfb8b1326f1a","target_edition_id":"edition.r017.id-id.draft","target_line_end":113,"target_line_start":113,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[113,113],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa37c3130badf0919e795703cf9ccdb3abf132186801e96e44731fbac57f78b8","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-017","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"60fb5fc0c2d084eb6432e13c7d8a1fc1a3dd4e0555eb7f9ddf75a7cddfedd373","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":126,"source_line_start":115,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"16bbd357889b6c08b4b613db471bdd2b7b0be435a17fa201fc6d0482ea67e2d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":126,"target_line_start":115,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[115,126],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7ac9e942d6ee30d001aad18e50d5d6bd8cd5f2cf26ef3fb7db87cf7d443484bf","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-018","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"03ea45ca1a732a09fa001b4ab9c854a20ad97da2935f837f74349615781e933b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":128,"source_line_start":128,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"846e9d766715ecb80d6de82b864eede3edb770ea7fec1cd322f286b392f67378","target_edition_id":"edition.r017.id-id.draft","target_line_end":128,"target_line_start":128,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[128,128],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce393d24e4bb415668170c4ccb8b1233343fc16b51cb917f701d5ab6cba01260","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-019","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"85fcd31ee30e892ed601632c62b9fb1d0dc4a51986e70484222427be92b7f397","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":131,"source_line_start":130,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"77d6429b98db276fd592fbf926609ec365a4b8bdfd73e51cc0e3a1b635b65827","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":130,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[130,131],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f2a3511b6e83e3edde96687141b345d8dd15a72959dc04a0a84f67118e770ab7","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-020","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"c9f19326961ebceb19f8830115c75c7d5b8ad804ea132fcdabc309288ff7bc86","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":143,"source_line_start":133,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"d73f3a51c33205bc3beac3ad8d2c58309ac859f13c50db8919c443392b195995","target_edition_id":"edition.r017.id-id.draft","target_line_end":143,"target_line_start":133,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[133,143],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c92bc7558e7d179bcc8eaa748ce8860ebe6359b526fa07fb975893e231464fc6","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-021","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"8260993a8d7410ca74ea94271aa802c078b64b9a0a245ec73cdc61ae120d54ac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":155,"source_line_start":145,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"d58500dcc7bcf9ee3190413604c1f97ebf7fab164bf01cea7995023785048d3c","target_edition_id":"edition.r017.id-id.draft","target_line_end":155,"target_line_start":145,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[145,155],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a24d5c7ee0e464f090938d5ba88b933c3b8df87da31b4ef9f716a5962a9623aa","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-022","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"872bd172efd689bf4f05c50382b8aa49e35d4c7ad921d3f11091ce054ad4475a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":170,"source_line_start":157,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"fd56ff57d6a6e8d3eece3024e8a9a4d667882c70f4bfbabd2c3f357890afd36b","target_edition_id":"edition.r017.id-id.draft","target_line_end":170,"target_line_start":157,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[157,170],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"694b8abd461eaf1bae8bda9ac423db04521f75d3450844033ea8c02f39c412d6","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-023","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"595cf12263c364af76e9202e1cae5e73e6eeb69ed9562fbbfc39e893b00a45bb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":172,"source_line_start":172,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"8f8a28d57ed9205b3c55bab8dfbfbf486e2527aaae78642b09536cad6252d7fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":172,"target_line_start":172,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[172,172],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19edb3f8f3e4fbe7ade1dcf50e7bc8724250109d25ac68e7ee05610c864e1140","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-024","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"c295e585ca8b0ccac69a41bf2f8f34d1ac90bfc5bdac71ed83d2e610f9a3acea","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":181,"source_line_start":174,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"5604e30df197726c1260bb21fc28a8ef6970f73621eba75b9fe9bcf1ec58fe19","target_edition_id":"edition.r017.id-id.draft","target_line_end":181,"target_line_start":174,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[174,181],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"babbb163586108b5bb3c19c82442df169d6bce73fba0dad3ff817246bc848cc2","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-025","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"25c7fc68f2e9b3f517b2c9426264c90ddb90e50646621b7754230190460d1421","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":191,"source_line_start":183,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"7163c26166d7bae2951a03c8e5161237a299bde240ef439201a6ed668dc1933c","target_edition_id":"edition.r017.id-id.draft","target_line_end":191,"target_line_start":183,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[183,191],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2511b4b6311c13d0e0626c0956024697603ffed14f44169cc7523970590d03b6","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-026","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"6e97f0265361f7eb1312da13e8e689631d70c9f18b004477c37ce3414c49260e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":202,"source_line_start":193,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"e0b3e7ad1e11e37760b2c08cf95ef3e63562f2d82ce1f3e170efcc66756f79b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":202,"target_line_start":193,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[193,202],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37bcb4ad47fbb934916932411483172a722bfd6f330717d0296d062816c117bf","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-027","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"bd5061fb6be0ad414a50d0662f3a0833fc3ac7490b8a12171a113189b7fa5724","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":204,"source_line_start":204,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"df20b1277e645bdceae87d738c420c45f36069ec4380bf8ea20c17a53235103c","target_edition_id":"edition.r017.id-id.draft","target_line_end":204,"target_line_start":204,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[204,204],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b9dadf62fcfef8d87cb59bc206813933a55293e2686d73777858c77a73c6e9a","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-028","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"6aaab9996fc3cea8106c26d95176c21cf7854572ac4f0cbb1e84a413bdcdd370","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":213,"source_line_start":206,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"04d9c29c50def81de6a1b8210df65f8b3390575ffcc48efad243dddd92afdf7d","target_edition_id":"edition.r017.id-id.draft","target_line_end":213,"target_line_start":206,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[206,213],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"596216275854c83ba0e41ee41cc1237d6697e1c03e15a9c5cfe6bd854bf39b68","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-029","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"5513e5c21b58d37cc7a79c506013b23a6f768cf5801be7f5ca6d6bd480a43c2a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":223,"source_line_start":215,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"45c5eeedcf54d25c7b3f87d279a3bb08cced1cbda0eacf06b3c6c8eb51e9a117","target_edition_id":"edition.r017.id-id.draft","target_line_end":223,"target_line_start":215,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[215,223],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d4566575f1dde67bfa29aca5b2108700031d879990cd1d3298eb1dad26f587c9","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-030","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"553c1eef836c26d1bc057ed9c776659fdedce2c9cb688a2c24fbdd87cb712108","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":234,"source_line_start":225,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"e835ce79128773fd06323c608cc9e5e80e92b27286e4bbb75eff8068798231cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":234,"target_line_start":225,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[225,234],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb53f91fc22a4899ae6c8db7213da67160f225137c6b991d5a793dd050f38c71","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-031","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"d995de5040029a7dff7a3fcca72993e14a9aaa966426b8dc44c023aa452a3e8b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":236,"source_line_start":236,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"24ff37a96b90444649912693b8c485dab170357d0774edfd881b079e48dd054a","target_edition_id":"edition.r017.id-id.draft","target_line_end":236,"target_line_start":236,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[236,236],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4fe91d47d27c55abaa2bf2db7c506acf5dd74a95ccd0bb5dd88c1487507aef3","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-032","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"55343e1aaa44de3826f7264f79bc00aeb6687453a6583caa24d6a55b920658ed","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":245,"source_line_start":238,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"0084fdd49faf09b5f990d42c53f673aae1ef492729470f804e4cf4f67a8f2811","target_edition_id":"edition.r017.id-id.draft","target_line_end":245,"target_line_start":238,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[238,245],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"45c8cc077775d8cee36545ad37eba0a5f2feb0abefabb6c5a851f697070c2d8a","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-033","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"67e70acca3dd1c6474ded04b05538a30d71b621260b4ca7f69deef8b48ab4aed","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":256,"source_line_start":247,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"b127c7289b1ba9b3b0e2c5db603ecb5d8d4393e80b3f5e9666fd1e492196c945","target_edition_id":"edition.r017.id-id.draft","target_line_end":256,"target_line_start":247,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[247,256],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c05459bae2b152bb3067387200dc3f4c7e6dc9ac8b82bdff29a1e69d2176fd67","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-034","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"8c94352c4828a5b7c25d1093adea4a71a5548d15e6088bc30aa3d460ae8803e7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":269,"source_line_start":258,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"7b2e1297c96f0d0e64d61880e30eaf781b2efa8ecb4f43ec3312a32f10623179","target_edition_id":"edition.r017.id-id.draft","target_line_end":269,"target_line_start":258,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[258,269],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"05b6b837122c397738f365f137b1922cfee5cfe0f30932ff71dd9c84a1976b34","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-035","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"cef2b6684d45527c2fb7f0e6a4222fa79ea002c9ccc1da8a89984c29dc27dc7a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":271,"source_line_start":271,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"3f25ffaee9ea4e53722527da2c45acc549bf4e6d978375082067dd5b87715e91","target_edition_id":"edition.r017.id-id.draft","target_line_end":271,"target_line_start":271,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[271,271],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc588f2721f40010525bc2323b8654dd5107743b9080e241d4a3d091baf88ea0","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-036","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"254dd5b5940abe82be186ecb343e268a2e9b996abdcb9e3b5ed8b74647ee4cb1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":281,"source_line_start":273,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"01aabdb7ecd8481cbdc6dc564641faebcadf4ae1e682d441d502233245122ddd","target_edition_id":"edition.r017.id-id.draft","target_line_end":281,"target_line_start":273,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[273,281],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b0b01408ce36415b7121c8bcfc2a82037fa01748971f2f611ecb4bf88fa26565","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-037","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"117dc15f209f9dcdb40b28c2191d9db67bb1270d4c8eec52e6092a763191166e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":293,"source_line_start":283,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"3b6253ebdf57defb8ac4a656483b4331b66f770537c88be7cb965d152d50b009","target_edition_id":"edition.r017.id-id.draft","target_line_end":293,"target_line_start":283,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[283,293],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4fa571cb878c741e4968b4f5140329be8565d8c6c2b007361c721aabd09e4822","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-038","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"226dbd1e5692d4349e36a4c417553fb78e62c6ea720f69caa6585c762a07f2be","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":308,"source_line_start":295,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"fbfe6c72b1387f6b1186a9f5ed947ab00e2a811aea7af2474b2dec3dc1519290","target_edition_id":"edition.r017.id-id.draft","target_line_end":308,"target_line_start":295,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[295,308],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c5caf2e9b1aace5a96d7db9c7b487bd7c3a476f67c58319f82681f86a2c703a","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-039","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"5af55201202c9d2090a92c13cb4d1edfbc91051c093700db21cb336241e748a4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":310,"source_line_start":310,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"02bb19a09f8476b7a665b960a45b345d9fdc81c9e2aef8108dd49c61b662d1f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":310,"target_line_start":310,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[310,310],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"15af6e6b42f492f6c20f63392392dc83dfd3b5f44cb6d7efd7c49e20cee669cd","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-040","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"2eef625739389bd8e32189853203fd20b65d3c9dcc6e0d916a209f8542515c21","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":322,"source_line_start":312,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"f44a123c01599542c223b00e2657148a21ed9cecccb8c7a990120e85bf58f7af","target_edition_id":"edition.r017.id-id.draft","target_line_end":322,"target_line_start":312,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[312,322],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f971a292b6edd67bcdf829f9062c0cb23b1884ebd94649ace3e26cccc12e34c9","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-041","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"43951af19aa2b0e91933541c2babb47fb2829e5db6534b715caea3d578572c3d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":334,"source_line_start":324,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"132d034a5b676bc84ffd1e940362de26eb19676ac68c4ff6522af836c0172260","target_edition_id":"edition.r017.id-id.draft","target_line_end":334,"target_line_start":324,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[324,334],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2d779fc3498cae1c0ca77dcbb330ce8728e50cc4610bca5c626cbb3774157330","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-042","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"84975fbc48ba64919d0d9b8a629718d8bb29c34ad125b275ba7af48070bd89fb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":346,"source_line_start":336,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"2169a11b74c173a0105e3877c0a4e8338515f0272bea33db71a86459ecd48243","target_edition_id":"edition.r017.id-id.draft","target_line_end":346,"target_line_start":336,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[336,346],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"29f60aa9e60cc3b6bcf7f2bc5ea319f3cc2cc8cdab7e0f0bf5d5aebcb7bc7820","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-043","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"511e0e82044b86a02767795d9facf7260089fce3c18795bf272f1a29f4650cef","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":359,"source_line_start":348,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"eae77da9e8575b5208ab0fb20e813a3de94df847b3867f7e411b64ef8b8d691e","target_edition_id":"edition.r017.id-id.draft","target_line_end":359,"target_line_start":348,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[348,359],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e384e87ae1a0abe4a2b22e3dc64ccc6b5fcf932fc5d6ea0748dcfecde93c270","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-044","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"0fc176dbacf6f55fe3d3002896c9220e69fa6f0abd0301d375e470dced67467f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":370,"source_line_start":361,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"b399515af85654093de832958dc404f4919fa949acf8dd2aa2b8396de0900800","target_edition_id":"edition.r017.id-id.draft","target_line_end":370,"target_line_start":361,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[361,370],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f4b904de3bd2b94dbc667ceef41b160d823500434db0af7b97e9615d9c6a2886","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-045","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"d0b88817d3cf3669031e2d53ccab3e5b5f42bc5a870124a8a81a0c97a569bb55","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":372,"source_line_start":372,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"a3cbc04827402b1b190145e32be9e487cc3ac9df99a7fcbdda4eb8e471a11f3b","target_edition_id":"edition.r017.id-id.draft","target_line_end":372,"target_line_start":372,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[372,372],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"63f8bbae227a451f9b1b58bc2d49b5afb29c98b6faab9ea8ee25bdb181d97fad","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-046","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"8760c93665b0b4584fa89b63ed1538bf73945915ef49180c6f1c466f32562ded","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":382,"source_line_start":374,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"cbf18eac9bf37cf7dbe28c3de45b925586a15b10e41fbbb2fab9dec2c38da3c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":382,"target_line_start":374,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[374,382],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ffac9d7512a4eb48c8e83d9c62bea7cbb4561b0fc4a4738e4d3758b8339f96ce","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-047","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"c2494a7614807fc39dfc351a04c3cd66ee08d1aadb746c03911ed905ea28d9f9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":394,"source_line_start":384,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"b60e829e2e7e92a3529e5892d8741f8c747246c62d28ca133c5bb0aecc6ac2a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":394,"target_line_start":384,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[384,394],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"533466897f438600e190dce34223583089f9e1989c59bae640bdb5e68f25b47c","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-048","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"f474561c5ed1b935c8f787a3a02304d14a49777af06199a5efbf2b9d840f74db","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":410,"source_line_start":396,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"9482767079c912912f8c44d7e3e7d5e9d52247b08e669181fc6abf93651ba950","target_edition_id":"edition.r017.id-id.draft","target_line_end":410,"target_line_start":396,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[396,410],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da1d8f2a3dd76fd31764d0459c271f339ad55d8eed904b56661251cc81a64f55","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-049","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"723e26c7a0fa74201223d0961969df552588e99097ce3e5fc9cd49d299f7df0a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":419,"source_line_start":412,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"9928e9c610ae1d8e60790ed3822220dc4b51e913b99a69da9e7069ba57fadfa1","target_edition_id":"edition.r017.id-id.draft","target_line_end":419,"target_line_start":412,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[412,419],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b30d97e76a1b809f6addeb70d3c517624996f5fccf2ba0285274fcb281923a93","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-050","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"cc3821b9fb727207c61e1eb10917c0004d77ec8c73f4357da48ef9fe1fd0e5c6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":421,"source_line_start":421,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"d7c3441be0c5a7f26c497bc374f6c62225f01616e3f54b4bfd7682e07c8e03ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":421,"target_line_start":421,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[421,421],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3b495696e2a1d85dac64b8477b075fd7e0fa391c1107c2324665acb8158d24ef","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-051","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"b128a3b70fe3e919ff519d669bb497787493d7d58b949c9db1fa3f67b8421d6c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":443,"source_line_start":423,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"5878bf01bd0715f401eadf43ab313e297631be9114265900dd097db520857af0","target_edition_id":"edition.r017.id-id.draft","target_line_end":443,"target_line_start":423,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[423,443],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a44fac509a0705d8859a54a2a2e290bbcf637ff9e658e7281c2616611afb927","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-052","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"74712c6896065f91a5201aeccab66d935f9afa80b6b9be147517f767ab6c4a2f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":445,"source_line_start":445,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"a8e8ce0d83787ed6f4e6f885bf61c5a1533ae4cb10c33f631c1aee51de8a36c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":445,"target_line_start":445,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[445,445],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5032a3c4ee29ba064f24d84b2b89bd50949823eb80308bf2f4af133780a82132","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-053","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"83805d733863027addec1a9b38ac00c9a7f0837d436f05902efdb37390d7949e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":461,"source_line_start":447,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"85397bc03a2e673365bf89407cb0bac72eb4a86ab324e5b92a3610d507a87235","target_edition_id":"edition.r017.id-id.draft","target_line_end":461,"target_line_start":447,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[447,461],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3e5dd08690b9b52d74d3ddb4a473350e6cfdd57b40106882b97a74c306647962","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-054","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"d42d1d75e37fbdd32b2353fc3a4d7475f7485aa8969d9822404000faf9fef50f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":470,"source_line_start":463,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"6da2790153e343f04561b808206d1bd5af40c7306225cfa7683b9fd71020c5c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":470,"target_line_start":463,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[463,470],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e7b358a54444f8b29617802ed429465ea0319cc90f60c598fbeeb9b8d9bbb9f","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-055","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"da47b551a2bebb69ac7440e2f78e1bb631957ceb2a06bc042557795576fdd3da","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":478,"source_line_start":472,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"03bbcce79a71a8f3cb112b4074561a896d3e3e7628209247343f34bdff44d445","target_edition_id":"edition.r017.id-id.draft","target_line_end":478,"target_line_start":472,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[472,478],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a9429dfb3f83b09f62c73651694062109524cf8b4bcd000d4ae2342a52e22937","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-056","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"48e70ee8edd92a84a398d3e0694296e750c5f8ef0d735350292e093cd6e67a7c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":480,"source_line_start":480,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"6550ab21cb7298b32804f0f0fce889b403402103d5b850be34b94a40f1a240c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":480,"target_line_start":480,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[480,480],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5717b5fbc37d4d42367cbd1e4ba37ccef650d08735b56b625b92b1ca19cdacea","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-057","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"366076814f8e20dbf06819d79ad938421e7cc7d6bc885fba3a1cd293adba2c74","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":497,"source_line_start":482,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"ca5af5ab5bb22a9474dcbb8ddf0e4f5bb8cf84d076ddbd494fcdc94ab2c1be73","target_edition_id":"edition.r017.id-id.draft","target_line_end":497,"target_line_start":482,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[482,497],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"83666da2967ca60e48d97d445f03c0d128a2aaee7a3bb8ceec44990a749241cc","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-058","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":58,"source_content_sha256":"af437e19642287dcf535a5b8d4b64cb62be9b0afef6682e04eb5b14314b8e7e7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":506,"source_line_start":499,"source_local_id":"block-058","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"f0ef14c4e83174489858f55b331da081df86de7ff1ea16fb51174cfe499bf9d2","target_edition_id":"edition.r017.id-id.draft","target_line_end":506,"target_line_start":499,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[499,506],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"720bdcbdbfdf43a8d0773e89586b8894aef43b46659cb6012bed1310c607c446","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-059","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":59,"source_content_sha256":"f0265fb72e65dd480d509837add60e012378bb7779fd200fb6f8c6409d18c318","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":508,"source_line_start":508,"source_local_id":"block-059","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"4b06b0947b5736f5f8306bb3dd7a433ce48677f59a917f8185a2285d782be8f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":508,"target_line_start":508,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[508,508],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"21b5a472184a091baa31375c58e472ed11af696d305bdb773df89a9b5b06516b","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-060","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":60,"source_content_sha256":"5e4fc452f520a7f7f3e837d8d3c86f16bd6b42c209a8a11604be1d9487115b09","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":510,"source_line_start":510,"source_local_id":"block-060","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"fc21305be2486b18f91554afef8eb3c3d5e8f95d40bc661be6c72a4c46680545","target_edition_id":"edition.r017.id-id.draft","target_line_end":510,"target_line_start":510,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[510,510],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88b0ea3315c2d775468a55b0813ff3d7048546291ee0089114d5f52705937a22","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-061","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":61,"source_content_sha256":"4c1eb6a52b642c666ec296feb3b2210ad39ad835261d2578a5e9b7f725b2d66c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":521,"source_line_start":512,"source_local_id":"block-061","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"d045931a135823583b78e6379d1269e05d3420ebd618ac6a9b7635ce3291e39d","target_edition_id":"edition.r017.id-id.draft","target_line_end":521,"target_line_start":512,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[512,521],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e1f6f332b0da9ee527281eba7edb3120a0992df38c341969c564d1df4dc6d512","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-062","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":62,"source_content_sha256":"db77eaf92dba2f01209edb330ae10ed9419e5f830cee232c37fa56426936c563","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":533,"source_line_start":523,"source_local_id":"block-062","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":62,"target_content_sha256":"134018028a1561255e9d15a1398a73b7d228ec51f6a1c878dc7a2250ac9d91bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":533,"target_line_start":523,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[523,533],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f969ff98b9509e06fbf2c1a4a757461c76ba165e30cd99e2ffb18aaae7cf3196","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-063","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":63,"source_content_sha256":"e0ac872d95d5d6f24794d5c74c97c6d01ba3189d924e3eaab7237ede545a8245","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":549,"source_line_start":535,"source_local_id":"block-063","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":63,"target_content_sha256":"54a8b5844d657a2024eb907421d1564fc9ed2ba4f91cd032d50a84b53b321454","target_edition_id":"edition.r017.id-id.draft","target_line_end":549,"target_line_start":535,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[535,549],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e3575e5a276099a5d4c0cca95d3b77993b505628e8acaade5a14411d8017d0c7","concept_ids":[],"id":"segment.r017.book1.ch07.solutions-manual.block-064","locale":"mul","parent_id":"unit.r017.book1.ch07.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":64,"source_content_sha256":"bb99ab5f6bc1f448760a1b4a7575e6bb96ed583d18f5a3b290b11696ed43db52","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":558,"source_line_start":551,"source_local_id":"block-064","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":64,"target_content_sha256":"1bd3b39933154362e61f26572c1c5048591f6f5286b844282bf8762455421378","target_edition_id":"edition.r017.id-id.draft","target_line_end":558,"target_line_start":551,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[551,558],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch07.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5019ff7922841a8038c056592cd6b54b278a5624dbc76aa4c7c6426f2cf01735","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-001","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"648d4a8b4b45f7216e3acee5f0207797f00c9a44a9a34d4b54814d651a6570c3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":15,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"6bbc9ce55101afb7a8e8243e2e744f6b701314481f663edc60afb0201bbeee29","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,15],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d5e1aa76f965c34eff9eda9a5d16b0470caf9802742b79b3a963dd75249f7bb","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-002","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"3b6e8ebb0874fee520e8be23e548e91d131b3286e2d8f756c3316abcb69a19ca","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":19,"source_line_start":17,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"58d75256334836740ba987743505bd4b9057407973bbd18a83b4d909c7361232","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":17,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[17,19],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2a9cb4c4e39431571134db171a62d049bcfb19e8a5bb76d0460e29c775e36d3c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-003","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"60b718474cf3b51558767055adfabe009ca49eb34ec0aa01be3e4ad33d232884","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":21,"source_line_start":21,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"27cf98929af9efca5d798df91ca74dbe8afaea87a393ae51266ee2e59f544378","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":21,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[21,21],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb21b66c2fbf3139d7748c8851c1b6f2c111fc9a1953c35b4661b64b3d2c5205","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-004","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"e166a6fb84091f0f88e1fe793e3e75da452b4b48de05af9cf55bade1d7ecc818","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":23,"source_line_start":23,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"d94b72e083869dd50ba48832d2fb6f3aa7e3690621c994c218e19169c56c2726","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":23,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[23,23],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3d9d65d351a9035d13735df630d5c554e466f1a5619133cb3d9bd85ed3d3ec08","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-005","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"449b3ae8ebb56f5d7fbe760c125fcc38cd6213872cd2ad39c0530107a69a7907","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":25,"source_line_start":25,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"1388a07fcd32eea9173e0d15ee6dd44721832f858425dbbc2edff2d2aef5e7eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":25,"target_line_start":25,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[25,25],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b98029ef0d24773c57dc2de6c88fd5973dc2573714220b562d75b0e68a3725b4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-006","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"1e2fca96712c625349bfde5131d5d44e30d60ffc455b48b48e005245e1181bdc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":28,"source_line_start":27,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"1c4f9c3b4edb8ecddbff25bedd6dea3c7f0a5539a2a3e6ec9531ab7b11286a5c","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":27,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[27,28],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bc9fbd75a720195ce535e0642d7735a973b0f34560fedb2d3943d2f01fa42783","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-007","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"4c8b639779f969c72c92d6cea699c05c3211033c17925e7f8360ef392b3409fc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":30,"source_line_start":30,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"f793a2b1a7f13c695f03788714029ed878de99a61227045ea516c3ec4ab30f42","target_edition_id":"edition.r017.id-id.draft","target_line_end":30,"target_line_start":30,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[30,30],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82cf90250bce9d7809def6b109bcb6874eb70dadf5692f00f76805b00037b3c3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-008","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"c71f9f5a309898680d61ed68227c7b44480e4e9bc213e8d938db502cf7778f23","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":37,"source_line_start":32,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"e49878d99cefce40745b4be3823816dc0e178a927ee22a2b8bbe63a35c94387d","target_edition_id":"edition.r017.id-id.draft","target_line_end":37,"target_line_start":32,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[32,37],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c8a0fe64266b153dda94b68bca602a077971308252b8f71049912c7910dbf66","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-009","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"4c0ab3962594373f36a2edd8d51b5f717c1fb8abab331f060bc52a0c6984b594","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":46,"source_line_start":39,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"fd71a966cec03b6624cfb8af59b93da8aa384ff66772ba7daf50e77f3e3be897","target_edition_id":"edition.r017.id-id.draft","target_line_end":46,"target_line_start":39,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[39,46],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3988e15db08f62fa6b03481f3a5577b4111dea87edf3446790179e54e492962e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-010","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"d7816135652cb6c8f4183ba373b057305e50ce3626d9438297c16b23f7e5f10e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":48,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"75ff5c2a7438269f7a2bffabffd7653bb72d21420617ccc8ee9774353be34f67","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":48,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[48,49],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a431933b9afcdece21159df44b74e17a5e98e71f6e4ead80893075b1a390ec0","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-011","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"31f2b63a1f641f4787bbdd4c55e19a5adb77a5c4378f5bcb890aae9ddfdae4cd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":51,"source_line_start":51,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"85425a2f7b3eea8b3939ce94217a3c31e7f769becc457ac003bea198b92213f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":51,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[51,51],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9719af2f236ad7c0e0efeb7c3c7bf7485c0e063ab97c1b4bb10a9edf4e263e21","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-012","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"a4e854cc89d2ad94ab43391b4b99b3465c9f7ee01ca4ef1ee2ffa06d332513e5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":53,"source_line_start":53,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"3c09bee5521da2868ede253f838d39ed50c4392b4febbc8360e75f721e23dd09","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":53,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[53,53],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3db847dd1de35ca3542c02f3cf8daeb4c6b4ce61f54e35462f869ac8ac8007b4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-013","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"a6269c74b76e18af1142998a512f409661764fc646c0092fbd12191c72d43f9d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":67,"source_line_start":55,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"9aca96ed9cea653d41a7f884d0077f6819cf821648c0da4931f1e0cf91de7396","target_edition_id":"edition.r017.id-id.draft","target_line_end":67,"target_line_start":55,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[55,67],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ea6f8613c38f8713b238525c230a821505a7fc770217cd0974a7b4176ce6403","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-014","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"374cfa9ae7ebeac3ed45292caf562121127e33f24333c73d949509fd409e7b87","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":69,"source_line_start":69,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"fd9e6b23e2504253b4a770d1a1b10645438af59416d06516b2e1d93d54f71673","target_edition_id":"edition.r017.id-id.draft","target_line_end":69,"target_line_start":69,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[69,69],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1dd9b3bf383d5d28c539e679268e86282ae4f7cf363a22d5fadf18e3c68c6105","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-015","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"2f92a971693fe9934ede6e9decae8357896f2422175650532e2e295dfff32e5b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":72,"source_line_start":71,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"e2a49ac8cb2303b35a9781fd8c888f686a73b615a656c669c01816d4b0747269","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":71,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[71,72],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d420119b7288d0ac41c6a641abf8996789926123b264572853f67f9d2052dc99","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-016","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"93fe4bffeafa9c19b0dbc84203bf3e688e1d55e13bf04a1718510444789220be","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":74,"source_line_start":74,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"31808dfad75366041106967a0b0a64be9d30e883b4a20bb6a7849f28519d9a6f","target_edition_id":"edition.r017.id-id.draft","target_line_end":74,"target_line_start":74,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[74,74],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7ff61b0e4d59352d5b6ce31041010c1a420ea7511df787e3462a7370dc2711e9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-017","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"5b400453969e8543937532d9e5ccb66faebf90d706a70bd0bc83ab8e2c627e8b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":86,"source_line_start":76,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"49dc891f567876d60c098c0a0efa9794dd6ac56148abd495c65791f0c59878b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":86,"target_line_start":76,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[76,86],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"be213a31dff9b00760850df390f1b89c449a4c84e47371fe1ad92ec95202933d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-018","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"44c85b4108a9a639794b7c6c254c1a54b7de680f2951e2c6c9f000c683a9bec8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":88,"source_line_start":88,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"dbe76bbc7dc7646c5ba9d2ab8c729e1d9e84e5703f8aaf6c86a9cfaf19b1a701","target_edition_id":"edition.r017.id-id.draft","target_line_end":88,"target_line_start":88,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[88,88],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c20cfd5313c1f8827e633ca922918c852c2e72f684ee832636b7a9530f92617e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-019","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"2e89b2aea9dd6db7c82c8b83c0d79421150b46e96aac1157e576faf77a512f9d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":90,"source_line_start":90,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"4f7f00d52f0bfe8471010112e567de0580129c75f2704e805b30faa2c58c4c01","target_edition_id":"edition.r017.id-id.draft","target_line_end":90,"target_line_start":90,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[90,90],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c3e1c287cdb4aa4497c7d17e497f4650b98e83a5b2f4d328c8d90ef818beb4dc","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-020","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"a7fd986f373763de4b2ef99ca5def63a7d1bb76f85753195feedacf29351c78f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":103,"source_line_start":92,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"b8dae498b0fe2503da0ea474fb46b9c9678277e42df495e679178c807c8ea5a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":103,"target_line_start":92,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[92,103],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"427f73f20598ba406fc85895acd01b457c3b9febf800880d0ef7a26744df9a77","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-021","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"dc4f4b1b65f49f15f5cb2c2c814c211308848695ab8984ee3da671e7770be0ca","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":105,"source_line_start":105,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"8712c4fecefbdaa655a71ab1fd30d1c6918ee3d0dce94ea4118cf186ebd69e08","target_edition_id":"edition.r017.id-id.draft","target_line_end":105,"target_line_start":105,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[105,105],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae820cab5ffd6da092efb84eee10962eb8845ec4e632377caf065f6e33aa11c3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-022","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"aa31ee94a843040d7d96ef3063e61919debae7f136ee38fad1dfc937ce7073a8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":107,"source_line_start":107,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"131c713e8d41ab1fcbb0d211593670590658b73cfa2e2e4b9ec23ad834a3db8d","target_edition_id":"edition.r017.id-id.draft","target_line_end":107,"target_line_start":107,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[107,107],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ba7f367eb0c40371cc444f1ac9329705623d4562514a51d2b00cdf9e525da233","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-023","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"c39527a45aaace200a5c10b9ff222d7fe0f7c5d8111e0fdcb28c27efdf233bf8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":110,"source_line_start":109,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"a6f7094ac231043d222c7051d841b8a66a0021cf998302d16a8ea185474e3f93","target_edition_id":"edition.r017.id-id.draft","target_line_end":110,"target_line_start":109,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[109,110],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9dd76e23d305fb8474d15894e722d6ed7196c60e8a05e69f79c6da268435799","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-024","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"2f725039bc305fe381a8a03188aea1d17d9d42290fa7f8118f0d53c276076636","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":112,"source_line_start":112,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"c967d33e2932707eccf896c70c3c3b75a485067a0f7396ce75cf0f70a4ffb6c5","target_edition_id":"edition.r017.id-id.draft","target_line_end":112,"target_line_start":112,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[112,112],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92415312b6e08e26c55c5e8be3b14333edc27d555b1c40072b44af3f7d95ada7","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-025","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"8b54706f95a5c7535353a1bd8fab769164ffce99fb272ab7ddd97167b1651e11","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":120,"source_line_start":114,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"deec99f76739e9770341ed60edf03738c3e104e69828dac1d2b23ccfb4548752","target_edition_id":"edition.r017.id-id.draft","target_line_end":120,"target_line_start":114,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[114,120],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"558ecaadeca8b9eba9d1ac4a67752e1ddb61973b8d16c7b82f5d0f87d1d6a059","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-026","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"2208354577fdc41b7dd0e0f7029526c4aa81478e4d314146da0a9e269bbcd082","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":122,"source_line_start":122,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"2b5adc4dcc125e1723a630b9246592d800f055ce720003e57e6413bf3494f3d2","target_edition_id":"edition.r017.id-id.draft","target_line_end":122,"target_line_start":122,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[122,122],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc7e5c0b1efeb9d5b19bb643ec5e99cc6f9e8e3b82c7c113a5cd6afaa1acbbd0","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-027","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"ca8cf4383dc29c434fd562a15f8cddd73e8d458cf3ce63cf3ecb0c223ef74384","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":124,"source_line_start":124,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"16a19f23db8d32547e4881ad350f167b86f3edd23d0f8b52ca0bd52bb98a26ef","target_edition_id":"edition.r017.id-id.draft","target_line_end":124,"target_line_start":124,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[124,124],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8da3a86c505e31e3d19b21bfea0ce2a2012fe55cec0343c3574cc360bd00b29","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-028","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"170bc784f4652c148dfc012b606b2d364c0ce00398839a6f9c197c36b1483ed8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":133,"source_line_start":126,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"94e1e91a0a32c299aa37f07534929bfdde7acee0adaea8cd4b3dc345e7bf3aea","target_edition_id":"edition.r017.id-id.draft","target_line_end":133,"target_line_start":126,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[126,133],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"99c8424559556d1797b47145fa17e3a72e0f7ddf2fec3e0c7f1be928ca67e9ac","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-029","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":135,"source_line_start":135,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":135,"target_line_start":135,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[135,135],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4699cc9efbbae7f33bd39bf367c61777bcc7f9cc122db9b01f3bd5da6665700b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-030","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"af9a732da9f8dfe730eb1728aa0bb4ca75830dd24168ab56038af00062d1629a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":137,"source_line_start":137,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"cf04e66aa4036f8f344c91dae3213586808c22c9d07adc5ca747b90dadd2fe68","target_edition_id":"edition.r017.id-id.draft","target_line_end":137,"target_line_start":137,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[137,137],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c0184ee4ed4e829799a475f034c18df9200714dd338c33b7d365d476b259e5c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-031","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"3cfb486a432694212a4c0afa476f5a2370970c98530a3f90370df1935a0d1a25","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":140,"source_line_start":139,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"df333584e1cdc608ebb6a998052de53b2919979f303b633b6cc463cc841f3b5f","target_edition_id":"edition.r017.id-id.draft","target_line_end":140,"target_line_start":139,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[139,140],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"252c6d79970effa752dedbb010fe2c96f6df6c69775433910de7a4459d926698","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-032","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"cb53f59cdc8bdb7523d428606371fea1468a4ceb7e57d0f49e0bf2c34cffcf66","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":151,"source_line_start":142,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"a6db5feec85463dd3c9634b4d47d681b41096f337417abe6ca63a91764c4b0ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":151,"target_line_start":142,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[142,151],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c04b532661f65ec216389a6960c687f926929e4cd8d87a3c04d2f6dcabaa7ce3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-033","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"d6433b36f1c0bb55069a5d99c58640e90828d1dd762d9d6aa9aa52d410d31ad6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":153,"source_line_start":153,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"810f0f84ae8dac1a9c7d6bd8d6297514041fd15aae90a9b0e7df1da08a41bf35","target_edition_id":"edition.r017.id-id.draft","target_line_end":153,"target_line_start":153,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[153,153],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b5f41e386b81fdf4fc5f56ca05314c7199c9dc8e6af4ce3ac83bc801420cff86","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-034","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"d265b2f78cf5f15b76f900b311c2c93a8f7051924911c8d76d93d3a33691b986","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":156,"source_line_start":155,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"5f8cdf083d03ce847f84e9105f907df36b397db304fbcde3a0cf3ef139751aa3","target_edition_id":"edition.r017.id-id.draft","target_line_end":156,"target_line_start":155,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[155,156],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cfef14ea9a21df3b4c9be359a7d58837d5d0dda66a8da5f6e63fa1c2ab2433c1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-035","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"f64fb47eaa22f73b901d76f46b1da600843e2c12f0530c2d6eef235f7d4d949a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":161,"source_line_start":158,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"004fdc7409a45441c3733bfdc4166d677a85a0460925bf3f740567e3ba5ecca7","target_edition_id":"edition.r017.id-id.draft","target_line_end":161,"target_line_start":158,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[158,161],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"adbef5f59e32c7feef41fb818735980cc2c6b9d1fabd521a4891130b71c4d185","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-036","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"22cc6a22956302f5e710478f1533d3323f47064ebf2d2600bafdf855204a8f8c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":164,"source_line_start":163,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"a0a6b09bc0036031626449a7b2f65094e9cd3d493d8c2de0e6f17426cabc6645","target_edition_id":"edition.r017.id-id.draft","target_line_end":164,"target_line_start":163,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[163,164],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b170427b87cced8c325afc6425576ebf3de0a76979e0b2e7b70adde69ec2b20e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-037","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"6b26dc115c2fb18612abead2f6f2d568a305a70ce0c84759be0c28463bc88bd2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":169,"source_line_start":166,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"88601bc56562a9c181bc97b49bb50a7d4993ad0954edb6113a82a55bba033d7d","target_edition_id":"edition.r017.id-id.draft","target_line_end":169,"target_line_start":166,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[166,169],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b56a5ab5596078b8a29d5bd4c0ccee2638da80f51882dfcdeac0a338faa5cfc0","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-038","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"cc7647e7fc2913996b338f972f5d546c628e4a5306f15e9fba546ba377debea4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":171,"source_line_start":171,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"74ac739e5a915c368b8bad42d1aec0e25f7872e6a16f469ea2507419a4387dfa","target_edition_id":"edition.r017.id-id.draft","target_line_end":171,"target_line_start":171,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[171,171],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2dbfa01144f9e947b5ad9bf3e8101a0e649fc7a8a92036a4c0049b90b045128c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-039","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"76b3bc8dd46aceaebd15057c8524b2114e91f511594ee0a101f4aa825260b130","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":177,"source_line_start":173,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"202a9328ec8099b894af8c98b63ff2e0327e09bcf0a049aa35ed37b25bd33c98","target_edition_id":"edition.r017.id-id.draft","target_line_end":177,"target_line_start":173,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[173,177],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ea9f358beaf838ea813f09d32496300fa9919c0e25e1eb2cc36ce5f195533a7f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-040","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"11af70b12654eff081d4b7b29239851842cf929c03cbcbf5fe8c259c3d366e4c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":185,"source_line_start":179,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"9694fc24a78f9b4c33b1ac90713fd6e998ab38c30f4e174018444f152c65ee43","target_edition_id":"edition.r017.id-id.draft","target_line_end":185,"target_line_start":179,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[179,185],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84f7f0815ee0e86547362e60aed0a9def3d59e40709ba1d22375f40571fefdfa","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-041","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"9a060d082bc8d25483c7f1243f5662bd7652ab7e978e82ca1c8fcc8092ef4aca","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":188,"source_line_start":187,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"6bafa6e0ff48f89dca9e6a09b59218d670779177d5c6f2185db21b7d2dfde6fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":188,"target_line_start":187,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[187,188],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a634014f4410b7ce91ff21d02cb457679d5a91a89036f8dcb08d1fc3c28e3f6b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-042","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"45e897727a1747cc0dddb65fd2a0ffc79577b0066f1b2b243ebd7bf576c20fc4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":194,"source_line_start":190,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"9b895475dd746a984bc248160d00a5de9d4da97550bdfb97f54d7d40a694dca5","target_edition_id":"edition.r017.id-id.draft","target_line_end":194,"target_line_start":190,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[190,194],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d4bcc897e13efa71e4a41b6ddb90d2c5195dc34e164ceecc96043524e51f5973","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-043","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"22a197adf3a951c0a3747641778119570307153115ed0026bc8156401cb6f095","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":199,"source_line_start":196,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"3cd055b475e8ce96c49b6cf30e0ae2e0d7e513ade8e8aea8c351df15551ea26e","target_edition_id":"edition.r017.id-id.draft","target_line_end":199,"target_line_start":196,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[196,199],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82512b6f91a4e8c8be17899d6a6363473eadee58de9b0b636ff2368c566c7505","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-044","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"e73cbaf3a3a4082d23c44a814f210713f5a0b48fe46d6d6c89f11271fa106d25","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":205,"source_line_start":201,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"8f86f78b96200fe728d345e44ecfb463346ccad704a7a25a9cf25ce6ac693a3e","target_edition_id":"edition.r017.id-id.draft","target_line_end":205,"target_line_start":201,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[201,205],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e1e43d34b5b6adb9e2a2f5c5ea759ddb721e07c24a3920e50036fe64c86315b1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-045","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"9ef1688b251796bfaec3d6847b4274a6e739d80238cef71792306c4ea84ef35a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":208,"source_line_start":207,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"fdd304b12b0f9bd3799663b86ca61b5df9f7d8eebfc87c8de37e038003896d47","target_edition_id":"edition.r017.id-id.draft","target_line_end":208,"target_line_start":207,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[207,208],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ea968fd7c0f961fe7d0100216afe807e5aea29b1d23a3a8658a8f505580c118","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-046","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"cc4b2c4abaf305fbf7bdde815623727b2f03cf0e1b37ba4165a2a6dc61c200a0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":219,"source_line_start":210,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"cc4b2c4abaf305fbf7bdde815623727b2f03cf0e1b37ba4165a2a6dc61c200a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":210,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[210,219],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0217d4cdc4b2f23c980147beeab847fb039f6826e76a1d40145e65ea059c0961","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-047","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"57155767291582900c1e8ae10d59fbcbeed650cb30d6a72e285bd3e2e6757fe0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":222,"source_line_start":221,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"884f15cb4dbf16562441b83480ca5cda676e38029fb3ace1b94c1d8f01effb75","target_edition_id":"edition.r017.id-id.draft","target_line_end":222,"target_line_start":221,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[221,222],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8fcba7a7d3810632f27d81418a03eb2831fb1e8e3642b8f23ef4845a61e228f0","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-048","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"322f05f973ec1db32e7c340a3c902d8dfbb4f12689f5130ce47fae340b1b0ba5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":231,"source_line_start":224,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"f7192950021b90f6c785c9f7e59aa89feedc7c954f19f7e2f8028726f85660e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":231,"target_line_start":224,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[224,231],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cec7e44b4a670d34c1b9ea338d98648df59e32e0684d5b415a81ae6c254acf0e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-049","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"73e0f367e200c05fc5ada316be4f4a280ee989374fca2314e58838d540355f0b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":237,"source_line_start":233,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"e67dc29f8dfb8f41337aef8408903bbf8cac1bf670d8b7a43b4bcdaeffff14e9","target_edition_id":"edition.r017.id-id.draft","target_line_end":237,"target_line_start":233,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[233,237],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d27cff6335f5c452fc56ae617048064797dd2e4946f59a2b6f937b8153f4266","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-050","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"b0a37985143a66b35f056148650fccb530b55cf246f608de8b782d944a23b852","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":240,"source_line_start":239,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"9503878b5107379ed2b2d79efb5b8214930d3fba1da14fb8f6cfec0e08f0b0e8","target_edition_id":"edition.r017.id-id.draft","target_line_end":240,"target_line_start":239,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[239,240],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f190538062af85d2acbc7b41883e03c1f05ecb43841ad22d44a2e8e2f50ce5ba","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-051","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"7989f3b6ad95c9ad9775e291b2fefcf8f3aa2149df2a82ed04071ccaa6831ba6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":246,"source_line_start":242,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"7989f3b6ad95c9ad9775e291b2fefcf8f3aa2149df2a82ed04071ccaa6831ba6","target_edition_id":"edition.r017.id-id.draft","target_line_end":246,"target_line_start":242,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[242,246],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"082bc77780c14335bcbf9dc25204ee244412b83db6f67b671cfdd9f0041ee261","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-052","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"12735a97d9375168bd4f48a298dc47ab5fd26e220248b360b4fd93a5846dcdd8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":252,"source_line_start":248,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"cf0187f42d1b9103248fbe4e7d36616fc9a24d196c055e60de96ab5662ea995d","target_edition_id":"edition.r017.id-id.draft","target_line_end":252,"target_line_start":248,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[248,252],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0da1dd5706e85560872b14a0aea971af110420055c4ed270d456e24395f81a4c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-053","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"ec7918e7b2ff4347ed1cf77048a53c4a0fe16d04be35cc73aa6d8715f93a9594","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":256,"source_line_start":254,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"f937661aa9321e3a244ae175e32fd27c2eb94c3705471cdb4b63c9ef8579a154","target_edition_id":"edition.r017.id-id.draft","target_line_end":256,"target_line_start":254,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[254,256],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"006f43afccf84b5a3ba9dc614c17c7831283c3aaf6e31e344085b30f5e3852e3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-054","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"a1b14bb40e114d80bd6806332eaa7ca23e02bce3fd48a0256fdc87531795f595","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":259,"source_line_start":258,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"95157aa45c66d5864a5cfa016883d38408d8e25e41d91ec67ef3328147208ac9","target_edition_id":"edition.r017.id-id.draft","target_line_end":259,"target_line_start":258,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[258,259],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"363723e89faaa9ebfebde476e46744542f5b769857cc7a35c2aedc46c2f6f94d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-055","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"1d170233c3f6d4f3acbebd3489f7ee420a11b6a4fac3616ba57d2245c26ea0e6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":263,"source_line_start":261,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"4ad4e52e002de08edfb8b03d94f295e323f64992de80a625911720b5eb04f707","target_edition_id":"edition.r017.id-id.draft","target_line_end":263,"target_line_start":261,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[261,263],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52a6ee05752776da6926ed7f2d737630877ee015280ec886c82b6c88f70aa40b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-056","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"327ed495a8df873c657f5c02006d5118b1cb5ed145c9c60eee527648c2e75efc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":275,"source_line_start":265,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"6d7806de4260fd6ca198d586b18e49aabc5cea9f3e02550e1b801db1e69a3b80","target_edition_id":"edition.r017.id-id.draft","target_line_end":275,"target_line_start":265,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[265,275],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4075fe3946fff1320f63b72c1bfacaa87faebc68d70522875097400d3e8a057e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-057","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"fc44be00667477349566d3835e50cb7d664f5b546b20a95c4d249fdee051b715","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":277,"source_line_start":277,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"a18ba3524f786a860c924ac3e5bd971bdb88d0d577be3f1f5399ae82aba2fb23","target_edition_id":"edition.r017.id-id.draft","target_line_end":277,"target_line_start":277,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[277,277],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94bacb7d77575f2e90fc03a92d445b51f7d34f8f99341e0510b91836878f334c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-058","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":58,"source_content_sha256":"6889cd6992fad812b41d15673ed20ebade8212feb549b52c944239080d87a66b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":282,"source_line_start":279,"source_local_id":"block-058","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"f75ecb8e03953f03bc4e4147e52c131926badef5a2041b8e540f9adc39daec8a","target_edition_id":"edition.r017.id-id.draft","target_line_end":282,"target_line_start":279,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[279,282],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"59ba5d81f54b3297fae64deb5e280130a3aadfd3364a948c691c8bf80253d992","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-059","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":59,"source_content_sha256":"55d9019f625e4970b81ac454b8abab3b752960e4b90dd54af20580db613c7e49","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":284,"source_line_start":284,"source_local_id":"block-059","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"861ca44249b6a187dde8a46c2dca00f3a8f15e92e5a6f576a5479d6ce6efdc6d","target_edition_id":"edition.r017.id-id.draft","target_line_end":284,"target_line_start":284,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[284,284],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b8325648f9d7edc1cd59f9a6f3b98bf979eb009723c289ccf2f296ef9f7feadc","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-060","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":60,"source_content_sha256":"3d1b0082abb1e0b83d5e9eb1d79a4a0501ca7b57e1b5245890ac9ce4e6fc99c4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":289,"source_line_start":286,"source_local_id":"block-060","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"2d8014ca956109561dbfc82e8c479f7462ca111530ddead915d6c06f2054d8e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":289,"target_line_start":286,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[286,289],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48eaeadced9ecf1120df7f40a8b5abea78742e96a4c205dbee59fe2e5b138f24","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-061","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":61,"source_content_sha256":"b8d152d3026d178bb3607a29669636e04a19830969d6bb82b2b34c65268640b7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":294,"source_line_start":291,"source_local_id":"block-061","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"2f739a382b98518d855564641964f4ec353c51bcd420c54bbf354a27cfad4689","target_edition_id":"edition.r017.id-id.draft","target_line_end":294,"target_line_start":291,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[291,294],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e65dba66ad644aa6f1bd6c766b248915baceb13bc624bef91575bfa938faae2","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-062","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":62,"source_content_sha256":"04fb1488d3752dd15261757d008a35da289779b234bc17c0a8a80055edb9c44c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":298,"source_line_start":296,"source_local_id":"block-062","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":62,"target_content_sha256":"2c5038d48a00f5dbe2c6c9ea6cfadd3893b8efaa52b365b7611f82cbd2b7a54a","target_edition_id":"edition.r017.id-id.draft","target_line_end":298,"target_line_start":296,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[296,298],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0cac9220dfb7905acc0b1e36ed30022f0daef9e2ac29354c5379632c48043ad","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-063","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":63,"source_content_sha256":"f580ff2f42984a7e6c730eeb555ad60916cc070bc7b748eb306ffd17d7aafe92","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":300,"source_line_start":300,"source_local_id":"block-063","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":63,"target_content_sha256":"920d79330d0631272d386884c8dfacdce783b731dd8eec7f3f6fa4972ff9ea8c","target_edition_id":"edition.r017.id-id.draft","target_line_end":300,"target_line_start":300,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[300,300],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cccc1a6ea73558dedaab971058a91ed929e3fd8faddf223bddfe8e6826d7db08","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-064","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":64,"source_content_sha256":"a690c5c09eb6f4e94a8a05c64d2c0d9a78a49aa7a88a7b9357ff7c765091d7dd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":305,"source_line_start":302,"source_local_id":"block-064","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":64,"target_content_sha256":"0dc4d20b8fa9a24f8f2150465349ca3c6d1153c4ee5fe83b1ddbd95e651b660b","target_edition_id":"edition.r017.id-id.draft","target_line_end":305,"target_line_start":302,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[302,305],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4528ea6aa3e2fb8b2ef9324c9e142792d91d4a45ba43942d0e0d0f5745f6103c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-065","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":65,"source_content_sha256":"07ea9a3fd0574d36c803bf72ba0f850b8dcaa6cf838ee85a64ad95557d49d9cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":315,"source_line_start":307,"source_local_id":"block-065","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":65,"target_content_sha256":"e3bb184a217628d957ee8a9f4dcea98ab881e2722013195d54d9f0876fb6b15d","target_edition_id":"edition.r017.id-id.draft","target_line_end":315,"target_line_start":307,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[307,315],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9883ed5101fbe00dbfc65e41fe1c79ea5f6afc93a541bb861f68c2c39200b364","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-066","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":66,"source_content_sha256":"ec63ed699e3f5ca64657047a6379cef5119c210aa3396267da211653e0a6e500","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":318,"source_line_start":317,"source_local_id":"block-066","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":66,"target_content_sha256":"a8d93beae71d1e355d678cc772ac42becbe3afb33a55f1c143c1f1a224a5516b","target_edition_id":"edition.r017.id-id.draft","target_line_end":318,"target_line_start":317,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[317,318],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"65f8754f87bc3e2f8273d89ea8bc8943efa58281203989e5d82b6d1eea55bacc","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-067","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":67,"source_content_sha256":"39a24d67b80362c27c1edf7ae4ebdd5b34029688328081ba052c56f7a1c8dbc4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":320,"source_line_start":320,"source_local_id":"block-067","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":67,"target_content_sha256":"7a219f6b8a66b27b7d2f6fda0666b94e320c3caad369253fdd08ba790eaac387","target_edition_id":"edition.r017.id-id.draft","target_line_end":320,"target_line_start":320,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[320,320],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3abaf8243314622cd9582b96e2c54d9696d584468fa0520048378f2836301077","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-068","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":68,"source_content_sha256":"4757bac0ec0f87567048ac90a3971cabf3bcd61f57932cd1ff9729eba580d8b2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":325,"source_line_start":322,"source_local_id":"block-068","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":68,"target_content_sha256":"7312dcaa8554769f75ead66a7cb33c35d1c94339c0dbf5e6ffc4657d159e4399","target_edition_id":"edition.r017.id-id.draft","target_line_end":325,"target_line_start":322,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[322,325],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aefc612dcc749124508c7c43bff16a947a47dfdad1797416262536baaef7b424","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-069","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":69,"source_content_sha256":"3464bbdd0ce0fa103570ccc162d82be2d2f5959eecf52a675bfb9b118a056c1d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":330,"source_line_start":327,"source_local_id":"block-069","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":69,"target_content_sha256":"3ae5c6925ef015d0814a74956933fc685eaa2c196f5a019e5ad1f211d51d0049","target_edition_id":"edition.r017.id-id.draft","target_line_end":330,"target_line_start":327,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[327,330],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"691b0a65d4381eb23a4a0ce9c47d882e15687ed15afc0c147bd15cf43b17a16f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-070","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":70,"source_content_sha256":"37561f11240f93ed221670688d8d67ffd99ee30cb10e6d2f6592ce1c9d97c443","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":339,"source_line_start":332,"source_local_id":"block-070","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":70,"target_content_sha256":"22f73ef4837ba80c8cc7265be3b15745103befa8cfed1c965826add29f0b1ae5","target_edition_id":"edition.r017.id-id.draft","target_line_end":339,"target_line_start":332,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[332,339],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a737be42fb6a5e0b3b4263c4248a29a39201ca91ee57056cb599d01b6695714","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-071","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":71,"source_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":341,"source_line_start":341,"source_local_id":"block-071","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":71,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":341,"target_line_start":341,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[341,341],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce7b9025f7c761c48f66c0149799b4518efc2b9503ea5cb2cba567ba980ff8e0","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-072","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":72,"source_content_sha256":"acf27c23776424595f345dc80eabe5d465a329bb7e7cf237cb153f1b0c6a79de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":344,"source_line_start":343,"source_local_id":"block-072","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":72,"target_content_sha256":"9f3708ffa4a8fff2a990b17ade9592d767636e1943f68a79a6337d855bf8c7b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":344,"target_line_start":343,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[343,344],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"99b10916d404cd3c7769c8de9f6e181e48c762b24de5c6b12acf23c07a485084","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-073","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":73,"source_content_sha256":"b70ee4be0b2bf583c1e78cbaea30f23c4b5754c829e22c79fba2a4e298c4a035","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":346,"source_line_start":346,"source_local_id":"block-073","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":73,"target_content_sha256":"c17ae3c02efcfbb578aa29cee03287b178f814bcbefd77d8c0b5258bf39c2b70","target_edition_id":"edition.r017.id-id.draft","target_line_end":346,"target_line_start":346,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[346,346],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ace5ad34dce8faaf394736ef292af8cc88cd33939e6e3ecf1fd9f67d300636b4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-074","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":74,"source_content_sha256":"476d2a9c6f4d90a92473aba59b907364a90a27e5a276471ffc4cfd5785cce7f9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":356,"source_line_start":348,"source_local_id":"block-074","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":74,"target_content_sha256":"330b6bed1e8e5b70dd7f9c2b03a31b87352bb9f2adfea4037417320f42416a45","target_edition_id":"edition.r017.id-id.draft","target_line_end":356,"target_line_start":348,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[348,356],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d6fef47a5edda57412e0c8a2ec020517de2eb5fb45a1703dd5cae9fa361dbdc8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-075","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":75,"source_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":358,"source_line_start":358,"source_local_id":"block-075","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":75,"target_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","target_edition_id":"edition.r017.id-id.draft","target_line_end":358,"target_line_start":358,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[358,358],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1817bd8fce89ef717c62793de37bb672bc47a59b5d4b5812f50acb2abfa6e2db","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-076","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":76,"source_content_sha256":"6254ddb5ef76349277ed75a0255fa4c04d7fa95b54959bd115ef6ef362887aa7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":364,"source_line_start":360,"source_local_id":"block-076","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":76,"target_content_sha256":"694b13e91c4a626b26d414bc7842e3644af534cf9ad191507e8fba1ae48b0521","target_edition_id":"edition.r017.id-id.draft","target_line_end":364,"target_line_start":360,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[360,364],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0ca6c4ca4349931db10a0a45c58c91484acec08681393d7196b1b9b102115e6b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-077","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":77,"source_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":366,"source_line_start":366,"source_local_id":"block-077","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":77,"target_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","target_edition_id":"edition.r017.id-id.draft","target_line_end":366,"target_line_start":366,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[366,366],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"826aaef25426f84159c44ba2bfc878abf8fec219b195c77438378d40a5da8671","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-078","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":78,"source_content_sha256":"440829aee9a7ec1a2148e993c09cbf81c731c0d1761a6a0bbcddb7233beef39d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":373,"source_line_start":368,"source_local_id":"block-078","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":78,"target_content_sha256":"af8a60dde3ead82b07aab8993f6241a288e0966504f805b6ecbd9ad084003836","target_edition_id":"edition.r017.id-id.draft","target_line_end":373,"target_line_start":368,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[368,373],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e6ff0678aea8a47889a29eb5fa456b95fc46ad07a004ef03eeb04885c5981328","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-079","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":79,"source_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":375,"source_line_start":375,"source_local_id":"block-079","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":79,"target_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","target_edition_id":"edition.r017.id-id.draft","target_line_end":375,"target_line_start":375,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[375,375],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a65b14a86072b0684b3fcc126582d5820dae82a97bae375dec0a089b3c73a731","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-080","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":80,"source_content_sha256":"b8b19c8617a66b0b8cbbbbdee9d6e4494a24ed26bc63e0c50a1778429c5c08c0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":383,"source_line_start":377,"source_local_id":"block-080","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":80,"target_content_sha256":"e4d7933b1af1b696ac0fe05817c9e8e83bf4695f5e6cfbd88a62a5759aed1c80","target_edition_id":"edition.r017.id-id.draft","target_line_end":383,"target_line_start":377,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[377,383],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"459b67d1d471e3ade531c77657b68e28763d6a2846a108d2de23c7a1a19f58e1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-081","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":81,"source_content_sha256":"fb33d03f91f0391310f414ae64f69843391dcdd48c98a8ff0e1e8682bd9bb554","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":385,"source_line_start":385,"source_local_id":"block-081","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":81,"target_content_sha256":"a58da77a00c0371f7ceb69694bbe5fbba2459d9b082a9cef07688f087662b5fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":385,"target_line_start":385,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[385,385],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e0be47e0ef59f518cb1afcf96a8bbcadff4b62fd50204fecbc0d9a9736fd10d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-082","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":82,"source_content_sha256":"de025dee7e22fe4d8323da1a61053b5f614fdc7667c9b9db42d6b21d9785849e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":397,"source_line_start":387,"source_local_id":"block-082","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":82,"target_content_sha256":"ff50ba9c1b06499c77b826369e118d594914011bf11690152124488fc0be1ae0","target_edition_id":"edition.r017.id-id.draft","target_line_end":397,"target_line_start":387,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[387,397],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e70efb8cd91aacb53a6db91bcb16d8d619f425cb6d079220035db67b4d1d4e3f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-083","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":83,"source_content_sha256":"083101549b2655367d994c34da247652aa86e80e7ac3692c521d94c9cf9ef0e9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":406,"source_line_start":399,"source_local_id":"block-083","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":83,"target_content_sha256":"1f8a2a122241d8de7e27a6c30cd336b7b8c4d9fc71a5b77b0d0f5fc6014c4f72","target_edition_id":"edition.r017.id-id.draft","target_line_end":406,"target_line_start":399,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[399,406],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b554bfbbad52cb66683c69b18d9f6ff404d8b26845d226ba02754fdabb69def","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-084","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":84,"source_content_sha256":"7e6df6e5c9e22e133d7a7014f532aeedbaff25abb5153a9e917a488b3fee7c6e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":408,"source_line_start":408,"source_local_id":"block-084","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":84,"target_content_sha256":"636633caa5f247987aba4a48025da03b1845f2bf5439265726704d1318aa8da3","target_edition_id":"edition.r017.id-id.draft","target_line_end":408,"target_line_start":408,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[408,408],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"306bb3feb2a39bd19ce4a737540653b8d9373964b2ea646490622f8b65807e4c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-085","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":85,"source_content_sha256":"735c12ecfdfb117d2bf32bfa5f51e611cf57efef1c64f103ca3c4f2a860f1097","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":416,"source_line_start":410,"source_local_id":"block-085","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":85,"target_content_sha256":"740cd040f063092ae4bc7c18fa24a93645c4bdbd20acbe1f5fa46bf3fe483d41","target_edition_id":"edition.r017.id-id.draft","target_line_end":416,"target_line_start":410,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[410,416],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9565a4112599f442faa83c0cbb45c0fe2c24e4cc32a7a59fae56b4c2a2187da1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-086","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":86,"source_content_sha256":"b8c6b017c34d3006f6a855b2265cc65957dbb78aad3d044a5e286bd0170870cf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":422,"source_line_start":418,"source_local_id":"block-086","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":86,"target_content_sha256":"a18bcb0cfb9ad4a0c8dffdcbfb5fe4b64955e5609de55dc9b3d6419a99504468","target_edition_id":"edition.r017.id-id.draft","target_line_end":422,"target_line_start":418,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[418,422],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e51fb2f83a232f730df25eefc525d261ed3a8f28fa2d8acc21bea563bfc05a47","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-087","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":87,"source_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":424,"source_line_start":424,"source_local_id":"block-087","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":87,"target_content_sha256":"1ea06a4806339a2e39252d23a52f90503c4f364adfa3e9fdb024b39998812c41","target_edition_id":"edition.r017.id-id.draft","target_line_end":424,"target_line_start":424,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[424,424],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8fb59d8d72efae47bcffba292a545f3f77d8eb91bab54125d8cc5c4b7783a60c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-088","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":88,"source_content_sha256":"e3010909a6e0fdcdeabad056e888ff1e26455c2f94c11052bb7a0f61f22fac31","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":427,"source_line_start":426,"source_local_id":"block-088","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":88,"target_content_sha256":"cd6e786b008257ab80789de14297ca8327e9a2b6f55b1c0d7ad18f31ee016cb1","target_edition_id":"edition.r017.id-id.draft","target_line_end":427,"target_line_start":426,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[426,427],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"097370404e30a0fef8a4f5b69ce2e0f16732af2ff54d9bad94a40b15859b9131","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-089","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":89,"source_content_sha256":"867cbc7eb06755f7aec91c50de5f90ea9308b8da36ae52bd97973bd96fe35b98","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":430,"source_line_start":429,"source_local_id":"block-089","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":89,"target_content_sha256":"5a2808815fd4e5b9cd7f57f64405609c08bf31909390743ade69d3aa886d8d2c","target_edition_id":"edition.r017.id-id.draft","target_line_end":430,"target_line_start":429,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[429,430],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"89c28d8f3c7cc66d56ceb24f708d3f2fb900f2354231f48f1ada0feedaa64f9b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-090","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":90,"source_content_sha256":"610454a113ae3983a600da48bbf15b5fad3b57d560584c56c5c3360e324acb54","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":433,"source_line_start":432,"source_local_id":"block-090","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":90,"target_content_sha256":"915d8f5e5ccd4d07b9870fd1a54a5ebf0981d8fc43c2e3e6a3551a19c9fc24bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":433,"target_line_start":432,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[432,433],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c353c31bd942bc1bb2af22bc83b3d88eb65c9ee3be14f399f046dc8f396981a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-091","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":91,"source_content_sha256":"4e6db53e363b99bab2dc67a0d9a38df2cf8b4ae5c8f42b2068b63a2cbbd886d8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":437,"source_line_start":435,"source_local_id":"block-091","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":91,"target_content_sha256":"23f5a47a4e712678668b2fb9fecc77e8c8f96ec660e821865e4e0143550670bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":437,"target_line_start":435,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[435,437],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"518a5250c1f2067b548be23068e7c5364475006ba064d6b20260f5b9579d0a8a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-092","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":92,"source_content_sha256":"97cb955beb40613c9023263a48e098018e9e4314ca7a10ec863f160d4fd4a8f4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":440,"source_line_start":439,"source_local_id":"block-092","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":92,"target_content_sha256":"fed6f39c24e3df252a0c9f36f074c8ec0933d65b3e920089a803f86812648cd0","target_edition_id":"edition.r017.id-id.draft","target_line_end":440,"target_line_start":439,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[439,440],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"55574d18b8eb71a5702c89787931f39aa74130398f87ba260e2b43c7264a69e5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-093","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":93,"source_content_sha256":"656bac2e5a4ff6dfb068c4df551b846f564a7761def6345e9e4b3ccaf12f44c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":445,"source_line_start":442,"source_local_id":"block-093","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":93,"target_content_sha256":"996e44220ed3c0a9aa679732db71a224ca00a7df962806cc807ce694bdd16f14","target_edition_id":"edition.r017.id-id.draft","target_line_end":445,"target_line_start":442,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[442,445],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2d262faf4cad070f1ab24bd2686559ffbcb81cd5fdb0f8eeb26918b252f6db4c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-094","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":94,"source_content_sha256":"d80d6593dd1b75e7e2ee8681cd9439e22af0ad01ca947c928957f2d389349d43","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":447,"source_line_start":447,"source_local_id":"block-094","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":94,"target_content_sha256":"3e702f2b29d3587d9acdd4cfca50ba647a9941357a4c3429cbcba6d4adf6be05","target_edition_id":"edition.r017.id-id.draft","target_line_end":447,"target_line_start":447,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[447,447],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa659551d864d8836bdef568b5266ec79106136f49fce6481bd08f8894e8f258","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-095","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":95,"source_content_sha256":"3d111a5072ed123441ef989a7d47afcec1ee6f9f5333c72e7034049e460f818f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":454,"source_line_start":449,"source_local_id":"block-095","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":95,"target_content_sha256":"288c6501e9d97d2ba0312de574652be567f1e325ac9b8f6d87128fd6c6c075a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":454,"target_line_start":449,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[449,454],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e2cb7ac8d5be1a39e14af0a60417d71eff55ee9013e944fd16f029577456eb9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-096","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":96,"source_content_sha256":"ecc49ee163a852cef1834826f94fe861f62291edf0e9cabda9139f9d82919dbc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":457,"source_line_start":456,"source_local_id":"block-096","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":96,"target_content_sha256":"2bccb9807577c64c84b8ff632818fcb22b7509baefb719556896df4e62402621","target_edition_id":"edition.r017.id-id.draft","target_line_end":457,"target_line_start":456,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[456,457],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23c7440f63c7c5f758a62a50f9f2ca3c03e5a0c7cb9f113a89af7b2a266b1813","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-097","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":97,"source_content_sha256":"0465da500e2950ac291b0a407601ab5a5e2f32a3ea17340bec31350cd9b6aa94","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":460,"source_line_start":459,"source_local_id":"block-097","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":97,"target_content_sha256":"83060a99fff7ffc952fe18b716620dd7df4c18e271b22eed9237adff78758f12","target_edition_id":"edition.r017.id-id.draft","target_line_end":460,"target_line_start":459,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[459,460],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e087cf60c9a5cbe9f349ab802919e614476eeda5fa15c7019576743d77dc50e9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-098","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":98,"source_content_sha256":"616a4ea719c3163ce1738d78517e7c9466861f7b104ce3993578081718f27335","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":477,"source_line_start":462,"source_local_id":"block-098","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":98,"target_content_sha256":"5d8108b4018d818c2e3825114d2c921aadbe070f96466833fe4dc4d64d52724a","target_edition_id":"edition.r017.id-id.draft","target_line_end":477,"target_line_start":462,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[462,477],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa86cfa9cea137957770516a5605c3e3e8dbcd0f56c5e1cee5abb3a2985f9d66","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-099","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":99,"source_content_sha256":"e3aa05d0e0ab3d3cd6f5f2ed12e2d64fc082cd3fadac8b401e0c5f3c0d275eea","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":489,"source_line_start":479,"source_local_id":"block-099","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":99,"target_content_sha256":"3b52fe942b9a769fe44c50c9d5fb6828463464729590750bf7953c416ef28401","target_edition_id":"edition.r017.id-id.draft","target_line_end":489,"target_line_start":479,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[479,489],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"122bf1de8ee0881f74a58046f1452e24a9107322e7c8c626f6c23fc95409bedf","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-100","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":100,"source_content_sha256":"69d07cb9fea0ad6db3909bc28868690bddb3186b51d3b6a85ae1d6d14d072b59","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":498,"source_line_start":491,"source_local_id":"block-100","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":100,"target_content_sha256":"bd6e63789bd0eb6ada0f1eb6e601442f481f196ff8eb0096d9faf9734764bbae","target_edition_id":"edition.r017.id-id.draft","target_line_end":498,"target_line_start":491,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[491,498],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0766786fa998963b1a52df7cd48b53ee6f989def010d24546a4694cb77f81e8f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-101","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":101,"source_content_sha256":"0b63e77432e6ceb1adf12ef579ca8f3a4f89092719803dd9404a8ad4dbe0a586","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":506,"source_line_start":500,"source_local_id":"block-101","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":101,"target_content_sha256":"e3b525f77bc41af4db8169abfefec078cc3ed50bd8a758d9c73f7db43040a074","target_edition_id":"edition.r017.id-id.draft","target_line_end":506,"target_line_start":500,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[500,506],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"782cbacdc3317dd45c71412e6d831e870b5addfedd6923538d446399f5bd568c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-102","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":102,"source_content_sha256":"96e7f5e7dad5df90fd3e20992ae9a82fd98e07ecdac71da74c6e52406d570fe8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":517,"source_line_start":508,"source_local_id":"block-102","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":102,"target_content_sha256":"06e62e9b3bb6408f021e09b952f2d685411439d34b6789824c295ef096384489","target_edition_id":"edition.r017.id-id.draft","target_line_end":517,"target_line_start":508,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[508,517],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"973d7a2dc70acc9e668288922f86ad1d27e9a810d15c1a7f20f48860fc8d5801","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-103","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":103,"source_content_sha256":"9219fc67ffd5fd7835bff8a1eb6603da307a13f47633b419fe6876965a2c5cc7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":523,"source_line_start":519,"source_local_id":"block-103","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":103,"target_content_sha256":"4d2eb1cb0940870ff26b053cacbca2c75bacd6201aa063a6d77af06e35def398","target_edition_id":"edition.r017.id-id.draft","target_line_end":523,"target_line_start":519,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[519,523],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f307e1c72aa76dd7757abf39bcba1dc488385e8b7cc2efedf3473cf250fc2f1c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-104","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":104,"source_content_sha256":"2d5aeeeb9899aaf5188d2df58233fc9075986039c42db696904c3c4947e52245","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":531,"source_line_start":525,"source_local_id":"block-104","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":104,"target_content_sha256":"2d5aeeeb9899aaf5188d2df58233fc9075986039c42db696904c3c4947e52245","target_edition_id":"edition.r017.id-id.draft","target_line_end":531,"target_line_start":525,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[525,531],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"73cc49b62feb5b4f2ef059ba86602bc7a0bdda2b80ad4a002562dd1d4a34ad02","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-105","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":105,"source_content_sha256":"9fb098e46684c9c88762d159c8e9533ddeb5854ff10ecf91d5589f46a6a2ffaf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":537,"source_line_start":533,"source_local_id":"block-105","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":105,"target_content_sha256":"0b71252693512290b05a9b078a9d55494557417758e3ee42433f6492bf96266d","target_edition_id":"edition.r017.id-id.draft","target_line_end":537,"target_line_start":533,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[533,537],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae702540b127074d9ecb8c44568f3b207eedf57466a96b640e3524983583097d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-106","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":106,"source_content_sha256":"f99af4079ac583b902dbfa514beb0179c597dbfa8685d053eb2bc32d06fa7c0b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":541,"source_line_start":539,"source_local_id":"block-106","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":106,"target_content_sha256":"f4e4d349ee5116b0bab753c42c50f09c600afec730a7dc4c37a51e08777ae9a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":541,"target_line_start":539,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[539,541],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9edb58a127f9fb45ae0162c3de870f716804f5ccad6de4a08539e2e3cfa76f2","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-107","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":107,"source_content_sha256":"bce6f068469729b136cc682c8a6475b4f6a21d57aab39d19ca867c5a2fc9b640","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":546,"source_line_start":543,"source_local_id":"block-107","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":107,"target_content_sha256":"bce6f068469729b136cc682c8a6475b4f6a21d57aab39d19ca867c5a2fc9b640","target_edition_id":"edition.r017.id-id.draft","target_line_end":546,"target_line_start":543,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[543,546],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c662aeaeeae0a4bd275d96750f77c30983cca457c28f0d22a0c526464d3a587","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-108","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":108,"source_content_sha256":"08e80ab4e2c76ecf1e1c3ed080bc37281b1e059732cf7fa346d1320c5ebd5abf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":550,"source_line_start":548,"source_local_id":"block-108","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":108,"target_content_sha256":"08e80ab4e2c76ecf1e1c3ed080bc37281b1e059732cf7fa346d1320c5ebd5abf","target_edition_id":"edition.r017.id-id.draft","target_line_end":550,"target_line_start":548,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[548,550],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3d97f9254763793adb065e05705f7dd8175ec23c4f7cb4944f3d21a935f74c2a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-109","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":109,"source_content_sha256":"266781d39fc163c67669912ec76c1124322dc7317cb67da63f265650f21e23ef","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":554,"source_line_start":552,"source_local_id":"block-109","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":109,"target_content_sha256":"914a42d6debf8d1766e7cb76533e102855bdf070dfa2bc438a73235de740ea6e","target_edition_id":"edition.r017.id-id.draft","target_line_end":554,"target_line_start":552,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[552,554],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8aa3d01fae61adfabc927b6b50fbdf771be26a245a7948edd57595a864cd3a63","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-110","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":110,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":556,"source_line_start":556,"source_local_id":"block-110","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":110,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":556,"target_line_start":556,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[556,556],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dab3dc64e01c586e1e4f1c7f7fb1a49906f0265e6177ebd70f47a1ce8cdddef9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-111","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":111,"source_content_sha256":"bd5010044a6a0897554377c9c612f28161cae0ca0c4c32440d843047a461da5f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":558,"source_line_start":558,"source_local_id":"block-111","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":111,"target_content_sha256":"35f9b26e643433d40fc2ffd1f020c44a367c39193b3b14752fd9bf918685e67c","target_edition_id":"edition.r017.id-id.draft","target_line_end":558,"target_line_start":558,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[558,558],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a54ef3e8f4f4758c77ddb107f46b136b26d47724deff44f44a4c1e20aceba2a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-112","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":112,"source_content_sha256":"448a055a1da856aba8577d7bedbff1f48eb245b9fa49daa4d9293359bf5cca5f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":610,"source_line_start":560,"source_local_id":"block-112","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":112,"target_content_sha256":"69430bd9c6b680e1cb899827908e44eba73f5da2a8ef991f588cf6c44822e712","target_edition_id":"edition.r017.id-id.draft","target_line_end":610,"target_line_start":560,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[560,610],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce344b8f7b80eb74e0c6a5721608ee2e64a3bc88ebb5426f9c2b1e1d6207fff7","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-113","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":113,"source_content_sha256":"bc35bc8d1ef5f2a95a6b70800dfde9698e6470d5a0f6974348589dcecd78a9e0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":618,"source_line_start":612,"source_local_id":"block-113","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":113,"target_content_sha256":"6aa9d051ee371e055720c7a0ef7917b1ce15a911492c84fb372f7b7ecc4530c9","target_edition_id":"edition.r017.id-id.draft","target_line_end":618,"target_line_start":612,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[612,618],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb400fd23ba311bf2c566d9774b04fbbf18a5cc7c4e21bbc26101dc8a9b729b9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-114","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":114,"source_content_sha256":"2430b7ddff6fe84a9196d95837ae1e5a4b5424da22c029be3ca4709164225829","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":620,"source_line_start":620,"source_local_id":"block-114","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":114,"target_content_sha256":"d3d79b06c68a06460afd99e72f2d4653b50ee1dfe15c7190aa4bd5d02474f455","target_edition_id":"edition.r017.id-id.draft","target_line_end":620,"target_line_start":620,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[620,620],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26b6170dc090c9f25f0c1fe3d21fe1d304637e0c8a62671770329a229f4eba88","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-115","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":115,"source_content_sha256":"6f197ed6d17be3a6dfdd4d2da384c0119cd50b719ee344c9b6d7dc2931fd80e8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":637,"source_line_start":622,"source_local_id":"block-115","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":115,"target_content_sha256":"38741c7b27ac8ea2a36738f4613d45f46e279c0c8d5dc1dd4edd2b10d79f2187","target_edition_id":"edition.r017.id-id.draft","target_line_end":637,"target_line_start":622,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[622,637],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c96c229955e0c2d011d68e2293aad1d506359fb2705198160755981d09e2a29b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-116","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":116,"source_content_sha256":"75f832a34c8bb458f07ed20ba71bf6bcf1ff0c93febb830513126d16d82f374b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":643,"source_line_start":639,"source_local_id":"block-116","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":116,"target_content_sha256":"eff7e8c5ff4f074edde44b32f142a71ec39d70eb25ebaa58309be3acaacf2177","target_edition_id":"edition.r017.id-id.draft","target_line_end":643,"target_line_start":639,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[639,643],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e32c12b954a150b5ce37517a50bc50818f2f0a23267bf99960469da0bc474d60","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-117","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":117,"source_content_sha256":"7991ed6ad7818500ff9d1ca3323478517c5555a49a5a537870443a77716d0f33","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":646,"source_line_start":645,"source_local_id":"block-117","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":117,"target_content_sha256":"7cd49ec455ab55309ddf0130ea0ae036a77d8538f0511cafe5f04b7f4156150b","target_edition_id":"edition.r017.id-id.draft","target_line_end":646,"target_line_start":645,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[645,646],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2849af9896c212d65725cc42b7060d5550a290cb1904d964630d0ad845cf4f19","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-118","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":118,"source_content_sha256":"5e515de17f1e904c0f3dd84900b547d9e30519fd92b1cb4734b40fb5b28894ed","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":675,"source_line_start":648,"source_local_id":"block-118","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":118,"target_content_sha256":"17ef35e5e203b522d4772823c99b3bb9c6573ccbf9daf0e6a6d38b2e5772990b","target_edition_id":"edition.r017.id-id.draft","target_line_end":675,"target_line_start":648,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[648,675],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"421d0ea811c942fe9ce74b15d82cb63de59b5d54c2415157ee33202d47491f87","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-119","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":119,"source_content_sha256":"4134e45328a58545a270ce598110d3c01712fe0e3e5ef93629229c2d493f5879","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":678,"source_line_start":677,"source_local_id":"block-119","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":119,"target_content_sha256":"623bf3e1b84a049aeb778dd9d35b446e8fbdb2a780642b864ca920346b8f7fa0","target_edition_id":"edition.r017.id-id.draft","target_line_end":678,"target_line_start":677,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[677,678],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6eee939d49bcb9193e0a2c619a191bb5f489a43351dd5ad592279905e629b80d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-120","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":120,"source_content_sha256":"db37e51a7267c0533825a79619b68974e5ee111b60f2cc3751e7bf8b7033f27f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":690,"source_line_start":680,"source_local_id":"block-120","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":120,"target_content_sha256":"661bf8beaaae298368a0354052a35a0a943a0174a3d1e943685381e28c5c61a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":690,"target_line_start":680,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[680,690],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"53bcd5f529e5135026010ca04b523870f057e60c30d437e35007cb508185ed22","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-121","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":121,"source_content_sha256":"844cb37b4d15f083f4b7851f211690b7f69fbbf226c163c5934a0907c68dbeeb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":698,"source_line_start":692,"source_local_id":"block-121","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":121,"target_content_sha256":"844cb37b4d15f083f4b7851f211690b7f69fbbf226c163c5934a0907c68dbeeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":698,"target_line_start":692,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[692,698],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed44b552a53ed73c80910b703cdc10edd952e13f3f5be7ff71179d29271840cd","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-122","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":122,"source_content_sha256":"8e5d011ae1d3a81bfdd668c07166061f4bc144aa8a7ed150b226519c79119e02","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":700,"source_line_start":700,"source_local_id":"block-122","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":122,"target_content_sha256":"8e5d011ae1d3a81bfdd668c07166061f4bc144aa8a7ed150b226519c79119e02","target_edition_id":"edition.r017.id-id.draft","target_line_end":700,"target_line_start":700,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[700,700],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"75fe1a3bf2d4f2d6eb885e19f13668187da4ea27bcd5916412b7b514dfe41b1a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-123","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":123,"source_content_sha256":"4ff19577aa4a784f4a8e5b9960391ccd28ba671768e506a90be5d4c7f079fdb7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":707,"source_line_start":702,"source_local_id":"block-123","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":123,"target_content_sha256":"4ff19577aa4a784f4a8e5b9960391ccd28ba671768e506a90be5d4c7f079fdb7","target_edition_id":"edition.r017.id-id.draft","target_line_end":707,"target_line_start":702,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[702,707],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"360c88f85ebc3298be533d009c9fc94e88be762e06d38faa01754586fd754051","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-124","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":124,"source_content_sha256":"0bc44b189656151b2ed87ad41c7243d5081252effa2d23c36c93709e51a5bc20","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":713,"source_line_start":709,"source_local_id":"block-124","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":124,"target_content_sha256":"0bc44b189656151b2ed87ad41c7243d5081252effa2d23c36c93709e51a5bc20","target_edition_id":"edition.r017.id-id.draft","target_line_end":713,"target_line_start":709,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[709,713],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e6509dc10cddb77a974cc60184011ea545a3b1217f273031fa9df31274e8cd69","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-125","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":125,"source_content_sha256":"8861b32670168746a08bd762e59381f95745974b57e86f87d213012eede2f22a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":715,"source_line_start":715,"source_local_id":"block-125","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":125,"target_content_sha256":"8861b32670168746a08bd762e59381f95745974b57e86f87d213012eede2f22a","target_edition_id":"edition.r017.id-id.draft","target_line_end":715,"target_line_start":715,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[715,715],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"73fae698c5a6713fe5e7ae03dfef3f7cc00d257d3b2944c1db8611f1837bb1a3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-126","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":126,"source_content_sha256":"e5077a692f5dfe5d8422793ef02fd7a78b9c7d0b9cd430437caa39b662884a0a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":724,"source_line_start":717,"source_local_id":"block-126","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":126,"target_content_sha256":"3d1ab4c175c87c80dd8bd31e88f6772b09891587936d640cd408a52799cb0658","target_edition_id":"edition.r017.id-id.draft","target_line_end":724,"target_line_start":717,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[717,724],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ffab71d2979d50c4ccd8059d2f6cf198fc83fff255fd536ef077d99aebcf91e9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-127","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":127,"source_content_sha256":"2a503b5e105e4df359f3db3a1c7801c94c41c0ed384d87fcbf745bb3d108a766","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":731,"source_line_start":726,"source_local_id":"block-127","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":127,"target_content_sha256":"ef6dd465b5068f3d14e605762e92eb212b6df89e594ab04fc97dc2d67f8b372a","target_edition_id":"edition.r017.id-id.draft","target_line_end":731,"target_line_start":726,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[726,731],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dbc62ca7e90781ad07359a60f69024308939962382bfcfa7b0939b8da0a5f013","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-128","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":128,"source_content_sha256":"1fc522d33c84c4931a6413bba9f4c086915dddbc407dd7434a334a31cafef65f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":733,"source_line_start":733,"source_local_id":"block-128","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":128,"target_content_sha256":"a04ba0d7924d432bbbb2314c20d970986660da5f7305bac2ba82487e74fdf94d","target_edition_id":"edition.r017.id-id.draft","target_line_end":733,"target_line_start":733,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[733,733],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a488d931f94bc2207828fc73a9d14f1ffb38a4b0e2468ec0b4d4a927bbd8349e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-129","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":129,"source_content_sha256":"ba9b9b89ea6b73cccfb28ff7a8caf339513a13ea65a0465b78d9cbe9fc9020bf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":735,"source_line_start":735,"source_local_id":"block-129","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":129,"target_content_sha256":"a79978b0397c9fbe14a1b5e2622cadfd7b558a1f6660a8c8fdff4227eac4a970","target_edition_id":"edition.r017.id-id.draft","target_line_end":735,"target_line_start":735,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[735,735],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1fe4b7d39cfd0e3e4f0c53d999bb5d369876f87cd636fb5360468f76815d33e1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-130","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":130,"source_content_sha256":"902f279e44fb25aa2cec92d8803321fa87c006309fd0278d93386aebd3482339","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":741,"source_line_start":737,"source_local_id":"block-130","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":130,"target_content_sha256":"70c7e9ca0133b76a077c4964f3707d0b32d56ea4a4f4931c2a63fa5464032b40","target_edition_id":"edition.r017.id-id.draft","target_line_end":741,"target_line_start":737,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[737,741],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"667eeeca183cd7568c9b4f5f3e6b1fe2a508617574c2f7308f0e3bbda1fab5ac","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-131","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":131,"source_content_sha256":"6a14cc1da0292d2e1236a69592396d7005c48e3c0adafa16c6f638c50f21bde3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":762,"source_line_start":743,"source_local_id":"block-131","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":131,"target_content_sha256":"6bc005aa0b937d17efb35e520f6ca2d60369c3e722cf2018dea2e44ae0cb13d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":762,"target_line_start":743,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[743,762],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23459aecf0cde831f6cac670ce97341cb1a2998992dbe69c6ccd74660d59be81","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-132","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":132,"source_content_sha256":"a3e67600daf858010db49c31d68e0abab87d301cdc8da4ef8b5d025c3e36c5e4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":766,"source_line_start":764,"source_local_id":"block-132","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":132,"target_content_sha256":"a3e67600daf858010db49c31d68e0abab87d301cdc8da4ef8b5d025c3e36c5e4","target_edition_id":"edition.r017.id-id.draft","target_line_end":766,"target_line_start":764,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[764,766],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92c363c5f79506883f41e520897c0fd5dae3176ee6be065b2860d2606575044b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-133","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":133,"source_content_sha256":"ef10bc7fbffbfe610ef1b55a01e4bbcf72258a610a830d2e8894194267c4663b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":774,"source_line_start":768,"source_local_id":"block-133","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":133,"target_content_sha256":"fd19fda62a75986ef5c4d03e7bc0bc2c2ca16c507625e0ba064ef20ee4d124ca","target_edition_id":"edition.r017.id-id.draft","target_line_end":784,"target_line_start":768,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"alignment":{"authority":{"exporter":{"bytes":152116,"function_lines":{"alignment_parts":[1793,1832],"nonempty_blocks":[1292,1308]},"member":"scripts/export_backend.py","sha256":"3edee807a41c766c84efbda2a67b209b3d41a8afa7dbf00252ee3cdd846eedb9"},"input":{"bytes":448536,"member":"backend/input/backend-input.json","sha256":"c70da303e2feade5dd52092b8e15b722d0ea8cd5e26be63d8cb001739b55daba"}},"contract":"frozen-native-exporter-strip-each-declared-part-then-double-LF-join","parts":[{"line_range":[768,774],"raw_line_slice_sha256":"29e03e27b08cc57bf2d56f5248ba051150ef57fc99a776c76876204cb5eab2c4","stripped_part_sha256":"dd12488480cc4c8c26eecaf91160b7d8b04d7afd0eba9fc991fcb7db9db5299b","target_block_index":133},{"line_range":[776,784],"raw_line_slice_sha256":"8e937810f68e82c88cf19f7c5961c4f4ef7e727cc0d9575366d469fc292602fa","stripped_part_sha256":"a72653ce4674a12c5b5a7592cd0a5ef192b465a94bbef33982dc243e9b8ec847","target_block_index":134}],"reconstructed_content_sha256":"fd19fda62a75986ef5c4d03e7bc0bc2c2ca16c507625e0ba064ef20ee4d124ca","source_block_index":133,"target_file_guard":{"native_expected_sha256":"b18eac29969fdce112da5ceb83b74518138d1bcaa22efe52aeee2411676b9b7c","released_file":{"bytes":136863,"sha256":"42c1640cd736a36e55d812fa58c696edbaa56958b02a2cd17c2cc301d0b30179"},"whole_file_guard_matches":false}},"archive":"source","line_range":[768,784],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_native_alignment_parts_exact_text"}}},{"canonical_native_record_sha256":"759c053323df9050a2f6c674241182cf2b8c36cfdea53d6b5ca1d39c30db5868","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-134","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":134,"source_content_sha256":"c9761ac499da9dcb635ec6d2afeae33e4e5f614b3d95a1d7842102741ffd397a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":781,"source_line_start":776,"source_local_id":"block-134","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":135,"target_content_sha256":"c919ce6c361d4a508699f79f8f8fdf4d15d12453993a1fd3163c7cfd1ff661f7","target_edition_id":"edition.r017.id-id.draft","target_line_end":797,"target_line_start":786,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[786,797],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"669fe8a8a045df5613a53516bad8cdefd0c733be428446c59191424403b1408f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-135","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":135,"source_content_sha256":"c9795401482b883dd163f7201779f4b5434f29e6460c26669d7fb76e1b18af66","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":791,"source_line_start":783,"source_local_id":"block-135","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":136,"target_content_sha256":"ba770799b8d636f216a6cad65b7a4f0b07dae96ca1c7135a7022bc58e0a32432","target_edition_id":"edition.r017.id-id.draft","target_line_end":804,"target_line_start":799,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[799,804],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e77d07e434127605240ae2599b0c2fe67ca2689979931d147ed064097edad4e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-136","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":136,"source_content_sha256":"8120f24181677fdeaef294b36c80f564943063d800104034ee1f0d1c970c2f78","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":800,"source_line_start":793,"source_local_id":"block-136","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":137,"target_content_sha256":"6508cbed9cddaf19438d27dc8d10f17715fc651e208e62563ecd910aacf0e61f","target_edition_id":"edition.r017.id-id.draft","target_line_end":813,"target_line_start":806,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[806,813],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fff229815db1d67149e4a8ee2ada7c3cec2b6843945757f865062dd9ef7f569f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-137","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":137,"source_content_sha256":"217252ebe59ff470bef3b00706acd1d208ff3679beb775ba44836e2fb13fc5f0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":821,"source_line_start":802,"source_local_id":"block-137","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":138,"target_content_sha256":"3dfc8558a0a9a38edfe331fc7fa33666c5e82fc7597e7fbc1605119b305222f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":834,"target_line_start":815,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[815,834],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a08e1e7d8a54c8492412d79c24d43ea71def0d1370467b880aeeea1b0c2de95b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-138","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":138,"source_content_sha256":"30a9c9f1652524d4c453e21f7be59098c056aa45a93ad764f2a226ec95dcf9d0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":823,"source_line_start":823,"source_local_id":"block-138","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":139,"target_content_sha256":"3a5096c76d6ef6dcb1809e495f85cc2639ecda48c3b099aa4e383836627c01c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":836,"target_line_start":836,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[836,836],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"703b321afbefb22cea2af4c0cbb410073d6c89f8272756b6ac3e1237e5c4158e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-139","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":139,"source_content_sha256":"5b56cffd182a704b8edc7a800c9810110051ff9482dd3ae111c95079e85d8179","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":859,"source_line_start":825,"source_local_id":"block-139","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":140,"target_content_sha256":"67ea9a2109e21d9d4799f6f383216cb83ce18aaf130252a62046af8a884f5b8c","target_edition_id":"edition.r017.id-id.draft","target_line_end":872,"target_line_start":838,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[838,872],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9d05b9121bec9831ac6816ebdd5d56a3c2fada89e1b699fc1dbc624f523dc54","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-140","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":140,"source_content_sha256":"a462400d3bea84a23fc812ab5a3ca83941526c0af61aedaff3f834d8dcb5ec88","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":866,"source_line_start":861,"source_local_id":"block-140","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":141,"target_content_sha256":"1594bd9aee4d1a98c58670bc456e2f4391a4ac3695832428753e282003bd9f63","target_edition_id":"edition.r017.id-id.draft","target_line_end":879,"target_line_start":874,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[874,879],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c49db841e922fa03f97948ba50797f877c8584775d599c2111338312a40b54d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-141","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":141,"source_content_sha256":"0885230b454d24bac6c6bf21bfee22e8309c9fa65615cf402d05db6c7b889a7e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":872,"source_line_start":868,"source_local_id":"block-141","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":142,"target_content_sha256":"634bdb8116b0bc1015541436f916b6cc09ad4bad369590b4deafe096510d941b","target_edition_id":"edition.r017.id-id.draft","target_line_end":885,"target_line_start":881,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[881,885],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f9cc925b91ec2d0cfc196cd26debf2d11114172ffc263252ae865a344826d3d5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-142","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":142,"source_content_sha256":"c337ce3cd588a2b57b75ebadca6c0823fa864eaca5f1049e328a7d044d0efdb2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":884,"source_line_start":874,"source_local_id":"block-142","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":143,"target_content_sha256":"c337ce3cd588a2b57b75ebadca6c0823fa864eaca5f1049e328a7d044d0efdb2","target_edition_id":"edition.r017.id-id.draft","target_line_end":897,"target_line_start":887,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[887,897],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64531748fd7705d145b803550846160fbbb9b61f189c9295bb9026ee4496723b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-143","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":143,"source_content_sha256":"4d0c0f0f6ce4e8eeedc2d9d94322e7f231d228bd1d4a72c437dfcbdd6911a8e1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":886,"source_line_start":886,"source_local_id":"block-143","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":144,"target_content_sha256":"4d0c0f0f6ce4e8eeedc2d9d94322e7f231d228bd1d4a72c437dfcbdd6911a8e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":899,"target_line_start":899,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[899,899],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e251718a79b1cc66245ebf64e0f3daa1babfd0cc1845796b6d637774101cb11","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-144","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":144,"source_content_sha256":"58081f6ea7e8fcdc615065119c8bd4dcc5601bbdaabebd50383bfb3afb6889cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":894,"source_line_start":888,"source_local_id":"block-144","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":145,"target_content_sha256":"80261f34ff6385d701de53dc580ec5eed619e077b2211a47ae3dba177ec83928","target_edition_id":"edition.r017.id-id.draft","target_line_end":907,"target_line_start":901,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[901,907],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e844c9c3444cd9eaf01ae0125e65d3d0004ac28ef24a049327cd831fc01c9eb","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-145","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":145,"source_content_sha256":"441f6f4addf3ebc276217f520e8e2244d3a189a0730df7e06522c17566ee9415","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":898,"source_line_start":896,"source_local_id":"block-145","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":146,"target_content_sha256":"9a9a851d16003d729de5c5a7044789b34088466cca79468dc710d32183ad4dc1","target_edition_id":"edition.r017.id-id.draft","target_line_end":911,"target_line_start":909,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[909,911],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe50b64b32393c55e819f899c9e54674003c3406dc9668a60c23a7dd9ca7aca5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-146","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":146,"source_content_sha256":"443ce997c2193b9aa84621c337b10e75aed0cc633d3478d18113f533c1a19f50","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":904,"source_line_start":900,"source_local_id":"block-146","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":147,"target_content_sha256":"a39ab7cd40b1a65a52226d2a805e6a5c7ddc5dc2b23c12ebda4de5812936f14d","target_edition_id":"edition.r017.id-id.draft","target_line_end":917,"target_line_start":913,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[913,917],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7fc7730adbb98105d5dd6cac762c2c575f49fc6b93d566e1f61954c10b37b8b1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-147","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":147,"source_content_sha256":"1db96edf71f97815b4cdaaad93a5ac540777a7b53f2b2c7795d7ddccd3d8597e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":907,"source_line_start":906,"source_local_id":"block-147","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":148,"target_content_sha256":"1db96edf71f97815b4cdaaad93a5ac540777a7b53f2b2c7795d7ddccd3d8597e","target_edition_id":"edition.r017.id-id.draft","target_line_end":920,"target_line_start":919,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[919,920],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b3ef912b866a8b6a25f31b48d9358e15c087271cd5bbd7ca9057876ea4b14d75","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-148","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":148,"source_content_sha256":"99535fd53df338a348dd54874d197b6e2603f57244e8434b099968df0eef2b0a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":911,"source_line_start":911,"source_local_id":"block-148","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":149,"target_content_sha256":"86e5528d030c516bc3d1f55598572f7a990e81b1a575ec9889415fb1d88ff2c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":924,"target_line_start":924,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[924,924],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7776366665dea41be4fc53d9ff4a1563bb44c1045eac5af03bebdd019b06b121","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-149","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":149,"source_content_sha256":"0550dbe0e50d2adbc0f6b7513a04a793ca56d7de017909d492f89c02b7baa283","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":920,"source_line_start":913,"source_local_id":"block-149","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":150,"target_content_sha256":"4b9c502402d0940742847f61edf63b4c6a56c33ea8f238865a4806f4b8972470","target_edition_id":"edition.r017.id-id.draft","target_line_end":933,"target_line_start":926,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[926,933],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f34afd41775bb648af4c41090df310cc7e32554e51a77f1a6f5e16d06651f6c8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-150","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":150,"source_content_sha256":"41d90d6e9a975178d7b5d7a83e90203fc74fc44fbbddd41194709292e2040c8b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":938,"source_line_start":922,"source_local_id":"block-150","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":151,"target_content_sha256":"a0c5a384632ed02fca581bce850efeda09c7d635bec3218b9753689adce0dbd5","target_edition_id":"edition.r017.id-id.draft","target_line_end":951,"target_line_start":935,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[935,951],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6db0b9f56f06f9e95bdff2dbe38842fe09d918f1ac60451ad6665c1d3776fdb7","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-151","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":151,"source_content_sha256":"3c63c77fac2ea055bbdbeab2a4bc83e194aae497a0da907a42164dabe14213b9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":953,"source_line_start":940,"source_local_id":"block-151","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":152,"target_content_sha256":"b6774454d588577bee5f0552486638175171be2893a012c33016e65f4d41af60","target_edition_id":"edition.r017.id-id.draft","target_line_end":966,"target_line_start":953,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[953,966],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c56810426c1b36997a89f47bd9579fef71b8feaedaadfb07b5d34b1ac4380f53","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-152","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":152,"source_content_sha256":"5c9ec7fbeeb00ed53a39f12a79ff93697f17d7fe0081c72d8bd0ddffec9104ee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":998,"source_line_start":955,"source_local_id":"block-152","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":153,"target_content_sha256":"a1ccb4a35c2c7b684607e7bd89d34772eefe31e979d46442939430a62fa37d5e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1011,"target_line_start":968,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[968,1011],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"40deb115eb12b1a471493a70b97295da5c7a466a6fc95a4399561051354d1bbd","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-153","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":153,"source_content_sha256":"64b7c01768a638f2fdde625dd3f85f6b56478c8713453a26ce78f725f6884e2b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1001,"source_line_start":1000,"source_local_id":"block-153","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":154,"target_content_sha256":"0ffe1189977641b517702fc684478e9f369de7342983dec978b5449eca6136f7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1014,"target_line_start":1013,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1013,1014],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5461969c74543a7ed11cb3871e1a04d6539a205a4e019be2b5ca694c30b8772","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-154","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":154,"source_content_sha256":"b0e358dd9658895876612da6350fb66937f4eb8bc723858b4e868f725e546d38","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1006,"source_line_start":1003,"source_local_id":"block-154","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":155,"target_content_sha256":"8c4a6bc3b8b046255cd064933c1a5eda9c6f789a31cf3f03b81d28059dd26a16","target_edition_id":"edition.r017.id-id.draft","target_line_end":1019,"target_line_start":1016,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1016,1019],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e32087fe136f6c9f1b0fde99f4abefa43cdbf81178efc89f129ee561dcacf79d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-155","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":155,"source_content_sha256":"668bd9d4735b56c48f6a3d5b44283ac226f645541d892e74c950f9cbc0f197ae","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1011,"source_line_start":1008,"source_local_id":"block-155","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":156,"target_content_sha256":"b34d85ff6e1632d3e07b9c2ba64e87b23fc7e15b21200ff754d1f7d9b8ff0c3a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1024,"target_line_start":1021,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1021,1024],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f9c24aa57a56d1665dfe1fba0ab97bdcc76a0763c5b35936b86483038410467","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-156","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":156,"source_content_sha256":"08dc9866cc4c920ef3cc4ebc07f1edd3983729defda90f37e406a037823e1ea6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1013,"source_line_start":1013,"source_local_id":"block-156","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":157,"target_content_sha256":"f645435f0d6ea360f73ae18db24d5cd5e7b834e6c34bc05c46132b369cdf637b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1026,"target_line_start":1026,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1026,1026],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4cf6045aa49208c9f8b0c8f516657d84a8e9c2239e1684a8b3eb1a37c82aa4ed","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-157","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":157,"source_content_sha256":"acb3579c830200b692393c9d7b0a35279bc67a682cbaf7b36525ced15c9db393","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1016,"source_line_start":1015,"source_local_id":"block-157","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":158,"target_content_sha256":"a72b778e382b8de7686da150fb361cfb57657e004b9c8b9519d707a0a2a3f3ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":1029,"target_line_start":1028,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1028,1029],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"757d2ed25c3a41efddf5029d22b83504f6d79ca2fb14c251894bdeb26be1058f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-158","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":158,"source_content_sha256":"0732f87f646aed4a37e7f901558f0de97ed3228ac6d0aea014e8ab7b087727de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1018,"source_line_start":1018,"source_local_id":"block-158","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":159,"target_content_sha256":"e595aea71c28bbb2c24586eabbf167fc7cd044530117ec6ac1e6b823f03e9666","target_edition_id":"edition.r017.id-id.draft","target_line_end":1031,"target_line_start":1031,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1031,1031],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"232f39f6eb720b0dd423ff73b0721ed8109f0242076a448aed1a274b8d160f4f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-159","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":159,"source_content_sha256":"00e50eb63fb01dd05a40ba3d216d640c0952afd511e46e52933cc089f476fbcb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1020,"source_line_start":1020,"source_local_id":"block-159","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":160,"target_content_sha256":"00e50eb63fb01dd05a40ba3d216d640c0952afd511e46e52933cc089f476fbcb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1033,"target_line_start":1033,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1033,1033],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a6cb4e4b19a7b78639bb58ccb55a0cfea6379fb3751e7f70d7451a9cbf6a766","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-160","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":160,"source_content_sha256":"6fc2f1a299f648362ebfa457bc9266fff274eaea6b4d9ecc4ba29df23e9dde6f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1022,"source_line_start":1022,"source_local_id":"block-160","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":161,"target_content_sha256":"1963fd6e83ced67e968be6279aa6244d443be5a19176675a591c8b61167f3892","target_edition_id":"edition.r017.id-id.draft","target_line_end":1035,"target_line_start":1035,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1035,1035],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c7a502da36e3cb3a95ff3e22c1a0235b9dc6c30db1b9a3ca3257d35f200c9629","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-161","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":161,"source_content_sha256":"ff8150ed1105cb391f0bc8e26d9c232fea043f773f1048f99d7d60e232686564","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1024,"source_line_start":1024,"source_local_id":"block-161","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":162,"target_content_sha256":"feb92df241c55f900c8bb64245ef944ed5bf323865147425a727f428b894c70a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1037,"target_line_start":1037,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1037,1037],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90a4eb0e964f0c3c860d6688549e1a2dcc6dc27ae2de7547b3fbabe8a092e89c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-162","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":162,"source_content_sha256":"33e37d7dc2ff43acb18dc6d70ed9a4f792bf316bef6bc0d4e45e29d027814192","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1027,"source_line_start":1026,"source_local_id":"block-162","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":163,"target_content_sha256":"d622aa44f4ad189ffcfda846c870203b99131ba8c5b889ac69dec66f1b23d716","target_edition_id":"edition.r017.id-id.draft","target_line_end":1040,"target_line_start":1039,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1039,1040],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d42f4ec4692eec03089467428606b78523ff1867232410f02beb8fe1ce11b4c6","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-163","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":163,"source_content_sha256":"493616d962d68c3f9615718dcf8d3c3084a7edf1e28481e1184372b7e732eee3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1035,"source_line_start":1029,"source_local_id":"block-163","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":164,"target_content_sha256":"493616d962d68c3f9615718dcf8d3c3084a7edf1e28481e1184372b7e732eee3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1048,"target_line_start":1042,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1042,1048],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"72929e2508e44c1776a5b8bfa8c1a434ab7238eb9f908cefdda7128ad0151a85","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-164","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":164,"source_content_sha256":"f080964a3a119da016884a93ddec992bb15adb40db65da75b0bf28a9d77aa7f2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1044,"source_line_start":1037,"source_local_id":"block-164","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":165,"target_content_sha256":"19e00dc7d6a70a347715edfc7d84e794b3d7166177cbc462c48b3352c463bb76","target_edition_id":"edition.r017.id-id.draft","target_line_end":1057,"target_line_start":1050,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1050,1057],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0bba7e43a7191af0a8fd45a7bd387fa05338a6de36dc41a2b2384d979b72d137","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-165","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":165,"source_content_sha256":"1d4eb56406ec2e888c28ea878cf87eedf2b61fa01a1c69e1b5bd903c29bfbead","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1047,"source_line_start":1046,"source_local_id":"block-165","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":166,"target_content_sha256":"b8efa62e9de7c9b475cba84990c847a5359af62da8a227ab6b701adea7a80cfc","target_edition_id":"edition.r017.id-id.draft","target_line_end":1060,"target_line_start":1059,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1059,1060],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e7a1e99918e4e0eaf81ac6c3ea6f77dae24d2eaba91561f63d8b4081d602229","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-166","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":166,"source_content_sha256":"00e50eb63fb01dd05a40ba3d216d640c0952afd511e46e52933cc089f476fbcb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1049,"source_line_start":1049,"source_local_id":"block-166","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":167,"target_content_sha256":"00e50eb63fb01dd05a40ba3d216d640c0952afd511e46e52933cc089f476fbcb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1062,"target_line_start":1062,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1062,1062],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b0fd785c8fd49f41c6a274c800e59743626c9e68b1cd3a5c6b55f1852bddf1d6","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-167","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":167,"source_content_sha256":"c7e0bfa47cc5d642f67ea2103795347e5c8f8bbba668b2591abbe923f9d62860","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1054,"source_line_start":1051,"source_local_id":"block-167","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":168,"target_content_sha256":"d52f7020520e4975430cc863717752c2be5586dd0b6987b5c7e2b2b2d47e54a9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1067,"target_line_start":1064,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1064,1067],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c743a0dcd94822c6c15473adbccedfb85376ca700bb4a8d80668cdca4e82398f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-168","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":168,"source_content_sha256":"609d3d098c38e9e40dcd0f4d201ca8f2512df6f93da5069596d506bd99721ff4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1058,"source_line_start":1056,"source_local_id":"block-168","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":169,"target_content_sha256":"609d3d098c38e9e40dcd0f4d201ca8f2512df6f93da5069596d506bd99721ff4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1071,"target_line_start":1069,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1069,1071],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc3f5d64b5a8a2f13f5ac948da38d5cc672a7f4ea52bc59080351840998973e9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-169","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":169,"source_content_sha256":"34ce9808e776388a60bf921d9a9768aa9df5cf37d47a31e9cbb581074752ccc5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1062,"source_line_start":1060,"source_local_id":"block-169","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":170,"target_content_sha256":"34ce9808e776388a60bf921d9a9768aa9df5cf37d47a31e9cbb581074752ccc5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1075,"target_line_start":1073,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1073,1075],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d49eb7b8ee388789629bdc4b0a2ca74193b3cdbb1052d22ebf75e6339d810bd8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-170","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":170,"source_content_sha256":"515cbdfc6d09ad101e434b83446bb5f2a88164ec9c9181f3e7c16ca2efd0626b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1064,"source_line_start":1064,"source_local_id":"block-170","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":171,"target_content_sha256":"51f82c3227c49d5dc37ce9cd0104d2a8ad4ae5c2bb3fc14f97e126b90a981636","target_edition_id":"edition.r017.id-id.draft","target_line_end":1077,"target_line_start":1077,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1077,1077],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"62d5a72a0dcaecedf42c072f9de4398ad6f68c6448ad8358f4d9787050faba5c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-171","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":171,"source_content_sha256":"91f8f5bc9914bb72e455f9f9a908fffdda5b7697d63cc52cbcd3c540b116766c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1066,"source_line_start":1066,"source_local_id":"block-171","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":172,"target_content_sha256":"05a8b76e73175f775896cb2541bc8170774a957934d93739d0912c466328191d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1079,"target_line_start":1079,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1079,1079],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9b4a1c74375da690666d874b370b1eaf6c4666df91235b06209846ee5a4150b7","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-172","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":172,"source_content_sha256":"8dcaf19708ded14058709fd3b5451a7cbee2815bd067c9bc4a11a3964cf6bd64","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1072,"source_line_start":1068,"source_local_id":"block-172","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":173,"target_content_sha256":"52e029a4de9ec6df1509cf47893e0f46042ecb33d1ab4a20e15dc11b3e78200b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1085,"target_line_start":1081,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1081,1085],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0ec23e8ab44feb727bee3486886ad486cbc6af85afd41e994349fd0ba87bc62","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-173","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":173,"source_content_sha256":"6047864f3ce81bc65c550dc1467bb2871062520ce05319d9bc9a9e511ab44c57","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1074,"source_line_start":1074,"source_local_id":"block-173","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":174,"target_content_sha256":"fd1a3a1f97a152db8492ff484d2faa6f2bd773ae1eab42643c754f22442e1ef1","target_edition_id":"edition.r017.id-id.draft","target_line_end":1087,"target_line_start":1087,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1087,1087],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14263297b69377f11060f469fbad4592d2bd503398e2b270f722b2e462b727cd","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-174","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":174,"source_content_sha256":"888a290cfe00a4db7cb0a12ac04f5c8da47dd6a95bed97ba45546567f4295e56","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1091,"source_line_start":1076,"source_local_id":"block-174","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":175,"target_content_sha256":"6d109fe72f7dc1c5490aad23d5b219d2190e52cbdfca360af069f3607800da63","target_edition_id":"edition.r017.id-id.draft","target_line_end":1104,"target_line_start":1089,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1089,1104],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"63bb25e002667b3364aa7baf0caa55b658ecbbfd3fb705d835e48622cc6c4f8a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-175","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":175,"source_content_sha256":"8825105c169163593b81ae05ce6d0a4cb1577d5f128ae3890a00effd5ad394f8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1094,"source_line_start":1093,"source_local_id":"block-175","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":176,"target_content_sha256":"c4a1c2d2af3e9a69fed789ad930cda1ac6f60028596abd1434d18b308e1ee355","target_edition_id":"edition.r017.id-id.draft","target_line_end":1107,"target_line_start":1106,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1106,1107],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9b585b497ca314b754dec8f437f526cd0d9ea29bd97646544c5bfb3bb99ca13","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-176","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":176,"source_content_sha256":"e90bc0c1add4d1aaea248f359ba05ec9b88410849c99e2851dfc6246e3e064f0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1096,"source_line_start":1096,"source_local_id":"block-176","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":177,"target_content_sha256":"a6d74e931c21073fca26b4945c8eb4a0995cfb8ae35bd1ece0647f7b4d2c640b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1109,"target_line_start":1109,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1109,1109],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5499a56dd3a6215eeefcac465d51afb96060bfcc78ab7eae1ce9c1fdf9897c2","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-177","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":177,"source_content_sha256":"e9537fd14227e9f9aea388472153a27f7544ddee7af29767bfad6e6d2066d81e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1098,"source_line_start":1098,"source_local_id":"block-177","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":178,"target_content_sha256":"82ab3c4e13627d1981c05f5efe82a96c1b00f27382bf4e1957fd252b360ed876","target_edition_id":"edition.r017.id-id.draft","target_line_end":1111,"target_line_start":1111,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1111,1111],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b31b2025fcd42ad097dbaad81202427a0c5efe6cc5d13fd08a44581817cb512c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-178","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":178,"source_content_sha256":"2d14d45f8a0f61d07ffcf7fc879792bc6996b24dca2db02cb738d82279755135","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1110,"source_line_start":1100,"source_local_id":"block-178","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":179,"target_content_sha256":"2d14d45f8a0f61d07ffcf7fc879792bc6996b24dca2db02cb738d82279755135","target_edition_id":"edition.r017.id-id.draft","target_line_end":1123,"target_line_start":1113,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1113,1123],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed2da0bb61fae45251a8f0f00d815ea2ddea7087e7640a7a4a3c3037cdf7078a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-179","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":179,"source_content_sha256":"5ddfb1401920447f088bac12ca74079820625cf4ef76e1535fa6d7b543163e9d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1130,"source_line_start":1112,"source_local_id":"block-179","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":180,"target_content_sha256":"65b7d8288b982f2ff292f20740d9f66255051386c6125d1234964c708506e831","target_edition_id":"edition.r017.id-id.draft","target_line_end":1143,"target_line_start":1125,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1125,1143],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4493a43b7dd7e583768b5a2610f179b91353e7389bea8e6be34fa3cb65b2cf73","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-180","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":180,"source_content_sha256":"73e5de8fc63f2f7d0c5c74999e68c8969b760ad724d5e472d936c5bc2e3b0150","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1133,"source_line_start":1132,"source_local_id":"block-180","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":181,"target_content_sha256":"daa59c75004d4638170fe52da4da2a51146e8717908c1950118d7dd35d49f92e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1146,"target_line_start":1145,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1145,1146],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"812ff70401d4abfea587da9dcc463f31c5874654b9514eb85b51b81362ab2bf9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-181","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":181,"source_content_sha256":"c820152b345058db690151772d2389041fbd5e8664fb9cf35b09416488f2241b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1148,"source_line_start":1135,"source_local_id":"block-181","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":182,"target_content_sha256":"d977d529166766a57113f5eb5ec9bafba64d86b43506e9df6909c74d1669c059","target_edition_id":"edition.r017.id-id.draft","target_line_end":1161,"target_line_start":1148,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1148,1161],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cfc987c33dcb80f7b069365fe7185453651389caa4d389d9c720ed979e46da70","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-182","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":182,"source_content_sha256":"4298e5f60086f2b0b222cee8c0b54d7496706e0619d5477da904ea73e05f633e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1150,"source_line_start":1150,"source_local_id":"block-182","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":183,"target_content_sha256":"1133891eca6a4b0d3db6795375d7f869a236c2232c18808427173cd2ac338f0d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1163,"target_line_start":1163,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1163,1163],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f89c8a0fef031b14e3d33aea81819d2493eacc80fc198ac0afec7fc03cc1a20","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-183","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":183,"source_content_sha256":"8bac979f43d3f8de2d66d37fe3610e55030946f3e753688ec7183b5acb73a385","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1153,"source_line_start":1152,"source_local_id":"block-183","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":184,"target_content_sha256":"2a2c10c6cfac8cc97b1da8c46508a3e3de30dfbd20627092fa12063ede71c234","target_edition_id":"edition.r017.id-id.draft","target_line_end":1166,"target_line_start":1165,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1165,1166],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4ecff9a29fbf0ea79cebea0801d2a0c0f5cf13422723f1efaafe6993e3658b8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-184","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":184,"source_content_sha256":"6b0cc4501f6ff7c1b3395272629022a02a22c9c55bdf62a6d6d2f8b653c88a5c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1173,"source_line_start":1155,"source_local_id":"block-184","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":185,"target_content_sha256":"19c512f4173a98c60b2b357415bc41e27afb56fdb0c75c6b0d386dd1623e612e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1186,"target_line_start":1168,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1168,1186],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6a8b39e8cd2c2866d0bd9fee93e0456e9f5988d9494f3ea1db859ca2a2e643e7","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-185","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":185,"source_content_sha256":"0f9a03cf0861983ba8d6baed4f45c3df499d55613b19caecc99ae71107cd1217","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1193,"source_line_start":1175,"source_local_id":"block-185","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":186,"target_content_sha256":"b936901193bfe3b6f55d108acb939c3f376ed2b05fd9b03e52136614ab7c32d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1206,"target_line_start":1188,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1188,1206],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ceca203b22b484a5fd37e55cd46a9ddb5da91612dd90723e13769782a01e2624","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-186","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":186,"source_content_sha256":"cd5d5c848e420346c8fde29ee6615ca1b8892512f1b8de46bd4c58d22c8f4491","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1195,"source_line_start":1195,"source_local_id":"block-186","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":187,"target_content_sha256":"4d23bf7a739ffc6b5251b3d16c6b3b8ff6c2699c916339375fbaefdb8c1d9bac","target_edition_id":"edition.r017.id-id.draft","target_line_end":1208,"target_line_start":1208,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1208,1208],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ff9ed2d9700545b2974fcfe0490dcce198d55266de2ca2df1aa9111c62117e24","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-187","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":187,"source_content_sha256":"9909af8f414488271352df3ae4f6bb689d5eefae319944fad215b471dc7fd6ad","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1200,"source_line_start":1197,"source_local_id":"block-187","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":188,"target_content_sha256":"90ae24a18140849b24b3bbd2ebb5d47d1cee4547666651c7ab1a53ade7264025","target_edition_id":"edition.r017.id-id.draft","target_line_end":1213,"target_line_start":1210,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1210,1213],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90d1c89318666cea55aaf6efa4f89ac65a127f32e1a0d4e38009091faa9c16f4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-188","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":188,"source_content_sha256":"deeb1fcfc2d268b5c747b48e305c5cf91a524cb8fff3490aee5975b5ba93cd76","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1202,"source_line_start":1202,"source_local_id":"block-188","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":189,"target_content_sha256":"02bef2be608c5b16f301243f2abaaae08c3533509e4e2ae4131685a6c89bd5ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":1215,"target_line_start":1215,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1215,1215],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f2b6dcc1ee0391e47442c401d03e1b352ed53dd55dddea42f3cc189dd43d5d64","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-189","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":189,"source_content_sha256":"d71f8557989b2fa5d9e6356247ee8d2e001b58dc3d58bc40aa21512fc034592d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1228,"source_line_start":1204,"source_local_id":"block-189","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":190,"target_content_sha256":"12f0ff0bb371f0af5bd1965f2a67216c847037af7c1118cc4dc1309fa7e5bdca","target_edition_id":"edition.r017.id-id.draft","target_line_end":1241,"target_line_start":1217,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1217,1241],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4ed6367d9df2bc79d7cfd5171d146b86c2621730b31b6d8b3f36925614bbf2d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-190","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":190,"source_content_sha256":"f19aeb033cc20f1c61ae0b1c5c9077030b220a61207ef02bae3bcf67c3b561be","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1230,"source_line_start":1230,"source_local_id":"block-190","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":191,"target_content_sha256":"80968bd6297a2e107d02b663fecc785f0602c97bfe222122cd6379355bb46309","target_edition_id":"edition.r017.id-id.draft","target_line_end":1243,"target_line_start":1243,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1243,1243],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c0b6fc22092d33d3cabcf21f7bb7acf85906b7f0f4a6d01c36cac083636d05c3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-191","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":191,"source_content_sha256":"15f1932a47cf8d5a0656d56891e4166e1361de88de0866469829875ad0075b6a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1256,"source_line_start":1232,"source_local_id":"block-191","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":192,"target_content_sha256":"139f95e96f57212ac076439092eba5f97b83fd3ccad15c69bccf42b06de77858","target_edition_id":"edition.r017.id-id.draft","target_line_end":1269,"target_line_start":1245,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1245,1269],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"71cf15ef70d129548280fe9ae8313121bddf2ee0a9351a91b4a4f97e23d002f3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-192","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":192,"source_content_sha256":"55cfe1782b01828c16ab1c9afdbcc5a4a9375177ebed1ad2deffbd40ae5742d8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1258,"source_line_start":1258,"source_local_id":"block-192","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":193,"target_content_sha256":"234387227d3d5efb1b509892f6de44f1470f358f0b3c163ea8daca31838c4c21","target_edition_id":"edition.r017.id-id.draft","target_line_end":1271,"target_line_start":1271,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1271,1271],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d58cb66c8dae777080116703efca8cbcdc72de7846d782ec585661dd902ef0d5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-193","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":193,"source_content_sha256":"ab9f5a586b0faccb367cacf3ee3f419bf651524f562f424fe77052a28cc70427","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1285,"source_line_start":1260,"source_local_id":"block-193","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":194,"target_content_sha256":"be0eea196c5cdf823f5b37e915286c55d7ebe2bf8138413a99ca9e1ff4610ece","target_edition_id":"edition.r017.id-id.draft","target_line_end":1298,"target_line_start":1273,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1273,1298],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4922e0b56342fbc77a4639709f4c636e5fdb2c25f44d408628f5cbf3fbd2d9e4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-194","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":194,"source_content_sha256":"0693659f9d6f2168ec8d8001310f799419d134d9f9dae64ffc6823b10abbed8f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1287,"source_line_start":1287,"source_local_id":"block-194","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":195,"target_content_sha256":"f9e4cbd0079bc450d19c30b170cb1c2a73de4faf41809b628b59a54c99d09fe7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1300,"target_line_start":1300,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1300,1300],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa8d3449308ad088023a3e6beedf30277a1a6f806dab71b52dc25400b10bbe4a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-195","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":195,"source_content_sha256":"f92f5947b9e9fcc81a11787a36e3acf61d60fb185f3c02490dcdbe69755b9058","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1289,"source_line_start":1289,"source_local_id":"block-195","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":196,"target_content_sha256":"004d5997f710d190a71e554d506d40f2db6565e4d782a8361952cd6be21df130","target_edition_id":"edition.r017.id-id.draft","target_line_end":1302,"target_line_start":1302,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1302,1302],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce3162f04e1f7e1549255bac9e5d6eacdc84a6c5f193dd2203825b83745694ea","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-196","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":196,"source_content_sha256":"bf661376e0b5c8e725c7eefbe1ffe5830696899e415408401b3dd6a6f399c949","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1295,"source_line_start":1291,"source_local_id":"block-196","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":197,"target_content_sha256":"f93f5859ccaeee1ee94ad23d16a104a77088b85d5cf777bf6c5fddf35cb406e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1308,"target_line_start":1304,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1304,1308],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9804c57f8610ee4497ada4502769e843960d266571f5006b59dff616aac8ca4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-197","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":197,"source_content_sha256":"cfd84bf950d00905cd92fd0ad8dd61f496e9ddefaab97a064f2b795926257382","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1307,"source_line_start":1297,"source_local_id":"block-197","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":198,"target_content_sha256":"cfd84bf950d00905cd92fd0ad8dd61f496e9ddefaab97a064f2b795926257382","target_edition_id":"edition.r017.id-id.draft","target_line_end":1320,"target_line_start":1310,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1310,1320],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd6c0cfd24532d5cb5310fec5926eb8293cadb4900c9894c3455a4c560855c35","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-198","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":198,"source_content_sha256":"ab0dfd3ffec953a7e0b52e845e7830699b7c777a5440158666391a5791fe5be5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1318,"source_line_start":1309,"source_local_id":"block-198","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":199,"target_content_sha256":"17d7418de8b6c76cb3d02261d3fbea817681dd2366bddd449a1c68a3bf4fc9f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":1331,"target_line_start":1322,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1322,1331],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa00c58653fcf68ee53342ef2ffee21afc8cb74e890712d42490c7ed0a75e6a2","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-199","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":199,"source_content_sha256":"baf9f76c487ce7c57593d4271f3f2a9d6925711ce4795dd8f35cfc6cf0580882","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1325,"source_line_start":1320,"source_local_id":"block-199","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":200,"target_content_sha256":"071a7bbd9430037af6acb93868b9ab8b10f34146d98a5b7488c4a5e8f42c89e8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1338,"target_line_start":1333,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1333,1338],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d6ca88cae3fa224ad33f466b7f538297715f92d5cbea0c2db5dddf4d69cf1e94","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-200","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":200,"source_content_sha256":"a687b531b385ef82afce72d39d5c26e7ffb133dbaaf1ac1cf89a2f140c55cc35","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1330,"source_line_start":1327,"source_local_id":"block-200","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":201,"target_content_sha256":"4960b52042ffd7ead0b17c72e5c1858ed9f8815f8b9a10f2c5362658029a67a3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1343,"target_line_start":1340,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1340,1343],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bcc9abd7445a9b643351514b0cf9c61d844f7b1c433e6429fccd37de287707da","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-201","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":201,"source_content_sha256":"0c7d07d78dc0ee7f0e7c62c499309b5b43c8148359f8b641a4b367dc8ed07e70","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1332,"source_line_start":1332,"source_local_id":"block-201","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":202,"target_content_sha256":"8b1f60fade5d66c6281a3b1d4c1f7c45e9a22ef0ffd1177ddcb1b0e6e4ab7f8e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1345,"target_line_start":1345,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1345,1345],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f913cc66c2e07c6d5945eced6ba50213d7c7d4c0a992db580084d9ace3a46ab","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-202","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":202,"source_content_sha256":"fecc33175dc6010f85583e2b2e5a5382530f2b2fdc2104a6582f8cce2b665f49","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1344,"source_line_start":1334,"source_local_id":"block-202","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":202,"target_content_sha256":"948b298dbae1a639ebe605f8ef5a66300c342e1aae875032e16dc93424dc2c05","target_edition_id":"edition.r017.id-id.draft","target_line_end":1355,"target_line_start":1345,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1345,1355],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18ecfb2be04f7d4778b80a467b5af0e9407c73716097e9fbf1a222fd0051ecda","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-203","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":203,"source_content_sha256":"4d0c0f0f6ce4e8eeedc2d9d94322e7f231d228bd1d4a72c437dfcbdd6911a8e1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1346,"source_line_start":1346,"source_local_id":"block-203","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":203,"target_content_sha256":"7609e4b6b1b14943379419c92b6372b00a916c7accb4208059719af92f3ddcc5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1357,"target_line_start":1357,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1357,1357],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a7682f8c4cc46f9744b5c0881b15e1e615b93536abf00774268087408eeb64a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-204","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":204,"source_content_sha256":"6a535266eda4172f7b863211f430674cf89fea0cf5df44763ed6525e0691b072","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1350,"source_line_start":1348,"source_local_id":"block-204","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":203,"target_content_sha256":"7b960a8727b1c4192bf67c1456937bd718631dfadbe5a9bbbbdb008a6714d034","target_edition_id":"edition.r017.id-id.draft","target_line_end":1360,"target_line_start":1358,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1358,1360],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c160c455bed01c519ca42062d655e9c115d9371a3480f601d0455f8c4dc8dd9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-205","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":205,"source_content_sha256":"df8704cb78a6fe0a07ff10c69af7749227f44112cd181ddce9a5e43df0348e1a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1358,"source_line_start":1352,"source_local_id":"block-205","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":203,"target_content_sha256":"1cf669669c647200c9347a15f19f05caaac53d14975d8f11d562140a82c1d6ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":1361,"target_line_start":1361,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1361,1361],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"429747c4577a2287f60c9e786c649df3442d85166ccd478700b76533a7d2fb30","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-206","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":206,"source_content_sha256":"6da24200c99737c1116716ce6f0e5d9db9d7358b7d58722b05f34e5656df68e6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1364,"source_line_start":1360,"source_local_id":"block-206","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":203,"target_content_sha256":"6d000159335633918800d7b8b4a632c305035f1b14113f229236d594cc0bc81f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1362,"target_line_start":1362,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1362,1362],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"033e6686edce8ed78d8de1fe60d72c43f05c0906f23c36e9a1321ec901a1279a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-207","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":207,"source_content_sha256":"52adfc9929fc0fccc1741bee463caef78a287a05fdda6a899f547cde62367407","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1366,"source_line_start":1366,"source_local_id":"block-207","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":203,"target_content_sha256":"f7d2513a4cc0b496fcb823409b5085d2aa715145625331ed12e9d2b6b2902788","target_edition_id":"edition.r017.id-id.draft","target_line_end":1363,"target_line_start":1363,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1363,1363],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2ec3c556b056defa402964c23e4de929e9334e29f395fefe9d2d33858d0c8a33","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-208","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":208,"source_content_sha256":"d84b77dfd8700c584a53df5b9b32db72be3b7137e1faba40ea6d363346e78e35","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1368,"source_line_start":1368,"source_local_id":"block-208","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":203,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1364,"target_line_start":1364,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1364,1364],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b05a60158334018df4b4df53af797951dfcd6a92e9b4a1e9efe3eff0028597e6","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-209","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":209,"source_content_sha256":"57c05eb71341de1768fdd47c4a13b6d6180afea266e9a06f990dec1e807b5499","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1378,"source_line_start":1370,"source_local_id":"block-209","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":204,"target_content_sha256":"20328978fee93c4433967adf083295770206e113caf783976f510af5b7f37d24","target_edition_id":"edition.r017.id-id.draft","target_line_end":1374,"target_line_start":1366,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1366,1374],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d730380201c518e2881aad219121fb86d908155abc6a3d67387ba8bc9d87a8f1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-210","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":210,"source_content_sha256":"a958d7552bfa91c246ccf64ba90d80453f46087c530b8af1e5c3d70cf976a6ed","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1381,"source_line_start":1380,"source_local_id":"block-210","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":205,"target_content_sha256":"d82fb110df446fb31e59694ee9c0ed1471d9e6ed2efa88ffd280bfae98cd7ff8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1377,"target_line_start":1376,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1376,1377],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2cce39e01640c39b023a4c1849255db3919a98d433f696f1c30b5b258c5aa9ea","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-211","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":211,"source_content_sha256":"b9b86e9489aa1558508631aac17762582eee4eb218b132f1e0aa8220a1b7c424","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1399,"source_line_start":1383,"source_local_id":"block-211","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":206,"target_content_sha256":"95bb205c0b6f0371098532a36f1ff72b25f46cd29c3d72d8a7ed46684b31342c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1395,"target_line_start":1379,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1379,1395],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e881d69271bbbbba199c881f765b95703f7c85bd0c7d9ffe22bedfd83f6c079c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-212","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":212,"source_content_sha256":"4c63c12eadcf1672caf4561e144bc9bf5b75cbcf9c89033596a8d324a07733fb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1416,"source_line_start":1401,"source_local_id":"block-212","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":207,"target_content_sha256":"bce86db5d3102bdaffb5cfacf681a37d446ee9e7737227dffd906ff7b6a9dd4a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1412,"target_line_start":1397,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1397,1412],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b738cbd59c9112fa2890cfcb1451c261afecf8a41ef6e0c0bdbbedd7183603ad","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-213","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":213,"source_content_sha256":"83c0a655fd68dcaccd9cdeb53bd499f6305f6b821e3b8a58a5c2a77c0d36c522","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1436,"source_line_start":1418,"source_local_id":"block-213","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":208,"target_content_sha256":"96c01553f25c2df07f426758846c4637b9f56236f485fc5297313aef2faf0df0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1432,"target_line_start":1414,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1414,1432],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e4854d6391f4707a07207dabd5fa97281c0ba761b321d3486947c51df363c30f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-214","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":214,"source_content_sha256":"35fc966de4b13a35ef999021618e40a786f1fc7d3094964533fd799a15f0465f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1440,"source_line_start":1438,"source_local_id":"block-214","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":209,"target_content_sha256":"22311445f11390aa8d928434e99db7e54a5175306d474f537767db556ee8452c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1436,"target_line_start":1434,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1434,1436],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"34a9f8b317d04d9b85d11ac7181b6bc2762a7d0d0c0af49f763feb1310e94bf0","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-215","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":215,"source_content_sha256":"4587696ca52913fa757351b5772650e453d0ce4eb6640da987510fa592d35c4b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1463,"source_line_start":1442,"source_local_id":"block-215","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":210,"target_content_sha256":"5b2a78676862da3514cd87fc6c46fecf213f2164a98806d09f3779abbb82740f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1459,"target_line_start":1438,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1438,1459],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c82f05d3accfa228e4fb3da1b93327acd2a3ac2b5c435fe7bc293a4f3331c14b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-216","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":216,"source_content_sha256":"127a40d3c0e3adb082b7df3ac3885f081c1c512412724dd96f1354c2c6fc41d1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1484,"source_line_start":1465,"source_local_id":"block-216","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":211,"target_content_sha256":"c5de6d5ebadd0adf3fe724995e37e0e568ca33d9747238f93f2cf8f60bf90fce","target_edition_id":"edition.r017.id-id.draft","target_line_end":1480,"target_line_start":1461,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1461,1480],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"68f24099b2d8f6149a6dbe0b1eacc5118455eea32b1c48e70d82d9c912497350","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-217","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":217,"source_content_sha256":"d58df5be6b91319d11f2cf386d95d70bf820585fe29b6abd33802354528abd74","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1492,"source_line_start":1486,"source_local_id":"block-217","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":212,"target_content_sha256":"b54bf7b2ada746f821fa17c4995fe37d07a2e76c60508347c68773c4490f96c7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1488,"target_line_start":1482,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1482,1488],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9035a838b0eefa72e73fabb1ffda92c5ad87cd651b9f9be7df2a32ad49665cc","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-218","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":218,"source_content_sha256":"8b4f21f2ea082f8f36f0b7b742f90bb9f498c3c622b93a764b5046d11e886380","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1494,"source_line_start":1494,"source_local_id":"block-218","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":213,"target_content_sha256":"fee86f814f0d48808c0fa2761d5dee600d3485feb8d1391dc4938a2ff569382c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1490,"target_line_start":1490,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1490,1490],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fef45e823994541259f468870767417c4f7526d9115f2f84105649f59706e1b5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-219","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":219,"source_content_sha256":"d72a82f2a9ff612d991d8724742595acafcebcc05f4237c226dd2758ade4e241","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1507,"source_line_start":1496,"source_local_id":"block-219","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":214,"target_content_sha256":"d72a82f2a9ff612d991d8724742595acafcebcc05f4237c226dd2758ade4e241","target_edition_id":"edition.r017.id-id.draft","target_line_end":1503,"target_line_start":1492,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1492,1503],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f372cadc9ff6a46bfadc6ebc0b6e119d54e510355e9dd35c2a4fe258a343f9cb","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-220","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":220,"source_content_sha256":"87f78512e1b31f4ab074503e03b26e8aa59154769f78e90fde48a6de842113ee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1511,"source_line_start":1509,"source_local_id":"block-220","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":215,"target_content_sha256":"87f78512e1b31f4ab074503e03b26e8aa59154769f78e90fde48a6de842113ee","target_edition_id":"edition.r017.id-id.draft","target_line_end":1507,"target_line_start":1505,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1505,1507],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4d21149b7f5ee4325a471320ee6dd47d9c8f5b28a2e8df6ef58064f8bcbc97c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-221","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":221,"source_content_sha256":"4ccc6d223e0d01f9daab264cfac27f92949ef7d8d55a6856ce57e2ae0d9ba92a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1515,"source_line_start":1513,"source_local_id":"block-221","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":216,"target_content_sha256":"4ccc6d223e0d01f9daab264cfac27f92949ef7d8d55a6856ce57e2ae0d9ba92a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1511,"target_line_start":1509,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1509,1511],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bee9d484ceaf59ffa61d8fde70e2b372a751db81a061fb9009e5ce0eb9f9e74d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-222","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":222,"source_content_sha256":"8b5f4c0f03fd3343fd68e99f736fc1c85dec3757acbc10f85d1bef16503ea50c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1519,"source_line_start":1517,"source_local_id":"block-222","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":217,"target_content_sha256":"8b5f4c0f03fd3343fd68e99f736fc1c85dec3757acbc10f85d1bef16503ea50c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1515,"target_line_start":1513,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1513,1515],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e231b44b1861aa3514a31fb045d3cd8959fa42491d6d6a7e6de089d0f993a1f5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-223","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":223,"source_content_sha256":"34be76be3e23e2c1a6eaf1f344356ceff38a91d0482183bc104698256bab7fd6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1551,"source_line_start":1521,"source_local_id":"block-223","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":218,"target_content_sha256":"34be76be3e23e2c1a6eaf1f344356ceff38a91d0482183bc104698256bab7fd6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1547,"target_line_start":1517,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1517,1547],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3833826bbf8653a336ecae32ae9cee983075ca14224e98da24bf64a84b46caca","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-224","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":224,"source_content_sha256":"3f4b5e9f2a789f7a8cd739c50009bb1b42dfab9502da2f13b8e3f3dbb5008728","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1558,"source_line_start":1553,"source_local_id":"block-224","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":219,"target_content_sha256":"3f4b5e9f2a789f7a8cd739c50009bb1b42dfab9502da2f13b8e3f3dbb5008728","target_edition_id":"edition.r017.id-id.draft","target_line_end":1554,"target_line_start":1549,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1549,1554],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c7ebe2e359c080da287759ce0a9c18102965578a4bd3077e2bbc8985ac686c1d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-225","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":225,"source_content_sha256":"1092284887636cb825ea4ac1716f61b0d0de81459e12b43bd0054bec4e48edab","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1571,"source_line_start":1560,"source_local_id":"block-225","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":220,"target_content_sha256":"abdfa2a360077644b32d150ac8eda52d075e68704a7fd4d5f40d9719b36bd555","target_edition_id":"edition.r017.id-id.draft","target_line_end":1567,"target_line_start":1556,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1556,1567],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb1a2e763fddc8b65977e5cdd5b57012a45784bea9c653b94632441e71dd0c29","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-226","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":226,"source_content_sha256":"53c1965a59fc65b7017ed08f089f3acf6bd5fb7975f18553edda127e2dbe2b3b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1583,"source_line_start":1573,"source_local_id":"block-226","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":221,"target_content_sha256":"49087e3dc9ef62f4478a2c0a67c3d76f8d4ad097d8b3b640641339fbbfbe8607","target_edition_id":"edition.r017.id-id.draft","target_line_end":1579,"target_line_start":1569,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1569,1579],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70684fb1172966918496603090fbfc55f6b4a5d7fccfe0c81226c70d04a33c61","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-227","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":227,"source_content_sha256":"e8ea908c8bd882f45200266d029fe352c4048fc39be4dbeb278717649d333003","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1587,"source_line_start":1585,"source_local_id":"block-227","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":222,"target_content_sha256":"e91a7065748a57a35d7552701fe9f8d3f2c49217bd21a99b737efb754cce4c5d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1583,"target_line_start":1581,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1581,1583],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab9299f36b4b8a5fdf6dc32c618a547d2ffbfc05c84009dabb41b36cea691c61","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-228","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":228,"source_content_sha256":"e32940cbfaae5bbbe2c8c2ef8af1e7b90462cd764a4766b13d176840829c124d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1589,"source_line_start":1589,"source_local_id":"block-228","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":223,"target_content_sha256":"57dc89d24a004e03dbe13be76dd539200a088ea3cadc2e235e8fbeaeeac147b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1585,"target_line_start":1585,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1585,1585],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e31d58126303b2933c94766b5e92ae20c7545573246d162149bb3c6f29e7b00","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-229","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":229,"source_content_sha256":"2dce264735755fff39295aef46025b717a6e850bfb7bd48c7ddb5726fbdd70ea","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1591,"source_line_start":1591,"source_local_id":"block-229","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":224,"target_content_sha256":"df573a3fbab62fae06f27a48a7091c926ba0c194ca174093a7eea71972a33c2d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1587,"target_line_start":1587,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1587,1587],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a2230405f9ce7204c08ffe99d14cf950c4712c75563fa3422c074ec255aed20","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-230","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":230,"source_content_sha256":"ff6acb7ee8caacc2372366659e9553f373d752c9a7fb04475caffc0f80d4b326","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1604,"source_line_start":1593,"source_local_id":"block-230","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":225,"target_content_sha256":"e51a6db35a23aee5c5630919bd7f59bb463e7dd9d7bf4b49e346980a24e6f6db","target_edition_id":"edition.r017.id-id.draft","target_line_end":1600,"target_line_start":1589,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1589,1600],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1818f0be57db5ee9d015bbcca0c067df7653fd7f844de8f014f1684caba6a2f6","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-231","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":231,"source_content_sha256":"9f27c24eea4b14df1914375b329b445bc8d684e9771d38ddbc9be9e4817dda05","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1610,"source_line_start":1606,"source_local_id":"block-231","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":226,"target_content_sha256":"568bc05ceb6a7c29002b06381cb014ab77836b9458ce2389bdc29dc44ba09ff3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1606,"target_line_start":1602,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1602,1606],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5ce89a28591ff632ba235516c14c10bf34750deddbe0367ba3a82e8a2768198c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-232","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":232,"source_content_sha256":"772dc11a01f636d62f2e286311f36332ae9f469dcae7471021e879234c02101c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1613,"source_line_start":1612,"source_local_id":"block-232","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":227,"target_content_sha256":"9dad820a1e82628e9b07374b189447ae9b1b7a15f2f57110ae712f6ba350ef7a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1609,"target_line_start":1608,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1608,1609],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eef897f6e0197b3364b4d95bce003fa5450bdc2b02be44c6871f886eae13b65d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-233","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":233,"source_content_sha256":"07e1c4223bbf47ebde017559ad6cbe712a5c1e9241e7a392cc59438fa6466951","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1616,"source_line_start":1615,"source_local_id":"block-233","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":228,"target_content_sha256":"d6481a134e94887c02cf5292cb7c1f1ab8f4d75761d157114220bc1e18893d07","target_edition_id":"edition.r017.id-id.draft","target_line_end":1612,"target_line_start":1611,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1611,1612],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"91c9aea072a6215437d4a306f8698be835666055f68851a914f25187f64d9b5d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-234","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":234,"source_content_sha256":"6b3782c1ba0a3000d5844a8437884c35b9f1004788600efecddcb783d3a8da27","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1619,"source_line_start":1618,"source_local_id":"block-234","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":229,"target_content_sha256":"7b0822f327af0d0e3805b8f2a7ff3640b90cbd9ecaca6f83d4e17c6a531e7a82","target_edition_id":"edition.r017.id-id.draft","target_line_end":1615,"target_line_start":1614,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1614,1615],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a8acb8012fc22806ac601ab5d4a36fd917008c58330ba30adb44ba5fab7fd173","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-235","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":235,"source_content_sha256":"7d47d014ef87a734aa36af64cbffe9ca1ee2cdb5b94e522f1863b58200845aea","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1621,"source_line_start":1621,"source_local_id":"block-235","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":230,"target_content_sha256":"dd444166ee2a9b6384cc3f962cd4251b2bae2ca15e4aa0faef117e573721585c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1617,"target_line_start":1617,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1617,1617],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"95b0b7b74b3a24553aeff59ddc53a9b4879bd875dce73a4a63072cbd0a43a402","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-236","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":236,"source_content_sha256":"7f7d96b157f1861a8f93c8e2871721a075daa11290e2ac2eba3fa6b243d98faa","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1623,"source_line_start":1623,"source_local_id":"block-236","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":231,"target_content_sha256":"3a093a112ca183985b12691730bced708098195b0412d309d79557d47f535e9d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1619,"target_line_start":1619,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1619,1619],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"627c31552c53fe8c68c5569bd4f3efdde3cd0d1685a12eb358ae8301f5b63627","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-237","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":237,"source_content_sha256":"d567528b4c1bb6478b33f4df9c2c1dca1d6f4340d4b24af5c5184aa5db8414f7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1625,"source_line_start":1625,"source_local_id":"block-237","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":232,"target_content_sha256":"94156d240f8da349f7ff740a533b605812d1eb610808db2ce22ffba4ef385b68","target_edition_id":"edition.r017.id-id.draft","target_line_end":1621,"target_line_start":1621,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1621,1621],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e32f61a033c1efc9b8d1f31adc2b9f965887c9ec71163326f0c1f3de9899d1c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-238","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":238,"source_content_sha256":"4eddd2de69c6690d03901f431952283d550968319d730a9d6bbca6e6b05e4822","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1635,"source_line_start":1627,"source_local_id":"block-238","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":233,"target_content_sha256":"df5fe2390dca491e0212458dc841bf384a0d44f4a971392c3f678bb5a1bca58c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1631,"target_line_start":1623,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1623,1631],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7561d65fac6d574983ee95d5f5ac00d515739e0bb43818f31a4f638fcb74257","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-239","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":239,"source_content_sha256":"e5af1c61940058695c51e846aa3cedf57251aca4cd02f894fc58a942b31d4506","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1662,"source_line_start":1637,"source_local_id":"block-239","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":234,"target_content_sha256":"24d07af5c2afb48af37d6fee657fb1cab89629249da3962a25c94abecf71ef4f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1658,"target_line_start":1633,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1633,1658],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18737c3e1281d5af42e8429fe17b8f6608dfbe01218ba9a590609de20bbf6194","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-240","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":240,"source_content_sha256":"d902b77463dc4775c346a35b69319c134c23df22b8c2e0492c394f7b6411f03b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1694,"source_line_start":1664,"source_local_id":"block-240","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":235,"target_content_sha256":"2f8d5189d50419f172f7ee9fe7235a530acad645e134c9fc0faba7b92e9e3f52","target_edition_id":"edition.r017.id-id.draft","target_line_end":1690,"target_line_start":1660,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1660,1690],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"756038a00f41bf16c018b4d9942378aa97ad09a1e944d7fb4ea140b268bc1525","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-241","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":241,"source_content_sha256":"7ae0547d23352b4d50e0d92eef4b865bc9a2a3fb48d7dd43b3630fa4ee12bd39","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1697,"source_line_start":1696,"source_local_id":"block-241","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":236,"target_content_sha256":"7980ecfddb6d1ca5dcb0bea03b26425016e22310c23ab8200e6ace96b6d3901b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1693,"target_line_start":1692,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1692,1693],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc5e28c8b66f32253f886abe89b07f8c4145261d7bfba517a7a21dcb49cee27f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-242","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":242,"source_content_sha256":"ae33c2eff4d04ff857f7a363c35d0931ce7124ef8220fff25afaf01add648eae","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1710,"source_line_start":1699,"source_local_id":"block-242","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":237,"target_content_sha256":"bcd712d3f3d904d80b287fa1001b387dc686a8dfc4a2034da910517d32f2f57d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1710,"target_line_start":1695,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1695,1710],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d002be497cdf009c3162eb07447bc5c3fca7aa7e3d5fdbaa0517a3472b9bb708","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-243","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":243,"source_content_sha256":"5fd4ced6fa5b5b64dda6a706689fad2b164e08838f3044bd436fafdb8a178ad6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1714,"source_line_start":1712,"source_local_id":"block-243","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":238,"target_content_sha256":"87c9548f876092c007924fdf725e8ea50cf616d835febee0fe9d2ab58b686ae8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1715,"target_line_start":1712,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1712,1715],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8bbbc6997202ae690ac65a6ace4093f66265b40efaf8f3ff07eb5a4bb76c68d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-244","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":244,"source_content_sha256":"392c3105cc495a9acf8ed150b0ba22b5c1375e4d016da1281acae8c355cd40ce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1720,"source_line_start":1716,"source_local_id":"block-244","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":238,"target_content_sha256":"76b3ae19c4c8a0c1318d0b621031cfd643beba0d5dca7a4ee5d0575e003c5eba","target_edition_id":"edition.r017.id-id.draft","target_line_end":1718,"target_line_start":1716,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1716,1718],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6f68acbb81d9819a15cffc643b36470914866b4e772471e79abe20a216888bbc","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-245","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":245,"source_content_sha256":"816967ef4dba947a7cda7a82a8c9b4d3383ece1604450ebda5037c72ed04ab41","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1726,"source_line_start":1722,"source_local_id":"block-245","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":239,"target_content_sha256":"415f07584b1897b0bef97763164e65a47f7223d52876822080645ba59ab92053","target_edition_id":"edition.r017.id-id.draft","target_line_end":1729,"target_line_start":1720,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1720,1729],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c19df0bafdb8df299af4eaa5752084e383c11cc99e7a134290e1a3d2a35aae3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-246","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":246,"source_content_sha256":"bf25537128f752e426c9ad2d8e842942c6446d8d012e0451d9ac9ca241e79904","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1730,"source_line_start":1728,"source_local_id":"block-246","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":241,"target_content_sha256":"f77486b035a91e5b1149d7cf627e5613f646c798fdd742d05fa80a5ba0aa14f3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1755,"target_line_start":1755,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1755,1755],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"63fe48e77e5b1532cd4613e5791791910572336eb8b0cb9565889f495e618930","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-247","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":247,"source_content_sha256":"31136b36926c8c3c7d88f35d51a5b507ab7e0bb375ae2ac0627b1e19ad72835b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1734,"source_line_start":1732,"source_local_id":"block-247","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":241,"target_content_sha256":"fc61cf4c79efb3215a80a954b1ce52967d1684d38c31d68d1946aa32779985cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":1756,"target_line_start":1756,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1756,1756],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"53c0366d85dd5a605d90b0e373f40de412e25821713cff6802e6de78fe5450c2","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-248","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":248,"source_content_sha256":"3c26c12bace897de8ddf5d7e49e9db40cb17073fde7c9c120ff02f4635a3e7d2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1738,"source_line_start":1736,"source_local_id":"block-248","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":241,"target_content_sha256":"1f4c2f30892229e688487b22eaac713ae95d4024974cdfd41b2ecf7dc7f285df","target_edition_id":"edition.r017.id-id.draft","target_line_end":1757,"target_line_start":1757,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1757,1757],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9b25f26d07c10b272b21ff055e384b3592455c16dfc4e5101e076d675547cd0e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-249","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":249,"source_content_sha256":"b679f2ac23ab33086d2e91048d0c4628b3c5900d346bf6d19cb7d3857ba97213","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1742,"source_line_start":1740,"source_local_id":"block-249","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":241,"target_content_sha256":"b06d64b8041adddf515f62fd5a2a55f729435a736daedda953a9de701d7ad19f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1758,"target_line_start":1758,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1758,1758],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b5700baaee0eb4433a80ce903ab2c5f5366ced390b7b3d60ab3e2f0b4253c478","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-250","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":250,"source_content_sha256":"ead3c5ea85c8e98175538bba5dd83182cb77d0560334440ee5a3d451a5394bc3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1751,"source_line_start":1744,"source_local_id":"block-250","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":240,"target_content_sha256":"dae07592fccfe25de40db49b1e48c1acdd39a787ee49e3de42739f5a92c3f1cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":1764,"target_line_start":1731,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1731,1764],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"95457549902cb73322c6b8b4dd75c61a2840e0527d51a8b548d38666669cab7a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-251","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":251,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1753,"source_line_start":1753,"source_local_id":"block-251","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":243,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1766,"target_line_start":1766,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1766,1766],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1647a5cb564bd68074c0fbd6523908ea2586267d64b0b254689cc7509dc607ce","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-252","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":252,"source_content_sha256":"b3a33cb86bd6d6d031250e8923cb0a88edca664f5340d12ccecfb61e1db708fd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1759,"source_line_start":1755,"source_local_id":"block-252","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":244,"target_content_sha256":"3a018aaefe1b87542cc5fa4e7f474f73dd8b778c24609adeb0345c67e5ef51e3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1772,"target_line_start":1768,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1768,1772],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c3c747c94798a118c5a693171816730e4433a2f4b4f5ffebe74f2d89c5e3924","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-253","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":253,"source_content_sha256":"5915c454533240e840af51658d36f1ecd6c6a61355d011378a57b98d644d7327","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1771,"source_line_start":1761,"source_local_id":"block-253","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":245,"target_content_sha256":"5915c454533240e840af51658d36f1ecd6c6a61355d011378a57b98d644d7327","target_edition_id":"edition.r017.id-id.draft","target_line_end":1784,"target_line_start":1774,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1774,1784],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"30eb460d75f217038a8629cc181d5776a22e69121c51432a5872358dd6adec16","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-254","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":254,"source_content_sha256":"c3a541fb05a252a4f9ec4de707f0709fe91ac6e67262906dd9c91c08a22a4d4b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1780,"source_line_start":1773,"source_local_id":"block-254","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":246,"target_content_sha256":"a1f647d16cfdbe60ccf23f71456156711bd332400daf2cad2b9631311fa57987","target_edition_id":"edition.r017.id-id.draft","target_line_end":1793,"target_line_start":1786,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1786,1793],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b8f3314e89847244e9d3211e7fc4b9f4bcd51c3af65ef8a1e02fddce3207c845","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-255","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":255,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1782,"source_line_start":1782,"source_local_id":"block-255","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":247,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1795,"target_line_start":1795,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1795,1795],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b6057789ba016dde17abcd31c0e6db2e9bc6bebfc90d115e3d272976e5fbbcef","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-256","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":256,"source_content_sha256":"2afdec1b51f2f05d1408d7059a750a44312bfc2069a84ebf78090bc48a224fac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1787,"source_line_start":1784,"source_local_id":"block-256","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":248,"target_content_sha256":"e1e8504c12cd771b7980536d7c32cc868b3e08623bb67ad342510db6f02fc2ea","target_edition_id":"edition.r017.id-id.draft","target_line_end":1800,"target_line_start":1797,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1797,1800],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"67b12efde22719a23ab3671697538583fabab3ff369f06fe482ca516850e932d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-257","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":257,"source_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1789,"source_line_start":1789,"source_local_id":"block-257","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":249,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1802,"target_line_start":1802,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1802,1802],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bccff827c73ad00cfbdf01157cce1aff7e6a594eef23220315a34f6e5b83f997","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-258","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":258,"source_content_sha256":"bf3a4bb99b7d601bd7719f8ed3e498a423097ce947a798bbc6849cfdcf49ad39","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1795,"source_line_start":1791,"source_local_id":"block-258","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":250,"target_content_sha256":"81f50cb0b6b2b1bca3e6cdabf4e2642878c304263341364577f5dcb7ed11d76e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1808,"target_line_start":1804,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1804,1808],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ff6914f3a0fde8ac464567e9ffb58741656c0a4f95417951aee22cb5d8a39bcc","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-259","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":259,"source_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1797,"source_line_start":1797,"source_local_id":"block-259","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":251,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1810,"target_line_start":1810,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1810,1810],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c1eddd4720851d8cea733185ae3cd5996c913f5216ce742503b03e38bc1fb004","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-260","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":260,"source_content_sha256":"67529bc44c71fc0163f99324492aff8d5a945ab80b5e19e54cd5eba6a5b0a483","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1802,"source_line_start":1799,"source_local_id":"block-260","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":252,"target_content_sha256":"d2560ed89b3178d29ca623f048c138d8187aef08e25e7d683e503a61d4ebd06e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1813,"target_line_start":1812,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1812,1813],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ecdf45745af17de59ca8417bfcfdbaa578b282982223c6939ca802af5d8cdef0","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-261","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":261,"source_content_sha256":"aaea00d3e2c4c95f629b2d8000a8cfa0756c6e473b7fce4435d39e3902ab86ff","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1805,"source_line_start":1804,"source_local_id":"block-261","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":253,"target_content_sha256":"25405ceac3115ce125e16d4cdeb48d761a6aa00e5059daa988a55849c2274cf6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1816,"target_line_start":1815,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1815,1816],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26127cf9daab1785a5cd1f070d5baf60a7d9eee651e560a3f18c54209691f094","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-262","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":262,"source_content_sha256":"28a4c0cbe1ff79e1867622d37ccc6d0d7a03c25cb68a6f623d938800c193f506","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1807,"source_line_start":1807,"source_local_id":"block-262","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":254,"target_content_sha256":"77ca02779e4c24d4414ad4ba0c72d03f3b43e1949c6e8b0fd3e41c6c2737d1ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":1818,"target_line_start":1818,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1818,1818],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b3501dd00d78d175b00547d7933ade978e9fbcdff706376790ac987f597caecd","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-263","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":263,"source_content_sha256":"e5f543be9064b7acb0ce92dbb84a30405ba5154f1eae751b36c0054c0cd0c8d5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1813,"source_line_start":1809,"source_local_id":"block-263","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":255,"target_content_sha256":"9e1235346acf567f6c1959ff6a2741982955430e0ed949c3ce3b05aeeef075c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1824,"target_line_start":1820,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1820,1824],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8140506d1a452a891f8878733e1c26e70ee130b63df6def060483b9128e9a33a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-264","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":264,"source_content_sha256":"975eac1d60e1602ba266b94a5f420a40a04b879294ea9c5754885808e690e058","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1820,"source_line_start":1815,"source_local_id":"block-264","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":256,"target_content_sha256":"6a15aded054e2142aa86db51c99ef5556e1063e63b58b0e4d725dc26e8af1a44","target_edition_id":"edition.r017.id-id.draft","target_line_end":1831,"target_line_start":1826,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1826,1831],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c251f107b2a7786998347e6f04e29a32a36870e0e35c1d6dd4ee0fe7ddcb8a63","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-265","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":265,"source_content_sha256":"3e54027ea5770becd0311214c6625dc92258e360e0a276a45bfe43e08ee06a37","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1830,"source_line_start":1822,"source_local_id":"block-265","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":257,"target_content_sha256":"8dc35f04719421f2ed78574ff1cbe032cecf8e2a7502503d7290954f1a9370a7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1841,"target_line_start":1833,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1833,1841],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81436f2b3f13f36c0d25b99e2a702d100865eff6eb67174c82de5375bda6692f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-266","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":266,"source_content_sha256":"c51daa8beaad0d7e7eeb5077217bda1485e90008b394174864e2db15b58b0bfe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1833,"source_line_start":1832,"source_local_id":"block-266","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":258,"target_content_sha256":"cc3a898a28ab2ba447ff9ead718398ab48c13794619ffea9c827c4e1b75ce933","target_edition_id":"edition.r017.id-id.draft","target_line_end":1844,"target_line_start":1843,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1843,1844],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e0ea418d7a5fe2ef9bb9b3bb6bee3d306691e43a24f92e361d4fae3a4811c32","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-267","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":267,"source_content_sha256":"4bc4f24e8b9542c98b7ec6def6bf638ad45b73f2ce7094885f4eebde4bd6effb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1837,"source_line_start":1835,"source_local_id":"block-267","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":259,"target_content_sha256":"2e08740f42dc54d4e556145e44e8f62bc45c64feaa2b2e38ebbd2639d1407a60","target_edition_id":"edition.r017.id-id.draft","target_line_end":1848,"target_line_start":1846,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1846,1848],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d17d856ff16844392e4080cc9da5dff2dc2f6af0228e4d40a463a3d012bd4bad","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-268","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":268,"source_content_sha256":"1e53ee436e3169f8f8c018295378ee1fcad99b3a78be0002b61ae1ccb71a3a4b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1852,"source_line_start":1841,"source_local_id":"block-268","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":260,"target_content_sha256":"0f22aa40e304f124d6a7c74c18b5172d94424b6c8c7e616bd47e3f606a6732e4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1863,"target_line_start":1852,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1852,1863],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef264ab02611a1777f0c2d665195ee1bdbbaebb461d64c355ae197f9f786b15b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-269","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":269,"source_content_sha256":"5f637c1b52e383f6a9a1fd37a830323c48ff84bcd1ec66c937a577cbad25cde9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1855,"source_line_start":1855,"source_local_id":"block-269","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":261,"target_content_sha256":"e35061816d1a39c59d99b0cc0aec91abd408095f22e40ab9df2027b0c4bee492","target_edition_id":"edition.r017.id-id.draft","target_line_end":1866,"target_line_start":1866,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1866,1866],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"208833222a68322305eb59c953c237bdd5bac698a5af31cc1b9068c98b3612cf","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-270","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":270,"source_content_sha256":"cc1b834f0aff510f8ef277c93ee1c59817bbc4ed07dd7c7f55105c5dcfa9b667","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1867,"source_line_start":1857,"source_local_id":"block-270","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":262,"target_content_sha256":"851152ea256f8c58f0cfd5b4dbe1419acd832f96fdfd54736004d1af9afdf612","target_edition_id":"edition.r017.id-id.draft","target_line_end":1878,"target_line_start":1868,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1868,1878],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df2c46370bf40feefc539d660db1bb82b020fa118bfc7265e6bb0b1c566f5383","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-271","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":271,"source_content_sha256":"77e168bc5fdeaca286fa19de0b03efde3258297d6744f9bd70b9f03aaba53812","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1881,"source_line_start":1869,"source_local_id":"block-271","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":263,"target_content_sha256":"7bef4da0ac75eb6ee338174f541d9bc0f67c63cb86044648c320109173a33510","target_edition_id":"edition.r017.id-id.draft","target_line_end":1896,"target_line_start":1880,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1880,1896],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5ea488c158c9f58d2bd83368bb831c157cc672700bef0a86d21ff74117af3d98","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-272","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":272,"source_content_sha256":"be88ba38834899b881596194e5f56820751eb339a20ac0c4b263e352e16e0157","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1886,"source_line_start":1883,"source_local_id":"block-272","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":264,"target_content_sha256":"241aac36d4d6f4f197df9efd3154bbb220d01be6b58e9360fe807c6651e1f749","target_edition_id":"edition.r017.id-id.draft","target_line_end":1901,"target_line_start":1898,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1898,1901],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a3b27213010f3cd51cfbe0d876364afb24f58b027994d82fb271fcd2f8c07c84","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-273","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":273,"source_content_sha256":"99b01d398d32ecf83ce22f18b225d2d5ce2ef1624da72090fe31aecb7dafe6f7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1890,"source_line_start":1888,"source_local_id":"block-273","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":265,"target_content_sha256":"99b01d398d32ecf83ce22f18b225d2d5ce2ef1624da72090fe31aecb7dafe6f7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1905,"target_line_start":1903,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1903,1905],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2bc48dcaf489e6deed198882cfe0d35e201d35fb82cd8399971a2c19abc124a8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-274","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":274,"source_content_sha256":"817b5662a8768458fcbe16cc68e2e400f3fa41e4a97cbbc97ce56aaed41a725b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1898,"source_line_start":1892,"source_local_id":"block-274","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":266,"target_content_sha256":"0db9740e0f07ca96bbb55cf09cbc1bf611e63e3401f7edf46a515a2416cf59ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":1913,"target_line_start":1907,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1907,1913],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19376cb77a00d33037cef06faae1b00ffdbae901785b520b59be167e8adb43fd","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-275","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":275,"source_content_sha256":"98ca1dad9644845b3af9ed0de31ee5e7843bd7962e95a6b0e2cbf94af6fded1f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1905,"source_line_start":1900,"source_local_id":"block-275","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":267,"target_content_sha256":"1b11565096d09e6427aba950dc667749447b381ebc0eb264f59da1691d803585","target_edition_id":"edition.r017.id-id.draft","target_line_end":1920,"target_line_start":1915,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1915,1920],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"523ff67a34eae71de342b155859b20eb3f83bf1bc412443c0c88d3bac5ff8ee7","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-276","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":276,"source_content_sha256":"d4f883bdc48de9347da7fc8095e1e9720b97eb9eda0e9efdba915b4f2b2c61e9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1911,"source_line_start":1907,"source_local_id":"block-276","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":268,"target_content_sha256":"ef0efa223fcb5033d95d7647a67f2d6be092f54448d411647e58639dfc693b70","target_edition_id":"edition.r017.id-id.draft","target_line_end":1941,"target_line_start":1922,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1922,1941],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"abbf4b73dabdfaacc23772e1106670dd7a2432a01bd425a882c3b356639588e4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-277","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":277,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1913,"source_line_start":1913,"source_local_id":"block-277","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":270,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1943,"target_line_start":1943,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1943,1943],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a7aa96bd1c48df2269fa61b02b9f5e4a4b3c460bf573c61c202580cdb523383a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-278","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":278,"source_content_sha256":"30ab960e441c8be4316e1e94292e4e73612dd77d6f827ae8e27c47d3054da64a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1927,"source_line_start":1916,"source_local_id":"block-278","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":271,"target_content_sha256":"f26019f85b5e1d3db8b51dd3cc548d88119be91dd74962af65f9ad3d58b03705","target_edition_id":"edition.r017.id-id.draft","target_line_end":1957,"target_line_start":1946,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1946,1957],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"faffbeb8baa0ab78c7b6e1e2bcf88d30ead99d2ad8d1e9b338d338628a2898e1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-279","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":279,"source_content_sha256":"b0ae0aa128efb0ff0a98785454656b8d035f7b5aec3f38bddb0f9b36204a68d9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1941,"source_line_start":1929,"source_local_id":"block-279","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":272,"target_content_sha256":"b3dd198c8b5b6207743cbe7af83a7cdce8ce1d19cd3eecbd37aba50d9805ef10","target_edition_id":"edition.r017.id-id.draft","target_line_end":1971,"target_line_start":1959,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1959,1971],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b0ee4298923122ac379da7507bf9cafac19f1853248c1ab13bee71471ec125f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-280","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":280,"source_content_sha256":"0860841ee193e1edbbe2f1ae47badda5fe7648a2db90d581b3e950385469de8a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1954,"source_line_start":1943,"source_local_id":"block-280","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":273,"target_content_sha256":"5488c82c16820e20ddcdf25a58b087c45bafa40566ed94222a4cca8edf44f069","target_edition_id":"edition.r017.id-id.draft","target_line_end":1984,"target_line_start":1973,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1973,1984],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3f2feca5d23d54371f0944c99558e2f55a7bde5d9fe0c5415d59313373926c11","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-281","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":281,"source_content_sha256":"5f824b5b6bde535551c48507984c720fd78b695d5e64f96af45c5361c6583da5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1967,"source_line_start":1956,"source_local_id":"block-281","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":274,"target_content_sha256":"3e33aa5dbeec8248a2a3128bf9022e2f76d60eb122b928bf26debc9c98cb9e7b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1997,"target_line_start":1986,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1986,1997],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"be4518636d08f496c0c066bbaab7c03228ff1923f4ac6113610490947b1c64e6","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-282","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":282,"source_content_sha256":"73f6532d66e43cb586b0a54cf32b9695c77a93c2ca03ffbeba62abd757f41477","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1978,"source_line_start":1969,"source_local_id":"block-282","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":275,"target_content_sha256":"96d407670c3b19e088fb7e01f5ae330d2def0cfa9b6f7ac0f2ebd26ce698a166","target_edition_id":"edition.r017.id-id.draft","target_line_end":2008,"target_line_start":1999,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1999,2008],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd0b2dde58532be72de8999ec8dcae64a5bf07fcc7a8df9583913ce1e77959d6","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-283","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":283,"source_content_sha256":"a11b2ab15ddabcc76feb896b3f5e7a4c47ae14dd3e33111803caab057a75ccf9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1982,"source_line_start":1980,"source_local_id":"block-283","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":276,"target_content_sha256":"6b13f5c78f4d12d10c41f714ede812c38317dabb39c461fb58ae9fc7c24fce7c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2012,"target_line_start":2010,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2010,2012],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3d2fc82339bfa2edf726ae8eefae511dd4be69adbd09b13115a011347ef12d32","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-284","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":284,"source_content_sha256":"70497ccebe47d496511834e927bf9e8f1aff3b507544792d09d17b8c288a6497","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1989,"source_line_start":1984,"source_local_id":"block-284","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":277,"target_content_sha256":"2432c3425293de7e30f45fd77014a70a0e54561bc06078d4ca65344c1ee46316","target_edition_id":"edition.r017.id-id.draft","target_line_end":2019,"target_line_start":2014,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2014,2019],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d5c41a503332f025d2ca4ccb583bdc4398ce4314396d150e5298b0df48a04031","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-285","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":285,"source_content_sha256":"03a9b67c7b07dedbcfefcb6008fe3c018b46ac542765879e73023724dcd38275","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1991,"source_line_start":1991,"source_local_id":"block-285","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":278,"target_content_sha256":"fd5f4d81b3626be3eceb39ae8ec9ed00d59f7a0d7337c9d4629940b154163a1c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2021,"target_line_start":2021,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2021,2021],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"146dc2c2f7b073807b6580e2cedaa3a68f2940570548d2defff7d74e54ef0762","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-286","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":286,"source_content_sha256":"0c7d07d78dc0ee7f0e7c62c499309b5b43c8148359f8b641a4b367dc8ed07e70","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1993,"source_line_start":1993,"source_local_id":"block-286","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":279,"target_content_sha256":"0c7d07d78dc0ee7f0e7c62c499309b5b43c8148359f8b641a4b367dc8ed07e70","target_edition_id":"edition.r017.id-id.draft","target_line_end":2023,"target_line_start":2023,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2023,2023],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"71e11fa16b795b9ff92133063803bb106be54f4257b7475bc1804312ea3e183f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-287","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":287,"source_content_sha256":"d81d18577e1da7c27a9f0269d012c57cb5880d9f749aa871be4e24fa1bfe37ee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2005,"source_line_start":1995,"source_local_id":"block-287","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":280,"target_content_sha256":"d81d18577e1da7c27a9f0269d012c57cb5880d9f749aa871be4e24fa1bfe37ee","target_edition_id":"edition.r017.id-id.draft","target_line_end":2035,"target_line_start":2025,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2025,2035],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a0d9f440300970ab475708096991df28e4a6eba015f080ca4effb60113821525","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-288","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":288,"source_content_sha256":"4d0c0f0f6ce4e8eeedc2d9d94322e7f231d228bd1d4a72c437dfcbdd6911a8e1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2007,"source_line_start":2007,"source_local_id":"block-288","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":281,"target_content_sha256":"4d0c0f0f6ce4e8eeedc2d9d94322e7f231d228bd1d4a72c437dfcbdd6911a8e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2037,"target_line_start":2037,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2037,2037],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"59149914cf7593814fa24d5b28bf6f6f11502fd8d733aa1e08cf02555ac7b6ae","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-289","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":289,"source_content_sha256":"4e2a16781139f05e802e25cef055d6dabb9e7b04cdb17e289cbf9d837d99b85e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2015,"source_line_start":2009,"source_local_id":"block-289","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":282,"target_content_sha256":"3802d7c8a4510c8e7f035d6cdd8399a02d3ddf9e94996a01d573d37163d1e11d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2045,"target_line_start":2039,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2039,2045],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"742ba21133a3d5e12aa82e6c9cbc727f36099571dedb4c480c1e6141bf1cb657","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-290","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":290,"source_content_sha256":"d6fbe060c4af2f689c6f731722c9053ed0963ef8d1b695a3f4b68839f3ad04bc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2019,"source_line_start":2017,"source_local_id":"block-290","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":283,"target_content_sha256":"bae23d2b097ebdc3f6fafdfb3e7c32d85c0e3d6924ba2bac0ccbab108af4e173","target_edition_id":"edition.r017.id-id.draft","target_line_end":2049,"target_line_start":2047,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2047,2049],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c65eb867ee21aedb594628caf94a2c58321ac2180fbc9f7d9e108a2532a935f5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-291","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":291,"source_content_sha256":"1db96edf71f97815b4cdaaad93a5ac540777a7b53f2b2c7795d7ddccd3d8597e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2022,"source_line_start":2021,"source_local_id":"block-291","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":284,"target_content_sha256":"1db96edf71f97815b4cdaaad93a5ac540777a7b53f2b2c7795d7ddccd3d8597e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2052,"target_line_start":2051,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2051,2052],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e5e36112b21d67c94de147a04ad696c77f20cbf821d37972b01a0b5c2ccaea6","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-292","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":292,"source_content_sha256":"2abf4d8a366cdbf596fd786684566102331b6c9e1eac4d6995b8b42de134d736","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2026,"source_line_start":2024,"source_local_id":"block-292","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":285,"target_content_sha256":"f9d8a509e2530f7342e232a9148eaa3da82678d4806ae579545c95132bbfb61b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2056,"target_line_start":2054,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2054,2056],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6cdd406edef9fdd77939d4f4baa797bc2abc5bb9ede07b12e92cb502f8700b7f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-293","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":293,"source_content_sha256":"13c1e83ac3ca433fe2f73d526e0f841fa1665f8fb0385dd5988c975b6825d921","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2037,"source_line_start":2028,"source_local_id":"block-293","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":286,"target_content_sha256":"dc0d40e84d727ca09e60a0929c106a84512fae3112647b1077443486e8ecdf6e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2067,"target_line_start":2058,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2058,2067],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"954cea3756280b485d2ad90d23064d08ec8548eadb879fa4853200f23e72917a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-294","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":294,"source_content_sha256":"2349164d8ec8e80b42434dc9e94fe33946a022be60282e564891d8863d663478","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2039,"source_line_start":2039,"source_local_id":"block-294","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":287,"target_content_sha256":"29f01e691b7facd0f414214eeda0c6ff1027fbda8dcc517854a626ced478c035","target_edition_id":"edition.r017.id-id.draft","target_line_end":2069,"target_line_start":2069,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2069,2069],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"74e24584dcbfdae1f18bc56df07c81b230164bf09eb9379b1a591df03c8e3975","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-295","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":295,"source_content_sha256":"df94fefbde2b65cd768ed35b6eacd29959fc79e7b18b08c14d559fa1c6dccec8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2048,"source_line_start":2041,"source_local_id":"block-295","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":288,"target_content_sha256":"966443080773e84e795d546e822111a1071e03052e431a8b10beff86ddb390d2","target_edition_id":"edition.r017.id-id.draft","target_line_end":2078,"target_line_start":2071,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2071,2078],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2a0ae3148cd724a3efceb4b8b4c31dc9fa4ef59a1128811004ef486324e79630","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-296","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":296,"source_content_sha256":"faa57fc1f7fc8299b2ad0302f9c628c5635d6884dcc99ee62fc92cc3d80abba6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2052,"source_line_start":2050,"source_local_id":"block-296","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":289,"target_content_sha256":"ad1da57c620556d7a6e1621e69233619b5fab9f2299d98094d2b7843da43e9f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":2082,"target_line_start":2080,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2080,2082],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b36925fcbe9ebf05c5815b4c2fc01172ae5cf05cec0c1e4a8cc3a2bb29746ddf","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-297","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":297,"source_content_sha256":"b1e1cc0bee2aa1adb624892bcab236954a9ac54f2f095588a278c8c1c2548069","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2099,"source_line_start":2054,"source_local_id":"block-297","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":290,"target_content_sha256":"3646d56ef6aebc43995f3ccf74678c096376ddeb4b773a9b7e603ad2cb5ddd41","target_edition_id":"edition.r017.id-id.draft","target_line_end":2129,"target_line_start":2084,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2084,2129],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"11e8f4c79bbf9ed9e099297847671be08b243e5b8f9104ee00ea346f69b4c45a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-298","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":298,"source_content_sha256":"eea80fef0d5c05b80411aa896832bd26f52a3ed38307db4c5389914acbe4938a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2101,"source_line_start":2101,"source_local_id":"block-298","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":291,"target_content_sha256":"e113c3063275ecf9b8d51be7fa541a7d423b4f6a864a0bab80aa8243a844a99b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2131,"target_line_start":2131,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2131,2131],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cbcc3af27ed2d4c9dc055ef71373b2886f9fdc128179460becc2f2b73636b592","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-299","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":299,"source_content_sha256":"1b17420dd99ccc242a14f8d5336eeba6ca55fc78430dd29e69d22bfa8724042a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2111,"source_line_start":2103,"source_local_id":"block-299","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":292,"target_content_sha256":"541b27bb06522853410f290d7a43d85dd3e9e2aabf1305cb2670a0c33ae38fff","target_edition_id":"edition.r017.id-id.draft","target_line_end":2141,"target_line_start":2133,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2133,2141],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ce480770eec88b33722cedcfdf26dc3caef312f15de960126c1bdcb67fa86b1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-300","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":300,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2113,"source_line_start":2113,"source_local_id":"block-300","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":293,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":2143,"target_line_start":2143,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2143,2143],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"30ce8217164e649e9d17c6b9d859a719cab4c33703510c469416e3a7da5facbe","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-301","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":301,"source_content_sha256":"98c1f9ce68787e16eb5ea177b6a2d7822baecb4d94319522de9e2403bbcafa77","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2115,"source_line_start":2115,"source_local_id":"block-301","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":294,"target_content_sha256":"83e122fa1afbc8d959cb08c99224eedf3f7e18edeef85881c287674d0ceca155","target_edition_id":"edition.r017.id-id.draft","target_line_end":2145,"target_line_start":2145,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2145,2145],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2fcc394512aba881e601a08a8125cf071a9ec659c52e0234a4cf02963683c43d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-302","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":302,"source_content_sha256":"2e06c483189c0a26887d12b6f92dfe02520cf2196319bd4f1bb610bc832ec8a3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2118,"source_line_start":2117,"source_local_id":"block-302","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":295,"target_content_sha256":"d5910f8db4955bac1b4c8aca3bae350af1778952c9b1db10ae0c0236ab77d532","target_edition_id":"edition.r017.id-id.draft","target_line_end":2148,"target_line_start":2147,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2147,2148],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6f6b9440b8d2c9081698da9d8e913f02045a3f480fe9f7a54de1bae278f3adce","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-303","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":303,"source_content_sha256":"79e4e94ca2018543a513864af63193a2c09ac33327da4382db897bfe5ff8dd64","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2125,"source_line_start":2120,"source_local_id":"block-303","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":296,"target_content_sha256":"fac35a28c2e13a93530f1268dfbfe0d05a67cf3ebf5bb3923d66ddff4933c794","target_edition_id":"edition.r017.id-id.draft","target_line_end":2155,"target_line_start":2150,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2150,2155],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e65f1484d01d19b54db27792770fc7cfc5a6b610189175ab1403b80b4e4f987","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-304","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":304,"source_content_sha256":"3e7e87e72cf74757d0523cf4cde01b998ea581d66edcaea14ad06e36a40296d3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2128,"source_line_start":2127,"source_local_id":"block-304","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":297,"target_content_sha256":"201ef581f49f77998a537e284ef29553b0d962ef5fd16806952c0b8229b2df22","target_edition_id":"edition.r017.id-id.draft","target_line_end":2158,"target_line_start":2157,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2157,2158],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c270c66aadade9a46e1bf3773dadf93cbee9aa78713f35f11b02f303cf52b2f4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-305","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":305,"source_content_sha256":"0c7d07d78dc0ee7f0e7c62c499309b5b43c8148359f8b641a4b367dc8ed07e70","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2130,"source_line_start":2130,"source_local_id":"block-305","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":298,"target_content_sha256":"0c7d07d78dc0ee7f0e7c62c499309b5b43c8148359f8b641a4b367dc8ed07e70","target_edition_id":"edition.r017.id-id.draft","target_line_end":2160,"target_line_start":2160,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2160,2160],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"644c151ebcada28ceaaf0dccd91389f74ab48518960daa2a97c74d6d876cb93d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-306","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":306,"source_content_sha256":"f80abe40ad15a3a199d98d95b97c0ea2680c57754a857110fa57e35ef72716cf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2142,"source_line_start":2132,"source_local_id":"block-306","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":299,"target_content_sha256":"f80abe40ad15a3a199d98d95b97c0ea2680c57754a857110fa57e35ef72716cf","target_edition_id":"edition.r017.id-id.draft","target_line_end":2172,"target_line_start":2162,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2162,2172],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6840018c56e130dfcf1053e932ce782a223ce24d4f1d2182fbfdddf23346d22","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-307","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":307,"source_content_sha256":"4d0c0f0f6ce4e8eeedc2d9d94322e7f231d228bd1d4a72c437dfcbdd6911a8e1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2144,"source_line_start":2144,"source_local_id":"block-307","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":300,"target_content_sha256":"4d0c0f0f6ce4e8eeedc2d9d94322e7f231d228bd1d4a72c437dfcbdd6911a8e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2174,"target_line_start":2174,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2174,2174],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4eb14a9cce7384ffc217fe8391733166e3d6c1262f8a6df1e88f50f7205333ab","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-308","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":308,"source_content_sha256":"0bec97bf328ac488427ab5b71fab5750ce6fa0eef79d50d9b201bfcf203376f0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2152,"source_line_start":2146,"source_local_id":"block-308","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":301,"target_content_sha256":"c46269c8b799b27fce55534fa119020d6460380b8cd091b83c0a9b2c59bdbcc7","target_edition_id":"edition.r017.id-id.draft","target_line_end":2182,"target_line_start":2176,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2176,2182],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bddbf1039e1df74ae834dd569b9c4383948b167851c0187624f0aec2ad16ebb8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-309","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":309,"source_content_sha256":"5aa7d6e9dbe7d692d2cf3a91402944a4b9addaf46a2130410df7dfa073218119","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2156,"source_line_start":2154,"source_local_id":"block-309","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":302,"target_content_sha256":"53e66b3ef8ab0fa20730503781db360c4fb8fd445a7755849fdf6ce7a6fddf55","target_edition_id":"edition.r017.id-id.draft","target_line_end":2186,"target_line_start":2184,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2184,2186],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4ff53d359526d429168c9881b6a74dc9e79c74203055e8897e086e93696d133","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-310","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":310,"source_content_sha256":"1db96edf71f97815b4cdaaad93a5ac540777a7b53f2b2c7795d7ddccd3d8597e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2159,"source_line_start":2158,"source_local_id":"block-310","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":303,"target_content_sha256":"1db96edf71f97815b4cdaaad93a5ac540777a7b53f2b2c7795d7ddccd3d8597e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2189,"target_line_start":2188,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2188,2189],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fcaaf295a08555b24e628fc2db4aac03a6ac2f7eb4ecf16498de455b6ff39103","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-311","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":311,"source_content_sha256":"366595f1702190a4530b4fcaffc0666cf0185cd7d7b2adef24c6ded511385d16","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2179,"source_line_start":2161,"source_local_id":"block-311","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":304,"target_content_sha256":"4a5e2f5c9a4bc06c63be3dc266f555968542cedf12e98722801b62cc725c7919","target_edition_id":"edition.r017.id-id.draft","target_line_end":2209,"target_line_start":2191,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2191,2209],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"597510e9b3f5c752fe86f413d26e1a5f6dda6b4df6af58a79de0d23afd8757aa","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-312","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":312,"source_content_sha256":"5d8b63b43e11f46d7c909872ff12149618a76596bfb182e24e399f76f484d7eb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2182,"source_line_start":2181,"source_local_id":"block-312","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":305,"target_content_sha256":"17b5eb27e757632931c61d3a8d2e1d31cfcab3765c10adcd3c80ff9036f53f4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2212,"target_line_start":2211,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2211,2212],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5e1c128dc02b052e5f70dd81232657565c67dd8cdccee52f518fbb14f2ca985","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-313","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":313,"source_content_sha256":"3caff7c004abbef90641657b67ccbf1abf82dbf61dc5918186115b2a7c42c4d8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2188,"source_line_start":2184,"source_local_id":"block-313","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":306,"target_content_sha256":"317f2563acb05a25746c5af7536e06bbc65512cc3c49c9cced9555c8c7d6f7f7","target_edition_id":"edition.r017.id-id.draft","target_line_end":2218,"target_line_start":2214,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2214,2218],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16e58de32b7421c05b6f9fbdc0987bcaeb28c3d5d8a007f248ad1c47d4b07ebe","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-314","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":314,"source_content_sha256":"b35ad01c04e93dfb22965b9953c1a8b57264027cb0e928ec7fd76ed4ce448523","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2194,"source_line_start":2190,"source_local_id":"block-314","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":307,"target_content_sha256":"7b4297d53ae6a01047ee00f2a6e6aff60bd4a2d8d02741738eef54640f5b7be1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2224,"target_line_start":2220,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2220,2224],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88e619da5446967d5cfc6ebf835e6be74f4e21cb27d206ea69daaa7b31be7a60","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-315","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":315,"source_content_sha256":"b9c1f51ff4de53f19e4df8f8eee3e82bdabece23a12bdcc5f4ac6dcbcb2a8ed8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2196,"source_line_start":2196,"source_local_id":"block-315","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":308,"target_content_sha256":"c3914b1d68ec6d35600344c0372aa1a07fa4bf2870010de7544835287fb533d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2226,"target_line_start":2226,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2226,2226],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"75d911d2dd6af529decdada28856eb6f7770ea96f512dce29be503e8dc7594ab","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-316","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":316,"source_content_sha256":"6b4612f13dcfaf86605036dd4401d8331b6e2c3d07abcf4ed24358931d26fe80","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2199,"source_line_start":2198,"source_local_id":"block-316","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":309,"target_content_sha256":"3309c1a770061b68cd0f2580a26aeb4978f43106e4f75e5d32343527258fd05b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2229,"target_line_start":2228,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2228,2229],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"501c82282becdcd048ac04cc20c8abbdcfdf3fd06118ccd384a741b78a138439","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-317","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":317,"source_content_sha256":"78071a51f560ca5c7c7d57fff0952446c21aac8fffb89c69b80a0292ed031726","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2201,"source_line_start":2201,"source_local_id":"block-317","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":310,"target_content_sha256":"89c32d88cb631186a8dc1a0f882bdf6c47eb214623ade28c5e8ff8e80c9b7b3b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2231,"target_line_start":2231,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2231,2231],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e973b2cbb39797e051bf933387c388bbf2bedf5624409ade16f1d4abbd2ff642","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-318","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":318,"source_content_sha256":"869323cad4197610aca2617d044543e10fc3eb6bae248d90f07735931e7b281b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2232,"source_line_start":2203,"source_local_id":"block-318","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":311,"target_content_sha256":"f29358e94bd19285c9cf899f9886decec4fc6f046945b1c9acfa5ef505f4318e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2263,"target_line_start":2233,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2233,2263],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e94d2dae59ae6a277c57bf1abce32fb066c4fb1202ca7deb3a57b83975f1adee","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-319","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":319,"source_content_sha256":"7384aa6a71854ec4b5079526d477f7660477472b3d3fb01369cfd683a257a63a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2235,"source_line_start":2234,"source_local_id":"block-319","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":312,"target_content_sha256":"27459381ca8a636713ebf1c7a65886bf206189bafba8056273e401ec576a9f55","target_edition_id":"edition.r017.id-id.draft","target_line_end":2266,"target_line_start":2265,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2265,2266],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"acad2887c8e3e7adc1992dce9f4f64cd65f3b15cfe7a556a319072a1e9a32467","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-320","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":320,"source_content_sha256":"fffae15bd82e7e7819d21a36575ec369c8e10da3c38c72c149cf86eb3f0e61b8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2239,"source_line_start":2237,"source_local_id":"block-320","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":313,"target_content_sha256":"56b9c91984e4d048f9437ded5f7a04b4838624c41ef4097bb18b27abda13d081","target_edition_id":"edition.r017.id-id.draft","target_line_end":2270,"target_line_start":2268,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2268,2270],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d610b8d7488094b8c0c2205c6ff5baad266f1c89272af1bde66a90ab28096a7","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-321","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":321,"source_content_sha256":"974578540be7020ff82805aa7e75d73baabd3ab032031cb2760b9241faaa60fb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2242,"source_line_start":2241,"source_local_id":"block-321","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":314,"target_content_sha256":"0b584ec066f12c124d84307d897c8235f4bda6912dbc2c0e84ca0029842c411b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2273,"target_line_start":2272,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2272,2273],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bc11893d73fcffbdb719541386c04a84ef5a6009d7597cbbe758eaf1850b85f0","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-322","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":322,"source_content_sha256":"71c9683efbf862b7f03ecc4540362ddd5d0ed6b21b4c78a241345f455032f6be","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2249,"source_line_start":2244,"source_local_id":"block-322","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":315,"target_content_sha256":"91e1b197ff4fcb0b437d59189a9692f0828010717d386b4e8c2624f19268502a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2280,"target_line_start":2275,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2275,2280],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"96b6c30efbcf0966f12b7f8b5512f674ea0a390ed7962513ad3241f621c52619","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-323","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":323,"source_content_sha256":"31665ceb9525ef79d25b0e10505375f5bd8d4b64774fe02501c76257a70e68ec","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2259,"source_line_start":2251,"source_local_id":"block-323","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":316,"target_content_sha256":"77fe4940bae1508f469d1694057ff4686470f7ac84f2d5fd8b884e84195df1e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":2290,"target_line_start":2282,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2282,2290],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e5016fc52934b18e015370fb8b7b1d2ece60447040b383af3f151a750f116db8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-324","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":324,"source_content_sha256":"0c7d07d78dc0ee7f0e7c62c499309b5b43c8148359f8b641a4b367dc8ed07e70","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2261,"source_line_start":2261,"source_local_id":"block-324","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":317,"target_content_sha256":"0c7d07d78dc0ee7f0e7c62c499309b5b43c8148359f8b641a4b367dc8ed07e70","target_edition_id":"edition.r017.id-id.draft","target_line_end":2292,"target_line_start":2292,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2292,2292],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"153565fec567778e43e33d2d344da6476a4862c0c2e5fbc1fbef2cc119bcc02f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-325","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":325,"source_content_sha256":"d3e4ef2073a121342d6d52a9e132cd97d1476968efaf28d31a38dd442b9057bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2274,"source_line_start":2263,"source_local_id":"block-325","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":318,"target_content_sha256":"d3e4ef2073a121342d6d52a9e132cd97d1476968efaf28d31a38dd442b9057bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":2305,"target_line_start":2294,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2294,2305],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bebefbefd48afd4b8242a56f4882b512d09b81cf72510d243ec6c01985bfc36b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-326","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":326,"source_content_sha256":"4d0c0f0f6ce4e8eeedc2d9d94322e7f231d228bd1d4a72c437dfcbdd6911a8e1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2276,"source_line_start":2276,"source_local_id":"block-326","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":319,"target_content_sha256":"4d0c0f0f6ce4e8eeedc2d9d94322e7f231d228bd1d4a72c437dfcbdd6911a8e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2307,"target_line_start":2307,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2307,2307],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"01021e79b3d484b7d239338929ea66f53c64e804686bdd00eb16d8e9430d6871","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-327","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":327,"source_content_sha256":"9e352062ba60277b1553c9e9b2f4235d7704201be95d2207559d4ee87cd8c8ab","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2286,"source_line_start":2278,"source_local_id":"block-327","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":320,"target_content_sha256":"74f1758b3655acdd9bcbfde71c263905eaa598f85944cad99b4f0c1164e5595d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2317,"target_line_start":2309,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2309,2317],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52aac1dd2e0a1fa4856bda57d3846dfe35ddb204402ec8357eaee48631d25ae3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-328","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":328,"source_content_sha256":"ba3aff334b5565f3a457b2ca3ca7d98e5b3e2414fc29754ab99550c820aa4298","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2290,"source_line_start":2288,"source_local_id":"block-328","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":321,"target_content_sha256":"7a83159124c5e3c2cb91eaf553ce5d109aa9cc187ecc660e36046451bcb19180","target_edition_id":"edition.r017.id-id.draft","target_line_end":2321,"target_line_start":2319,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2319,2321],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df3de1edd98ad62f42071aaff592adbea8a5094ef30f4c8db9b5a3622e5e1813","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-329","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":329,"source_content_sha256":"1db96edf71f97815b4cdaaad93a5ac540777a7b53f2b2c7795d7ddccd3d8597e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2293,"source_line_start":2292,"source_local_id":"block-329","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":322,"target_content_sha256":"1db96edf71f97815b4cdaaad93a5ac540777a7b53f2b2c7795d7ddccd3d8597e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2324,"target_line_start":2323,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2323,2324],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"330614073266af8454dbec3682aa7c43ca190a6f654922805bba17b0ca13f453","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-330","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":330,"source_content_sha256":"91f8c6aaf7ddfe885aadbef2f00e4f4a3a1d8f87cd62363475d5e66f9dfc3b97","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2295,"source_line_start":2295,"source_local_id":"block-330","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":323,"target_content_sha256":"ffe92fde5b359900edc99462fd0b573198bb4ac1f6b894243b02fbdb776fde3a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2326,"target_line_start":2326,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2326,2326],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6f4e4f10b6c90598aae637ef6f685abe622159457a4777ecfd9078a471f1105f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-331","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":331,"source_content_sha256":"4dbc70f7d5ca14f96c30ed9bf9cf4ff2132d41e415d2666de96115fb35ab79e1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2298,"source_line_start":2297,"source_local_id":"block-331","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":324,"target_content_sha256":"d6c8fa7df58e094f371181e6d4c25ed53d3625252684a8a6ed09ce608942ba8b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2329,"target_line_start":2328,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2328,2329],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"990ed16da521644443444f9bd21a97d54cc219e7c9369f36afa159f7e5bcfa9d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-332","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":332,"source_content_sha256":"59cf524b6dffce90bed085e3a1a589fdf4f9b9063d83529767312152c9daf2f7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2300,"source_line_start":2300,"source_local_id":"block-332","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":325,"target_content_sha256":"c3ac5ebb9ba0536f4cee06133d307db5a8ab64bdda8428e842a5c5beb23aa849","target_edition_id":"edition.r017.id-id.draft","target_line_end":2331,"target_line_start":2331,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2331,2331],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ed2da94f0c78eef24f22e61971206f27ab60b26f18cd83038f505e56d96c7e1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-333","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":333,"source_content_sha256":"2b98f0300b4c75c926f03ef80f8bcc0cc81bdce6dbfd0506be2db9800b8fece3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2303,"source_line_start":2302,"source_local_id":"block-333","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":326,"target_content_sha256":"c2d3e4960bfd9404cfed6c5adc7a695f1c50456f54d99256e4ddecef99527aa4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2334,"target_line_start":2333,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2333,2334],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"485dfc3e285d4dc737e77b21eacaaab8ab5223445ef8e6e886b648f98eed27b7","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-334","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":334,"source_content_sha256":"a3bb3738ec51bf9831b642bc6ee00984146d2927eec63ffd1a64b00c64d08bf5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2305,"source_line_start":2305,"source_local_id":"block-334","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":327,"target_content_sha256":"839ac2e4b3ebf726ec269b4ca639ff9284c4e027afcde16e5916a8ea9b981866","target_edition_id":"edition.r017.id-id.draft","target_line_end":2336,"target_line_start":2336,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2336,2336],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64fe4aab864ef13b9c10c0587b3cc36e6731b4a613d928801bac2f17c1864e93","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-335","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":335,"source_content_sha256":"91a9123eb5885ece762eb4840e07b0461960e1fc477e4be0485a15cd04b06886","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2315,"source_line_start":2307,"source_local_id":"block-335","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":328,"target_content_sha256":"b7ba957ad74c5056840d8bb0a19ba394721a3a0a8cf42bce9f7c99857f58ab2d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2346,"target_line_start":2338,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2338,2346],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eadbcb97158fd2d1568b933979e8949324f1e10b697716e31c7dddb0f8f36f55","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-336","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":336,"source_content_sha256":"49ca933a66b3f275937bdea87eb4b686770bffe740ae0034061565f4e031b22f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2318,"source_line_start":2317,"source_local_id":"block-336","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":329,"target_content_sha256":"5eed1572736cff9b3826cc60696850f99420f8c75c2cc09c5c73c51bede7b27c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2349,"target_line_start":2348,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2348,2349],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0197eb91d23d0e10b2e6ce04abcb1c75266133d896fefd3425081457a3a922a5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-337","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":337,"source_content_sha256":"0c7d07d78dc0ee7f0e7c62c499309b5b43c8148359f8b641a4b367dc8ed07e70","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2320,"source_line_start":2320,"source_local_id":"block-337","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":330,"target_content_sha256":"0c7d07d78dc0ee7f0e7c62c499309b5b43c8148359f8b641a4b367dc8ed07e70","target_edition_id":"edition.r017.id-id.draft","target_line_end":2351,"target_line_start":2351,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2351,2351],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ef68e15c31721687ae4067b71b3cddc9a367b829e385a71fd994a8b4ae2250b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-338","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":338,"source_content_sha256":"6ba654d93125ed08028a8f37e5ff46c765a1d51cd6ee8d0c9fea80082081e70e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2333,"source_line_start":2322,"source_local_id":"block-338","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":331,"target_content_sha256":"6ba654d93125ed08028a8f37e5ff46c765a1d51cd6ee8d0c9fea80082081e70e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2364,"target_line_start":2353,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2353,2364],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5adbcc96dded57cdb0331d136d2a418a201370e0f792b301ddd690d194ad7690","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-339","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":339,"source_content_sha256":"4d0c0f0f6ce4e8eeedc2d9d94322e7f231d228bd1d4a72c437dfcbdd6911a8e1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2335,"source_line_start":2335,"source_local_id":"block-339","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":332,"target_content_sha256":"4d0c0f0f6ce4e8eeedc2d9d94322e7f231d228bd1d4a72c437dfcbdd6911a8e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2366,"target_line_start":2366,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2366,2366],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2161e38a9e85c21210a13046a1ac28b81833a96510ed1dec27e54a77bf1b126f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-340","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":340,"source_content_sha256":"458f10b2bbe126600188e6a2b738ade363d5bb91a1ce24873eaf0a9ed7011a1b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2345,"source_line_start":2337,"source_local_id":"block-340","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":333,"target_content_sha256":"a10b1e2f494c59e90a463b3e20039fa9a60f42b3b38e2a32eb193bc7c218be7d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2376,"target_line_start":2368,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2368,2376],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a9994d80d0bf63aca0bcf1d7c24d745f05971e34f66fe0f62a48562e96e93a3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-341","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":341,"source_content_sha256":"2ac7bedeae63b928be004a4b9f8ee0ad23f6ec2c42ddd875f28c1ec182c06528","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2349,"source_line_start":2347,"source_local_id":"block-341","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":334,"target_content_sha256":"9f7e903617d69796e55176dd50413690aee0670a3bdf8b937b1a0b397e995667","target_edition_id":"edition.r017.id-id.draft","target_line_end":2380,"target_line_start":2378,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2378,2380],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2935a11bdc6f1103aefc020e8e1bcbb8ecb9372b302b3ac709c47dc9c1188ae5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-342","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":342,"source_content_sha256":"c75e52c14f037bfea1c29d989f863b54ce7a1413189042f5f2213ba52a7abcf6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2353,"source_line_start":2351,"source_local_id":"block-342","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":335,"target_content_sha256":"f7ad4ec273809963e0c8ddf84cf8915027178f0f061fd06723f84e0d3a04cf5b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2384,"target_line_start":2382,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2382,2384],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"505af23915356017a1fdba7f51c88f3d2b7719ecc0e27f637731ca1c3c2e5c98","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-343","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":343,"source_content_sha256":"1db96edf71f97815b4cdaaad93a5ac540777a7b53f2b2c7795d7ddccd3d8597e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2356,"source_line_start":2355,"source_local_id":"block-343","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":336,"target_content_sha256":"1db96edf71f97815b4cdaaad93a5ac540777a7b53f2b2c7795d7ddccd3d8597e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2387,"target_line_start":2386,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2386,2387],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52b4582c6633c6f24bdee0a5d169fef4baf6c3fd7a1144bbd2bbad3e30c60d55","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-344","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":344,"source_content_sha256":"7f68e4ce2edf84dc688e68fed898fd8d1540a72b22cccc41254f94fbbe88395c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2358,"source_line_start":2358,"source_local_id":"block-344","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":337,"target_content_sha256":"4b04ca57779b7e1343253bbca7a357794c47f5e05b19f7e73e4c012cb00963fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":2389,"target_line_start":2389,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2389,2389],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"169f55b0e4da84296613c6eb107555616ac0613881cc46d29ff836c9af3b0598","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-345","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":345,"source_content_sha256":"b671cba0064a65b671f9cabf89a08f6c8ede178865ed1f6c687d68399958f669","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2360,"source_line_start":2360,"source_local_id":"block-345","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":338,"target_content_sha256":"8f5196425309891d14351adfd105457326310638e6c1264bcc084217140ed83a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2391,"target_line_start":2391,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2391,2391],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e3230640b1a02e4b221fb9b8594b6a375bf53595f82960cccb719f76147735b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-346","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":346,"source_content_sha256":"23839b6a22f68cdb485a0cdb8253756c36e06c50dd432cc3c294cff4e2af29b3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2362,"source_line_start":2362,"source_local_id":"block-346","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":339,"target_content_sha256":"09259b66e0af90741cf7def39d777ee163442c1c5c3d06af057afbc153ef2aa0","target_edition_id":"edition.r017.id-id.draft","target_line_end":2393,"target_line_start":2393,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2393,2393],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"59546c6b0ae55c339635f0b3309c1f97427c9054fd1218c6b7ec2c35c312bee8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-347","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":347,"source_content_sha256":"b7b50deaf53b97c478c4aa9207f2fbf3a6202eee2cf25986b62bab5e2bcaebd9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2364,"source_line_start":2364,"source_local_id":"block-347","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":340,"target_content_sha256":"8fbeaef6ab1ee792170277ccdd8a44bdbef3aee9e2eae9840f0533571aa55fbd","target_edition_id":"edition.r017.id-id.draft","target_line_end":2395,"target_line_start":2395,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2395,2395],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a875090ee1c15715c0a239c60e057726898d2ce9fe1df0253fa10f0bb251e67","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-348","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":348,"source_content_sha256":"b9c01b077a1516e0c19a138979fffdfedd62ffb75a15d4fe6de15a0750b96ee2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2366,"source_line_start":2366,"source_local_id":"block-348","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":341,"target_content_sha256":"191f9885eaa3a5459bc0a57ccffb075262f907dc3e72c0e7326f0eef9682f7a7","target_edition_id":"edition.r017.id-id.draft","target_line_end":2397,"target_line_start":2397,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2397,2397],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9274c12258152c2f1346db80ad3edaa980d1ae220860e48c0ccd12b859d7deb8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-349","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":349,"source_content_sha256":"3048b2c9a394e89fb497b8e6b9e99e597d083cb941c45f3b3229ef607ef37421","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2368,"source_line_start":2368,"source_local_id":"block-349","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":342,"target_content_sha256":"05477ead1d57f924cba7eca9b0052b9aa220098ea8e81ec0926f0087b59b9797","target_edition_id":"edition.r017.id-id.draft","target_line_end":2399,"target_line_start":2399,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2399,2399],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9752ab8248160dbe4e822cf327bc01a3f63ab75ecac34593c05fc62807e888e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-350","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":350,"source_content_sha256":"b4d490c559adb92137b3d5f41841c4098e0d9fdf98fee65ead7e366d7d3b09ba","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2374,"source_line_start":2370,"source_local_id":"block-350","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":343,"target_content_sha256":"e02fe367cde9f3690830a6b6ed6aae35854a22911d4d3ed563f705ae1651bd5a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2405,"target_line_start":2401,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2401,2405],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0d01d3878e1147ea207a35d06cb8e0d7b5512b751e992ff69ece5ef8fc5543a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-351","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":351,"source_content_sha256":"fbe2be93d21f662985c4b5ab160c990db9ed4037e0af6043c75b05d873c73626","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2376,"source_line_start":2376,"source_local_id":"block-351","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":344,"target_content_sha256":"1f88ea4ac36fa2d26529aa1ba6ea776182ad4f8800cadd514a30579c07eb4703","target_edition_id":"edition.r017.id-id.draft","target_line_end":2407,"target_line_start":2407,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2407,2407],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d390dbd26d0c9d84b51d46a9dc57a8a51616d5f4b8ecd1cb1aec02428b16213","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-352","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":352,"source_content_sha256":"06c78d24f4655c7668e1745bff2b90d9b23b7bd9f5d5865b5bb6de3df7d083c1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2379,"source_line_start":2378,"source_local_id":"block-352","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":345,"target_content_sha256":"5eab606766160f5340fefe13eec83128d588d41ad2874a603b52492dcc473611","target_edition_id":"edition.r017.id-id.draft","target_line_end":2410,"target_line_start":2409,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2409,2410],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"53a1ea4ec9111ef870bc9ff79d428453ca4c632bb4812e8ba70e8690287bb301","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-353","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":353,"source_content_sha256":"0f1aa6e80916818ba2349e38da38c663e580c799e640f1249996ba3a4ecc651e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2381,"source_line_start":2381,"source_local_id":"block-353","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":346,"target_content_sha256":"cd01cb219c794677cbb6c0acd8551975ec21134de7b9eefdd5b3072989c10fb1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2412,"target_line_start":2412,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2412,2412],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80235758952e15b45e4e183af07c10af93aa9ee0350c4791435fb92306edcf05","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-354","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":354,"source_content_sha256":"66f7375ba1e60af22350261f63b366787536217b13779408949e12afc4a41bac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2393,"source_line_start":2383,"source_local_id":"block-354","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":347,"target_content_sha256":"b168af8c1eebe23375fe95639fc13d7a580d007f3eba7d6d04944eab1f1d31ae","target_edition_id":"edition.r017.id-id.draft","target_line_end":2424,"target_line_start":2414,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2414,2424],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c6852122c9f8a5f0e7aa24dd51ecc6c39a62383cd94281c912cdea42c9bf7f76","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-355","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":355,"source_content_sha256":"6f867f21a14a08a801da34c088404aef269ce9ad478bcf48dd3746dfd48000d5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2405,"source_line_start":2395,"source_local_id":"block-355","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":348,"target_content_sha256":"6f867f21a14a08a801da34c088404aef269ce9ad478bcf48dd3746dfd48000d5","target_edition_id":"edition.r017.id-id.draft","target_line_end":2436,"target_line_start":2426,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2426,2436],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ff529a7acbe559477f977c769187d0c060b99e642e6827f6d837023c8c9c1c6","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-356","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":356,"source_content_sha256":"456fe69a91e80486759a186f5886fc68f8309d3ba769dc0df9ce31fe998cf250","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2417,"source_line_start":2407,"source_local_id":"block-356","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":349,"target_content_sha256":"456fe69a91e80486759a186f5886fc68f8309d3ba769dc0df9ce31fe998cf250","target_edition_id":"edition.r017.id-id.draft","target_line_end":2448,"target_line_start":2438,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2438,2448],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9b2689003fc5e0d40cdefe1af591c344402978844f887496275f9b63c49049dc","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-357","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":357,"source_content_sha256":"897fb107b622ba9bedc82ed7f17ca6a6800b85ed74e069d0bfb118fa1f599cbe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2441,"source_line_start":2419,"source_local_id":"block-357","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":350,"target_content_sha256":"897fb107b622ba9bedc82ed7f17ca6a6800b85ed74e069d0bfb118fa1f599cbe","target_edition_id":"edition.r017.id-id.draft","target_line_end":2472,"target_line_start":2450,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2450,2472],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b01ff5a99714c905583a8ba91efa57fd870500b024260e117cd981ba8aab4c0a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-358","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":358,"source_content_sha256":"ba09bc56cde20613bb71729cc60f757606b9eebd18ff865d1ce3b4efb3ab53e8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2463,"source_line_start":2443,"source_local_id":"block-358","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":351,"target_content_sha256":"ba09bc56cde20613bb71729cc60f757606b9eebd18ff865d1ce3b4efb3ab53e8","target_edition_id":"edition.r017.id-id.draft","target_line_end":2494,"target_line_start":2474,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2474,2494],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"69112f44edb34de6fdcf16c857fce03f312d312df1995b107504727045913fc1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-359","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":359,"source_content_sha256":"7c674faa49f19b3f87b04faca6c231e8a0a3a81e3f870f042e9fec164be71e57","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2465,"source_line_start":2465,"source_local_id":"block-359","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":352,"target_content_sha256":"8f6eb91f085cef8984cd1871ed27ed4aed8006649d4a20272ae7685c2b9ee230","target_edition_id":"edition.r017.id-id.draft","target_line_end":2496,"target_line_start":2496,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2496,2496],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"44877fdd8b5aa40749c04a168830c5877549f0777f8a0a85a5b77ab4113e1fa4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-360","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":360,"source_content_sha256":"a2afc2a8f7729192a60f3b5517190d9e3e2b799d0add7d5b8c909089b1806127","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2473,"source_line_start":2467,"source_local_id":"block-360","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":353,"target_content_sha256":"e5dc8469fb502a00e910b53d3873fbe24c3938c831ebacb746e5a7388f2340aa","target_edition_id":"edition.r017.id-id.draft","target_line_end":2504,"target_line_start":2498,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2498,2504],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"87441f8f2e4235bb043e1877c59feb50cb7902f72b28857cffa363370cdf1534","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-361","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":361,"source_content_sha256":"62e637117f9f2972a4e259d6929389676c500bdd54fa2204d0dca5f9821a883b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2477,"source_line_start":2475,"source_local_id":"block-361","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":354,"target_content_sha256":"3a984653eed078fea529e9aeab14055da3c1b94b4ec60785666909af8b2d25b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":2508,"target_line_start":2506,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2506,2508],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fea6af199d0a3e0ab2572cb80cd5ada7e79df66b4070700486922bdbe66559f4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-362","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":362,"source_content_sha256":"05858fa7c97f3b5b3d83af89e4347aebcb86ebfd16ff93b9792c337436205a61","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2481,"source_line_start":2479,"source_local_id":"block-362","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":355,"target_content_sha256":"ba2da5c857996eaac2870230f71bb5c39e845ddbfdddcfae0082321775bb9eaa","target_edition_id":"edition.r017.id-id.draft","target_line_end":2512,"target_line_start":2510,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2510,2512],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9908a1a6f403f191dfb1cc909a31f6fa3565f93bc53d4bea447686d14f4c1451","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-363","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":363,"source_content_sha256":"9bea239ad3450a1582676f4c0438dc77b0e2a6463836a911bdb039ce976a0bd8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2493,"source_line_start":2483,"source_local_id":"block-363","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":356,"target_content_sha256":"f7b2827f31ab22797e91f0af9af80a14703cc960f04eb790e64a3b8236652e2b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2524,"target_line_start":2514,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2514,2524],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1754a05e1d496b1693336f7aef20b2ebf5c41fb6b223ce36d4f1f2a960a44837","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-364","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":364,"source_content_sha256":"ebabb34d40ed00853201532dc443c5bc8f1649285d31b1d65d24592d7d1f92f1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2505,"source_line_start":2495,"source_local_id":"block-364","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":357,"target_content_sha256":"d4a7740e8b3803a11eeac064d170edd7f8a9bd48c94651d02adb36200c0ab335","target_edition_id":"edition.r017.id-id.draft","target_line_end":2536,"target_line_start":2526,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2526,2536],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8fe2a336602cbaa7ac84e0b9206b97b9f9863f14be79141da1c3209d9a682d7d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-365","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":365,"source_content_sha256":"7d1bd731217162d7c0ea4f61abeaf186ea5282ef5b1a16529691d8e6637201fe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2507,"source_line_start":2507,"source_local_id":"block-365","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":358,"target_content_sha256":"df2a26e78ed314e8aa55e58c31bfd1243ff9791b61a66061320590fc2a4d65c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2538,"target_line_start":2538,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2538,2538],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de6716acb043f47ce5a224706a0800755381029daa667b1d1d4670b216a76f04","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-366","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":366,"source_content_sha256":"16e1a8b71fe8b15e55ddd07ace81a2f7a6e32ad1e96fb3f8a25bbe60004b8171","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2509,"source_line_start":2509,"source_local_id":"block-366","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":359,"target_content_sha256":"3d92f07b3f53e1d9cc8c5e578533fc5f3cf6b2bf63d63cee4b9a52960e049d38","target_edition_id":"edition.r017.id-id.draft","target_line_end":2540,"target_line_start":2540,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2540,2540],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82a0d708a6e00d97706c2383ecd5f850dfa484cfc0d341fbfd3656bbd433d609","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-367","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":367,"source_content_sha256":"5a0a2c82a0cbd09e80a40c1eef6a6b6b57072fae3114924ed684dd29078ad10e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2513,"source_line_start":2511,"source_local_id":"block-367","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":360,"target_content_sha256":"737cd579b596a42ac6c26f0b1e7984b73a811bc8429f61cc8d66f114753bdd8a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2544,"target_line_start":2542,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2542,2544],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80fc68a2b1dd514aee47da1c008e9be1db60840b9a4e629c7a0649a8edda132f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-368","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":368,"source_content_sha256":"3921fb20f6e0a7408992c126a59298159c5400abbf59bc86264c8559bbf3314a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2523,"source_line_start":2515,"source_local_id":"block-368","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":361,"target_content_sha256":"8294aeb629174631ae025ec1391f4545e9900e7e7f0be43af0fc6b95315b09dc","target_edition_id":"edition.r017.id-id.draft","target_line_end":2554,"target_line_start":2546,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2546,2554],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"043621bc94abc65b6289d28f8767c59e26d7e194b97bb5f6a818a3dfefc8fdd8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-369","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":369,"source_content_sha256":"644433afbd8cd8f5b078c5a5d8e1cea401f48184792fe4ec9dbb1a8971af8295","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2526,"source_line_start":2525,"source_local_id":"block-369","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":362,"target_content_sha256":"27dd10067a9d7c09c028d2a80fba33c85fd90ee0f98310969292277662f827a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2557,"target_line_start":2556,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2556,2557],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7b0b8ac4e33cd0fa807d6b1d0b5e4e04511a9ef24ca8f9437d8c4a1a4bf6811e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-370","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":370,"source_content_sha256":"c7dfed4935136cfcc695118e195aa9bde2a0b85e1e7f80b7968dd3be98d04f4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2529,"source_line_start":2528,"source_local_id":"block-370","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":363,"target_content_sha256":"34ba0a0dc6100d1d304b535d31004271d9c3acfe0cd64edd1af79d23f227ee1a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2560,"target_line_start":2559,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2559,2560],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b426af0638e4aec2574a37bdbf8ecc702dd62fc0d4460fe004918acfb72361c0","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-371","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":371,"source_content_sha256":"215dbf197d5c362a7ff0472a24e2a8de85fa00ced79350e275a09715cfded4e1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2537,"source_line_start":2531,"source_local_id":"block-371","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":364,"target_content_sha256":"215dbf197d5c362a7ff0472a24e2a8de85fa00ced79350e275a09715cfded4e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2568,"target_line_start":2562,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2562,2568],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b3bb795e41e091533e457772f52b8c6929d15066d355fd602c0fdc743f13c814","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-372","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":372,"source_content_sha256":"9eee5e64416b8ca779a2418064d204b68af207d95b4d9775a07c1ff9651cb23e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2562,"source_line_start":2539,"source_local_id":"block-372","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":365,"target_content_sha256":"f63f2cb84a12be87ee93202150e9c3d01c91c70f3070a3a7ad84602ad83dc92f","target_edition_id":"edition.r017.id-id.draft","target_line_end":2593,"target_line_start":2570,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2570,2593],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"77388d697d3582ec54ef49270ab647de65433e0bbc7d33d80760f45c6926aa32","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-373","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":373,"source_content_sha256":"041411b08e22529e22f664839fffe87489bf0469e2aaf9d3faecf2bed215eb95","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2564,"source_line_start":2564,"source_local_id":"block-373","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":366,"target_content_sha256":"6359574f049b5151e1bd3d402c0f48d0fddb55af312c693ccbd0185ef16f3616","target_edition_id":"edition.r017.id-id.draft","target_line_end":2595,"target_line_start":2595,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2595,2595],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2d7508ac998db8d24d9919700d36a1e3d5ea3a04b05e6b253561d28d72ffbd94","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-374","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":374,"source_content_sha256":"63ccb411f0177359bf032858e0cebeef3843e1a3d25d86f5d7c22bc908dcc0a6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2568,"source_line_start":2566,"source_local_id":"block-374","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":367,"target_content_sha256":"452a9a217369aabb0d9dfaf9cc74a076cec63e4f0e50ace714a3b12a3c58eff1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2599,"target_line_start":2597,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2597,2599],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"40cee0613b135303445a7e2afaff3eafc8f40a53e8528b0ace6b52342625cae3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-375","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":375,"source_content_sha256":"39720b3cf650f14a1e803b76d604b3c0c0dc500f8e4fec2409c047c0b9317dbc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2572,"source_line_start":2570,"source_local_id":"block-375","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":368,"target_content_sha256":"9de715260da4d511c53d1413edfc34032890c78659545313e8919f1ea6b99b77","target_edition_id":"edition.r017.id-id.draft","target_line_end":2603,"target_line_start":2601,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2601,2603],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b6ab39adbac051d8dfac41fc0a5e5086b684e6a3ede2fd9ae90f7ca20ef46811","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-376","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":376,"source_content_sha256":"5b9c2cfe8d1fdd9131f7836abfd697a983df2b0cb104a3199272ce8f0f86e63b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2578,"source_line_start":2574,"source_local_id":"block-376","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":369,"target_content_sha256":"0fe964aef5347cf45479c0527638ef9f089ed5f2edd7b438a71ec245f65f60f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":2609,"target_line_start":2605,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2605,2609],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"190420a3d80614841045db726ab4791ead8d1854701e277b2e42924ff68d4f51","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-377","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":377,"source_content_sha256":"c7b3f121f54f2360706b81ea46f2046f83550f1ce9c67a1d52e8ddf54a2824bc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2580,"source_line_start":2580,"source_local_id":"block-377","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":370,"target_content_sha256":"c6f00f535d807dc87a59c3ec7c9565fc77d4d7b968f03579399a503eefec54ae","target_edition_id":"edition.r017.id-id.draft","target_line_end":2611,"target_line_start":2611,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2611,2611],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c393a793f0af241c5b7c625c5e75805ab8d7778fb70f02f2c618893a4a8a93f2","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-378","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":378,"source_content_sha256":"1ddab21d945674a6616ca4520b346ebdda953d1d1d43627ed55a45aad7665d52","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2582,"source_line_start":2582,"source_local_id":"block-378","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":371,"target_content_sha256":"68d2b79afaef033d0a4791d5aa89ed42d3f2ea1b67279e35f2d468c628f70ed1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2613,"target_line_start":2613,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2613,2613],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"647196c652b6a9b64f4949f3e8d7d2c8b31a9085ac9e3b5cd3cef2cf182de670","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-379","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":379,"source_content_sha256":"5d73c4573abaeaaf4738376611a068df0325ae111bc66fc7cef429ef87675d1d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2584,"source_line_start":2584,"source_local_id":"block-379","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":372,"target_content_sha256":"f8f4b9b4175f68cafe55cfb9cf5fa56ddfbaa3886840753652fd284378209404","target_edition_id":"edition.r017.id-id.draft","target_line_end":2615,"target_line_start":2615,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2615,2615],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5cb4e12dd40ac68ab581bec93c79c1319ae32264e55a64e46536a3f3b51c930c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-380","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":380,"source_content_sha256":"9b15ef14340540848b4e64e4978d5a7e75619dc73ef22f64a99a9b17c8b1b47f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2588,"source_line_start":2586,"source_local_id":"block-380","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":373,"target_content_sha256":"1b0eb38a24ad3c4fdeea46785e2e77664047e19e6c02cbeb5773567389cc54f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":2619,"target_line_start":2617,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2617,2619],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20f3d83fd9a4a0a33b1f1509d8931fc9a233b370b4de443d692dd9864bf91e78","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-381","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":381,"source_content_sha256":"a6c18cd910118035e9ea010f2ee79c798b3efbc009700c989db4ce6c1d1e71cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2590,"source_line_start":2590,"source_local_id":"block-381","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":374,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":2621,"target_line_start":2621,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2621,2621],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ef81feef392c4881a16fcb3d60654740534a54061f0544eddf5c32505e5c6a6","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-382","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":382,"source_content_sha256":"32e865f1ad874431158d6133df8f8484ec50fe6ab02c2eb111785119e2e55c94","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2611,"source_line_start":2592,"source_local_id":"block-382","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":375,"target_content_sha256":"e9ca9d970d22b1345f689beba506f32e2851259a2b3aaeb923060caaf37596fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":2642,"target_line_start":2623,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2623,2642],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f8f3c22291a47f42ca1d325b1fe23826cda37b69173e8e35c3760881d6f76f25","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-383","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":383,"source_content_sha256":"ab5db44fd68c041a2a6b479026f3e3199fb8ddd0a49fe557cccdd2c7004433eb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2615,"source_line_start":2613,"source_local_id":"block-383","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":376,"target_content_sha256":"bf8dfd6773783da5e91ba4a4669420c65cd604f900f1510d730097c320542372","target_edition_id":"edition.r017.id-id.draft","target_line_end":2646,"target_line_start":2644,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2644,2646],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d0d5c6fc6f50c9036cd60272c7525b79fafe40995abe766dc2606df75f5f96c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-384","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":384,"source_content_sha256":"ce503f48d97ff7110e7d0ee9cedc3129bf9aa84cf035c5e5474177324c5e89a2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2627,"source_line_start":2617,"source_local_id":"block-384","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":377,"target_content_sha256":"3548e4e880f3139b225b0241affb28cdb9e07bfa18a462402161b930d4dda0e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2658,"target_line_start":2648,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2648,2658],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9caeb5645d5b5c97d37722da8b47df21ed21802eb42f1781c1016378d5a98b67","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-385","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":385,"source_content_sha256":"4ffbf8e154daedafb8462cb9e2813ae656ee8ca901f1e7d09862c5b59def0a9f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2631,"source_line_start":2629,"source_local_id":"block-385","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":378,"target_content_sha256":"e15e7d860c12063645528bd43641260663a5bc0e1952966a4c06b4971cd59051","target_edition_id":"edition.r017.id-id.draft","target_line_end":2662,"target_line_start":2660,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2660,2662],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"42a79d00fd230b693ef6789afca68af9ca57fa97fac4fc40be9b9dda56636d1d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-386","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":386,"source_content_sha256":"990c4d367d1fe4d7767f868f4bf6a2345254773fa97b6f570f10a027dbc6c8a0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2643,"source_line_start":2633,"source_local_id":"block-386","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":379,"target_content_sha256":"a94a5891045ef512aead524bde1e142a9de46ecaa10a6c7acc97e7d1c4a1a5c9","target_edition_id":"edition.r017.id-id.draft","target_line_end":2674,"target_line_start":2664,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2664,2674],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bdbab9e519eb89e6f44a40788bfde37ac7c9adb1b6103435161868453e22f207","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-387","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":387,"source_content_sha256":"a081e87bdede93864fd9a0724d198bdadaf745245a8198efcc3cff30eaf1e7d6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2647,"source_line_start":2645,"source_local_id":"block-387","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":380,"target_content_sha256":"11295895223588e9246a0a3fbe330ba18911f45efb16d2f44a0a416494ec3cb1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2678,"target_line_start":2676,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2676,2678],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"47a9397e5b61ff53acd2d2a28c1042ffa205b44818ade48819e8a9e2b9ca1f78","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-388","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":388,"source_content_sha256":"b3cba440e624824a2cddde8b57828864f228db3481f10684a1679ccd79f99751","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2659,"source_line_start":2649,"source_local_id":"block-388","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":381,"target_content_sha256":"8708514597f473895337e2d9e0ba966b82b45e6caa7b3ab0ed2e4ed0dba58c39","target_edition_id":"edition.r017.id-id.draft","target_line_end":2690,"target_line_start":2680,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2680,2690],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"705378b2a7784b07accc47a07f05d520ceeb17df6d304577e6e7c71b05d1307b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-389","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":389,"source_content_sha256":"2ed56492985d7b6569ed5a0afbe316a3fd112b6626b3828a23c7de536d95f8b8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2663,"source_line_start":2661,"source_local_id":"block-389","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":382,"target_content_sha256":"91e3cc38c740d299e8bcbd5f76f98b6ea9bb1428af25db8ee10fbd7d9ae7ea66","target_edition_id":"edition.r017.id-id.draft","target_line_end":2694,"target_line_start":2692,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2692,2694],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9412ba7a4a1c3331fa0f0d82ded6f4d2e691cc2a339a5cc240753280ced93626","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-390","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":390,"source_content_sha256":"dec6581c3f050f4a689cbb079d896e188349fee9081701a5a6b21ef94210fd8a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2675,"source_line_start":2665,"source_local_id":"block-390","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":383,"target_content_sha256":"1f6be5031c715829dab41fc5c93990ac2778922ba7291bc5fbab619defcfcf6a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2706,"target_line_start":2696,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2696,2706],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"11c4dd21ae2f82a970428214706c2b0efe1d94ebb272089725053102f1dbe52e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-391","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":391,"source_content_sha256":"eff615276ea60b7d7ac62204e5ce00bcb39aa4380a2c3acf1a9bad229a78e0ab","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2679,"source_line_start":2677,"source_local_id":"block-391","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":384,"target_content_sha256":"84a29e21a677dd2829606283121be675789e3c7a5abb5b5620fb39de6079394c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2710,"target_line_start":2708,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2708,2710],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e233499bc06094642d9947026d3acaf21d4d8777cd9fe1d1eec480d9fe0c88cd","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-392","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":392,"source_content_sha256":"87713a3da1bb9131eec8482aa0afbc36d4ef8db7b2285de008744e0e1beedfeb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2691,"source_line_start":2681,"source_local_id":"block-392","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":385,"target_content_sha256":"6873b63bb35be1fcb9474d3004a854817ad7776a6b83acfe820c4181d4de0e72","target_edition_id":"edition.r017.id-id.draft","target_line_end":2722,"target_line_start":2712,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2712,2722],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"91337fc9a29ea8f54d73374693378c66b6d7fea0b0f59de08772ead52d163fd8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-393","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":393,"source_content_sha256":"befe6892ec44e33f7b364305fbcec8fa778e09b9cb39adc300c1dd14bcf212c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2693,"source_line_start":2693,"source_local_id":"block-393","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":386,"target_content_sha256":"e3f87b06f7a641556fe14f6828c82cf2c975b6a9ee5826c46c7cbd0d343ca7a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":2724,"target_line_start":2724,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2724,2724],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e02677778723cfd2e057360f3c3978c6abe188f42f94fe99e83dbc9ffe4e25cd","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-394","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":394,"source_content_sha256":"f0f7d56d3239f1e90f4c1014ad6b905dd3c5c58da34decfd2b31f2001aa4d65f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2698,"source_line_start":2695,"source_local_id":"block-394","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":387,"target_content_sha256":"22d38b4374e49064bd919928ae00f12ff3753603814920464c8a8d86d2151af5","target_edition_id":"edition.r017.id-id.draft","target_line_end":2729,"target_line_start":2726,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2726,2729],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1226eb4f00ee70a8a86de3140abca71280555380cbecfeebf2990fe3f8f32fd2","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-395","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":395,"source_content_sha256":"d89843b11de4ee7dde395d9d109cf5b46b6cbd325b92767a92d53e22d706b816","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2709,"source_line_start":2700,"source_local_id":"block-395","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":388,"target_content_sha256":"354ebbd61994393080fbfef541fa3f53883de984d843130075831e7f8958d5f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2740,"target_line_start":2731,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2731,2740],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c4ff6747809247d97b31572bfd248fdb4923d16599c42c03e9190ed799db33c8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-396","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":396,"source_content_sha256":"73abc34a6e1c34850c035bb06c637f760c6247172e5230e806b448c0a2db2742","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2719,"source_line_start":2711,"source_local_id":"block-396","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":389,"target_content_sha256":"aab225c503da59d15cf50e8ab2ee59401dfb91c99873101567f2e715e48a8061","target_edition_id":"edition.r017.id-id.draft","target_line_end":2750,"target_line_start":2742,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2742,2750],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c819035ea522bdfbcc8663d8a07a4c4aa10e4ddce7a3ad60eb49346ad66a2a6","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-397","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":397,"source_content_sha256":"8ae646c26f3dea216bf98291e91835922aba5253237693294e11d6e17a5ac470","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2733,"source_line_start":2721,"source_local_id":"block-397","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":390,"target_content_sha256":"4c741fce75bf7a7db627c197e6e58f27b00fbe919ea625db1c32eb56b6e30e27","target_edition_id":"edition.r017.id-id.draft","target_line_end":2764,"target_line_start":2752,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2752,2764],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ab739dc6ac2fcc27814402ad03a7fbac396548342b44914e20174d01b1f02b3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-398","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":398,"source_content_sha256":"9c785803e49b6bfaa4321a038df5f3bbf7acea0ddcf710927818a06e4ba14028","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2747,"source_line_start":2735,"source_local_id":"block-398","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":391,"target_content_sha256":"187f0d92c6b5139d72a454bfe2641502a248c44da98e35cfdbb089a796ab7ebf","target_edition_id":"edition.r017.id-id.draft","target_line_end":2778,"target_line_start":2766,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2766,2778],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3cbfe8fde0ea1c78777747d0b6981e142959c4536640dcb23d64a5f55da77bd8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-399","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":399,"source_content_sha256":"d3bfc34bb63b21f77c0bffcea70bfa484df73b2240f0c97420d71a8eaedc8d49","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2761,"source_line_start":2749,"source_local_id":"block-399","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":392,"target_content_sha256":"27884359c07ed46e10bcb7f09c7b9d2a51b74c6fbe8be41480428702032d1617","target_edition_id":"edition.r017.id-id.draft","target_line_end":2792,"target_line_start":2780,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2780,2792],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a7c25c85c5fa49c93f44428ce0d2333bec7433e69a94f33ebb12c510f4cf3a90","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-400","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":400,"source_content_sha256":"6bd0b054cc683619845fae25557eda5fce02ddefb7fc09c6657dff71316e12d0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2776,"source_line_start":2763,"source_local_id":"block-400","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":393,"target_content_sha256":"dcd6356a6a176837a79f142c8d179c1e5a968f6180cbbbcb4eda9011e6480cb0","target_edition_id":"edition.r017.id-id.draft","target_line_end":2807,"target_line_start":2794,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2794,2807],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e100b96a602f742a6e8b7e2e3488f9c207a597cbb882b948d22a6fd293cbe2a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-401","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":401,"source_content_sha256":"acb0019b9b673ec4af8a3daf6fa4fbeaed1a44dfd98078d8c4e4cbba81af9e06","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2790,"source_line_start":2778,"source_local_id":"block-401","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":394,"target_content_sha256":"61785f1e94907f0a352e24530ed0f87d50787a42344e4e9c9d7e0003024330dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":2821,"target_line_start":2809,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2809,2821],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92765964cc1cc15986b1905f215a44498b07425cdcef9821120da5154b39e7f3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-402","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":402,"source_content_sha256":"01903a46c11238419bc9e6d0e1659c680868eb7fcaced2663b93e0997236675d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2804,"source_line_start":2792,"source_local_id":"block-402","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":395,"target_content_sha256":"de18baacdf8176cded718a3b48ff38947b1ed11434f6fdc71f5ae43db450ca43","target_edition_id":"edition.r017.id-id.draft","target_line_end":2835,"target_line_start":2823,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2823,2835],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5a9436754c6e08923a03ec3f0b277d961eecc62af248c34efcbe477257e7390e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-403","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":403,"source_content_sha256":"c8e278add1d6c18f659152466edf4e82568ebad5aaddedeaeb2d654335866d4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2806,"source_line_start":2806,"source_local_id":"block-403","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":396,"target_content_sha256":"5a7c51fe019c052d866e25f75541baf5ff511cb9d0d48737b288dcbb3fd56de0","target_edition_id":"edition.r017.id-id.draft","target_line_end":2837,"target_line_start":2837,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2837,2837],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb57aff71a169ed3bcbc30e416fe3f2fc3e1fe2c79a2e8a7dcf6e8412eb993bf","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-404","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":404,"source_content_sha256":"0a29722d304bcec4e0efdd2be093949c444334e52152ddab5f3ead0ad59762af","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2818,"source_line_start":2808,"source_local_id":"block-404","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":397,"target_content_sha256":"c992b9acaf98e9ada17bb0e706fa443d424207b7f96023b02c1ca62b2145eaea","target_edition_id":"edition.r017.id-id.draft","target_line_end":2849,"target_line_start":2839,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2839,2849],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9688787dcf24212f294da8d1802c9c61dbbbefa39b9f5a3ae4d188cedb265e7a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-405","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":405,"source_content_sha256":"a0d222798bf9abcab1b4fbb643dba000edfe210fe7da431009032c78cc763ee4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2827,"source_line_start":2820,"source_local_id":"block-405","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":398,"target_content_sha256":"a871aba210d0d19e5b779c99c75f17befa6d3bc95824dddfc1bcefe4d2a09a58","target_edition_id":"edition.r017.id-id.draft","target_line_end":2858,"target_line_start":2851,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2851,2858],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d0b9cb23ede88e87d1863c37e6e9a81d0b27cbaf1d4075b7ff9f23db4b313b53","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-406","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":406,"source_content_sha256":"f0e27447d5e6dbd0bfa7bdbc7935510d2c0bf28d05f4dd30e64c8dcd09d0219f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2841,"source_line_start":2829,"source_local_id":"block-406","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":399,"target_content_sha256":"ac996763e401820113a561708f271c2c97497bf1cf9db45c8b5bd7a180faa52f","target_edition_id":"edition.r017.id-id.draft","target_line_end":2872,"target_line_start":2860,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2860,2872],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed13fecbfe691d54c3dfd216a1ef80254e464f4ee0a93b479ba1f192cfe929e1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-407","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":407,"source_content_sha256":"366b440fc2199ea32aa354815867fabee1b75504674af78cd35cf882c6918a4e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2845,"source_line_start":2843,"source_local_id":"block-407","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":400,"target_content_sha256":"122b0f8dd1a669df1f6d05b80a95e24f86c3ac37e17eb887b52c9e5c57e3bab4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2876,"target_line_start":2874,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2874,2876],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c470df7cbd9717b33c34a8cf9b5b80e7276f8d3eef2dfce58e253b914738aa4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-408","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":408,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2847,"source_line_start":2847,"source_local_id":"block-408","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":401,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":2878,"target_line_start":2878,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2878,2878],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8080028b83a4576c449816b92e440805f3e6d4cfeb338a36b173883db57ad8c3","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-409","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":409,"source_content_sha256":"c6e1342bfbda06320961ea87020efdb1a2fb4dbe20968087c549bb2e1ff5b37f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2850,"source_line_start":2849,"source_local_id":"block-409","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":402,"target_content_sha256":"a71061b88e21b87000964bdcccf84acdc67dbc55ea3fd55e771cd94d98ff7bb9","target_edition_id":"edition.r017.id-id.draft","target_line_end":2881,"target_line_start":2880,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2880,2881],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a6871de3b73a5d4e11927f83369e222517c6d70cf6a1e92a9331fb5c7792d49","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-410","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":410,"source_content_sha256":"e67c2c52149e544dfff793ce7a5dc49147070d58f12556c77fee70756109e3ec","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2855,"source_line_start":2852,"source_local_id":"block-410","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":403,"target_content_sha256":"71437bd7395519a5c18725eabc58b8f1f18c98da24fec6f6d0569fc0a7d23cf6","target_edition_id":"edition.r017.id-id.draft","target_line_end":2886,"target_line_start":2883,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2883,2886],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a52d3450c84a90ae1889e04686773819f121ddd41f6a21949ae27837b5de925d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-411","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":411,"source_content_sha256":"e294f0b948faf5aa6532b1f2a63c189f3e51afd042e30e856173679b60650984","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2863,"source_line_start":2857,"source_local_id":"block-411","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":404,"target_content_sha256":"77dfe20433c20c04f4705085e589312215bbb654f8963088163f0599e451ffa1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2894,"target_line_start":2888,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2888,2894],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a930436a397d2b6ceec78ab4409eedd658fc04c76f35ac31236631d79c6f9cb5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-412","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":412,"source_content_sha256":"da75ff00c085ce40ffd7e32ce697ca351ed62b5e70e39606dfdd1413cbabdd0b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2883,"source_line_start":2865,"source_local_id":"block-412","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":405,"target_content_sha256":"b1e8b918c759c7e5917cd82c951bdb131174356dbcee2c63063fc4901dd1662e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2914,"target_line_start":2896,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2896,2914],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4115aeb01dba2d3d29c15e2aa5958afcc6dcddfa3b9a987e08ee5bbf2b071552","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-413","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":413,"source_content_sha256":"4be7db13a50a6cf69022429255b203425a63979cca3cb7d03e8476641e361703","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2885,"source_line_start":2885,"source_local_id":"block-413","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":406,"target_content_sha256":"7c4176f9ca89c18c50f3aacc3b3a978ec2d874e6385a52e4b13e5c4d0a343459","target_edition_id":"edition.r017.id-id.draft","target_line_end":2916,"target_line_start":2916,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2916,2916],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3d1f0ce5d370722057a7f6dc9eda36151f4e9cc3fefd73e6ecda79f0d1e4a500","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-414","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":414,"source_content_sha256":"11dac7cdc03d5c9594d095b667dd31cd309695fcbf47d0e682704c8f7a6fdb3e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2905,"source_line_start":2887,"source_local_id":"block-414","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":407,"target_content_sha256":"f9d4dd5c9007fef0004556b0e64c945d08efef56ec4acc9fb7b3d85dab74b800","target_edition_id":"edition.r017.id-id.draft","target_line_end":2936,"target_line_start":2918,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2918,2936],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"42f5c88d34c94b49cbae682e4df63bbd16ab60c45c8e4d6303ef88db8a000abd","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-415","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":415,"source_content_sha256":"070c82f595a58c404017d08d60ef7ee4b27c5877e128e391ddb9e2145cbe6910","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2907,"source_line_start":2907,"source_local_id":"block-415","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":408,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2938,"target_line_start":2938,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2938,2938],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a4bf088d610aa4c35af08c947471634b34fb8e56b3883723760f86145972f6f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-416","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":416,"source_content_sha256":"29068319cd05056cfcf82b71ff0a6e4fa2741443a53f488d249c1645ef14c487","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2909,"source_line_start":2909,"source_local_id":"block-416","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":409,"target_content_sha256":"1ed65e442676cd51a5d1d62fe63a5798674a5fc1e6e7691b4ad934e4b7f3fa24","target_edition_id":"edition.r017.id-id.draft","target_line_end":2940,"target_line_start":2940,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2940,2940],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b5c9b8cd84f70a9c9ec19d00ba8ba85468493ceb4f86069c9583a57322a858b8","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-417","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":417,"source_content_sha256":"11acb798de2341c158d09e43c8a44e9aab5e09163bff672f1af6c27af31f199b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2914,"source_line_start":2911,"source_local_id":"block-417","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":410,"target_content_sha256":"12fd0d9cb74aab4d372a297ef26e5bdd6fc2d54c580bae3a92a86b0c739e28b5","target_edition_id":"edition.r017.id-id.draft","target_line_end":2945,"target_line_start":2942,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2942,2945],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5133119e5143f5e3d48e1dfcfa87474153f612ece287fc7f0fe0d1b881fcac26","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-418","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":418,"source_content_sha256":"276e15a73a2ac4efc9bf88abb6de94a61d2c0b208ccffe192681472a0007e0dc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2919,"source_line_start":2916,"source_local_id":"block-418","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":411,"target_content_sha256":"d9d62ac21e70132467516ff2b1439a3d64b54a957c2469276cb30897195421da","target_edition_id":"edition.r017.id-id.draft","target_line_end":2950,"target_line_start":2947,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2947,2950],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a0861d66db9eb04c4eef6ce4bab991ecab80ee83484034b9a31bd8c8b194204a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-419","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":419,"source_content_sha256":"58e4b54ff8fc31dc1fd267bccdd4b0298767a49ea4c338473f289c7dfdb31a5e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2924,"source_line_start":2921,"source_local_id":"block-419","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":412,"target_content_sha256":"9ea0ecd1f74bf448fbb9ccca01b15c2d0c28a0646214c3fa18222d046f028a29","target_edition_id":"edition.r017.id-id.draft","target_line_end":2955,"target_line_start":2952,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2952,2955],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce7efd6f3bc1948874c09b695862693b691559f0db24466f7dbb7541f25ee8d9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-420","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":420,"source_content_sha256":"6f44a55a21b6cda20b005dd755c1dc88da14a0b63b2ca40f18239d4f1db9f4ae","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2926,"source_line_start":2926,"source_local_id":"block-420","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":413,"target_content_sha256":"8315ce89907317e46c775f7d6a6bef7427e38d117450a9f7f08c5107e004fa97","target_edition_id":"edition.r017.id-id.draft","target_line_end":2957,"target_line_start":2957,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2957,2957],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef3d4eee6e3654474c62e6b9a31cd755f41566d519a434cb0a18b6c46c4294a0","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-421","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":421,"source_content_sha256":"11676e4c4549785404b9bcab52689fd8a274d4bb12a4d551b54251c1d9819bed","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2939,"source_line_start":2928,"source_local_id":"block-421","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":414,"target_content_sha256":"6413e94ce95d589d5c3769ccb6108804ea72174f824e5add32f6e8d05b115292","target_edition_id":"edition.r017.id-id.draft","target_line_end":2970,"target_line_start":2959,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2959,2970],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4784d8e5996e14d708d51ef8f093b09ea820b38f92cfdd721a96628fffbdf106","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-422","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":422,"source_content_sha256":"d255d0851339f85cecc7d761457183272e930e26c7fab0df8bd7da0175a2fb30","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2941,"source_line_start":2941,"source_local_id":"block-422","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":415,"target_content_sha256":"4a586fafdb6d38e10efa91af931649f390ff747fcc6e03537ec0745f12134a5a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2972,"target_line_start":2972,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2972,2972],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"590f5488e96154a23024b58c86fe32bb9e166523718a8c5350eeddcc593cc96d","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-423","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":423,"source_content_sha256":"afd96917ff7730da60dcb2a8fa70d5b92439ddd6398f95bcaae320d0f5f8a961","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2946,"source_line_start":2943,"source_local_id":"block-423","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":416,"target_content_sha256":"ca44b8dabe1df021161916a7a7aca6fb0517a6bcb9cda038c7452ffe2b1875d0","target_edition_id":"edition.r017.id-id.draft","target_line_end":2977,"target_line_start":2974,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2974,2977],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f8aebc019c0a3ea3b9f35ca9de82224742ff019003231e782bfa28b9a95ee881","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-424","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":424,"source_content_sha256":"9a7c18884f4d8509c3d6861dc578e890b4a870cf6a434d52a5dd2852965adac6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2951,"source_line_start":2948,"source_local_id":"block-424","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":417,"target_content_sha256":"d46f9da53e9ffac16ade5480a7de7bc7ff92efa099f9e7b5e8bb1dec21d9110b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2982,"target_line_start":2979,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2979,2982],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"abf6383ffb6fab237d47021e656f18ac4308e555e76f53d32cd7414cb725f0b9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-425","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":425,"source_content_sha256":"7a681a943ffaaedb6eb2fcd61d80bd9e0b9a7855c4fde1e355d29d831cfcc81d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2953,"source_line_start":2953,"source_local_id":"block-425","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":418,"target_content_sha256":"17723d011a3b739cc7a9520387405771cec53ef69286f211d958b692c49f9c46","target_edition_id":"edition.r017.id-id.draft","target_line_end":2984,"target_line_start":2984,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2984,2984],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e069715b9b8436c7ab35e291c6ca4aeabefc1dc136d7611e451bd7ad6acefe5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-426","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":426,"source_content_sha256":"8d0b16bad66ad99fcd8cedd59bd84e3378fa35315453e17af0255cd525c39697","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2966,"source_line_start":2955,"source_local_id":"block-426","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":419,"target_content_sha256":"3239f79c57e963492b7843fdac81b37c816097ed33d2b339100d5a97aa56d2c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2997,"target_line_start":2986,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2986,2997],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8553cf5ce33613c943f5431f83a491373f984f4f31cb127c0c475bca4120a22f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-427","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":427,"source_content_sha256":"538e7272dbdb597ba523a9c943479b40a88d1240cd2f204fea38b3b4652ab658","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2969,"source_line_start":2968,"source_local_id":"block-427","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":420,"target_content_sha256":"4d510582673ea420730225a425cb8002990a0707db8114c658a5b32fec26c3e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":3000,"target_line_start":2999,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[2999,3000],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fdb31288602a3bb63e00f6da5ed8f0782f89a67707dd39b0f5b121155a1441d6","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-428","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":428,"source_content_sha256":"f8025e5c8cc2623df239dd968ef773643a1dc95cf764f0f896bd9a7a5828fe71","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2980,"source_line_start":2971,"source_local_id":"block-428","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":421,"target_content_sha256":"09e6b710ddd36a8157100ad9987da698c39a75da37a1bc3620e502d7606ca333","target_edition_id":"edition.r017.id-id.draft","target_line_end":3011,"target_line_start":3002,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3002,3011],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"977d09130f0a723ebbb4505ede2c2597a5442c41a1e481ce1b8beed98d52b2e9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-429","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":429,"source_content_sha256":"de560d9297e1adcc11498435ee30b2fde98ea56a081feb862247266e97c6549d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2982,"source_line_start":2982,"source_local_id":"block-429","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":422,"target_content_sha256":"8be4112af2e298e62d1c1bae814dd26690a4d1d92a973996b54147e037be9603","target_edition_id":"edition.r017.id-id.draft","target_line_end":3013,"target_line_start":3013,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3013,3013],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b1b8c6dd74261c3271e69309d43e00b92a2466d3ff490cde11d9e9d57c065bb1","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-430","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":430,"source_content_sha256":"2a094b3790ccb3007abcefb3ef604176893569868756543045131c907ff7d631","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2993,"source_line_start":2984,"source_local_id":"block-430","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":423,"target_content_sha256":"d21c7cf6c25bea0a76ed14887537d05ac502b66af0e32b8f37c87c7deada8e16","target_edition_id":"edition.r017.id-id.draft","target_line_end":3024,"target_line_start":3015,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3015,3024],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"356285ba8419396d587ef6eade1bdbccfd2f7bfbb711df1d94e7a50329f67712","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-431","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":431,"source_content_sha256":"2b103616af73b6df9c0a04af8c70a2a11da8e312bf1dbe5997d6f0ee9c7fa046","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2995,"source_line_start":2995,"source_local_id":"block-431","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":424,"target_content_sha256":"e6ebb461f7e21ca24abbafc1d04122db62d54c4eca4a1aafcf1f85f114782a55","target_edition_id":"edition.r017.id-id.draft","target_line_end":3026,"target_line_start":3026,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3026,3026],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1899691b8f7118122483f28b2c94521d7cbb846cf7227536db75f71b1899f1e9","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-432","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":432,"source_content_sha256":"a79a5794bceb59007b97446152599397c50416ce2314d59b494ce1c7e31ba006","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3007,"source_line_start":2997,"source_local_id":"block-432","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":425,"target_content_sha256":"0193f81ed0142497b241e2770dcf185622d933e0abab5ce6d87952f7f3675262","target_edition_id":"edition.r017.id-id.draft","target_line_end":3038,"target_line_start":3028,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3028,3038],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d63884cba7b6aefbb8cd1bd6f98baa6374698ffd422093c14d2987dea134c96e","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-433","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":433,"source_content_sha256":"0f8d82b370b3601c7e91f8427f0ab2df58f22b470f92c2bc4d983a01c62ddffe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3018,"source_line_start":3009,"source_local_id":"block-433","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":426,"target_content_sha256":"70db11cc57fc66c8d0f14ab40d560ee3ac06f40f050c2fdb030c07e6839a3443","target_edition_id":"edition.r017.id-id.draft","target_line_end":3049,"target_line_start":3040,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3040,3049],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"15aa1743b5a7082ba96400a696c706cbb484c9f3ea1afe30098a324273736dd2","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-434","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":434,"source_content_sha256":"6226f0787d4e77ceb977bd139a1b65a43b1e09fe0f568beb72cbfa7a31a4bf73","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3020,"source_line_start":3020,"source_local_id":"block-434","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":427,"target_content_sha256":"118f9d34f1f6938f04845898f06afc75e8af9c258bf9b47ce5e514023a51732d","target_edition_id":"edition.r017.id-id.draft","target_line_end":3051,"target_line_start":3051,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3051,3051],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"237b5c297e2705435a071ff5de1e66b4047bac66eb84fdc7c29f54f84ed943d5","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-435","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":435,"source_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3022,"source_line_start":3022,"source_local_id":"block-435","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":428,"target_content_sha256":"c2bd3dc3de64dd36580c8f344898107171cbcde85c06920ffca22983b8491fac","target_edition_id":"edition.r017.id-id.draft","target_line_end":3053,"target_line_start":3053,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3053,3053],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"662a2ddd90788f2f8735d2ec94ca22a199d44d2669da9ca63faad94a5e1b3f63","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-436","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":436,"source_content_sha256":"4aef319e42d7f02709898a44a49265248b41483c529e196586492ede86598b66","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3032,"source_line_start":3024,"source_local_id":"block-436","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":429,"target_content_sha256":"4e51b4cc1cdc2180943a8ee41745ed043d1511e8842262c0bf348ec09383308a","target_edition_id":"edition.r017.id-id.draft","target_line_end":3063,"target_line_start":3055,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3055,3063],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa9014af67907b40977e249c0533a3b1e1c9379655a92fd38915385fee1012c4","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-437","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":437,"source_content_sha256":"87b8d4c1ddaf78b42f77c55226eea6e4d36c30c0f211f24202a4d3a17ef16257","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3041,"source_line_start":3034,"source_local_id":"block-437","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":430,"target_content_sha256":"ebb7765026cfb1145770429fe450029c47ff3199a4486e90f8b2583958e235f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":3072,"target_line_start":3065,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3065,3072],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5341b952ce2ecce1c36e07ec643438bd268809dc4b871c8061f26fd36ccfa228","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-438","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":438,"source_content_sha256":"e4a5d51c1d7ed4ba27674e8fa6cdd41757167027c8613c2ecaea0a6279b32cee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3053,"source_line_start":3043,"source_local_id":"block-438","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":431,"target_content_sha256":"cddd486bd4c5c132b6d9cb4b540d5a37dede00b124cfb7c0775dc3857dc41148","target_edition_id":"edition.r017.id-id.draft","target_line_end":3084,"target_line_start":3074,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3074,3084],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eabd2ff60e4d7e5457330f3a01afee77736b577923ee50df7228cc2c7bd87a6a","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-439","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":439,"source_content_sha256":"e832f9af0df51e963d668e9477deeb9007991783bb8e707f0c7b7191b8eb45b3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3063,"source_line_start":3055,"source_local_id":"block-439","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":432,"target_content_sha256":"aa948976b38961c98c58d0b22fb46baffa3e331737146339d3168841072d2981","target_edition_id":"edition.r017.id-id.draft","target_line_end":3094,"target_line_start":3086,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3086,3094],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bdfcda2c6862052b3ff70273c0f0294aa84c68413e16cab8289c18dee2c6796f","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-440","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":440,"source_content_sha256":"ac56ca55bcf60568642a57a9a04ea8674bbe87ea86c4d10a5fcbf242fb7bd873","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3072,"source_line_start":3065,"source_local_id":"block-440","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":433,"target_content_sha256":"8681d01ae2c78c6d33ad1b722370486353ffe9f7a5d400bf3f283381f21baa43","target_edition_id":"edition.r017.id-id.draft","target_line_end":3103,"target_line_start":3096,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3096,3103],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5fe1caa10e63fec10c074de44ac2d74db1655a63ac0815c921865356e0223fec","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-441","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":441,"source_content_sha256":"d34eddf844c8171dd1f0b01fc6e166141d3bb0828ca77109430917570928e4bb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3084,"source_line_start":3074,"source_local_id":"block-441","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":434,"target_content_sha256":"2970271b13b3dcfbb8ae706915cb9ad2216132ba6ca8fe617a2e4f5358cec638","target_edition_id":"edition.r017.id-id.draft","target_line_end":3115,"target_line_start":3105,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3105,3115],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ea77d905cceef61db39ff29c82442016fbd23fcde757632541e548037ad15b6c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-442","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":442,"source_content_sha256":"00b7f854502e5db9cfc1ac5da81294ad74809675a2ac2286963a5b44c53f95ec","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3087,"source_line_start":3086,"source_local_id":"block-442","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":435,"target_content_sha256":"8483b0a947d2b5f6ec40286cf5238b64f8c4459d6ecff8153f2548c60c106c16","target_edition_id":"edition.r017.id-id.draft","target_line_end":3118,"target_line_start":3117,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3117,3118],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d38abdbca136d12746c4a18c466d5900df42a5abdd85f2617a3c8f19606e371b","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-443","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":443,"source_content_sha256":"6a327f9a697256c0deae5d1b33c76519b4a6ecadb48c0c7122ea2d8338086092","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3096,"source_line_start":3089,"source_local_id":"block-443","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":436,"target_content_sha256":"d9ca87c7f8e9393726b65ca2557c68fe7e15604fc93b6e3c357bb2dfefd15b10","target_edition_id":"edition.r017.id-id.draft","target_line_end":3127,"target_line_start":3120,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3120,3127],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e254649ed96acb912c75d9415c6150f6a7fd9d3efa5745422c83a211e48c010","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-444","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":444,"source_content_sha256":"c1b96265a462d1eebc5036a8549f975f6f1c303d381e3ea4828c6a73246af3b8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3108,"source_line_start":3098,"source_local_id":"block-444","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":437,"target_content_sha256":"45e07010b114cec50afa3293599929c1282a8b91f16039a82206e02d9b0a6565","target_edition_id":"edition.r017.id-id.draft","target_line_end":3139,"target_line_start":3129,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3129,3139],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5335206c481183eddfc5b339e82d4521853322bca5f77105e17ceab778f55b26","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-445","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":445,"source_content_sha256":"79b3691b84b3b2c1e5daae88792ee31c534f492be2b7b38b2d9f97814167d2bd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3119,"source_line_start":3110,"source_local_id":"block-445","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":438,"target_content_sha256":"711bf5420f425a34d4929d5f7bd9ed43128d67f3da559b8421e4b3fb1571fd4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":3150,"target_line_start":3141,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3141,3150],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9e203f023c2820d2131927f1cf0336a245c71d5edcc068706f4fdf9a0358772","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-446","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":446,"source_content_sha256":"5d2049f208088e82ae6ecae6f743511c8cd34d3753be11df36cbecfc036a0a23","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3130,"source_line_start":3121,"source_local_id":"block-446","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":439,"target_content_sha256":"9e07fd5edc053b05e7bff78514b776633873d9b700b419abc57ce460070c763d","target_edition_id":"edition.r017.id-id.draft","target_line_end":3161,"target_line_start":3152,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3152,3161],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bf40fc7dc72e50582023fa4abe064206571584425518416dc058b0897b56ef5c","concept_ids":[],"id":"segment.r017.book1.ch07.text.block-447","locale":"mul","parent_id":"unit.r017.book1.ch07.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":447,"source_content_sha256":"26f83e99c7d5acebf711785edce672f56017851756ca4bf6c9ed46c45844ce5c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3133,"source_line_start":3132,"source_local_id":"block-447","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":440,"target_content_sha256":"25fb4bc5d60c3e492e16fd73b6c5c83c2c8a96d095b35be31c9460e55974e350","target_edition_id":"edition.r017.id-id.draft","target_line_end":3165,"target_line_start":3163,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch07.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3163,3165],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"58fdae87fc89bccf24edf46501f0b8cae3b8d37a6d8aaa067635ebf8efa402d4","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-001","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"32629607d4e068db4e43c90c53b135873bc840c401dac79ca7dbcc200bad7ee9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":10,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"689d8b0393055f209db417f7df4d4b074ff86cea20f0e9f264a9079eb50add62","target_edition_id":"edition.r017.id-id.draft","target_line_end":10,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,10],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"555f5e7b9d50e92548c8c25118d715715245c309d59581a5a0128139c2512051","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-002","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"8f3e564e5d84ee456db3927f9e1b6c89fb051b3413b574f20fc03138867297f9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":21,"source_line_start":12,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"371a0958231d7e306052ec1f7b3402c9d5153fb434baa0145d1ed8974e49af97","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":12,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[12,21],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b7476d961686995dcd2605efa42586ebd4fcce7499c922cf101c40a5412d9365","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-003","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"bc8ee72e3fe2213083bd9efe365f19d00feec9b4c4d3f7430e22699a0b15ad03","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":23,"source_line_start":23,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"f0857c2657e87cca5c3584d361202f4e4bb90d104e718d8ae1ee99b77f4f2af1","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":23,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[23,23],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b23d9bfbdc17975643335ef0a0f4d6223e614f2494c084adddadcbaf4ff20fa","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-004","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"f8608e2e5b9f5f236cbca1566a2008f2aa04ab6fa2d2af63ad7fd961386518c3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":59,"source_line_start":25,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"323568f98c25c0685627c8b4e1797926187068db8532685068cc985eec3bb4a9","target_edition_id":"edition.r017.id-id.draft","target_line_end":60,"target_line_start":25,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[25,60],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ce71734332844a98fd8af1774aeb4420f929ce1c61ea209d764ee36850357fe","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-005","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"c27bc9e148c07429f8fdb3642903a128d3ef87e72cc95350474d816fce90cf4e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":61,"source_line_start":61,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"6da69023cbe9ef63ee1d90f34ba1c27441660a2547a1f3a295fd6a9d4c11ead8","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":62,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[62,62],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"483e4fc7735d71702bf8d3d4151c1c205b4718351bd9811d26614e871876a483","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-006","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"2b0d16d1bdd573ce300da11ae7a80417dd80669e2505de60927052c2c2e0f387","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":98,"source_line_start":63,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"a550550b6f7797741c6b3d1f783422f255dbb76208d0a5d849f3d57680d92403","target_edition_id":"edition.r017.id-id.draft","target_line_end":100,"target_line_start":64,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[64,100],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4cb9da20124185844e60226eede767bf61c864554dfe4da9ceb2fd3493731375","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-007","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"76785cc9bfa9da207def60bb5edd1a21318410d0b70c9e44052a66341852c79a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":100,"source_line_start":100,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"034b704c1efac83912df13079c921320c3c0ce74057194047b7a827c01afa60b","target_edition_id":"edition.r017.id-id.draft","target_line_end":102,"target_line_start":102,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[102,102],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"351d96604b010bbc95d5bd40fb662aeede7c52b347f9bfb4131b6321944c7448","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-008","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"ba3dde17915732cf8050edae9bbe7214b22048c94a8689dc0017af4237dece96","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":142,"source_line_start":102,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"dce0f4feff100716c118ebb1f7c05c16c32f608147db05c0532a92c479873ab7","target_edition_id":"edition.r017.id-id.draft","target_line_end":143,"target_line_start":104,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[104,143],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2fca63b7e5f886e12105a2a079696896b73e5d5f3011ec8673b05c19f05e201e","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-009","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"5b090d2a868110a1494277650073b91a89e09788c1e1af71f2a51be00a74f461","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":144,"source_line_start":144,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"76dff632cf86ba864419262f60654ad809293467e9a966065d3f6c08e5bbf5b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":145,"target_line_start":145,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[145,145],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe2beae81511749ea22148c4e0a9eec3301bcc18b8a364555f52db76516c2d64","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-010","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"c16b1761ed89b35855b344b58b32d43950f1d56f2fdadb80687b5d2e926748b6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":146,"source_line_start":146,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"e5cd3caddcc303ac60e50b15075bab83053dd419f2d6c063b8a797563a4bed38","target_edition_id":"edition.r017.id-id.draft","target_line_end":148,"target_line_start":147,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[147,148],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ffe804a75bbaff0e5b86fffc7a4c7d20da8be11adce6f67c1af70f705e1d8c18","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-011","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"bc5fbf4e2bdbefd4b905cf15a4ccd7adf5a0ee45965a49472b8cead0a3fac915","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":180,"source_line_start":148,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"8bbea09676d67eba12c07ea38ceb3c0615ff62cddd94d2c52d4921c6a2cbb948","target_edition_id":"edition.r017.id-id.draft","target_line_end":182,"target_line_start":150,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[150,182],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"726d68bfeff5441fd3c95af0b8d8942c383bd403606f25f4cd9ac65482d6b8d7","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-012","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"31e19e1c52796348e0d2cc7737a9023ea91910b0ec64bf9d52f129fce9409378","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":212,"source_line_start":182,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"82540ac260ba769556922b7dae06a7d8e7ad8d3c1eb6ea030cc3bb368ba47150","target_edition_id":"edition.r017.id-id.draft","target_line_end":214,"target_line_start":184,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[184,214],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1bc76409f94c543b4993a2a28a2b517203f21960f51b68cf381f153b60e31b3a","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-013","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"4674c65346305a86edc44b390aaeb0fc25807a689f51ba7b80214f807576265c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":214,"source_line_start":214,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"20924fb910094f52328287d2ca14dccd4742dfa99c3cfdc9bce335b39daf32e4","target_edition_id":"edition.r017.id-id.draft","target_line_end":216,"target_line_start":216,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[216,216],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d00b586c4497b96909a9c0e1b39c145e06c784a1f5b8beae79bc35657ace0401","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-014","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"a9f0ae6da40b235a9c70119fa80995def07dbdefe0879dcb2b900d52be245f65","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":230,"source_line_start":216,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"8894326f01e48657ed1a4538187d3e7adb6902c1e46cbbdd3cb8f432c36cf285","target_edition_id":"edition.r017.id-id.draft","target_line_end":232,"target_line_start":218,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[218,232],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3fab84985b8bf813a1bf87508e77c16640127277c3b5ad728c6e9c2921792563","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-015","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"28cf7e280d28368b05cb88f14ab88ddade227a2dd9e548207f34d007cd1b839e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":248,"source_line_start":232,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"47db46a1608bbdc190d607d03753ac2c5ba13a73a689aff4a50f2cab8bb79f09","target_edition_id":"edition.r017.id-id.draft","target_line_end":250,"target_line_start":234,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[234,250],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e8ccad1a271749afe609fd73364e7e64bb73c53ca19515a1335f727f41438061","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-016","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"9908f44af298f15dcb538405f13e77095a1fe0de75890b43eb7b5f09dda3f4af","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":256,"source_line_start":250,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"3b235c86860a75706f78822c6f4574abccba6e618b11d526a9bcff49e6c881dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":257,"target_line_start":252,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[252,257],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"996a2e40a9138673d51987e77f0825f40eca5ccbf4ae09d6be101fd27350266c","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-017","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"c6ef831bce82de802790921aa99ce5a2b570c5efdbd0d781d1b7baa52db1f9b1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":258,"source_line_start":258,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"3abcbb67a872bfc31e0e4670a4d3395daf75167198f630f756f0e1539dec7391","target_edition_id":"edition.r017.id-id.draft","target_line_end":259,"target_line_start":259,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[259,259],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f3cb20976a81560f781e491e736c29d6d86d3e521335620e3843d6d71089d63","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-018","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"c934432435f214e266b791156c20c51bbd3025a4f1f05ffda15601c43d86f31b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":305,"source_line_start":260,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"eadf5e98ce003551467bc9e6c84ec95d30cfac04b8dffdd336343e449bdccc2b","target_edition_id":"edition.r017.id-id.draft","target_line_end":306,"target_line_start":261,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[261,306],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ec1a8653c9b1c84f838ced3fa3ef48f226ad5e3cae1f055eb1fb1fef665f4c4","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-019","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"d6d9feaa376672a107f38e507c4b5bb10207e90206a3e0f9182c31b8e5f65d8e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":307,"source_line_start":307,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"09bac3d4fa15ec7d1a47a5722a32f75505bdd71a000a1fed18fb7c0639e8d3b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":308,"target_line_start":308,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[308,308],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d1b733f2ea9e4ac1e6785da0998c5c959ccbb480f8e801a9a49dc94a2ea2fe7","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-020","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"1e28921a49e8f1b18a6af1b637eb4634fddd3271d60c81e64a9bc6ba8181a232","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":317,"source_line_start":309,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"f3a5eb4d8c9bd29d8d0d5c53ba07753445b53edf896bfba38866466c3e0ac618","target_edition_id":"edition.r017.id-id.draft","target_line_end":318,"target_line_start":310,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[310,318],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b10e863cc834cb7481fd06e70bc111039fbcb42c30930b9b90aa20eaa0334156","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-021","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"383784b7873fe1aedfb6c644168bea5e588f00f396b6693cd2b14fbe44cf9261","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":330,"source_line_start":319,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"20762ca05fee5ff9915c8d7c2261d5f95d30eda03a32e773ce614a5e3c3400e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":330,"target_line_start":320,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[320,330],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3792cfa7bd6febee282442506f0de2aaae289088d9cfe43f9e5161bd25ab8038","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-022","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"a99e0f9d99039a4232494df1e80df343bdba6ecc46800f4094a6bf97d07677d3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":332,"source_line_start":332,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"d3f44b0112f9d1ee6d178688c4f5b5ab73ad8d138d589b994ed49d589a1ea6e7","target_edition_id":"edition.r017.id-id.draft","target_line_end":332,"target_line_start":332,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[332,332],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1760683adb06a5396a088ca0368d2d2f741c30392bc6310800540c919632faea","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-023","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"f05cafd430ce7d43170a68545ad3e159ce2bb75178b68eaa78a10d4800853a41","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":346,"source_line_start":334,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"f84d3cf8075d183108cdbbc6046aeccf953f2b75a5f7c1e61b6561a048429de4","target_edition_id":"edition.r017.id-id.draft","target_line_end":345,"target_line_start":334,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[334,345],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"54cffc1c1971a7ab03456c5e70742ce20ab0fe1f197a94d1b990cfe449c55779","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-024","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"1701abb0b5c1fa4813b0706c0c980eb6c0bcdba6cad7bfe558e608c9bb672ca8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":362,"source_line_start":348,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"b61fcd8a40ce33e3f13fb6c9e7e0fef0ad42f6de53e912c323da82176457735e","target_edition_id":"edition.r017.id-id.draft","target_line_end":361,"target_line_start":347,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[347,361],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dadd80bcf7cf02ede0d7d843cf838be2552bec66326117311e19bf4a284d775c","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-025","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"c5322cb2b492109393a00e890eb8beb978681da787d89cbc04d385815f873a77","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":371,"source_line_start":364,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"01128b9575dc01dcca8560a5773fffcc2b56df17630a5fe01aed3b400bc0f84e","target_edition_id":"edition.r017.id-id.draft","target_line_end":370,"target_line_start":363,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[363,370],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2aafb974279993c3c3f8fa59a87097be48d1336d4ce40c071a51c98fc6b76377","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-026","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"f6b274aa1b5c310f222530b2d931cdd436710cb2784493d6a217942846867ab7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":373,"source_line_start":373,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"7773b591ae702df707d8f1ff89ed0c9768194716a4ec2fb6a78717134ed44526","target_edition_id":"edition.r017.id-id.draft","target_line_end":372,"target_line_start":372,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[372,372],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2590222dd9033c3c6dcdde61ffc7d853aefa139403b710f5bd4751606f294698","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-027","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"19161a1ea2261d96483945013cf75cf78463ee2d90f150425159455f4af46602","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":384,"source_line_start":375,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"bbf320f1b57e14362fb8c68411aef7fcee2004364e375b147bc551823e15e7d2","target_edition_id":"edition.r017.id-id.draft","target_line_end":383,"target_line_start":374,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[374,383],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5f6d662c350b0b95d7873b71d853e1ed87cfe120c49422445e66757b1b608b3","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-028","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"345064a8ad475f95a1fb0a9f400625c216d12fd5c343f28a3515468913b4f3f0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":389,"source_line_start":386,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"5679bb5cec57b0f76e497588ffdc4e4d3cc753b0361b337ec5c81e7c6c47a337","target_edition_id":"edition.r017.id-id.draft","target_line_end":388,"target_line_start":385,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[385,388],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cf80f91331dc4b9b7b31f1784d7d67e01ad7f1fdfd411c2073adcf7c5c5fd3b4","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-029","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"c9f8867ae223fd4ac832c1a88a4f22a7283cd57bdade262862b72e3b00032ef9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":393,"source_line_start":391,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"73a66dcb91254c155213935268c337ec5c4d46aade0a94f2df8913062c7fa824","target_edition_id":"edition.r017.id-id.draft","target_line_end":392,"target_line_start":390,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[390,392],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc79fb34dc91012dec1012e27cb5efaa11decc2c42fbd10f796e5a1dd5145f9f","concept_ids":[],"id":"segment.r017.book1.ch08.solutions-manual.block-030","locale":"mul","parent_id":"unit.r017.book1.ch08.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"6bda66e27ab837950c1c8373cb45703fc4f7791efe73cf244351cbd06bcba26a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":398,"source_line_start":395,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"10c39b1048a92eab7a286b3feb76d77eac8c4edbd86750d1fe715a5ba444d3cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":397,"target_line_start":394,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[394,397],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch08.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4957e85e678c96a8a8b9d868eed293dd43647f7a3c161b4cc361b822d92937ba","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-001","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"3ff561b610804aca883a4fa7bb930acd2a4d49c8b3548adbd94943582ee1bf12","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"9b685ca28a4ed645527ee3c76294cc92f9db1807639158d06f572f3f42e36d61","target_edition_id":"edition.r017.id-id.draft","target_line_end":2,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,2],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"32100256dc8be4a85002860099da477db6832d09307ba7cd36c65a7b9eb54213","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-002","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"b7b263206250966bac5f681caa237a7eb11ff990b6458064e804a5eeebff2e25","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":4,"source_line_start":4,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"5e360160736900f4a5c32b5913f876c7e73e302252da22a615bcbb51b3ac8488","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":4,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[4,4],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e776288731afb319fb94edee4dbdc49e1ad64fd4c5cd496d0403aadf8cfd53c0","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-003","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"951a6d6994f49b7f3323ee73073a74aa585bbbc760eed7ecdaacd43bbb2b9f6b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":6,"source_line_start":6,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"33dea3149d2927be42a00b125d82a761c6b57e201847402095fe7327ddba4d3d","target_edition_id":"edition.r017.id-id.draft","target_line_end":6,"target_line_start":6,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[6,6],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1cf5f43a320f4ce11ea3d63f37829f9d6da886a13d37e59306b83c76ae5bee88","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-004","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"75012b61c76a60705ee0c1f885225a573790a33acbdae96a8018b846d17544f9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":18,"source_line_start":8,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"208e92a54ed4aae864496ce521d905a5eb9d3765449d2d8761b4f50ac4bfefce","target_edition_id":"edition.r017.id-id.draft","target_line_end":18,"target_line_start":8,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[8,18],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab10a153b4254e50b71b927b61271325db49da13140265f65c810904d93eea71","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-005","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"d437cf3bc6447ea9f24a53cea6d2fbf56ad715162a0c1a945035c4da9c4b65ed","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":20,"source_line_start":20,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"75d8724ef1aefcb26a98b566276d22271d4fdc082898ec127ce3819783ff4e3c","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":20,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[20,20],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f647a6dc428f006c8b661613d0cd4dac5c5e485b7b211ae8c0a8a3218d912da","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-006","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"00001612cf38d6c7ce7077a8d559f3ab96a1ce36adbf97e471e19752ede674ef","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":24,"source_line_start":22,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"00001612cf38d6c7ce7077a8d559f3ab96a1ce36adbf97e471e19752ede674ef","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":22,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[22,24],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ebae3b61ee184c69c4382f906836ec11235d33b1362d5e88cb88b0ae08165f5","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-007","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"2aec13019578c0dc6811c8d4e13403bcfa74b9d8fd3045fe9ab8314a6363d1ed","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":26,"source_line_start":26,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"67d3f2384a1bd65806813129d81be4108f55a967c482d0b1588af2391c9bc83f","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":26,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[26,26],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16fb89d6203eb2c8cc904414745c3f4d51f1a5fe5c6b2248e252a13c51762757","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-008","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"ac1350986c2a6926b230140b19acad1f6634eaeb8656d00c566a46aedb818041","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":47,"source_line_start":28,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"ac1350986c2a6926b230140b19acad1f6634eaeb8656d00c566a46aedb818041","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":28,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[28,47],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"95256997eea4aa7afad1648606d4d400d414e5394238ae4bfd7dd992041137df","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-009","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"44e26e108223acc14b446b04fc2e0bb7be998c711216a71424c7d029b7fc805a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":49,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"0d882670bff04df2ae083e9dc7a8e6b59cb75822e94a307d2057b7ed698b4415","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":49,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[49,49],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a594b10b5b8e902b695b88b8121571ef4d761ddee4948ba2f79f76ffc45765c","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-010","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"dfc5423d853c5aef7d7d7f7c31a1f8e2085090e90fdcbfbf2e2f555858e465f8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":55,"source_line_start":51,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"6159a44fc30a47e4f46a16fd122c68348b57b5455715969fdbd1b57c3827e919","target_edition_id":"edition.r017.id-id.draft","target_line_end":55,"target_line_start":51,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[51,55],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d99745bc2d0da27cf945d641128161f1031226a728f64c59e1c9d085f14875e4","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-011","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"e0057176169a3d9d9490783ee6c77997f82edd720acbf4a11bb91ec05f717c96","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":57,"source_line_start":57,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"8d8cada18fea455f293d90ed561c5be63d5d74610f06046ef82bb148ca278d11","target_edition_id":"edition.r017.id-id.draft","target_line_end":57,"target_line_start":57,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[57,57],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee73c12a4011b1e61c9b7d8d2aa46aae640e0dad3a164fd13b897b81d147b251","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-012","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"9257c4992aa690ceb63fea1d28cc2989fd7c665470d0914a044f86da473d4c66","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":59,"source_line_start":59,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"3eb09207cd92266d95d8d008664b2f7a59926501636689bd00414b6951cc6f13","target_edition_id":"edition.r017.id-id.draft","target_line_end":59,"target_line_start":59,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[59,59],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce297bd69284c42c60c69548fa0295b96ff7da4bc8e048f9bd1fe8dd521187a5","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-013","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"69b0fe6abc64772688c3c6134a9c0f67a59ce4bc8022abc859336f083ea6c124","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":62,"source_line_start":61,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"18905cb23150a18d7ab49dac4e220169906ead22a96b2700dd1f462b5c8511f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":61,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[61,62],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88539c6be2121a9f4c6668af3dfd3ebb6546f1840c21471ebcf3e91e8e28e4f8","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-014","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"a22092c7adbdfb473e2f2d1bb63a9a31d36c309081ecac74640b5df42eb8474e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":64,"source_line_start":64,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"3f1da04cafdda8ff523f78bfccacc308630b2bc757f0c273c56f8a21220b5428","target_edition_id":"edition.r017.id-id.draft","target_line_end":64,"target_line_start":64,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[64,64],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b5095d453cba12bc95537218d149fa559ccf5a8e6c46fe2a80bd556083f6a28","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-015","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"808b7fb6048290e99253d2f4a0bc7f54b447c5bde4b34845dba4a18d7dc6b644","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":70,"source_line_start":66,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"30b2e3ec4e1ab67111123218d05ddffe94feeee956ced3018135fb1dfd21fe0a","target_edition_id":"edition.r017.id-id.draft","target_line_end":70,"target_line_start":66,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[66,70],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39686eb13250fa388cfc8ad224b6ed661e46a2ae3ecaad0f5c0a9e0ce7f0bd97","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-016","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"1e9ebf6b529b6f6c5ba935784771e3de21dea0032c2e713a52180c3b5a57622c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":75,"source_line_start":72,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"e11b1805721d1fbc6027b2346f00087ee4a2e3c40ac24cadd989001d7247d994","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":72,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[72,75],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5fbda8a7632ebbc5d4475c43c98b6391d4b3aa24fa4060a37f645e568fe1df60","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-017","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"d92e144259d6f9dbbbb8fedd1cce9f4face5d0dc8ed42d24594bb237b85eb4e7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":80,"source_line_start":77,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"2ef5edac414018ff24b65db232e27a16949e8d14124f883d2324f58e897c7b21","target_edition_id":"edition.r017.id-id.draft","target_line_end":80,"target_line_start":77,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[77,80],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88461b315e852b89b373295f9338e4040dcbe225d7dea2d62b0c4213935531bd","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-018","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"f242e21311494293384acd8353ecfc9431a395103125d65ba4283ad4e4206853","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":86,"source_line_start":82,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"47b505e9197ebe43e8b9582b655f99a17251cf0e3b78ce6688fdf8240213bde2","target_edition_id":"edition.r017.id-id.draft","target_line_end":86,"target_line_start":82,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[82,86],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"832082c58cba4ddaf2f4d769566451f231f999b74426d58717483fd2fe2e9938","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-019","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"e72e711ded24db4f0c3b5c2e7dde13857688490805f4defc0a258517b86ac5c8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":88,"source_line_start":88,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"e72e711ded24db4f0c3b5c2e7dde13857688490805f4defc0a258517b86ac5c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":88,"target_line_start":88,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[88,88],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e298793dccc1dec08d1a7658801f8e87b2a537517d9c186c6d90f01827571bfd","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-020","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"6001a3552c2628a795290c3fed73f7949395702244c9adc620db60e7063d509b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":90,"source_line_start":90,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"2c43e71665a34f284c3560345d46dbc90ee9509e62a15ec755551c36a834edec","target_edition_id":"edition.r017.id-id.draft","target_line_end":90,"target_line_start":90,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[90,90],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"33a1edc3be2682d4b94bf26045acb63d03ea778a7b67a708d7c871bcddecdbc7","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-021","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"5a4012066661160c0099b5850be488ec7f6360979599966ddfdfff7da16782a6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":106,"source_line_start":92,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"99bb6e55627f379092761b3434ced1c9557a87d921feb62e2b2027681cf38d83","target_edition_id":"edition.r017.id-id.draft","target_line_end":106,"target_line_start":92,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[92,106],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57e5d5cc48dbdd309e0a7f1c6fd5bb80f50b8eac2985b38b56175db886993ba7","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-022","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"8aa33fa8f2a019deb4b505f2a002a696e886fbddfc8cf52a38cfb21efc177fe9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":108,"source_line_start":108,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"9f6e2a78e8e58fe4e3a785c76865f608ea4d20192c536d188f21776aade07021","target_edition_id":"edition.r017.id-id.draft","target_line_end":108,"target_line_start":108,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[108,108],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e334de31e4a784896e036f51c7e3812bb9ed41ade9bb1a36a5f1c622645abd43","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-023","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"181e6f917774ef97b403611f54771a7b933cd3c0084c7fc539442d5e60d6ace3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":124,"source_line_start":110,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"69492f81b99c5d112e54e934a9d366ab152a673f30b3f3a4b5662d22b2e00237","target_edition_id":"edition.r017.id-id.draft","target_line_end":124,"target_line_start":110,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[110,124],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4f05f37adb13c0010c99d90c7f3c85e961c5824d40e7f059b1bdf0175c7decb8","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-024","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"7a4018e2ab2d221a031bbfcb84bf54ce2c22ffb8bc1f104ff80d8822e0929388","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":126,"source_line_start":126,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"3c878b1c73e581a8ca41b6cf7421dd76a6656d298cfdef07aa83f8b1b4a2b1a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":126,"target_line_start":126,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[126,126],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"943e175dabc25bdb60ad03b2b72f43662d4a9652fed313027c0bedc32a5f5224","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-025","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"54c29b74c47b3397e3b619c57b04facde91ea4f6fb8b304fb6a3acfa2d977c77","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":165,"source_line_start":128,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"b9981eb5fda03d89e0d41486bdae60933a369a0057e38f53947434eb3a73535d","target_edition_id":"edition.r017.id-id.draft","target_line_end":165,"target_line_start":128,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[128,165],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"08c2c76542c42050e09163eb4fbde4f4b260a4d11b593088e679130f6ccf480c","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-026","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":167,"source_line_start":167,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":167,"target_line_start":167,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[167,167],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b0bf5bea1d7743618a72304aae4208c16925e3abd5fcfd3741ca24ef7c60b5cc","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-027","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"46b700e2a023cf2a02913f2d3d3744be018d11e84e899d149160c958cdcae079","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":176,"source_line_start":169,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"0cb82969c701f0feee34de6d9878f553d126e2b439cdbf4cc46858a65f389f25","target_edition_id":"edition.r017.id-id.draft","target_line_end":176,"target_line_start":169,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[169,176],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7d4ec0cba1fdf08bf13b6d38883ec7e51cc5498656afe62c97c32bc1a711591f","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-028","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"00e50eb63fb01dd05a40ba3d216d640c0952afd511e46e52933cc089f476fbcb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":178,"source_line_start":178,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"00e50eb63fb01dd05a40ba3d216d640c0952afd511e46e52933cc089f476fbcb","target_edition_id":"edition.r017.id-id.draft","target_line_end":178,"target_line_start":178,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[178,178],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"47da9d03e210f01624c9aae50f0690b23aab540d37ac04ac7a432b0f54898b35","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-029","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"12334176c5fd5636e4beed553b78696ceec930b6694d766eed91073b69adabe0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":182,"source_line_start":180,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"56018deba18cb7c6c6c0d37c3b4e90ba04410443acc92259321d78b75b0b8e87","target_edition_id":"edition.r017.id-id.draft","target_line_end":182,"target_line_start":180,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[180,182],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24a71e76ae5849dd5aa94b03b5a73cf49d32b7530cd06b29ab5e89b67cf6f914","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-030","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":184,"source_line_start":184,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":184,"target_line_start":184,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[184,184],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"727c9f2b3516f11e418b8ebfe125c59375cba9ef71347516ffaa25c0edeca179","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-031","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"4fc6d97581639e1eee29db3c94784d80ca0d7212186d7a45b166c075c7e23650","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":208,"source_line_start":186,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"4fc6d97581639e1eee29db3c94784d80ca0d7212186d7a45b166c075c7e23650","target_edition_id":"edition.r017.id-id.draft","target_line_end":208,"target_line_start":186,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[186,208],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"337bdb2f7473680ae6a8b28054a410298b148b977174a380ff506a8114433f05","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-032","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":210,"source_line_start":210,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":210,"target_line_start":210,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[210,210],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d6ec348858aec751ad7f5b910d119ef980f0ec2e8f415a1837c49f7aa8908e39","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-033","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"2cd584244938e77b094210359e4a46d30b2c30b3962c0528e8c45fb5f8f7a141","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":235,"source_line_start":212,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"2cd584244938e77b094210359e4a46d30b2c30b3962c0528e8c45fb5f8f7a141","target_edition_id":"edition.r017.id-id.draft","target_line_end":235,"target_line_start":212,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[212,235],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cfe2f4d4f08271d34e642c6d9d8cb4c93510684e0505408a9449a3d209b85970","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-034","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"581bc8da692f256678a07fcf47ea4cf068396e2e0b2140dbc1b7aa3687ce7f83","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":259,"source_line_start":237,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"581bc8da692f256678a07fcf47ea4cf068396e2e0b2140dbc1b7aa3687ce7f83","target_edition_id":"edition.r017.id-id.draft","target_line_end":259,"target_line_start":237,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[237,259],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18c8a9aafeb1adaf23f0d3846010bc877b7d64438afc3b27508ed8f88cbb1429","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-035","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":261,"source_line_start":261,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":261,"target_line_start":261,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[261,261],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94b3d328c0381cd415e7ac6417a2752b038989dc2dabcd20adc69682a967f304","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-036","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"536221277cce6c99282582e0131f4aee215c472c2cb4624d2934c9a4b6caa7f0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":302,"source_line_start":263,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"536221277cce6c99282582e0131f4aee215c472c2cb4624d2934c9a4b6caa7f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":302,"target_line_start":263,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[263,302],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c52e9572a8ac9f2ee775b04bef34fa62849ae1ffe1d73059199d8bc1834af5bb","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-037","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":304,"source_line_start":304,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":304,"target_line_start":304,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[304,304],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"60d79f34668e767646aceaada3ecaf08026fa579add3d170a1c8274fea924123","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-038","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"80b5074d8c3039b386a828846a34e6b8d5785d4ad8ce99966a27603f5fb3fc8b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":334,"source_line_start":306,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"80b5074d8c3039b386a828846a34e6b8d5785d4ad8ce99966a27603f5fb3fc8b","target_edition_id":"edition.r017.id-id.draft","target_line_end":334,"target_line_start":306,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[306,334],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b8f9e24938ad4f9ab1abd7dea3a819c17aa9e68626d9afa6707e12256f733f37","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-039","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":336,"source_line_start":336,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":336,"target_line_start":336,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[336,336],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e68e4667d189592b5f65f5df224094d25cf58df875510df76449281fb1da53f","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-040","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"63e0bba80b25763c9845674dd1ab3f3c5a8f3159019d300bf5cd103154d408da","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":338,"source_line_start":338,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"7bd2af912d19b74a55f3d570d58160c855fdeaaead26f77e3d2a4801a7fc7690","target_edition_id":"edition.r017.id-id.draft","target_line_end":338,"target_line_start":338,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[338,338],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"acc8f781c4074778f13d89529d44c9a585f36bf73184b1e06d53b28201671cf7","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-041","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"0d8b380ba773a51f6d45aa36ec93f79164fb95b321d2847217e7c7fa1f854f65","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":354,"source_line_start":340,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"0d8b380ba773a51f6d45aa36ec93f79164fb95b321d2847217e7c7fa1f854f65","target_edition_id":"edition.r017.id-id.draft","target_line_end":354,"target_line_start":340,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[340,354],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1f5597c4fa11e4a36b24230edef21af0ddddb56ea581dfc817d292b50ee40bb9","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-042","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":356,"source_line_start":356,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":356,"target_line_start":356,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[356,356],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00da21eb0da6e6508dcc1899df09801b463163824580d3f47d6217f964fdd268","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-043","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"d6d30c6567dfcbbe5528d4b0b50ae210bd6e1f474cb4d1e191041e3ae17ab2f2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":358,"source_line_start":358,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"e4c1f9ce10722b458bad71aa017039fbe99d9b74c2fb829089038195ce64cbfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":358,"target_line_start":358,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[358,358],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed4c61438a79ef638890fb33d42d137526a9b5880db926db1abd358ccc4c6732","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-044","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"3d32219786a814202ed54e040415b55b48975c9dde854f7b07800ed65a53be25","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":376,"source_line_start":360,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"3d32219786a814202ed54e040415b55b48975c9dde854f7b07800ed65a53be25","target_edition_id":"edition.r017.id-id.draft","target_line_end":376,"target_line_start":360,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[360,376],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4f68ae93a668a1d2daf15df634f505cf93a10ce54f4446ffe3508b2d3d591fd4","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-045","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"b6484d6bdfec91557d76615fb9f1c3645b00ee2dfdbf0f7d9a7840862fbfdafb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":378,"source_line_start":378,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"0fb101535a4810164931897a0dd2756a81eb5c1d9869773c72215e7ac850e4a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":378,"target_line_start":378,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[378,378],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37e02c27171ef2e7d6c9054216fd1305bc98a097a8a90d0169173f904bbfb93c","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-046","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"b2156b040e6cd7a5558e1750e0f07cbaf1e4cc9af8f47d9c2de29d3501a6bdf3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":380,"source_line_start":380,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"5ffe98c9f55b46261e8bd4dea8d475954438c9aeff55d21b53705735d3065808","target_edition_id":"edition.r017.id-id.draft","target_line_end":380,"target_line_start":380,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[380,380],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc6af826ce4a5b693e68e910cdd3114d0b4fad905caf766aa9d1962c4bb3bf70","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-047","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"be5a34e1d169e660bf33762db95b88f163b5f229d1e441408292aebc95be9ff8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":383,"source_line_start":382,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"a94f437792cd9b9d7777476829045b98c0dc2b5680028528930894deaa7e809e","target_edition_id":"edition.r017.id-id.draft","target_line_end":383,"target_line_start":382,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[382,383],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37b958c9454776564f03c96b0229e5041cdbecca66796b562f700eef9bea20f9","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-048","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"632aaef531268761876aee34b4ad6595e7ef4e2b28514158046193d60052dd5d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":386,"source_line_start":385,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"2407c5392064159af69493f90736f395bf5366603da5fb1183594d82b1b4b17f","target_edition_id":"edition.r017.id-id.draft","target_line_end":386,"target_line_start":385,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[385,386],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f57158ccacd0d4f82f9c477a3cfcfd6b9a0a5cb6992b0fac88c23c173f46a0f","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-049","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"f9385dea63ea6aedaaca309fb60c9d90883747886ec536e57519a81a86e39faf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":399,"source_line_start":388,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"d0691ab5ad53ad9e7cf40447624224ff7e15b33bd25f3a6526d6397197d8159e","target_edition_id":"edition.r017.id-id.draft","target_line_end":399,"target_line_start":388,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[388,399],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c9adf56416333010765d0f8189743cf6f917283bc2f51eaf0d68a50504230c5","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-050","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"6c534c705cac0ddf868b849c543ac84098c0d10144ca1ab9207432f993448152","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":404,"source_line_start":401,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"f11477ed24d7e7aa979fa082e187cf9fc17ca93e0404b2b8736108fe05a973b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":404,"target_line_start":401,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[401,404],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"480a0ba11455704fb1e8c3293390a6a62ab04ae3f00cb437eba58ba650ebde98","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-051","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"de524a1c131ac3ad22293351a75b68d20ea449d1b3068081d8846085f5a3cee6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":409,"source_line_start":406,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"230156dc095196a476662a87cfa9cb279618762050efb7ed0fab795f66ab3f34","target_edition_id":"edition.r017.id-id.draft","target_line_end":409,"target_line_start":406,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[406,409],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00a849a0ffcd94a939811450609c4f12bc7497e3e2b3bf0bb80b7422b8feed50","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-052","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"82654c3f3596dfe7d014d2d7912cede8d6d3a32976827873307c025b6263fb2c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":415,"source_line_start":411,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"79f21de8b34f1c4f010a69736e7aad1571c58416adbe5fec3ee6d58b0e497850","target_edition_id":"edition.r017.id-id.draft","target_line_end":415,"target_line_start":411,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[411,415],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2171b73da576d49acb710e2e08c4cd5b47fcba62064db5b85ee320065f901c69","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-053","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"fd1b1f623c3e32ce4cd5557348b754afb7e5199ad913e69ded02576c4b3aed8f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":419,"source_line_start":417,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"1c9fc53c881ccc2f9cc0ad64c312bd24434f82ee746b2841e3532ddf66aa70e9","target_edition_id":"edition.r017.id-id.draft","target_line_end":419,"target_line_start":417,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[417,419],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c60d15e0b579cf0937b6b9b81a11a299b895cdc103f78d30f6ea8976096e5ada","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-054","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"1845a118f1074914538ff950c6bdba13950a5f2836707e2f230431fa74a3334e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":480,"source_line_start":421,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"e9988289a2bb088aa863ffc1be87b8ece55f9909feac1ee55e73fb4c1d7d9722","target_edition_id":"edition.r017.id-id.draft","target_line_end":480,"target_line_start":421,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[421,480],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"521fe3c686e52a8dacaa644c7cbee696a23494627f7d4bf17b8cb69717143697","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-055","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"86e0e2e3a58b941ad8561f797832d3a387190e51453e36ec260deae98884d09f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":482,"source_line_start":482,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"f058422af07585b8a69efedcbf48edf9391721e9a08675b3619246a85d644799","target_edition_id":"edition.r017.id-id.draft","target_line_end":482,"target_line_start":482,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[482,482],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c385aa266a6c193cd3905f2dc775540280df75e6de12c45d1f0625fccd699e5c","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-056","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"051a2b1ceb6380b8166b0952431a7b89bf10b04823ca3b19de3ea5113fd6437f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":533,"source_line_start":484,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"bde9be63b9fcc1da4ef99579e04441d78e766526e242b870d37c5c9d2b7fc199","target_edition_id":"edition.r017.id-id.draft","target_line_end":533,"target_line_start":484,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[484,533],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da6d655e7ea86049b1143cd1b99615b954802e952af8663365ad619961f054bb","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-057","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"b995674d88eab0f0fe1849eab5160e30b57418132ae916c1ee8cf72fbea2122d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":535,"source_line_start":535,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"64b5b3464b8da0165fd7ec976bb943c3c2d2375b81a45406a5e7950e86cd7adf","target_edition_id":"edition.r017.id-id.draft","target_line_end":535,"target_line_start":535,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[535,535],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f6b3a9662bbf3aa2cdb101aec197d31342f43e012e5c8788c620fa801f5b288","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-058","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":58,"source_content_sha256":"377c8540b77e11e4a348d078f193a9a4f28ad3dc95bcab997ae1d5407c9b44bf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":537,"source_line_start":537,"source_local_id":"block-058","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"290057db484d9520120ab432308cdccf2d2b59a3bad06b647961c89b1fb998c7","target_edition_id":"edition.r017.id-id.draft","target_line_end":537,"target_line_start":537,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[537,537],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d5f1e825fe1ab1e63054e6e4a288f8b23fdedbb1fa9988c501e31169b4420a8","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-059","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":59,"source_content_sha256":"3f4ec7c2ed7c98bfa34c3fa3925adf6bd7914040ef2391651a6c266da93e601e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":547,"source_line_start":539,"source_local_id":"block-059","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"3f4ec7c2ed7c98bfa34c3fa3925adf6bd7914040ef2391651a6c266da93e601e","target_edition_id":"edition.r017.id-id.draft","target_line_end":547,"target_line_start":539,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[539,547],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4f947899370de7f3d9e0aba06eaf80f1f63f280e1e3ad2164a30681e3debd2d","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-060","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":60,"source_content_sha256":"cf3779a04bd4532013508f0562e1e25a0ada82b189b661e2d9587f4cac7ca30e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":562,"source_line_start":549,"source_local_id":"block-060","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"bcb3f8df15bfe7faa8858432a94fc092b87bf198b56ec03147aafdb924e112be","target_edition_id":"edition.r017.id-id.draft","target_line_end":562,"target_line_start":549,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[549,562],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eef650181d60ab00aaa81dcf9b7dcc7826b18efe6d91f8fd95aebb407733cdb7","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-061","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":61,"source_content_sha256":"aa8cf6327cf532b4108cac2b0003ea84e53feb6cb0c389fddacbfc54ee847f3a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":565,"source_line_start":564,"source_local_id":"block-061","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"ee25ac8c784f07bbf3fea678a124affedc4c2b8fd21c47ab4a162235b3a1dbf2","target_edition_id":"edition.r017.id-id.draft","target_line_end":565,"target_line_start":564,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[564,565],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f8d5362dfb09341b807ff8034c7b5f3268f8a076c6bce660a646bd098cb05ab2","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-062","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":62,"source_content_sha256":"60b0c885640b2114c6a6c3896252022933f969fe12c18f6464a81b135dfb4725","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":636,"source_line_start":567,"source_local_id":"block-062","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":62,"target_content_sha256":"6274a1745678f8e92dec1d5e8277bc84878cd3e1677c16387df7a33e5f747873","target_edition_id":"edition.r017.id-id.draft","target_line_end":636,"target_line_start":567,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[567,636],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"092f7a03759ee860fdc1c8abbbf4ede9b24cae8754fb30313b07cf58a7684a69","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-063","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":63,"source_content_sha256":"80a099b4996c9458f0084bed21f60edcbff2f5027783f3844077361473b0f7c6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":686,"source_line_start":638,"source_local_id":"block-063","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":63,"target_content_sha256":"d74f44e8905e51564e9a7224c57f3fb59d00bcef3aed4b3e8e30c53a38587fcc","target_edition_id":"edition.r017.id-id.draft","target_line_end":686,"target_line_start":638,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[638,686],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a38b40d874d91dba73183b0466b27a8a8eb05d8edd46688ddc972c1bb4b71d4d","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-064","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":64,"source_content_sha256":"b37aeba6728b599c5427490ce4b2f0225f3dfeb3918ab407469c555702598d1c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":705,"source_line_start":688,"source_local_id":"block-064","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":64,"target_content_sha256":"0966fd5507c8ae61131a59bdc4e0f399d064a4a8574bfbe763dc0bc5b34cf0e5","target_edition_id":"edition.r017.id-id.draft","target_line_end":705,"target_line_start":688,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[688,705],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"980e3c13951a2ffb9f3aa68de4cc3c53dfc49d5d520f7fd495af031d82d5ec1a","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-065","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":65,"source_content_sha256":"45890f1b02c67a717b2dfe281332fb31370fc3964c2c538b7d1fbfa54628d559","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":707,"source_line_start":707,"source_local_id":"block-065","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":65,"target_content_sha256":"149a287d81866173175a715357a933b89ef365da1a8883dbe02bac20e79965c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":707,"target_line_start":707,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[707,707],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ebf82ee353f823a579759441d30fcd5ca70166ed61f63cc7132400c3cc46b72","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-066","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":66,"source_content_sha256":"7a97503fd6add6376c4ba8327948b14f41fde036a15f3f79ff6f7fa4273d9df0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":720,"source_line_start":709,"source_local_id":"block-066","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":66,"target_content_sha256":"7a97503fd6add6376c4ba8327948b14f41fde036a15f3f79ff6f7fa4273d9df0","target_edition_id":"edition.r017.id-id.draft","target_line_end":720,"target_line_start":709,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[709,720],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bf53f248c5670656b9bac9b45a82784fe55dd03295f3e0046b31d19187418097","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-067","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":67,"source_content_sha256":"bcae185ef78ebadf09075eaaa0ef58d465b0dc64831ac139324167d0608046c8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":724,"source_line_start":722,"source_local_id":"block-067","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":67,"target_content_sha256":"bcae185ef78ebadf09075eaaa0ef58d465b0dc64831ac139324167d0608046c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":724,"target_line_start":722,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[722,724],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"55eaa45ff711873da76e6914c76da1651e1d570b827372bc235283fd98bc5c8c","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-068","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":68,"source_content_sha256":"71f77034bd6c19202c12ff7163caec2475f798fd3c7e248c9d2dd52cfdde6db0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":728,"source_line_start":726,"source_local_id":"block-068","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":68,"target_content_sha256":"71f77034bd6c19202c12ff7163caec2475f798fd3c7e248c9d2dd52cfdde6db0","target_edition_id":"edition.r017.id-id.draft","target_line_end":728,"target_line_start":726,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[726,728],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02351a8064bb41e838b8a353ae9ee6732cd4ad7d35f1e0c7e5a1939e500f07a6","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-069","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":69,"source_content_sha256":"2800d7aa914528fc4e3ae534a9c10761b23d8c62507d286e9047d61303e3468d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":732,"source_line_start":730,"source_local_id":"block-069","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":69,"target_content_sha256":"0e2c0fd73df3d9485e1ccaccd0e6c2c3879b80f0df584ab41815bafc0fde4e1f","target_edition_id":"edition.r017.id-id.draft","target_line_end":734,"target_line_start":730,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[730,734],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9821b31d22a3bd9495d26a1541c2e2009c5e5000e6ea25cda1a9fe0b45e77064","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-070","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":70,"source_content_sha256":"d6f5ec72844a98df9ee3e30021f78ae7d8779575c075ba1b6840c3d9e89bf902","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":745,"source_line_start":734,"source_local_id":"block-070","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":70,"target_content_sha256":"03522726db0276b630752c6a31c23a0e68a1e1fdb1864b7f241571300dfbfe1a","target_edition_id":"edition.r017.id-id.draft","target_line_end":752,"target_line_start":736,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[736,752],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"56a97b8690c726afedc8ecbf329f8f8f70221667c5af7ce65dbb12bde36182a3","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-071","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":71,"source_content_sha256":"5a262673e9eae1f62b3a48993c0daa6873bdf5a3f235c2ba885a0926e59df75a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":772,"source_line_start":747,"source_local_id":"block-071","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":71,"target_content_sha256":"f2b49943196fa6acbab367ac8100148babeb36bb20a2926427120f9dbff2ad89","target_edition_id":"edition.r017.id-id.draft","target_line_end":779,"target_line_start":754,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[754,779],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a72e11d6f96654a005ad33459465c6ddb5c17a6c5ffb4d9d9e712f0e0646d98","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-072","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":72,"source_content_sha256":"10e866450b2dc15720bbfa0214c8b85bde3054252a3a77cffdcca302fe6373ee","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":775,"source_line_start":774,"source_local_id":"block-072","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":72,"target_content_sha256":"83d07595f72aa23eacb3eadcd78dcda7b4876dbc7c08f0115cdf6a0ae7042427","target_edition_id":"edition.r017.id-id.draft","target_line_end":782,"target_line_start":781,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[781,782],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5a321df751d17f9a523c434d6e04e9e71bf5ffb8c549d1a89046345830b869c1","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-073","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":73,"source_content_sha256":"138866af1bc3ca895702bb157cc88a3a401e3f11f066b5351881ca781414f78f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":778,"source_line_start":778,"source_local_id":"block-073","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":73,"target_content_sha256":"6e26ccdf763753ba71d6326d854cff070bbded488e92fa3cbfe1bc3034d88f83","target_edition_id":"edition.r017.id-id.draft","target_line_end":785,"target_line_start":785,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[785,785],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c6df79b5eeaeca3164e9a3b34726cf9b9a54a4e0cd7bda4382c9ee9d6ae6bdc","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-074","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":74,"source_content_sha256":"d250e6a53e667cfd543be8f7be94d0b90ba0064d89683f4e32de2ce88149ef28","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":795,"source_line_start":780,"source_local_id":"block-074","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":74,"target_content_sha256":"0ff4ef79ccd3e92e0d6f8ce08a0862370d7ed60318279bdcb36b7371d93efd1c","target_edition_id":"edition.r017.id-id.draft","target_line_end":802,"target_line_start":787,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[787,802],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b6470f2ea48fd67986fe00a031b10c12d2ee7ff50105beb2828d52adccff6850","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-075","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":75,"source_content_sha256":"aab37fe43b59011af08cd969d52031ddbdc0cc14415d22bc931ae074f6932466","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":797,"source_line_start":797,"source_local_id":"block-075","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":75,"target_content_sha256":"095d92c127a0175bcbe3fe5c6dd455b22a2838f22f0351b20309042549b39cd7","target_edition_id":"edition.r017.id-id.draft","target_line_end":804,"target_line_start":804,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[804,804],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"517646af36759c87c4f4e8cd49a64e249b47dd49b8a32af5ca0e7cc70f47a7d9","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-076","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":76,"source_content_sha256":"ea462cf337007e2bcc33350788b18e6f494b186fb7efc01109238637ec42c1ad","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":806,"source_line_start":799,"source_local_id":"block-076","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":76,"target_content_sha256":"ea462cf337007e2bcc33350788b18e6f494b186fb7efc01109238637ec42c1ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":813,"target_line_start":806,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[806,813],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"487a36b1c576779132661281f7c8895d6e71653aba1fa39a1cebb67cd70a9399","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-077","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":77,"source_content_sha256":"fb6a8e5929b7bd701e2ce4c684d5cd543f38db2114e5807a9413ac7960792de6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":815,"source_line_start":808,"source_local_id":"block-077","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":77,"target_content_sha256":"fb6a8e5929b7bd701e2ce4c684d5cd543f38db2114e5807a9413ac7960792de6","target_edition_id":"edition.r017.id-id.draft","target_line_end":822,"target_line_start":815,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[815,822],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d246d1ed317713cab2b6206ab8a24b36da6eff87e2611561d721c6e87f767068","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-078","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":78,"source_content_sha256":"f3469fb2da80b35e7026c5174a51b87621f34b611a56c1e5dc0aadd5ce23f7d7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":817,"source_line_start":817,"source_local_id":"block-078","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":78,"target_content_sha256":"11b7244bd54869ae5bc9f1f382440aaeb089f1055b5f9e3611e93950dcc90117","target_edition_id":"edition.r017.id-id.draft","target_line_end":824,"target_line_start":824,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[824,824],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d348c5f6821fed3a642001375abc96af9b0861986d4634978d505f4dbc0be923","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-079","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":79,"source_content_sha256":"98a6253235cf5b5f8e9f5630bfa4e852b89900f305cdeb7e373cedf4de461e74","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":823,"source_line_start":819,"source_local_id":"block-079","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":79,"target_content_sha256":"c2a0e4cc9cbf876b03ba544561cbbe8644688c7702a93210b221419dcc164fcf","target_edition_id":"edition.r017.id-id.draft","target_line_end":830,"target_line_start":826,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[826,830],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"340d8d4565e0227530ae46ea717d09b843507f4c44b50f29d0cfa1bd78dd5196","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-080","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":80,"source_content_sha256":"a2eadd365af1d992e0c3d3085255c19c7f36abca3ed7b278bd42376c513cf594","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":832,"source_line_start":825,"source_local_id":"block-080","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":80,"target_content_sha256":"752f3c7f5c2bd6bcbdc7ffb48ef162c78ccb1037415f094ce011c083bfc6af4c","target_edition_id":"edition.r017.id-id.draft","target_line_end":839,"target_line_start":832,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[832,839],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"08a3ccb40c07812a4aa8255a2ec6f869e1914f3562095b50d740fccb67855ff6","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-081","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":81,"source_content_sha256":"9a851e1abbd221d14aefdbc4e83c832aafe3dd9e59e7022cc9ec8593133f3453","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":845,"source_line_start":834,"source_local_id":"block-081","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":81,"target_content_sha256":"c1e20df5a37a71042736f5ebb66d1d2ac9f156b9fa953de5f6248f7c90d9db60","target_edition_id":"edition.r017.id-id.draft","target_line_end":852,"target_line_start":841,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[841,852],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d5d49bd739f93526f360cb52fd9a5af05c327cbfbffe01e6cc924cdfaa4a5c7","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-082","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":82,"source_content_sha256":"96a1ba88e813ee84f39e5966a95bfe17386202c0c1dbfbc8066e7e5603865cb6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":848,"source_line_start":847,"source_local_id":"block-082","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":82,"target_content_sha256":"74c9897361d4989b770c375e8dde894f6b2f5f978eff49edfca3679e98487b6c","target_edition_id":"edition.r017.id-id.draft","target_line_end":855,"target_line_start":854,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[854,855],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"399cded9121014a73dd4c16c9cdff64685909f6e27a633ba82eb822f4a4e9393","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-083","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":83,"source_content_sha256":"035701cf7a52fedfa37e28a4737e0f6ba424d34269ef31282d83c7170b1e06ae","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":851,"source_line_start":850,"source_local_id":"block-083","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":83,"target_content_sha256":"4c3b4c9ecd5a8fcdaa567395759c4cf9db1eef526b85bec5fee459d705e93bab","target_edition_id":"edition.r017.id-id.draft","target_line_end":858,"target_line_start":857,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[857,858],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5d1d8a049c1064888f9a51e7c0f5c98a4e90984f1eb47d5bc5e85fe2d2c4cec","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-084","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":84,"source_content_sha256":"1654b9dea85794a8692a285ce9eb15729bbf49bf7ab7f2ed92984753200792a2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":853,"source_line_start":853,"source_local_id":"block-084","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":84,"target_content_sha256":"da119d4aefa571e2fbeca064ab3d1bf03c780dfab13a9e19196fd93528875955","target_edition_id":"edition.r017.id-id.draft","target_line_end":860,"target_line_start":860,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[860,860],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"25bd506dc8031ae1ff07efe5e3a48c28392c49a5185e9a7a579c1c843696344a","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-085","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":85,"source_content_sha256":"066818f30d1789c248e4e5924e9f1b0ee3649f77b9fd2db2d28dd3277d6b9796","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":855,"source_line_start":855,"source_local_id":"block-085","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":85,"target_content_sha256":"15944f4799b3d983d7ad59481bcfd0d1e375172e230b92530ef18ebe7906805b","target_edition_id":"edition.r017.id-id.draft","target_line_end":862,"target_line_start":862,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[862,862],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"381bcb6646ff79062491996b1d76db10c9b8a9d400869e3e97331811085ff0f0","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-086","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":86,"source_content_sha256":"1898657bfb9bc54a4c212ae615e2f31eeae24f5957751f551befd77f80aea033","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":866,"source_line_start":857,"source_local_id":"block-086","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":86,"target_content_sha256":"1898657bfb9bc54a4c212ae615e2f31eeae24f5957751f551befd77f80aea033","target_edition_id":"edition.r017.id-id.draft","target_line_end":873,"target_line_start":864,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[864,873],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6f2b2854956ff5658cf0d08e7ed28dfec8b11442b0279afba3bedb507cb3afb8","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-087","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":87,"source_content_sha256":"1ab1857f2c519c3b46e886fe19d971606c35b7fcb13fceac8833c1779890f674","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":868,"source_line_start":868,"source_local_id":"block-087","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":87,"target_content_sha256":"841a903d490476fbe26f36da3c49a8942538f5e84d2c3fd0fe510a7676bb87bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":875,"target_line_start":875,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[875,875],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7bd36859bce3ea4a574f20ef393c95d72b9797cf3eba3b3eacc9c3c8da60f7e","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-088","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":88,"source_content_sha256":"36cfb20f143dbd9ed8f6cba32e91584cba3831c3686b3c0dfd878432e8afcd25","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":883,"source_line_start":870,"source_local_id":"block-088","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":88,"target_content_sha256":"22c111622bf90ae3c370da699d2ce70d4600ab8794c8a56f3fd4d57bbad7a0db","target_edition_id":"edition.r017.id-id.draft","target_line_end":890,"target_line_start":877,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[877,890],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9fc3c50a07674acfe2b161ba8f4c71548a511c2bf6ed7577db5b50ecf7103af4","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-089","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":89,"source_content_sha256":"a9a3cb4d23b4517e9e8323f9757449523ce996463c0be3735d8071aabe88bc09","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":896,"source_line_start":885,"source_local_id":"block-089","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":89,"target_content_sha256":"efa81f6eba641530afe3f30d258a24166ae09c80930f61d3917e2030fcef5eb7","target_edition_id":"edition.r017.id-id.draft","target_line_end":903,"target_line_start":892,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[892,903],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1702bd357cf1543a1734df3355973a11ecb3b7c6f0f397569a5c1a8ba5498b1f","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-090","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":90,"source_content_sha256":"1da974eb250f9ee677db6df74190d245945a3459b8bbbd80b325e201396cf4cc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":912,"source_line_start":898,"source_local_id":"block-090","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":90,"target_content_sha256":"eb5fde51b57eee775f4c1b07d3415cf113a29b80cee47d80cea4b6d2035259d1","target_edition_id":"edition.r017.id-id.draft","target_line_end":919,"target_line_start":905,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[905,919],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0733533871c103d44a79fd6e679359772c6c379dcaa34cd51dee3b15edac6f10","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-091","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":91,"source_content_sha256":"e33be30b17662e0d4e1c7dc3c2eac32c4beb3a99d3e468305cd6937d29d9224b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":934,"source_line_start":914,"source_local_id":"block-091","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":91,"target_content_sha256":"3e656a5b6642c62837716a66a9cf1f94b9480e14683f4268dd6f8feb6caf261b","target_edition_id":"edition.r017.id-id.draft","target_line_end":941,"target_line_start":921,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[921,941],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3e5952142384fd6625568fd6d89041095648b6d1ce2316842e1aefa44eefbea5","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-092","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":92,"source_content_sha256":"2ac46e9707743afd99ae9d67b4d99ffce4b7a982de6d8099d1ed51720cd00f16","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":944,"source_line_start":936,"source_local_id":"block-092","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":92,"target_content_sha256":"b1989f4edc2c59e42f8ff084ad1b53de9f08b3ca0bac053d03ef944c1c667e7c","target_edition_id":"edition.r017.id-id.draft","target_line_end":951,"target_line_start":943,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[943,951],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb2e9b47fa42db54716a0201d570b0b3b7cfd9a54ea35ba6ea29870dd9217b8d","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-093","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":93,"source_content_sha256":"81d4f5cf6ec44640bb428fb4dd5bdde5119b12df9c7ae80f36588763964b8880","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":959,"source_line_start":946,"source_local_id":"block-093","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":93,"target_content_sha256":"81d4f5cf6ec44640bb428fb4dd5bdde5119b12df9c7ae80f36588763964b8880","target_edition_id":"edition.r017.id-id.draft","target_line_end":966,"target_line_start":953,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[953,966],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e0b9aa4361676c7525256cf317a8cd145705b51c191eba661109ec162a03d89","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-094","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":94,"source_content_sha256":"b0dd989947d27737d84310fca2c751ba9853694b9d4f33d2c828311703c609cd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":982,"source_line_start":961,"source_local_id":"block-094","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":94,"target_content_sha256":"85463b7ccc089cc34b7455f19782571ba61a10e1223716302b1bd91014dbccb9","target_edition_id":"edition.r017.id-id.draft","target_line_end":989,"target_line_start":968,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[968,989],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d598bef9c259bf5762aba44348b4fd1357240f606185b438bd15180d8a64c251","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-095","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":95,"source_content_sha256":"ca0addd9a7724572d4cfb4537ad47587a4c00fa068a5af6019bbf5028c0a48b0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":985,"source_line_start":984,"source_local_id":"block-095","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":95,"target_content_sha256":"5b9068ca76a0b1cdee486f402427f42578bc822620d0392a0ca532496d360697","target_edition_id":"edition.r017.id-id.draft","target_line_end":992,"target_line_start":991,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[991,992],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"988df377725ebfd473029162a8ff17b208951ddbdd4fe0f25ffb8847e9358f9b","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-096","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":96,"source_content_sha256":"7b07798c7c2d0f2c6ee86045615cd926596040d6c178f0fa624d4aba933a807e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":987,"source_line_start":987,"source_local_id":"block-096","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":96,"target_content_sha256":"8a30e1f4a6e3b9c151a2945adf0ef4ccc3de0399d8aadd9cbaf0a18d198a3aac","target_edition_id":"edition.r017.id-id.draft","target_line_end":994,"target_line_start":994,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[994,994],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"472d7421bdf5a026e793f41dee17554deba42fa4d4f032d29a7ba836e36f81b4","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-097","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":97,"source_content_sha256":"5dd77d58511b3c0e3d6773670e7249e4e282f59bb4014b1a6909b30c5766e830","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":989,"source_line_start":989,"source_local_id":"block-097","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":97,"target_content_sha256":"eb6d02d5c98682f1eeab3098b5c2a09a05fab5683ca2380d3b0cd979a42db9a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":996,"target_line_start":996,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[996,996],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a38f795461062bb374b65526627426ec58d1b804fe7df4aa6768d6d859bd21cc","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-098","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":98,"source_content_sha256":"bcb0e369a84a058ccce1b820401b74c3ced97bbe74f0ff60bc5406df6e79f8c9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1002,"source_line_start":991,"source_local_id":"block-098","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":98,"target_content_sha256":"70ade24a1ab18a9ba226dbef2fd911e5b8d47f504aba1d2feca833fd43694998","target_edition_id":"edition.r017.id-id.draft","target_line_end":1009,"target_line_start":998,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[998,1009],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4bb6b34efa6c4143c61f620f9a41d9e7f286a940a3f9418cb6493151267b950d","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-099","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":99,"source_content_sha256":"1a473138d8aa237f09c6cf79694d111c187dad645e8a53231114e1f82fd2e36b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1015,"source_line_start":1004,"source_local_id":"block-099","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":99,"target_content_sha256":"bee220bfdb51853ede4d6d0541fcc9ffc8b967e1e60a23c3bde9e7ab6c87c194","target_edition_id":"edition.r017.id-id.draft","target_line_end":1022,"target_line_start":1011,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1011,1022],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ba77224c33880e2616d69dcaba63d4293854724cbae475071543cf6f4a3c37b1","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-100","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":100,"source_content_sha256":"74440da54975bc51933a60e0971a1743d657e228c6ad301d69284df9581347a2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1032,"source_line_start":1017,"source_local_id":"block-100","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":100,"target_content_sha256":"e386a350c176821d87e71c53fb44579664c7232fd21fcd59fb4a9fa6ab7015b2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1039,"target_line_start":1024,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1024,1039],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d281b9c03c44434395a7268b8cdf014450be27c8bb85cfc842956362e384ee3d","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-101","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":101,"source_content_sha256":"fe0f0916570f4dc1b465846c04fac63fd8aca27e9a4fb14e5b11b1214ff70c8a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1051,"source_line_start":1034,"source_local_id":"block-101","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":101,"target_content_sha256":"fae452ae88a9a2f917a2e6a405fe0e799d9bd468f0e09613f5705c28c588067f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1058,"target_line_start":1041,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1041,1058],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3dd192bd38a8678f12736b8864b83b928423fbd9bfdc5c3f42c03dce188e07e4","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-102","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":102,"source_content_sha256":"7d3387215054ecc7ed201021364c25c837c1849c98a27e0f4754f7fa0da69cf9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1080,"source_line_start":1053,"source_local_id":"block-102","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":102,"target_content_sha256":"723787b3a9e201bf5d24108224aaaccff41da19901492f3bfb594d2849df04de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1087,"target_line_start":1060,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1060,1087],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64dcaf7e265cdf55f8d8587b84ae7a2cdaf239f38b3ae94aec24b81eec446a46","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-103","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":103,"source_content_sha256":"1823dae6df5e9e227423c7f5268087c1fee86ca49d2fcd91333a626699f1ee83","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1087,"source_line_start":1082,"source_local_id":"block-103","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":103,"target_content_sha256":"90aa984be58f96fc4787f8e9cafe508e38446ed4a0be1c97161860cdad1b8d0e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1094,"target_line_start":1089,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1089,1094],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"51b6904ae89610cab2e5bb8b2c833297ee97cffd770dd552d11a9615e2b82755","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-104","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":104,"source_content_sha256":"bb0c107a8242cb171758bcbaa8a2ca66bbdd65d3e7c1bb52b33566afcd53fba4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1089,"source_line_start":1089,"source_local_id":"block-104","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":104,"target_content_sha256":"8c977fec3e1607bd081f21d4fb8229245f4e54c9d5e21651cb7dd2662f0eecf3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1096,"target_line_start":1096,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1096,1096],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92c3f9186f9fc501fc2061c6918714daa52fdcb2794db3f86777102239b38596","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-105","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":105,"source_content_sha256":"716f9ab9e82778149ef569ac98c6ab411d439dbf86f4a7e22b4ca524c49ed737","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1095,"source_line_start":1091,"source_local_id":"block-105","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":105,"target_content_sha256":"d7da5b1727f8d1f4f479e42cdae071c91c736394723c2acd9540e525e90bf578","target_edition_id":"edition.r017.id-id.draft","target_line_end":1102,"target_line_start":1098,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1098,1102],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7492fcf4a36cd726272278a02598ddcea3cc0f5c5356356bad5d73bcd2fd8930","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-106","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":106,"source_content_sha256":"1e4ccc9ccba9038d35b6d9ebed7b22602bc3cbe77fc62260abb1d7f124da6cb9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1097,"source_line_start":1097,"source_local_id":"block-106","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":106,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1104,"target_line_start":1104,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1104,1104],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a6b514d0e5938e44a2d5c952387e98161aade1f1fd89ab1273e4854a842475d","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-107","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":107,"source_content_sha256":"a6c18cd910118035e9ea010f2ee79c798b3efbc009700c989db4ce6c1d1e71cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1099,"source_line_start":1099,"source_local_id":"block-107","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":107,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1106,"target_line_start":1106,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1106,1106],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f5e06e92650671250c54892cda3cf8396fe58e49e40d84d07a816143c3feb8e","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-108","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":108,"source_content_sha256":"cb2ebfd4dda1544b579d4fa4f379d73bda27f7ec671dbb9cc2b163dcca15af31","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1117,"source_line_start":1101,"source_local_id":"block-108","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":108,"target_content_sha256":"582e74d28de1b5e25cae430af796883cd51655198b3f4a19fe54e5439b087bca","target_edition_id":"edition.r017.id-id.draft","target_line_end":1124,"target_line_start":1108,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1108,1124],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"554883221959e7da14cb6dfa113233a975a85b26c7b53ef0145e45812d037ce8","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-109","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":109,"source_content_sha256":"bc7951339ea8394e6d0ad598dad625fd7b5e9568f19211954a4cfcdae20a5a11","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1123,"source_line_start":1119,"source_local_id":"block-109","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":109,"target_content_sha256":"82fe087a51f6f51c8769c835a91fd10117410e186d619ccc783fe2da569c02f7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1130,"target_line_start":1126,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1126,1130],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7397902cffc0bd53166e8253ce4bbeff6e599dcb27190f1e4869f0aca3a65a2b","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-110","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":110,"source_content_sha256":"93fc5c6d45fb929a0d24d3ec538534b3c4536bd4ace204f0304c6739f09328c7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1143,"source_line_start":1125,"source_local_id":"block-110","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":110,"target_content_sha256":"98afcc2b9626fca507cb2e85407c0ca60ef6a54a5f641b450aeb136508f0632e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1150,"target_line_start":1132,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1132,1150],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c0b6e06d120179a20bd0798081d6918ef4898896101d3df6bc3a0e14bad9ba4","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-111","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":111,"source_content_sha256":"befe6892ec44e33f7b364305fbcec8fa778e09b9cb39adc300c1dd14bcf212c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1145,"source_line_start":1145,"source_local_id":"block-111","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":111,"target_content_sha256":"e3f87b06f7a641556fe14f6828c82cf2c975b6a9ee5826c46c7cbd0d343ca7a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1152,"target_line_start":1152,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1152,1152],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b5b755fc26b5d01b8ec1cbe69e3dc57ca2e8eaf9da2b3475f209e27c5830b0ea","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-112","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":112,"source_content_sha256":"7cf08bfde89e3aee685577b5074b543b67f8d152d5becf1a5edb20f3fa535d10","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1170,"source_line_start":1147,"source_local_id":"block-112","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":112,"target_content_sha256":"86143b90399260acfd8696f5dc9f1d3ca8db269a97fa98e1db4237a31fccb92f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1177,"target_line_start":1154,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1154,1177],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5006f8f994dbaff9e644272666aebc7819e4b88a17d07369acb1c8ee69c99f61","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-113","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":113,"source_content_sha256":"e3ddf253b30d4eb7fdc2f3ee007a501ac0a0ff652059c2e82948cc19a4cb998d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1196,"source_line_start":1172,"source_local_id":"block-113","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":113,"target_content_sha256":"fc515aa327884e315ab4272a9253b3d1b036608c7a7afc04802501f5b43bec6f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1203,"target_line_start":1179,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1179,1203],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"233bf7959fa03af4ca922aabbabe5ab1b2469af464b569bcd3e7f0d42ad534ed","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-114","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":114,"source_content_sha256":"154b074fc7bb6491bc08207acaba98c20c7240f29d4fe13aa8a6d565c748ede8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1218,"source_line_start":1198,"source_local_id":"block-114","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":114,"target_content_sha256":"5f23b3a3d3b8fa888371ef3d7785085725fea28785558a360e323906f6d2d069","target_edition_id":"edition.r017.id-id.draft","target_line_end":1225,"target_line_start":1205,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1205,1225],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8198fe85632bbb67ba481702b874c301b0d82f2a39bb0b077cb6e4889f289bbb","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-115","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":115,"source_content_sha256":"c8e278add1d6c18f659152466edf4e82568ebad5aaddedeaeb2d654335866d4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1220,"source_line_start":1220,"source_local_id":"block-115","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":115,"target_content_sha256":"5a7c51fe019c052d866e25f75541baf5ff511cb9d0d48737b288dcbb3fd56de0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1227,"target_line_start":1227,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1227,1227],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"87217876e4704c6af090af1c29a9c10fb38deb2d208a908a80ad8c817b8e41b4","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-116","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":116,"source_content_sha256":"e2b72d74fa23744034ad74c64bed30868761e12d338205ae5a68da9bd38dee13","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1230,"source_line_start":1222,"source_local_id":"block-116","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":116,"target_content_sha256":"ef8e47b7eefb22c731e89ba84da2e21b0a770d99b0795a2adeb4950e0c360ec9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1237,"target_line_start":1229,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1229,1237],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ea97b80058b9491da16a8d3db0bf9fc824cb0618dfaa75506ce8a712adc48012","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-117","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":117,"source_content_sha256":"e4858d4bc0b492917c4ca3534363c12cbd30c44b589419773189b07113246568","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1241,"source_line_start":1232,"source_local_id":"block-117","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":117,"target_content_sha256":"5ddf28d14ecb42cabb087f1df3a16a1a43f3a586ec1b5d402af40412749da862","target_edition_id":"edition.r017.id-id.draft","target_line_end":1248,"target_line_start":1239,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1239,1248],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5de969d4f6fdd6bed1d481643d513d08a550d5cafba741bf143e6998ccc0b328","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-118","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":118,"source_content_sha256":"4be7db13a50a6cf69022429255b203425a63979cca3cb7d03e8476641e361703","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1243,"source_line_start":1243,"source_local_id":"block-118","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":118,"target_content_sha256":"7c4176f9ca89c18c50f3aacc3b3a978ec2d874e6385a52e4b13e5c4d0a343459","target_edition_id":"edition.r017.id-id.draft","target_line_end":1250,"target_line_start":1250,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1250,1250],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a769aa6bbd3744a7f213855d167526cb7a2000844a8e36b5e282ae807a06e995","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-119","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":119,"source_content_sha256":"4f78ec5f756e30116c8ede307c96f53cc742177b2892690fbc4e98e27d1fd058","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1253,"source_line_start":1245,"source_local_id":"block-119","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":119,"target_content_sha256":"8f1dc1d54e29eec77479303f8f4616eae6c679f17181bb68763d4db98b5c2f0b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1260,"target_line_start":1252,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1252,1260],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc141ab84cb14efe5bd76a0e9c4e0d375ba52b5422d22882139c9bae869f78d1","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-120","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":120,"source_content_sha256":"070c82f595a58c404017d08d60ef7ee4b27c5877e128e391ddb9e2145cbe6910","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1255,"source_line_start":1255,"source_local_id":"block-120","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":120,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1262,"target_line_start":1262,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1262,1262],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a05667c731b7b3dfea8e9eab67dba3277bea3228a546b8bdd0e159e278a1f739","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-121","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":121,"source_content_sha256":"72ef6ada10241b97607bbc22b2d9249f7550cf4638f6471c0517d1737029b0ff","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1292,"source_line_start":1257,"source_local_id":"block-121","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":121,"target_content_sha256":"62a9a64f5405f919dc079995dd6d01c27a9d8d0eca0450ca4f3f9e86f780b4cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1299,"target_line_start":1264,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1264,1299],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"302f4bed61c1e86c5d0057dd15cc62b6c198c019d3434aca1e21d252f86322f5","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-122","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":122,"source_content_sha256":"9ce66c99e0aa410c2b25f26bed7884ff9c428f32aba35ff4087c8d6a93aa8612","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1310,"source_line_start":1294,"source_local_id":"block-122","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":122,"target_content_sha256":"abc2379665f8aef68d1768b01118d387e30d1872992c6fcf16f9d816b7fbe684","target_edition_id":"edition.r017.id-id.draft","target_line_end":1317,"target_line_start":1301,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1301,1317],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ad18657723d9e7dffeeba875cfcf4ca4d42dc4491003b234ddc06716f111ba7","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-123","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":123,"source_content_sha256":"5cd16c728ba57095a1cf037c8bea2215655ccbb6b3ffef2d2cd9f2a81a0923b5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1328,"source_line_start":1312,"source_local_id":"block-123","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":123,"target_content_sha256":"453b40dd5f67d4ecbe7df2220927406b9a0206b6108f585c8415338cb2e40705","target_edition_id":"edition.r017.id-id.draft","target_line_end":1335,"target_line_start":1319,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1319,1335],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5445b7138c12f4104a31b24ab3f72eaaa9940cc28cfd01f2bb5e93838ec9538","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-124","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":124,"source_content_sha256":"5c1b600b58cc1e2946894d2f4d516805d3da8269b6c4920dfd6129d0c8d15897","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1335,"source_line_start":1330,"source_local_id":"block-124","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":124,"target_content_sha256":"5a525c1bbc8ad35a81342e6484c92eb996ae297b5d3d6e7cb57285b71423f3f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":1342,"target_line_start":1337,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1337,1342],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc4fe2aa9f933715c89ecd5b94986ff813e755856b2961e4df4a887fe59c9e10","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-125","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":125,"source_content_sha256":"fd8685ac3e44f2cca7f837dc0aba3b1e5750c835ab3687f31a965374db9885eb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1337,"source_line_start":1337,"source_local_id":"block-125","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":125,"target_content_sha256":"bccfb35fc312c129259935d822636c77e8b603e5b1fe3d7ecb89c1e7cb781d90","target_edition_id":"edition.r017.id-id.draft","target_line_end":1344,"target_line_start":1344,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1344,1344],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c735a1e5f8721d5ee6d56b94d37506394a7c3b1e5bba9fcde887d1844a4238d0","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-126","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":126,"source_content_sha256":"e7226bd1113738d5946b252c08f705b9f00c44179b9873f0b9a6a55c7fd4dcbb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1339,"source_line_start":1339,"source_local_id":"block-126","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":126,"target_content_sha256":"dce1264c6f8836189bc0b8e2d6271e26aa8845da33664dad93a2025cfdaacb3e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1346,"target_line_start":1346,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1346,1346],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9af48656f99f3dd7f36af035bb6c8ba432ddc36778eee5ad680e0da1b4320eb","concept_ids":[],"id":"segment.r017.book1.ch08.text.block-127","locale":"mul","parent_id":"unit.r017.book1.ch08.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":127,"source_content_sha256":"da420a1e0a14609563c0c334e123bde408771b783d75666f96608f16651683b6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1342,"source_line_start":1341,"source_local_id":"block-127","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":127,"target_content_sha256":"4cee3795a1ff9f2cabdabf0ad70356abdeeac69596a12d00571ab73e25ec5ea9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1350,"target_line_start":1348,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch08.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1348,1350],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-matrix-version.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3476aca197423eb85d36f4c2cb1b27cc8789cf01e9ef444e9274d78a37854f53","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-001","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"79a02cbe05b8e128d3634f13bf2f3f878fa280183a570176ff8ef4d67e8df15c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":8,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"3b4ac24bcbd295ef6fb4d20acc60001b2f354fc0888ba7028dd401c51f224286","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,8],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a562fe248374aba6b3e6e1fa09fed6d750c52d1d35f4d8db5bd19937c73db770","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-002","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"30905f18ff730dd7c53a0637b5cc484852f04f87d48783537378ada2e3192d87","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":22,"source_line_start":10,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"e3cd0bf68d8935c77b1a4ea116188986ab2c02a7ff75bb6448ae12decc017bd5","target_edition_id":"edition.r017.id-id.draft","target_line_end":22,"target_line_start":10,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[10,22],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a4e25f16140e2b6588d715b307c4b0f8eb31ccf7e975480044424594a42dbc4","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-003","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"9c7259ff05ea62d144fe6ad77e2227ed10923d0e5ec7c05c21e41275b1c6d3d0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":24,"source_line_start":24,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"0897c7d4fcf8e9e23377ee98bd82cfcb9aa5d3641a30d951f713209fbb98bc22","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":24,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[24,24],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"53c10ab7f7039a997302271814e9938433b930324c6bbdbd77c4db1429415a3d","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-004","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"899e47b275741e21ae455e2d390053c88f9c504626cfeda7cb963fe8de8a1de7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":27,"source_line_start":26,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"7c6c96bb83ca5e9ccb763d58c7545a259976a09cf1dc5438e2aa639a1f7ddf78","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":26,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[26,27],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ca39d9e3185c1cffa908193503ec5451e637dcadb5b4825f9d3c12825f81ccd8","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-005","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"098eec1d85e5b9e90bb9486bb64fcd823800822f970038fa4fb792dfe4024fff","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":33,"source_line_start":29,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"3846d25ab421c8d2ad543b36793a1e6a78910c994c9f61d6cc018e0eec047ad2","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":29,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[29,33],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f47768584ec415ea8ce40da149ad3618ec62f774eb4e29a12a8a9208dba64b42","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-006","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"fbe61614a8859afa80d2e93df63ce23d10cb1a28b1bcb01e3ecb656106910283","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":39,"source_line_start":35,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"735c0526b70e902511cb7dbf151617748ef3dfad46d7315cbfe59eb024b65aad","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":35,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[35,39],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8bed5074c11444e3cad616ccc8f64a62b9de50188db39242fdf0506270302f99","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-007","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"e4ad391e72465ec929526806f733e63f66e2b827e27d685ebf732933aa13da72","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":44,"source_line_start":41,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"56eebf501a39c4b610dda60dfa3aae6e6f88085738216d7963b024a708b30d24","target_edition_id":"edition.r017.id-id.draft","target_line_end":44,"target_line_start":41,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[41,44],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c4990f88f4f44f6d7f7714b888bb639d6215b543d89aae5dfd089380433f0f3d","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-008","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"59ff3170ee7daacdc0006d027594b95bef5e9bac96ee5e0a5e4e5964a71d61dc","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":46,"source_line_start":46,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"7b56a6ee87813b5a06ccaea0c2447ad45fe13fa142f62e24250b6eb0aa8dbbef","target_edition_id":"edition.r017.id-id.draft","target_line_end":46,"target_line_start":46,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[46,46],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b91238e61cea55835fbe4d6e2dece2c16f302ca57842d16c552de5c223a85ad1","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-009","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"391b8c1bfda00251dbe6902b76af075a49aa0836a458ede301a5131e6ce1ae06","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":58,"source_line_start":48,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"1a5e68b60612456786375641201b635eaf5c1385aba42cfdf41e93cf79ea091c","target_edition_id":"edition.r017.id-id.draft","target_line_end":58,"target_line_start":48,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[48,58],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"516a2ca8e190d6a6933c101f0b8ddcf0f343b4a798efaf7c6363784f6b3d12b8","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-010","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"8d6f4614fc5a74576f2c7534ef57543653e74c3f23c5c62f10fd465d762d4149","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":60,"source_line_start":60,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"cccb157cfca755c1979fabcbe8860d2be0ca3ba25952fed395fea0f52be50703","target_edition_id":"edition.r017.id-id.draft","target_line_end":60,"target_line_start":60,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[60,60],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d7672c352426c4d156542b46a027f8253668914a9fb81b9f3af937a36733f632","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-011","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"a946fb076647f26b454b3f3efa66c0f76af3335fa578be943f8de9f0ad8af9be","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":69,"source_line_start":62,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"dcc45cbf3785816e1b91dccfae8128d183eb1dfd2833e0bcd1b181988bd608be","target_edition_id":"edition.r017.id-id.draft","target_line_end":69,"target_line_start":62,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[62,69],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"382a1b1b3e7b4f1d3d34065e8e1cc07ac705402b5d58fbae2378c3d4f8946fc5","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-012","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"1d6a007c5ef11bd490953ebe1503911ab7b3d2cd36ce54cccf9e3129e3224a6f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":71,"source_line_start":71,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"b8e7607059faabd7a5cf062e6e0e2bf9dab947e2ee0532749c2d24f66e2f6329","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":71,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[71,71],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ddea6d450f06e9c3d9f9d41615a433bf50d32df09f4c4ccc3660f66d9fcf609e","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-013","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"fa1ebaf228316ab43de492fc26173a228179b81a60deac1ddf69c91b489ce678","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":94,"source_line_start":73,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"2cd9c3028453c58321d90ddc3e7d7cf47c6d496f387306b0a38cb5e3f4cb7333","target_edition_id":"edition.r017.id-id.draft","target_line_end":95,"target_line_start":73,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[73,95],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6a021171d4ecb19c0a7ce7e497355b31ff13194094cd7151e89f0344e8313d1f","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-014","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"8d3ea5d350cd7e5d8a950aef535fd8375ae5571cbd79b38915b6c98e88b3e100","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":96,"source_line_start":96,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"f717fd04a77d1b81aa416ede3b939b114270ad7afb371ecce7cb3ac4e3a5b1c9","target_edition_id":"edition.r017.id-id.draft","target_line_end":97,"target_line_start":97,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[97,97],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"13bc739e19bd5880cccf0715dd3a1fa743b1b3c9551f388a665798e9a30de163","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-015","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"ecd1c51d275b1d0b8728bdacf1fab428da67f2d6f3b0305d2cebc48672a4d5c4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":110,"source_line_start":98,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"d375799cca63822f838a4972ce30958deb42518dcd28dee971a08a02c8edb84c","target_edition_id":"edition.r017.id-id.draft","target_line_end":112,"target_line_start":99,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[99,112],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2905e8becb7ae7d8067bdb3c97697f746a5996d2a572be8aaa8bf8bf528d4acc","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-016","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"6273ee2a0a0b247d38f758e08c8f4fedbdffc282448fc81f5395be77d25878b8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":125,"source_line_start":112,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"b1a8ad986e81367b25f4b07a5b3c183b5554c827ab6f12caa77efcf04d7edb52","target_edition_id":"edition.r017.id-id.draft","target_line_end":127,"target_line_start":114,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[114,127],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0200952c1a1fade15db9a036d913a0701f5cf29ec2f339272b8e2f4b9fde8714","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-017","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"8966a7fb69c64537cad16c2cead537a823d64973ced0920bc84d11eda493971b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":141,"source_line_start":127,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"27f148e742227048412cb6df15c1fcc2313eb3818acd5f97b997ed082e5b52e9","target_edition_id":"edition.r017.id-id.draft","target_line_end":143,"target_line_start":129,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[129,143],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5872d9226ff6cbd8db0e1b6e680d112a07fa7c29140819e9bfc6411e8b026e2","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-018","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"f77283d33c08c4122c11fef40bae0e0afa36b2604f09fac1cf996a11041800f6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":143,"source_line_start":143,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"ce2a5ae9fe5488327c8e410384a62a508703a9f79d96c73d4ea6348f8e1b456c","target_edition_id":"edition.r017.id-id.draft","target_line_end":145,"target_line_start":145,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[145,145],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7b70aa249a92eba2f14ac0bec056fa430aad0747f5f3b3f2c2f568d7cbb703c8","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-019","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"bcec208fd2f1e986ba70853b72f9f4c0be9697d7f8f14f89d1f7bb9ad8bf88e8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":157,"source_line_start":145,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"ca825c5a2d5aff19282f60e680dc23e09c8273b6c748a255145b0abb09c505b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":159,"target_line_start":147,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[147,159],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a805be31f37791dd52ab60305933559bfe47f1b166cbdaedfa026e22c80a4fe9","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-020","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"880100ad7bd102494a3e433162652e979151f48a6c2854998b15a649205be77d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":172,"source_line_start":159,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"c2c43b44b9bcc9c9315abd1334fa85f926de5715b61dada2739e3b1a9a2c79f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":174,"target_line_start":161,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[161,174],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aee1a542106df05124784dbdfb4914a86adc8c7f9c83e4f584d9416e62b31286","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-021","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"d5394625754b5ce10a305bdb3832286c15d3ffbc9422e7916ee36d437d91dd1b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":189,"source_line_start":174,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"edf7c9c86ebac77d934641ba00bc59938d6c604383f90cedc7a33a26d6a4af15","target_edition_id":"edition.r017.id-id.draft","target_line_end":191,"target_line_start":176,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[176,191],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1154aed107bf1414fbb65442f1c8c2cc2b02d358209e0a0b8529a4b362a32868","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-022","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"5b7612d295d517e0fb82e8cbc2c2a4659767807cb35fa6b9b5c579224766a1e0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":191,"source_line_start":191,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"e34dac2193a7bf958ec80a52c15f2dd5c14a30d8c6be7cf7fa8bc9f982c7ee12","target_edition_id":"edition.r017.id-id.draft","target_line_end":193,"target_line_start":193,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[193,193],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"73b88c00bf803a4a9285a790180b61eeb8f3f2e5bf27b83bcb5eaabb2cb9c88f","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-023","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"edce78cf237f194908e8d72a22ee52d8f26c4cdd2b80d4e27ca745b610905368","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":233,"source_line_start":193,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"b409cc29c67ffb122c8912617baad82ddf077c2eeb5fd1635c9fb74a872aec50","target_edition_id":"edition.r017.id-id.draft","target_line_end":236,"target_line_start":195,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[195,236],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"50d669dff0e65e8502e5c84f26223507fb9518b553fa070fb2299aa744beaa65","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-024","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"1bd60ad0d79fd8be731cea2f8d982303b9deeb089f21b31605e98da653c0072b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":235,"source_line_start":235,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"b63e26620782bd93af3fa2fa60e8676762847782bfbf801d7ed13e8cc5ab36ca","target_edition_id":"edition.r017.id-id.draft","target_line_end":238,"target_line_start":238,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[238,238],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39718410c53f904e4833dbf0466ec70fb79bfa06ad1191684cc4b7ef785b1130","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-025","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"bd312d9bc6f9769994f2795d7f4100d7e3c84208b704ffda853e7abdc2bf1c80","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":244,"source_line_start":237,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"9be5e334599237399b8bce3a81d4ff7a739b150834ae311affd8080c072ebd94","target_edition_id":"edition.r017.id-id.draft","target_line_end":247,"target_line_start":240,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[240,247],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c60bdd4853627de776448cd8bc1c13805668ee8de6ae9a83e42880f0c6c7fbc","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-026","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"ff01d3693e884f4ed05c2c69da9491215de7a49269629919ba21c899876720ea","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":255,"source_line_start":246,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"52ff63c694e5c28c9ee7c9d1008c6682ee5bdb87d9dceeea16e95f0fed47b2fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":258,"target_line_start":249,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[249,258],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"014ef995d4bfcd3e9337c9ccd31d43d44ad1766333da88133a8bcd695513fbcd","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-027","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"ef50b11c5eb157c29047bfe4f5f97421e9bf07dcb717f49dbddf68389c238359","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":263,"source_line_start":257,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"fb1896aa0d654338d492b5768336414ac451c9912998f0e864adfd93e17f9db6","target_edition_id":"edition.r017.id-id.draft","target_line_end":266,"target_line_start":260,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[260,266],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e39189f02a87d3812767ca9abe16730258143f846b07fed0635eff8566ce28fa","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-028","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"be86214d09f16cab278d776d79ee0b7e761eaafdf68030e74d551ca5e360be9c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":265,"source_line_start":265,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"25e4ed25bea2ba385151ebaa0c14ea113540e686c7be31c16bb40ea3b053fec8","target_edition_id":"edition.r017.id-id.draft","target_line_end":268,"target_line_start":268,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[268,268],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"53baa6ae846738309f021fb46b9088bba119fcada6d184c74ac601151b41a360","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-029","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"b97ae0b879659ec5840a43ce0d1cf2ed108a2d822d6f0318ee5d5deadb6acd2f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":282,"source_line_start":267,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"5686ac651b304943ad7350ae179f554154030461357ef88d37277b095833dd04","target_edition_id":"edition.r017.id-id.draft","target_line_end":285,"target_line_start":270,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[270,285],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"073b3d24b51c76b7f9987814531cdcae515cd0e15ab2eed86717bd690abdc3a4","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-030","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"8204548fdb5b9c15eb2831b81075f958aca71ba1c957a099f88ff9a4ee1b35dd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":284,"source_line_start":284,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"5d4fe9bcce42df825b6c33e664a5c4f916f777ff9b612694213fba544a43dfeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":287,"target_line_start":287,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[287,287],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"617a38d14b375eff25fd74b5e5a23a30cec176a6d4cc3386d1e22b40c7c27a4a","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-031","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"58d6eb099ff9e88d448ed55f2fed51359b9f1e46f7344d927adc1c655a07bf27","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":294,"source_line_start":286,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"ca8cb2ea22ed681e636d94228e8c9f15877a4a19d574ed0d7e4f50578a6181b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":297,"target_line_start":289,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[289,297],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"97859bd367eeb5bd47ef555d5d3b54053afcc58285aa545ac6f6c2c369ce2f7a","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-032","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"e43e0e44c8d089250a5e45500a5520a83bc397b9382d82b9895bee935df4269d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":296,"source_line_start":296,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"c84ba9426f786437417fb902bbe5a99c201b8d29422e55437af9b17891d08953","target_edition_id":"edition.r017.id-id.draft","target_line_end":299,"target_line_start":299,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[299,299],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7aca9e393234e51afcb8b33dd34993405bc6b9806edf1be2ac84c212e8fae014","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-033","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"5cc4c996af6c260e10d530a6c825dc2042b911c17a547c23e1c19655a66feb88","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":305,"source_line_start":298,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"e0425cad3d5cb913fd61c16047957942f7fad553c570a844105c98ea66c1eb2a","target_edition_id":"edition.r017.id-id.draft","target_line_end":308,"target_line_start":301,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[301,308],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f8f0f1ac6ae26295bed9d2de3f946376d963e2344727d8b002691e9b12f21095","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-034","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"cd202b7c5ed4067d6a5d6a863a62f088892d39bd3fd2a77df5d47b7a2b3d349b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":311,"source_line_start":307,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"8de42e34b9a4a75ad7bbd1e167e370aa4f767bf25c5136ea7456843e759f4cec","target_edition_id":"edition.r017.id-id.draft","target_line_end":314,"target_line_start":310,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[310,314],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ed7a0c873be1adbc8e22c0b479c47dd12060ce3d184f7c9917f6f924db9d5ff","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-035","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"fb81507459324668e3fb089cf74b0b2be956dca9853e6a80f1bf94b2c8119b81","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":313,"source_line_start":313,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"c8ea55e59f4ef038ceb132c5f6a9a84f5d57a0cbab6fb04e5feea28c45925573","target_edition_id":"edition.r017.id-id.draft","target_line_end":316,"target_line_start":316,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[316,316],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"79d01f2f3c588848ff1876b71bcda2db65015ada38e4402ef90ce55bee56b1b2","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-036","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"9a06ecba737eeeca2414c3152399685a143b121a85070d46c68e8c53b87da8d1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":319,"source_line_start":315,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"42515c82e3130a7cacd687b91b509a64b99e8c30e0ef6934078f57989a32e12e","target_edition_id":"edition.r017.id-id.draft","target_line_end":322,"target_line_start":318,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[318,322],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"be9ece17bf64d17cf960ff1ad09dc3b55d64c9e2b2fe17e0708e2750476a6a11","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-037","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"931fe2fb514986f37086188eb6e5017588dea074447e14f7e62c631e90cb11d9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":335,"source_line_start":321,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"1dddbb74d39df2ed3dd6f67178fa89bdac66075e74e0c24ef0575eaeef5c2b89","target_edition_id":"edition.r017.id-id.draft","target_line_end":339,"target_line_start":324,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[324,339],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1fff234b43d856f58a3f2ebbc8b0caa2c84e9f06ad2db00cc08aaf140794b5c9","concept_ids":[],"id":"segment.r017.book1.ch09.solutions-manual.block-038","locale":"mul","parent_id":"unit.r017.book1.ch09.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"ac42650bb62459830f4eeb76b7829eef3ba88a821b1367e3bee1964e38950c72","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":345,"source_line_start":337,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"bd9e48e0e6ee12bd0f09e0a1b049b28f6bf57bbdfec2d3f282c8f536de258045","target_edition_id":"edition.r017.id-id.draft","target_line_end":349,"target_line_start":341,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.solutions-manual","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[341,349],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch09.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"30bd322df34f450acddd87e1e0edeb58df9d426cee37dd050d9d25160afe1ad6","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-001","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"d8464d8fdc6eda9d86e408f64ac50c068a95c562165ae76cc6096e57a96fdfdd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":4,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"d8464d8fdc6eda9d86e408f64ac50c068a95c562165ae76cc6096e57a96fdfdd","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,4],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"efded2708cf7e32eec185e30ac12ba8e72bb7f338ef71140a285fa916f43a34b","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-002","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"889dfd4d82e29338c21a4ab75c150492104b0f81bfd9a631c03146ca644b8950","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":15,"source_line_start":6,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"ae50447bb4fa3fe39f1cdb095d26b9b0f15abc87d0528d2dce00ca56b2c2ca33","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":6,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[6,15],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d381075134c1970f8b49b55e4f6b5a1b3bc15792f5007dd1139883e9e28819b4","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-003","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"78503dcab47dfe002a86d70cc616b6bb573421e4b4218390de6229afb324501d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":18,"source_line_start":17,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"704005f70ac364559f51a9356b7fea6c3219659c74a88a39b14834979834ac3f","target_edition_id":"edition.r017.id-id.draft","target_line_end":18,"target_line_start":17,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[17,18],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe3d1c5b001189861e1b41224803b00cc3e5cf08ee008ece40f80b21fe40cbf9","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-004","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"b9dfd9ab1fea9edded2730f5f27805a2d79d9bf806a710216f001182b3c23b07","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":21,"source_line_start":20,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"bf109a492c2df99e7acf92a7357de5a028199a466a3778719c97d8cf4ee8fa05","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":20,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[20,21],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"220bd10727adde82495d5a0621e5cafae408d97605d26ad46c2068e7608fabf5","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-005","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"83182f7b3755832ef1528d8b3ffb6c54fef0767663c7c29ade31be3355da86a7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":27,"source_line_start":25,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"83182f7b3755832ef1528d8b3ffb6c54fef0767663c7c29ade31be3355da86a7","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":25,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[25,27],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de35c02c7caa835611f47257b9cebf40a5083710f52d5c2006f14d9a26142ff9","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-006","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"0b5d8169a5c3e268e64f5a6e43394b440e22857cc7f3af2e3f1608bf8283d04e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":29,"source_line_start":29,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"7fa7703b32aa2e209f8708123df343bd956f088ada44480b639ccafe010c1234","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":29,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[29,36],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23f669724cb2381bbcc613b52799dc2813a53b7901b3aac42c9c693c85db8850","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-007","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"f0e98af63dfbb9cfc5d21ebb12431e910c9e43612efce41f921c0e697a0a534e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":41,"source_line_start":31,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"3c530104ce008f5fe76ade5c217227712c3f638b71437f2de0675e8289c9a5ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":48,"target_line_start":38,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[38,48],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d1e890e3e8ff293983c970b1c66e735cfec3225d3a75c41b59d1a0a119db5b2","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-008","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"daa583d9614e43f113ea1059246e341f144083942d1c9226ad6ad6ae5446437e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":44,"source_line_start":43,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"8aa084cc4caac8d7c98b0c521ae61e333ed9a0fbca66c0f3c6f54876bcbd1741","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":50,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[50,51],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"71a268ccd3c62a90bf4cd769ee5eb032b16312faab51935697b62af65c9370cb","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-009","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"474365c16cb8859815403743e08a5f2c53a110add3922a69500d7ed3f1489768","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":59,"source_line_start":46,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"0eeb48f4cc89c46341f62150eaf7bc32a50d7dc1a94450fc532693176504acfa","target_edition_id":"edition.r017.id-id.draft","target_line_end":69,"target_line_start":53,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[53,69],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b30fb6a975f24e8e54f03d2f2f37c031451d36ef103a9b80979a877c766dbe41","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-010","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"c234a794d1b83bc07caa7e6f0148007a9f3447672faa3cb0fb4a6f9b04c94eaf","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":76,"source_line_start":61,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"0c9a97a343ea58779a82808c7a24ec6662abcc817fe8abf5d647b834152fef03","target_edition_id":"edition.r017.id-id.draft","target_line_end":95,"target_line_start":71,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[71,95],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b0d0070e4b2dd4902f5a148fa1803d4ecf101b108ec2b3875cf66ee796e9a2f5","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-011","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"0336e9f6abca627429c18ae5b88d572efecec3ab17482e25dc9c6f91bc8009a4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":81,"source_line_start":78,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"c6569321c2c9cdb6c04e6a2cf6abb3ff02bb0bea65a7c3b8ea11a810bbd6eede","target_edition_id":"edition.r017.id-id.draft","target_line_end":106,"target_line_start":97,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[97,106],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3553aca0915ad4247fcfd837ed7ece1ffc57ceb69483d175943ff3a5f0a2846f","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-012","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"a78c85467993fea30cf77af5229c7a1049392b5330a13d677daf96eb69566a1f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":84,"source_line_start":83,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"a0018f0df927784c58bb61b3eb742526ca1569895307137307fbf7aa518bfb0d","target_edition_id":"edition.r017.id-id.draft","target_line_end":109,"target_line_start":108,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[108,109],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1fbdf58a308ca2cec01700ab39d087a3cce824c54b13361fcf317e73b55dcb56","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-013","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"c130e370bae1902b13a8c0a44227a907993b67fbbb0c44543cff6ab6de03dee7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":86,"source_line_start":86,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"e042dfeda729513f9d2b4dfa35eb0b57064e63b8449f3315a540d1433be334a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":115,"target_line_start":111,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[111,115],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3b026151e937cffae20bfabe0ed83c90080353c1bd9ce505de9959d86adddde1","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-014","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"499a9451945c586475e06207c9e8c42fcba70cf80e730f9a4790f88dcf72c894","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":101,"source_line_start":88,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"2683f7c1fa8779dac5659018f714c5b9d8eab753d087d142ad748cade269d1bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":117,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[117,130],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fdfe00f6caba14477b9c484a27274f587145c028c9df543a8d3f7d12ae8fda34","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-015","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"9cf902e7a1e53de622ffbe7112fea4999f668fe06ea9c08ea6ae468d02c71f20","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":106,"source_line_start":103,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"ee7c2e877f2451bc5a36c48f3d76cbba200cbad06e0a7821a5f4b4d941c24a73","target_edition_id":"edition.r017.id-id.draft","target_line_end":135,"target_line_start":132,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[132,135],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a7e328f226407e677d46edaf44fffdb2ab328104a0c0d62d9ef51395c31853f","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-016","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"df98d2a998ca980480e2249b77adaa4f683a972ce5eb4900cb73bd24820c460b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":109,"source_line_start":108,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"3a06b250c8ceced6967543e02a57994fc9c3dc5890ef9da32e9214ca33267220","target_edition_id":"edition.r017.id-id.draft","target_line_end":139,"target_line_start":137,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[137,139],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14c6a6b6ab9decaed5e3b072f1c30247c11b20b0783275cacd9138a058c09cfc","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-017","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"8d543f0d91e30342dbb554113758111db040082047ef5eb667d1f1b69e51ff78","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":131,"source_line_start":111,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"76d9a0cc8df57a46d6355b5735e9d42a3da049c58bc9e20a8019075179717613","target_edition_id":"edition.r017.id-id.draft","target_line_end":166,"target_line_start":141,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[141,166],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"11ce3755156a3e4e2b437a2f7a1088b3ae0c4b38cecc922b62bb71fce746fd38","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-018","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"3d9314ff0218c5e2c9df334835c88d38de85746e0aa9ef843b0cbfebe9162e6e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":147,"source_line_start":133,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"628df7dbe460d17d1052f2833b889ea087dc581b1a963bc8a2c09682eec6d10e","target_edition_id":"edition.r017.id-id.draft","target_line_end":182,"target_line_start":168,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[168,182],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9167560e76981fa8eac13d9df3b47c1250069e8c032ea69314f55756bc54da2","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-019","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"5d27a8dee408c475cca48b3400c93ad0a24aabf78a0e8c30ea9b52c886d3f79d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":152,"source_line_start":149,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"811ed4402a68e8996f7a1fc080569c442df709cda9dc608de1ed74f43edb39eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":187,"target_line_start":184,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[184,187],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2ac9f81026da9083d17f6dce2497b454631f3da812d7580213dc6a114e81766b","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-020","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"3b033332280dfcb80fff6adb8a67f7eb4903e233ee8bcf9315d1cdc0c92b8c9f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":169,"source_line_start":154,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"36a844509a8441f85c1ace5d1cf8dcde0c0f9a8c7797164f39c1cedcfcc136b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":206,"target_line_start":189,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[189,206],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"03cf8d61bb7f229d8e87882a17d4257920a58a7c3c246202fc815429c078a47f","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-021","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"f59b5bd7175f213e6a6a89c633c969da1fde7c00e3a878499ae0b5a1e527f370","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":172,"source_line_start":171,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"d479543b3395e10358f3e8b07aa5bbe66f7dac6e3100481a986385c227c65368","target_edition_id":"edition.r017.id-id.draft","target_line_end":209,"target_line_start":208,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[208,209],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a470d44326853c68d96401b6f47911ff46b8caafc7d99cdee6be5eefb0349670","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-022","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"341ec77afb34b4c92f44b392f068e6d7023bc2d6f34685e04be93f9b198ac05b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":179,"source_line_start":174,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"24e692ac0e05325ff66bb0d64933498551547acbd3b53728af68e45c627952c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":222,"target_line_start":211,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[211,222],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ef675be673bef233085d6d3798c235180e4f48b6e5103e681a0100c29be5ff2","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-023","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"07fe1ff3ec5c0fc19d0997400dfc6df0b863d04df0f99733a6224de13a9468de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":186,"source_line_start":181,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"0e063a41901f6512663fc3d15ebcd7b77a4a7a8e6df8ac1e6629f2a06625ead9","target_edition_id":"edition.r017.id-id.draft","target_line_end":229,"target_line_start":224,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[224,229],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"824cbd994756b5baff8d83f29ed40b1e7c8efcfcca1a20f3da1be6929e66c1ba","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-024","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"0649ab9766363d75ae72164efcd341d8a386286355457dabae52cfa8088c2bd2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":188,"source_line_start":188,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"65282d059c4582337874fb8c7e38c6f847b4732eb4828eb6b38ea7f82e45f821","target_edition_id":"edition.r017.id-id.draft","target_line_end":235,"target_line_start":231,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[231,235],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c1a8f17725def47098e8aa0e82c07fb3d0856930360cce1ba1ed7cce85eff417","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-025","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"e8eafb4f074b8f386e4943c78433a2dbeaaa670d74b05ab688f80dc8df4e3089","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":191,"source_line_start":190,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"d056a70eb3ac5d9f332b3df89bddc33b3cd0db63f343040c6a5c7e0d66250a98","target_edition_id":"edition.r017.id-id.draft","target_line_end":238,"target_line_start":237,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[237,238],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8ac07b6d48acaaaa83466789673626ded99c2b39fcb188226c6c1841310e2665","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-026","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"2f3aaf9283ecfb808559da8947110829bacc6c626141905907e224ae4fa255f8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":193,"source_line_start":193,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"74fa03350b4a242b870a02d447e634732350efcdd90304b2ba9b90f07435b10e","target_edition_id":"edition.r017.id-id.draft","target_line_end":250,"target_line_start":240,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[240,250],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"573d60b8e33cf6bcf5cefed700356f5e6673f42c16f0500a6d74cfdf8eee4ccf","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-027","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":27,"source_content_sha256":"3c26f026f148c1b8d4ce7a9ef65714f85f515089f5b7291b4dd2cf0bf9998438","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":195,"source_line_start":195,"source_local_id":"block-027","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":27,"target_content_sha256":"1060e972b78e81fcd361b1e28eae357659cdb8c1dbf28c09df6a0e51a547a9cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":252,"target_line_start":252,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[252,252],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f51f630e35d8fef805e92b329be4bd445080612fa038145a7038a8e3264d801","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-028","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":28,"source_content_sha256":"a5b50d01c2abe50df41df72edcaad24903928bbfc1c86deb3776c2dd7725f72e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":213,"source_line_start":197,"source_local_id":"block-028","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":28,"target_content_sha256":"81fb827e73ac33a67e7dbd334b8523a75c952329c1d729b3b6df4c7687df0a91","target_edition_id":"edition.r017.id-id.draft","target_line_end":271,"target_line_start":254,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[254,271],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f07d3a01555dd493f5447b4dd5ba671fbd3e858e4ef47d8c07f4f865d30a1837","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-029","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":29,"source_content_sha256":"af00d7b5cc4a79ad69437de03bcb1b93f020e285b2fe46cef79a1bf3d2c09b06","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":231,"source_line_start":215,"source_local_id":"block-029","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":29,"target_content_sha256":"d07eb8b7f33e979b37f4c9d46592fb805d216f2bcc3080c3159db8ddb8406793","target_edition_id":"edition.r017.id-id.draft","target_line_end":292,"target_line_start":273,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[273,292],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c55dd94c1dbf04ea3c15d9d395272e6da159b9c8bfb49193247dbf7831eeaebd","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-030","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":30,"source_content_sha256":"c12c64fcd6131018bc304f55217a2c0f58714fd227e757c91ff1764acf42edba","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":236,"source_line_start":233,"source_local_id":"block-030","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":30,"target_content_sha256":"4451a1cd855f20dfedde4d4b61e90fad4daf79f316bfcca641abda658d83ff99","target_edition_id":"edition.r017.id-id.draft","target_line_end":297,"target_line_start":294,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[294,297],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5528936bdee9b338827b81245c92844fbfa98c68d24c5bf1b48a1798aada8fb8","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-031","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":31,"source_content_sha256":"a0aca981aa88dbeb8499b77f2c782840fb6767a8f12da2bd55befa95a42cc76e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":269,"source_line_start":238,"source_local_id":"block-031","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":31,"target_content_sha256":"d1fc3a3cabf5eafc9f9aaaf01f0ed131f474c5e17a6ad4b00bb4c3e9a9cc52b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":337,"target_line_start":299,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[299,337],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c7e39d315882910b87764c8edc03188bda29e47e7575a54c7443c02d97d8d75","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-032","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":32,"source_content_sha256":"0389bb6e1bbd378cc8ef128544568e50f3694f60087fa4a87f618df952e5aa7c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":271,"source_line_start":271,"source_local_id":"block-032","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":32,"target_content_sha256":"58334dba3a07b2ceaf01b9ef97b0ab2018fda58e254ac65030f1679d480b6d19","target_edition_id":"edition.r017.id-id.draft","target_line_end":339,"target_line_start":339,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[339,339],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3f4f77d40d8e04a7e4354de04ca3145349cc267cfd1f9070e1572dd25f9db1ca","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-033","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":33,"source_content_sha256":"93aa1b81d957331d9ef8ad03483d1c2ab54dd66f4554c962b2407b84f89aba65","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":310,"source_line_start":273,"source_local_id":"block-033","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":33,"target_content_sha256":"9076d8f920eeabb75c1962acf859f117126eb5645635e5d197986f912e79f66c","target_edition_id":"edition.r017.id-id.draft","target_line_end":389,"target_line_start":341,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[341,389],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b1d0fa9653e1b00343e2513d9ecf19ca492e7f8d060531e13cfd45590e2a709","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-034","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":34,"source_content_sha256":"c947ca271c7622526fe1d6a2d85a17d7dbd45c3f7ebdd3e802535872172b7d9f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":321,"source_line_start":312,"source_local_id":"block-034","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":34,"target_content_sha256":"69b7b83c336a1ddb97e38b344e6c2b8de8097f5358b530143aa0a0697f6929e9","target_edition_id":"edition.r017.id-id.draft","target_line_end":400,"target_line_start":391,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[391,400],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14ec03ff9b2380a8e63788c98c0cca3a38f45c9bef17d54d9efde8fc73adc4fc","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-035","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":35,"source_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":323,"source_line_start":323,"source_local_id":"block-035","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":35,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":402,"target_line_start":402,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[402,402],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eca15c13bfed919684aff6d74d4f0102118a9e2b49fcd23c3f295f53759d3721","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-036","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":36,"source_content_sha256":"1e4ccc9ccba9038d35b6d9ebed7b22602bc3cbe77fc62260abb1d7f124da6cb9","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":325,"source_line_start":325,"source_local_id":"block-036","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":36,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":404,"target_line_start":404,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[404,404],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"807abdf3372b2e01154d08cd6acb2cafd5df7b94ac9458b2040f68aa407cf3ad","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-037","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":37,"source_content_sha256":"a6c18cd910118035e9ea010f2ee79c798b3efbc009700c989db4ce6c1d1e71cb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":327,"source_line_start":327,"source_local_id":"block-037","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":37,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":406,"target_line_start":406,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[406,406],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e96e06ed69da39ffda67f7bd87ee7724bce525aa1152b15c9d8ef4e580e57f98","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-038","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":38,"source_content_sha256":"c01bdd1d439705e2b1de1e13e6847bb67d56fbc0b3e2d942c2fa5cb9f146cea6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":353,"source_line_start":329,"source_local_id":"block-038","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":38,"target_content_sha256":"139be4eff92a53f2ab9d77ac34cd202c0c5b556deac762544c9419e812b29ab9","target_edition_id":"edition.r017.id-id.draft","target_line_end":433,"target_line_start":408,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[408,433],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b175030308800e81831e17b49bca1bb32801b5b3cf2ccafd9d22e8604e20cda","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-039","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":39,"source_content_sha256":"b2a64a350bdb0e96020b84515f1dcef09eb9eb3b2e6b1324be2fc4bc8242c43f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":373,"source_line_start":355,"source_local_id":"block-039","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":39,"target_content_sha256":"17739d9c1ad794c10c5e15d3c61ba705fbee69351d3ffbcaaa584a6aba008f41","target_edition_id":"edition.r017.id-id.draft","target_line_end":456,"target_line_start":435,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[435,456],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5447667623cc6af2a0aeffe1a0c4a5bbb66947177ee4b1ec981c6ae7f0c47de3","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-040","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":40,"source_content_sha256":"093431ad9d6bf4846a9f75330e555cfe21141e33af1c2003968b203fbbb000f2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":394,"source_line_start":375,"source_local_id":"block-040","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":40,"target_content_sha256":"510a38124a86ec6ae85055af0085228f44229e937eeb0fef1613d13b7f865b06","target_edition_id":"edition.r017.id-id.draft","target_line_end":478,"target_line_start":458,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[458,478],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5cd81507bfe1563e35116dc31b86a04607e7322d668e2d3d1249b8d8f4e0e84c","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-041","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":41,"source_content_sha256":"befe6892ec44e33f7b364305fbcec8fa778e09b9cb39adc300c1dd14bcf212c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":396,"source_line_start":396,"source_local_id":"block-041","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":41,"target_content_sha256":"e3f87b06f7a641556fe14f6828c82cf2c975b6a9ee5826c46c7cbd0d343ca7a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":480,"target_line_start":480,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[480,480],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8cac76b88ae8bf6b8e59b41c59badb89e1fbd94e6509000eb87ee3a4a3a7959c","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-042","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":42,"source_content_sha256":"3c03dd63e5a3741388b81cd7653d3ed1c40bd2ccf5c4bd300f144a1436ef7506","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":402,"source_line_start":398,"source_local_id":"block-042","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":42,"target_content_sha256":"a76e6ac47cea4dd26323d1c5c3698510d5c578d9fcb949d442e79b83c11d2544","target_edition_id":"edition.r017.id-id.draft","target_line_end":489,"target_line_start":482,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[482,489],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00a60eb1fc0db8a4227611f1764f7ba6b5c14792e746e6c2a1a4016217a87261","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-043","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":43,"source_content_sha256":"c8db7b74bda65302407fb66edb0e431def19f866523f3ae15d76f8c15514b529","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":417,"source_line_start":404,"source_local_id":"block-043","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":43,"target_content_sha256":"35808b0bfe1cd81c987337f086ffc5e31393661ac1aae305889fef685fff0ce4","target_edition_id":"edition.r017.id-id.draft","target_line_end":506,"target_line_start":491,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[491,506],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d5b042eb0cdcc041b4301b2a8f7524b862d123903d5a21600cf4a3ecb8d4c624","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-044","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":44,"source_content_sha256":"5772904c685ff41632239b2b41b5ce62a593cf3e8b71937fbd16e3b3ffb38aa8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":432,"source_line_start":419,"source_local_id":"block-044","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":44,"target_content_sha256":"ace4215fbc28f475c5bef6377a808ef31dd21c721f3c4f0caf3926e21b68af5d","target_edition_id":"edition.r017.id-id.draft","target_line_end":523,"target_line_start":508,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[508,523],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e6bef4135a78937fb5673338d64cfbfa6d88c48ef4d4d05435582895a22e6bf","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-045","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":45,"source_content_sha256":"8068003575ab81313078cbb278b69fa65f9b761c4a30e2b4977d565baea3729e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":445,"source_line_start":434,"source_local_id":"block-045","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":45,"target_content_sha256":"53f8235bdbecb7a6f6b8fd5d0e0628fa8e77bac90b397ec6c2f62497e2480f7e","target_edition_id":"edition.r017.id-id.draft","target_line_end":541,"target_line_start":525,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[525,541],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb26cb92addd62ba87742ca1009296ca28d05d88b596234c2e48b5543bee7e1e","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-046","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":46,"source_content_sha256":"c8e278add1d6c18f659152466edf4e82568ebad5aaddedeaeb2d654335866d4f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":447,"source_line_start":447,"source_local_id":"block-046","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":46,"target_content_sha256":"5a7c51fe019c052d866e25f75541baf5ff511cb9d0d48737b288dcbb3fd56de0","target_edition_id":"edition.r017.id-id.draft","target_line_end":543,"target_line_start":543,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[543,543],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c251de13cbfc4693f85b5282aa3d7ca233e424ac902a5721ad2954c2f6ccc875","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-047","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":47,"source_content_sha256":"043e72dfba323fa9e661708c143d4b23252a35382a5330e060b7e25e6ebafb9d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":458,"source_line_start":449,"source_local_id":"block-047","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":47,"target_content_sha256":"435481cd4e121105a474b58c9ff87911d6495175b658e42261c708a63a6007d1","target_edition_id":"edition.r017.id-id.draft","target_line_end":556,"target_line_start":545,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[545,556],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"916a6f98f800e8277684c91d7d7c2721798b5c6d20f743ec73886d97d6ae2c56","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-048","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":48,"source_content_sha256":"24afc0084fac4f3e7a281b10af4c82f7a427fc3b201dd53fe78a4253ca5d3aec","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":464,"source_line_start":460,"source_local_id":"block-048","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":48,"target_content_sha256":"2c3a89c70bb729a27ddeac6ce923cf6933e13130d0881af8f02bcf7820b7c200","target_edition_id":"edition.r017.id-id.draft","target_line_end":565,"target_line_start":558,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[558,565],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a3f0487b3f188078aeff7aab2beace285f2aaee308e8a438de9ca0d672ae8ba","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-049","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":49,"source_content_sha256":"0abed55a82613fbb25c16f2deeb0378f1806224e58a6bfeda6b4f67f60977bd6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":484,"source_line_start":466,"source_local_id":"block-049","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":49,"target_content_sha256":"ecf977669438ed9d9ade688247e1944862bc250869a16b90749728496bc2058e","target_edition_id":"edition.r017.id-id.draft","target_line_end":586,"target_line_start":567,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[567,586],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94c4aa2c036aad0cd069079634a11f6c4520808fe240a29aa8aa63958bb6c51a","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-050","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":50,"source_content_sha256":"3eaf74adb8ebf5d156b30d07cf2ef9450e9ca7c7f551c18c18061d2bd2290dd7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":505,"source_line_start":486,"source_local_id":"block-050","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":50,"target_content_sha256":"04e7eaae41151862d4687215f076271996ac053714554dbeb9fedd2614f12e59","target_edition_id":"edition.r017.id-id.draft","target_line_end":610,"target_line_start":588,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[588,610],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a4893131faab2bf6c20e5b9b16eff8683ff3306d0e96dc22643b7c284e3c5a9","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-051","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":51,"source_content_sha256":"4be7db13a50a6cf69022429255b203425a63979cca3cb7d03e8476641e361703","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":507,"source_line_start":507,"source_local_id":"block-051","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":51,"target_content_sha256":"7c4176f9ca89c18c50f3aacc3b3a978ec2d874e6385a52e4b13e5c4d0a343459","target_edition_id":"edition.r017.id-id.draft","target_line_end":612,"target_line_start":612,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[612,612],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f135edc7dbc73842add778f1230979e4535e7e4f1597af3b77dc4a06528fa162","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-052","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":52,"source_content_sha256":"a374363ff58ed2b4357b046bba47c8431cb662ef5ee2b1c048f6bca5158e7fbb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":540,"source_line_start":509,"source_local_id":"block-052","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":52,"target_content_sha256":"24417552ce43b5e370350e32b5c6d7b8add212a1a7ef0db5427f3c26f986bf8f","target_edition_id":"edition.r017.id-id.draft","target_line_end":645,"target_line_start":614,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[614,645],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"09e7974009da2b1b8bd7ed9927e5b12f4a1f0f85017da466f7140973d47ff0a0","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-053","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":53,"source_content_sha256":"070c82f595a58c404017d08d60ef7ee4b27c5877e128e391ddb9e2145cbe6910","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":542,"source_line_start":542,"source_local_id":"block-053","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":53,"target_content_sha256":"12507c686f001ee5b8d63689f6a3d41beb1025b919388e235a379903b732cdd5","target_edition_id":"edition.r017.id-id.draft","target_line_end":647,"target_line_start":647,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[647,647],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bcf1eae29e8720220787c0d7b131a60979fbaeffc30b7b63184b4b2384b4972a","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-054","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":54,"source_content_sha256":"5afeb77e0cd98438242c92c8162a563f6845fa224a45d6bfd34250447fbe5a33","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":550,"source_line_start":544,"source_local_id":"block-054","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":54,"target_content_sha256":"74336a77d7f887d0c0de6f7f30c401fbe6d68bfa954ef25f72864e9784e8ab4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":660,"target_line_start":649,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[649,660],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a85ad82fd46ee951c2afe172082f83deba394717eb88707d64e80b127d575ac7","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-055","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":55,"source_content_sha256":"e8fe858faa2819fa485104ba9c502794ef5afc642edf9322dc20ca0b7381f784","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":558,"source_line_start":552,"source_local_id":"block-055","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":55,"target_content_sha256":"b0fa73e89018044a25e3041a9326821126bf8ccf37750492498b2f9bb4342379","target_edition_id":"edition.r017.id-id.draft","target_line_end":670,"target_line_start":662,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[662,670],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2d6e84a3ad83c133e46881daefdcc698fd131d687a9e55daf61db8e03bc5a9aa","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-056","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":56,"source_content_sha256":"dc13e4f9b58241da8ec17e4dabeb5963877ba7bd29f363becda21371406e6b17","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":561,"source_line_start":560,"source_local_id":"block-056","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":56,"target_content_sha256":"2c085de7cbbd0d1b590559f6285f3384b492e7810e90f997c6fc2067e7855a82","target_edition_id":"edition.r017.id-id.draft","target_line_end":673,"target_line_start":672,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[672,673],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dbe3ef3e1744abf010e79f3af2dc9371494638e0bb3475756cc79f2cfca4d187","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-057","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":57,"source_content_sha256":"65e0a15a7c75663890bf126235101a4b743acc083470142f208943ddf102cb14","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":576,"source_line_start":563,"source_local_id":"block-057","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":57,"target_content_sha256":"1f66c16dd1736e26b6620e86a1c7cef2ef0f342a22478816742f2808834aa4b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":688,"target_line_start":675,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[675,688],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0b8d6b030fd37596c82b1e6bee915704d1d1c874a87d3dfb27a828b678108f6b","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-058","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":58,"source_content_sha256":"87f76aa3dbaf919ecfbea53a14b16ffad8cad72b0f06770ebda4ab9a299cb762","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":593,"source_line_start":578,"source_local_id":"block-058","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":58,"target_content_sha256":"ffa72ed6cc5b1151c7711fb8ba76d1790073bdfbf1e11251b6c22151a523c5b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":705,"target_line_start":690,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[690,705],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a1ee3a94c17f16f4f9bff6ead7f0efbb4197e51928f3142bb861c8c5ea2acbb","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-059","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":59,"source_content_sha256":"0856c20084d374c0f754fb1b3a04867ad95408963d2f49302a643beb83d9bfcd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":609,"source_line_start":595,"source_local_id":"block-059","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":59,"target_content_sha256":"e0bcf1efa2284f9634ea28b2fead6e77438b0653d4637d3ba0e8858b67b9459f","target_edition_id":"edition.r017.id-id.draft","target_line_end":721,"target_line_start":707,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[707,721],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"22c53cca5bae748122857721383c03c79fdbc63538eadd80ae8a1b1aa9210010","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-060","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":60,"source_content_sha256":"b0cfb70f01285613dfe816ff3a82a7c83b90b8a8feb1fca3f3902f478d8dd3a6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":624,"source_line_start":611,"source_local_id":"block-060","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":60,"target_content_sha256":"84da6ed4333fd29fd79a784daaaf52e82603ac7cad5644d1ec9acbad40bbcfa9","target_edition_id":"edition.r017.id-id.draft","target_line_end":736,"target_line_start":723,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[723,736],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23a5992907446237d52120c147be2591a21fd265f5cfb38958479442a9b3ec34","concept_ids":[],"id":"segment.r017.book1.ch09.text.block-061","locale":"mul","parent_id":"unit.r017.book1.ch09.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":61,"source_content_sha256":"37ca49d5469eca2d6d97777ef4c09c8d47b9f3f0fe60f213fdf08f5da6b203ce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":642,"source_line_start":626,"source_local_id":"block-061","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":61,"target_content_sha256":"2dfce338952705e84454d2ea5be3c18ab8dd2aa55b408dd57547320bdd3d1a36","target_edition_id":"edition.r017.id-id.draft","target_line_end":754,"target_line_start":738,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","translation_state":"translated","unit_id":"unit.r017.book1.ch09.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[738,754],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-tableau.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d241b7a17a7d5c4bc7d962d0c85c000af92480a2300327692e248cd968317ce","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cc09b2590aedfe627fdf1c8d26ce7710474c15f50622e20d91c82ac8ac204c59","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,7],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"283da35d7a83dd23308806ddac9e338a012d6400a4390446cf17782c36d6de3d","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b2975f01dd7d12b5d07f483c6a7df83417416eecf3dd09f5eae63624945df53a","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":9,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[9,9],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0ec677f22d158b3f5c6c282a1b45aad24157d0fbe81a396a5eff7f42f6d6e1f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1705bfdf9338ce6844819a5319d58ec7a8af9cada911eb164f946a516284fac5","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":11,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[11,12],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"af6754a111b6ad398159949f745647ac6970e6b67491f1a02f40d7a7700668c6","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8fb71544ea4d3f4c0ae3af01460608bab6d66199cad43384b7944ec8dbde55b2","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":14,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[14,20],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c5fcc389aa3d6fc4edbbb533c7fdd2188adbf539951c26c5f927afb75c6d14c","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bd562ca973ac17b3982d1aea86474fe270da4b698b50f770cd8ebeb1dc28cb4","target_edition_id":"edition.r017.id-id.draft","target_line_end":29,"target_line_start":22,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[22,29],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"402d470623cc71130ac193cef95e23452d1156abf5795411c64ad2f7f6134b34","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d16622a456e8dfb2150305bd6acdb11b635b5c4edbd8f22945fce6e0bca0570b","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":31,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[31,31],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"914985b1299eecafdf7c5cea60a252ec9d982044a9a557c293864e83f357e2e1","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6b0eb83e90f37ce9cb2d5a08dcee773269232c00e7ded10049cf073b94d4732","target_edition_id":"edition.r017.id-id.draft","target_line_end":34,"target_line_start":33,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[33,34],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4f7a60766a7e488ec9bcb3f68bff343f4750033f27d8520b2db324ccfb23c06b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"29f6d0a13c80c93973cbb965183feefef59f5c853f18890461c67fff89e4d69a","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":36,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[36,39],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"47a176631726b8e374639b4e1c8660e2feb09829ede7fc635b523f4d05c55e7d","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a426bbf87115ffe45c8800ef258c963ffcd7d62e0fea631190b4f60a46833027","target_edition_id":"edition.r017.id-id.draft","target_line_end":61,"target_line_start":41,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[41,61],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92935281021b7755e8d749a0c58da3bede70106ee9b4b27681d6e40d128e5d23","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9e4e538e9c233a19c27b12c05394267ac54b6cf614319e92e773a25d6f113b49","target_edition_id":"edition.r017.id-id.draft","target_line_end":67,"target_line_start":63,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[63,67],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14f2a1c024b9b1b030c0042d96b478a84d12e586b705132b8376acb199d3056d","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b1cde335865d7335868969ed6f4f719ca0a2a1679dc0fff247f1a76ec367b97b","target_edition_id":"edition.r017.id-id.draft","target_line_end":69,"target_line_start":69,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[69,69],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b6c1138a5d8fa2c3b483fbe49dced5d13bc49c34dc115cce7e18616c9d412e97","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f929102848069b5c78734109893800dab3d9b49dbd97771d437f205185f94bca","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":71,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[71,72],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5793e55bd9ff4fd4ed30b9238e907eca110df7728e43c61d84e4e7cccf314d91","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"53fa2507b6cea30d7349f99917d3efa83a8b00682aff2ea7a06f7ac8240fbfe0","target_edition_id":"edition.r017.id-id.draft","target_line_end":95,"target_line_start":74,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[74,95],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9608b9a20095ca65e9767c4c62ee1255bb74f5b4edc63ddbce4505bf52c2ccea","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ddc89c195c50f89d7131a064e5a3fd34cc7c9c97fe020784d2b40bd459a7d55e","target_edition_id":"edition.r017.id-id.draft","target_line_end":97,"target_line_start":97,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[97,97],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b93c50076228713ced87fd83dbeb0ff28e72c23b4066bec27c34c0827c0a3be3","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e07f112b1b074af0a98eccc4108521f4637fa53d085f64f46f78e1ab8930f7aa","target_edition_id":"edition.r017.id-id.draft","target_line_end":100,"target_line_start":99,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[99,100],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8df917e37ea36146a5eee172ca2e3486a5b043de8b10b696ff9f86d7ce3b184b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8bdc4c122186f61e9a6a390e3386423f21fe50feec80e9a6073efdb3059be0b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":102,"target_line_start":102,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[102,102],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9fef884e5dbd3e842269d4a1ba96adca22763cdcdb88c8e0737d1c8696824356","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2e496f3e433988652ba07afde7a87a690b3f3af5d0af4c6471d383e70247bede","target_edition_id":"edition.r017.id-id.draft","target_line_end":117,"target_line_start":104,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[104,117],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5a8630b1dddb6fe39ea9b0638753037d7f9bfa9ddfb3ecd2f2689c372303f68","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd92d176cf9ef5b86cc26e737cd564ca7055e9c4e791662af4d07e8b16a01a9d","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":119,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[119,119],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"85ae7c9e65881906e45182d26b66f94610cd0514e258a36649a40c9353d919b3","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"659b03739a69e0f58be2eeb50b5e8961f5fb444787e029e7cc11040ad47c4476","target_edition_id":"edition.r017.id-id.draft","target_line_end":121,"target_line_start":121,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[121,121],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"91e75887c8b9038bcf1302f1ba7a3b98c7d27159986c6c7b87905866e11f04a2","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3096fda2c0fe79e01ec048ab28291390c87dc899cde8da770e34f313fe34bff0","target_edition_id":"edition.r017.id-id.draft","target_line_end":155,"target_line_start":123,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[123,155],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3964136fec58c21c2e1be21bf45e802b1b4d3f9e1a29e3a46a1d600010991403","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6881e5bdf078489a8c52bb39136d73877d1f15a1602c299ecc0d25742e0245c2","target_edition_id":"edition.r017.id-id.draft","target_line_end":157,"target_line_start":157,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[157,157],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c99c7a15d56244c2dc11d246590aa3816fcbb557af0408a1516a540427cd12c8","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"797fc157871d7009d9579145eb72fc22761db00b9aa9a96127c48ba7e04e3e4e","target_edition_id":"edition.r017.id-id.draft","target_line_end":160,"target_line_start":159,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[159,160],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2fff67a0ae8a5b31f17639e62baed3a6993daaa85e686e9f39a905a35228d59f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d027b9ed1f1745cd21a4c2e0fa4e3036ad8bca5b9d94cfae687c14ec99672e98","target_edition_id":"edition.r017.id-id.draft","target_line_end":167,"target_line_start":162,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[162,167],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6afa300dd51a29200a0bcbde19f0252803e16b7bfe50ec47885b461e7d94ae4a","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d9093f8bd20e1497551a37c822b7c109872b8e4e02a0faf87d84219d3bba2b53","target_edition_id":"edition.r017.id-id.draft","target_line_end":186,"target_line_start":169,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[169,186],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"05fcd90edb30b33ab5e467a95d7d059c84f361f0a25bc44134821dc0a021d5fa","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4d8058d3a9cf50a2c7bb7cb9e931d26892d58d285648e90d80adcef4796440a9","target_edition_id":"edition.r017.id-id.draft","target_line_end":188,"target_line_start":188,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[188,188],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7ac982f477e65e7e598729db7cc234d2c49b3f919417da7b8d948975f3e732c5","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"271956cbf1515589cfc5bd0c81d649ffa95616c4f2c9b4617ff2a5c47fdcf77b","target_edition_id":"edition.r017.id-id.draft","target_line_end":191,"target_line_start":190,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[190,191],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ecb5fb7505b95847fdff096d9f6b69d313191ed512de03cf8ba81da826acd15e","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"98cf154e2ce97b9b7568fa53d9840c421fb291f386de8fffbea0778b77001c6e","target_edition_id":"edition.r017.id-id.draft","target_line_end":204,"target_line_start":193,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[193,204],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18f68d762f55f5fe33108d1b5b782b6fcf92183f37d094409e129c213c7954e8","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4a3bc5eb47cae99a21c6f0b76cd22b380ab52770592980ea8328115cd166768e","target_edition_id":"edition.r017.id-id.draft","target_line_end":207,"target_line_start":206,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[206,207],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88b3818fad0351c8d69ff6aa7756fc4da5f4851c005ba3b7c709a30aea77127a","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"59997962d7f071461a93c76d9851e128ad6d0326cc1bc45d1134426287ff3f83","target_edition_id":"edition.r017.id-id.draft","target_line_end":209,"target_line_start":209,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[209,209],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dff49e826c5641a0c43016cd910ad9b32b9d9c79a5931e3ef1f0d7ca179f2ae0","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9ec95d8d8ec69ce4e6c209adedf98478b3638e6cfc85064d65a4bc2d90246a08","target_edition_id":"edition.r017.id-id.draft","target_line_end":211,"target_line_start":211,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[211,211],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b5084d14f5baebd1f6236fb61316e1ed207e74b2d105314211dc80ff5ffadf79","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"295d07be7c33a9b82f0d83a8636e2adcb57a1e9239c10b1736b44cf3bb61ce11","target_edition_id":"edition.r017.id-id.draft","target_line_end":217,"target_line_start":213,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[213,217],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f4168b04a6f69b21360e4da71f25b3c049266f1efdffc7eddb99d9809bec8a13","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5a8dddbdcad297577cf5499e6a5d0d815dc24dca455dd80a8f4b8dea6db067d2","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":219,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[219,219],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5e7693e2bf592d554cd273570670c054b9b2b471a3d8f17b1e60737dd4ea6f3","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"62100049479136150a1c488ff9a6be42a38bdac6b02bc2038182df77e69deb0d","target_edition_id":"edition.r017.id-id.draft","target_line_end":222,"target_line_start":221,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,222],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d5040f178d12ca3ff8f4e26f8c014234829438200fadc10a65c16cfeae3d23dc","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c2285a7025e9a33695b2354c1f30a574ded41da4d7a55e57cffd9443a57e8ff9","target_edition_id":"edition.r017.id-id.draft","target_line_end":227,"target_line_start":224,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[224,227],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d02f8f08374394b5663049fbd4e369594080332447aed2b418b13f46434f58f6","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"968b3c67be71b03bf46802c74b0e613881c532f7b95fdcfe6fb96d1d9cbb6b2e","target_edition_id":"edition.r017.id-id.draft","target_line_end":230,"target_line_start":229,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[229,230],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1816c1f40d3ffcf2b6d02a3f84c2954cb13ff47a332958000619230e740bd914","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dcb23631756143e338aec3c30c48b71421876b07fa504176200d26e424fb6be1","target_edition_id":"edition.r017.id-id.draft","target_line_end":236,"target_line_start":232,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[232,236],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e89967090c17f70a0148a8badc7a2a58cfc4bd15ea18f9fb97439d1f711f5d8c","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c2dab7ef2dbf624fd455713b244f9768379b38998ec15cbeafadfa867f80458b","target_edition_id":"edition.r017.id-id.draft","target_line_end":239,"target_line_start":238,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[238,239],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"13279519cfc8a02c0ce57618594fa3f05b89da62637722a1ef2037d72811f5da","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c3d8c54b6071d02c034c06cc298f2df5bd16239fe22c5f5aad36816fa4438668","target_edition_id":"edition.r017.id-id.draft","target_line_end":241,"target_line_start":241,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[241,241],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10a004c8e2f334701d7e05ea8b41f0e41b29fb19975b8c68caf873759886decc","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"244195985503582897ea08d538a763f5b5c4704f5be28fcb0d918e195f7ceea5","target_edition_id":"edition.r017.id-id.draft","target_line_end":251,"target_line_start":243,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[243,251],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a7ce6e417b9229a51d3711d72f582fc900cc34b76dea08a47d90bc647534572c","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f60e2df37cf7d0e5c41f8ca552cafd94af594cd643f955954c3550fbb4ae02d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":254,"target_line_start":253,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[253,254],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8ed24921b8f4779ced84fafd146dd0aa59baea8785ea5ed2386ca7d8d4a0da47","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bb9c89daed98b942be0d9507758cb3de048ce34bac49096db7b97f0747add8aa","target_edition_id":"edition.r017.id-id.draft","target_line_end":256,"target_line_start":256,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[256,256],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a03a3f24b0d2c49c53e7d9ef41c0e5855b960bf408112052f7286fa5e9296f9","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b6735bec01beeb187f6c3f1f03430aa344e546f4647dc2559fdb50b3112f899f","target_edition_id":"edition.r017.id-id.draft","target_line_end":258,"target_line_start":258,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[258,258],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cee099d2783c4394aadf8ab4a39ef6aebce6b27b5e466e3e621ef89f485f1579","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.solutions-manual.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch10.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"037ac6f0dd693ed1e3a46c0acef431b4036cdd81f9e2ace831b835c25e093393","target_edition_id":"edition.r017.id-id.draft","target_line_end":261,"target_line_start":260,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[260,261],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch10.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fbf0a1f697c88ca8aea207cc197e3cce39f361148ea14767cecbfea0ce344edc","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b43b7983d071872b9cd0a4e502897c958374cfd00a850c5eb301246059d1c21a","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,4],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"411c4e07c71bb4f95cfab8b4a3daff8f561e0ef61ac44b0245c9188abe12c3f2","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f764d6d23bfc1787009ba76f10c30368fbb1eb6950be956e1116c4dcc00dac48","target_edition_id":"edition.r017.id-id.draft","target_line_end":14,"target_line_start":6,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[6,14],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57ba679197a50658d3a9a0a2d6c2dd19feac6c3b910b8a89f07fee98dc4fb870","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1482e60235cee3a0df9170a30f5efa1e927465167685593c562227a731b6c36","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":16,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[16,17],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"118eba8bff0dbf68cfca27ce27bd88d17a72b5f4a1e7c0d1e7a5845277df3371","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4226ae3e605044b50a08b126065469f54638ca67cc7a81ddbf43111c0622159b","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":19,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[19,20],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b0fd5a96c4e6ce2c83d54b5a0213bd6d4186101f4c414c7e536e9eac0333833","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"48ee3295764ba2c6d3deebcf27ff85e1eec565d972b28d43f607b0ae4d63e3fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":24,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[24,26],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b596179add828ca2f12c4ac2280476c692b225b5f85e136cfe717f8f68d7a5df","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f8d8083f57b4289baf2654baf6ea0e364cdf4adafa6b92eaba2636fb387a07a3","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":28,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[28,28],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f535d821c1d4a22b8f10c8611015f271b4d7c3ec86bc3e8a42c2bd62af659bf8","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"176b3aa8bec8883f146f3babc04d0248f0940c74f96a71ffa5ed63656e2fbe65","target_edition_id":"edition.r017.id-id.draft","target_line_end":44,"target_line_start":30,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[30,44],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88c58eb22c100aa5aa4a3550984728bc5a9864ecdcdb26697e829a041f77c922","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b826bb9c976eed4d514b775e865048474e8e0242756b1fe62b315ed64a80c50","target_edition_id":"edition.r017.id-id.draft","target_line_end":59,"target_line_start":46,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[46,59],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d074b790f5854f4a4326bb6f3d339ef2074a5aac8931f42edb7c367509b97681","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fde3ffbe19dfcebcf4ca77379cf67310cfa81f16cb97faafdb68ce56346e42ae","target_edition_id":"edition.r017.id-id.draft","target_line_end":65,"target_line_start":61,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[61,65],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"29dced3b0deb15653a6118d22aad9b1454604b9b2b88faa691443604675d5f6c","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"00c4fe6d72970649796fe439edd0d17184a7ce2ebf9993731d2ea9a1d419cd0e","target_edition_id":"edition.r017.id-id.draft","target_line_end":70,"target_line_start":67,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[67,70],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"871f01a42772bbec572570cf69009faafefa12e16f19ae43b04536a477025d75","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e5da2cbfcfa27d49069e83c927b343d4e94ad14525462ab3ba8fe713cc43178a","target_edition_id":"edition.r017.id-id.draft","target_line_end":73,"target_line_start":72,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[72,73],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a8ddab80846934bb38f9135aac005a1189818ac0b5a3363a841541bc7f79b30","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"957d8d1b4d0ed20e129a775e0c66743cec2435cf7324cd2de3578fbee5feb79f","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":75,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[75,75],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c35e78c353e0859ac28803726a21642328d3d4a12de92268354a96d68f9c487b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"46937c0485b5d906766ca32286d400b2ebb1f79767d06a65b71aa79a05ce07cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":77,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[77,77],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb0af634a32413259b583de66dd3bbbbbc6627239f0bccb3c72c045b7bba20d7","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d208aee0f4904d791e947b9018c8bac77094b7d165f0009815f491672ed0e9d5","target_edition_id":"edition.r017.id-id.draft","target_line_end":83,"target_line_start":79,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[79,83],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"faa6b797b4e28309d0f4963e6ee69b22dcb83f5669a0f07e0b54316a811000de","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"879a965f09ea0c10a05692fb52540e69d0bb50faee967049f12493718dc84d42","target_edition_id":"edition.r017.id-id.draft","target_line_end":85,"target_line_start":85,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[85,85],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6eb35e7ee33c1a5a4b927e9e5c9b3a6c5b61371d60eb44184086f4feb2e16a11","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c388cf71b69e8a2d33218098dd5c2efc63e058d8a6673b112f83eb17b0ce1fa8","target_edition_id":"edition.r017.id-id.draft","target_line_end":87,"target_line_start":87,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[87,87],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"061b49b9314c96ca93299b8b8e9125bd450b3377fb37c498f786bcdce9e970bc","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1e04c10ab7afe3a1db7b281c361bf46eaa1b9b6295cc96a5dd49063d269de4ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":89,"target_line_start":89,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[89,89],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa8e8aa89cd95bd908e5e827ff9426cfe5140541f004116fe6b721dae76ebf53","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5834c8d93733b9a25a94cac5b446cb901b0ac8fdf9a2380473289f97b42fd6fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":91,"target_line_start":91,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[91,91],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d62db742b144ff67a58594924e13b07e9ebe65e9c886c945dcef36b1cc6d75b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6f2a004f876843eba707dc2e737d034ff0cb8518210ee38d6ffbd7274de312e8","target_edition_id":"edition.r017.id-id.draft","target_line_end":93,"target_line_start":93,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[93,93],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88db8178c197c725218c14a0d90b335fb74e1385be3f1087451b4eb8d5096efb","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd64857209ae1a32623ceee5c4018cebe5604163d9ac5dca739e656628bb61e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":106,"target_line_start":95,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[95,106],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d914628c3cb6c31d5856040a36b7dbcff19068a4863c209b7e1895c99c76d2d","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":108,"target_line_start":108,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[108,108],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"58555cd20588c3f24e7e95a29551647c12737e877a32485cacb45a61fac36dc4","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7fb3987cc1dcf3a75d9bd9a7193c7f3f9bc4f9b8b3de8000e004151e9c334268","target_edition_id":"edition.r017.id-id.draft","target_line_end":110,"target_line_start":110,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[110,110],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7f5fca9ff022fd35d175175c1f1e5f0bcbcf99c1e50de4188e86e4f932b5579","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1eb9e7eaedb2f123691084fa816954b2813dc2849aa19b174f002bc6d67879e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":113,"target_line_start":112,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[112,113],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a8e7ca9797a8b546a79b16b184837a37a249f7e4be02eef0cd7ad6016ef950b4","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"59329426c3010622f732a0750889ed2d068fffb3e774313446670bd564fd0f44","target_edition_id":"edition.r017.id-id.draft","target_line_end":121,"target_line_start":115,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[115,121],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1736cc23291fe223a003a3c005f6a45e9e67057a7aa10302679da5593627ccc7","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1c6f72954bfd33ca591cae660c5b9d3300c5e9d6488f943cff3a27ca39c00ce2","target_edition_id":"edition.r017.id-id.draft","target_line_end":123,"target_line_start":123,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[123,123],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a8fc5a00d2e6ef79dae5a05ad93453048bbb7b85aaa734b49a5588127d580ef","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"17d55f096603d8ebd19f7879fd57aabd5e30fa58541d0540bdf65727467bccba","target_edition_id":"edition.r017.id-id.draft","target_line_end":125,"target_line_start":125,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[125,125],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb5a637e2731bdbbe8f4053e12bdbd17d96ad9db78b95f3096955db9a8e608be","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"402c027366fb21edc77e278bed35f7f88e5d9c3dd1befc2c3a3634198f794aa2","target_edition_id":"edition.r017.id-id.draft","target_line_end":137,"target_line_start":127,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[127,137],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4f2e9fc257e954096af69ff2a69eddcf5f4653f6a3efc05e1d8f1dd31958b98d","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"312ca2280c488705f6196a1237711b9292ba573ca745e7245e617d32a9d0b62a","target_edition_id":"edition.r017.id-id.draft","target_line_end":142,"target_line_start":139,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[139,142],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92532d0e650877ef0eed265bafbfc02a44281be354edb80cb33490e28222cd59","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a819d781adb2304b3950c467312c33c85a9034d4e769db4737aad6f0b1a9582f","target_edition_id":"edition.r017.id-id.draft","target_line_end":155,"target_line_start":144,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[144,155],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"15b3090eaaed34c71481db71cb21d5877b893e1db3ebb58c2264990fd6962f2f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"080fb3fef2aa018c90b17254819617a3297dab0fd43922a2179a71d812ff279f","target_edition_id":"edition.r017.id-id.draft","target_line_end":174,"target_line_start":157,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[157,174],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6a9071715e238569bd38b50c6b1c380e29d4a34b5be8934c7fb392ed857c6a19","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"29802b26f70fd8dc79d5f863c2f8206c9c7831074b1eed1692c2faab997c07c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":187,"target_line_start":176,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[176,187],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f2d4882de491b53a61d877aa09844eac72d4a7b8093a5f29f7da1d07af6ddb0","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"54aa479dd883714c5c20b4a89cb8ab43f9bd14f117610101dde20b368517364d","target_edition_id":"edition.r017.id-id.draft","target_line_end":189,"target_line_start":189,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[189,189],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6519ba545b98b383cc355d998731c712f28610c8da746f12091d6cb55a7954b2","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4c575d355572b49c3b1376ba2af187119edf050304ed825132de7436de183278","target_edition_id":"edition.r017.id-id.draft","target_line_end":191,"target_line_start":191,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[191,191],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"03dae988523adcf2842b53615bf7a5d7acd0ea0a6dc8818dbcb81d3b7faa5715","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4d9fb9381e97f29d209f5ef3a9c0c0c60b92dec96b4217fdb566c82a2e9a6da3","target_edition_id":"edition.r017.id-id.draft","target_line_end":203,"target_line_start":193,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[193,203],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"59442501a58e77a673684c239e67f8c3b00bcad99c254bf07b60ee30a8a95ef7","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"efffca290a9808fc82b3198ebe9f93cb8987403e9ef1d0dbe9fb167f97ac6336","target_edition_id":"edition.r017.id-id.draft","target_line_end":208,"target_line_start":205,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[205,208],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bf3e60745668c83774e5bcfb9bee5faac1c9b997963123a960aea48861de322c","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e68295d289289b988af4d677cca499aca96d42afeff8ae2021d6a5e6220a58e","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":210,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[210,219],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"efce9caf5f9f71ce2dbb52b1f604258ef1fc6eb59f3999c4f9054a26e2c48c27","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4f792886686c11b3e7b296575fb93adb2c8afe2aac775e14724c376b5f90d6f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":233,"target_line_start":221,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,233],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2d3c49a9cea859a1646b2f0acd7fdfa5e975e1d5cbaae87a105e9834c120fd62","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"721c60c6fe81e9362ad9c622299345370ea58beef6f5f84536e841fc8fa7003b","target_edition_id":"edition.r017.id-id.draft","target_line_end":258,"target_line_start":235,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[235,258],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e02b079f9146143b8bac2086d9aae04ea3a7347dd624906d3a6b812509cd0fa","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9bbc1c76e32db3b840c4cbab608f7e63e597ed03c33018843eeab83f32382627","target_edition_id":"edition.r017.id-id.draft","target_line_end":260,"target_line_start":260,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[260,260],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6a2d85200425ca66c612e28550efa83189587476e53a700333f61d6304ce31a0","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7bad29f6ce39837c919d325856eda646129e20c714b9bb7a9efb16b500bfa37f","target_edition_id":"edition.r017.id-id.draft","target_line_end":262,"target_line_start":262,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[262,262],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16b2aec407138251ef7a4ccd70eb4d41e59ae82eeabccda8cdd1fe424ef05405","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"34d6acf10ebc6d1a477b60306238ee875531a7f2be34120e25ad72dc0a81395d","target_edition_id":"edition.r017.id-id.draft","target_line_end":274,"target_line_start":264,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[264,274],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4fdc4ee3566136d833de02f3d535ab9ae58be100ff2dd62ef0b16e85796e8ec","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bfa62283b6637985caeedbe8d008198b3c894912c902e9490fb058fa5d7d437a","target_edition_id":"edition.r017.id-id.draft","target_line_end":279,"target_line_start":276,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[276,279],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"89a8d93e923aa91a29ad4d8e7f5e0409a525a693494abafed94d070fc4e7bf8e","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"29b815e57b875cff7499c8f93679b1b3cea8c7516490224f0205e8a7620f3579","target_edition_id":"edition.r017.id-id.draft","target_line_end":287,"target_line_start":281,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[281,287],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fdc7856cb4ee728d87eb8c6b43d6a29fc925656610d1962e697014f34603a6f9","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-044","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"57177c91595b26c00374a1423066d374676ea266b6f10519fec2dcb08fca41e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":301,"target_line_start":289,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[289,301],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9e4136d7508d5bd435acde567f844ca83c90b518ecdacb64a9e6e795b22af33","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-045","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd997b8f61633afe5235ec3a8210aee83a42135047cba78e566219ab372c234a","target_edition_id":"edition.r017.id-id.draft","target_line_end":325,"target_line_start":303,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[303,325],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"749301e9ab278fd8a2808bca3a2c4bf31ac473696183c8189f0af5fbb4e73082","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-046","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"edac494bfc4f4feaa11cce25ef53eaef05f1321cfb3d12e12d154c081b38a106","target_edition_id":"edition.r017.id-id.draft","target_line_end":332,"target_line_start":327,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[327,332],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef5d9727aeeebf465160e10d07debaaf3b91abd53895353481a9b7595909d904","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-047","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f8691e8bb0fb7d7fabfad7f93b6bdd3f301292fabc0d0bce144b1c004d25f1bb","target_edition_id":"edition.r017.id-id.draft","target_line_end":336,"target_line_start":334,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[334,336],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c149f2f06c8a10343bc7d7fa855906e8c70b65cff3793b6123bde1d051094ba","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-048","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b4ceb67497e6fcda61853fcc4a75ac9621302fffff810c7acd363229d8fe09cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":340,"target_line_start":338,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[338,340],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b0a577adcd7ca053b80ecff0e93c719dc5e1c633b78f17eeb69a71463f797f24","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-049","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5bd7b305c4a797f8b98523bf747a66b5e982f8b68d34531a1fc64e0bc33cbce8","target_edition_id":"edition.r017.id-id.draft","target_line_end":343,"target_line_start":342,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[342,343],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"995036c427defc65c04647317885a1744cd286c5e2fb3e13beb1ad1ebc2dfbcb","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-050","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"939b46b58a7e086ffd2fbb0ce486b9c3d88e339d215543c8492703499ca199c2","target_edition_id":"edition.r017.id-id.draft","target_line_end":362,"target_line_start":345,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[345,362],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10c5860336aee2f1578582c99bcac56e8d6aa9af300fd99147d4c4f16a316f91","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-051","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7d576e4ef3ecfc4c4720ff57afaff06ce4790c4b446facf80a97acf196d7cebe","target_edition_id":"edition.r017.id-id.draft","target_line_end":364,"target_line_start":364,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[364,364],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5e4d01ab340b56f6a2fb4877e7164144ca763ea7f5c5c407d12416090015a0f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-052","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7ec2720d9518e5bda9894693a95cf4342a74333562b88b7054b2c327b7c62c30","target_edition_id":"edition.r017.id-id.draft","target_line_end":377,"target_line_start":366,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[366,377],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"22176c7ce238ebe3359faf694ba602cf82370bb7e27314151b199346764cbef3","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-053","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d591e38c30f203df296c8b726ed1a53348d25ec7ef957466d52ce220fdb41e42","target_edition_id":"edition.r017.id-id.draft","target_line_end":395,"target_line_start":379,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[379,395],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d38d4a27beb1832c6e9fea1c4bea57c1a243e1dc0c6327f4fe660ecb901b6dab","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-054","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"024ccee2df0ba9fe47c0b7acdb6b146bbb9aed196bb69b48bddc119e4f44900d","target_edition_id":"edition.r017.id-id.draft","target_line_end":397,"target_line_start":397,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[397,397],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e271848579b81a52a125d23aa8e334afd8f952947e29dc4da325862204a892b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-055","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"71becb94c11d1f1ec0943a3e7d43af11f3aa858e2e267eca5fb17b48b474eedd","target_edition_id":"edition.r017.id-id.draft","target_line_end":410,"target_line_start":399,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[399,410],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ca51f7b34bd36f1e080501809b57a52bcff37f0e50fa5dca658152a7f4fa35f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-056","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1ccad466b09599217a44ca9cbc8efb9ae9650cb57bdccdc25fa582281a02aa68","target_edition_id":"edition.r017.id-id.draft","target_line_end":428,"target_line_start":412,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[412,428],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b22b18c0fbd571449fc33f7a06cea31d9d51f30ba339230b67f2de29a9b3b8b6","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-057","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6f2a004f876843eba707dc2e737d034ff0cb8518210ee38d6ffbd7274de312e8","target_edition_id":"edition.r017.id-id.draft","target_line_end":430,"target_line_start":430,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[430,430],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"322e31e961a184d684c18518e4e04d7a046b2a642b8fe5499925a80b0ee2fc46","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-058","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0928be328a1d19ca2e10f2580d5ca8088715f9f0fe53fe7e8bfb90da3ff578ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":442,"target_line_start":432,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[432,442],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"29630c4d31da2aedb5c21d0cc81a20684ef932fec6b8c0f892921ed71d21346a","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-059","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":444,"target_line_start":444,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[444,444],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6313317daa7ea1e20560cf2a5648501cb489d5a51b7ad5e516d02688a3f54c3","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-060","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"54d822e9d27565543f136068478f304db4bfac3748862636948a072bf5139cdb","target_edition_id":"edition.r017.id-id.draft","target_line_end":446,"target_line_start":446,"target_local_id":"block-060","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[446,446],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"91fda062d8fbf204804f524b420565d43defc4e4682ef39c867bd8db53c683d5","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-061","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"26a2ae812c25ac1acd33a4e7801bb5519b0fba581cb7a89aae25a0cd6c5722b5","target_edition_id":"edition.r017.id-id.draft","target_line_end":453,"target_line_start":448,"target_local_id":"block-061","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[448,453],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"819720385c2f64e5a2564f0d2e51e866e57d24bd70f48efe3dc9ab1d5a2db93b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-062","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8e23a20e909011fa25b464030a8d797b75be1a9f1a54ccfdb53237a14e199f57","target_edition_id":"edition.r017.id-id.draft","target_line_end":457,"target_line_start":455,"target_local_id":"block-062","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[455,457],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6941799d1ad44b6142185127dd143c10df471dc7b53462d713de30cc900c005e","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-063","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"70718a8eab570fb98e87f03970f21ddb632ec9e28b687f6422bcf92d734a60d0","target_edition_id":"edition.r017.id-id.draft","target_line_end":460,"target_line_start":459,"target_local_id":"block-063","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[459,460],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"becfcac94a0cf78d763158b2d5b61d73f88f01c7f7288f6e4525bb6c5af67b82","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-064","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"adfe0396bdc5950b9c23ada99532ad0854199e16b3fa2bdafe316d60e070e734","target_edition_id":"edition.r017.id-id.draft","target_line_end":489,"target_line_start":462,"target_local_id":"block-064","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[462,489],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ffa8480f360db2dee9c767077b3ee006160d7c7d261538dd3be56805a84da178","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-065","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"252ab114758532bbd13ab2ee4f0fcc5288fef941951cd29d368a57bb34b2f453","target_edition_id":"edition.r017.id-id.draft","target_line_end":495,"target_line_start":491,"target_local_id":"block-065","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[491,495],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bdb54b89fec0341c39cab0e151a0321055d6472348dd693f227fef7b8ea48cc1","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-066","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bb57b80b5cd04af70d391942a196109c9e84bb9650ef56c6c0c93ec079051765","target_edition_id":"edition.r017.id-id.draft","target_line_end":499,"target_line_start":497,"target_local_id":"block-066","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[497,499],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c70303253dbc7758fe62e2317d7749d153e9262f74278922965a6b0b9b778cde","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-067","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"55a5a005f6a77ba9bbba8be4c2757baba22cd89641f06c3462f1a2f6d729befd","target_edition_id":"edition.r017.id-id.draft","target_line_end":505,"target_line_start":501,"target_local_id":"block-067","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[501,505],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"977f2d8b0b23431e8556fb3b3946f5e10c8e3d5d3ec75aebeebd580dcf888729","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-068","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7e8481e47bb502e6c54e92f2bf9d9b1b44566b36e25ff0dbe666b87250fa8563","target_edition_id":"edition.r017.id-id.draft","target_line_end":507,"target_line_start":507,"target_local_id":"block-068","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[507,507],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"acabf9a3b8c57f4ce8e5964943eed5cb07c30927def519259f4ef36e1500da3f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-069","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd1924505e6e22edbb6d1e4f76758bf5cd20a436b536829d4209757012b9bbd6","target_edition_id":"edition.r017.id-id.draft","target_line_end":522,"target_line_start":509,"target_local_id":"block-069","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[509,522],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cec9099348376d028c6af4d9a7420bb66e3f3147e15301fcab389fb48d93cca5","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-070","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f04687f2f039ce0afdcecd1c1ea6efb72f04bd68ea0bca0e951cbeb224646fe6","target_edition_id":"edition.r017.id-id.draft","target_line_end":524,"target_line_start":524,"target_local_id":"block-070","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[524,524],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"685e12cb167bef65330fcb7f0cfc0f17fa64f8c2308e596c2079ccd06ccf9d3a","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-071","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"430298927d6377b930f09a882a3bed521b9cf63b42552b69cdeef6cbb6a88f53","target_edition_id":"edition.r017.id-id.draft","target_line_end":575,"target_line_start":526,"target_local_id":"block-071","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[526,575],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab017bcc45dbb8fbb8c91fce17e7c4d62a2dd5bfc85488da7395fc454d67bcaf","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-072","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"068141aa90abcbcfb1de57628b3253eb31f3c34df05c523aa9a4dcbbbe4fece7","target_edition_id":"edition.r017.id-id.draft","target_line_end":590,"target_line_start":577,"target_local_id":"block-072","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[577,590],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"009219b1d9709c06563e9a2048a1dbeb0b718ed2e8086b6cb6148e75b07fa2fc","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-073","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8df4cd070608fa5c0833dd6ede9c91cdf1cd9b6569cefd8c0fc36ad48094752f","target_edition_id":"edition.r017.id-id.draft","target_line_end":607,"target_line_start":592,"target_local_id":"block-073","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[592,607],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5a48d0c0107e770a4bd3a8e7a1567384a69bd82ed99daa8e07ff2e84075985e4","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-074","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1a07615b638db9d48840c9160318b7b74fabb7b083cb4fd8b47560a0fc9b76a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":629,"target_line_start":609,"target_local_id":"block-074","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[609,629],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b982a22fa6c73e02320558647b6bc75d5b18cfb8f8ffbb91c70278a7f0838933","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-075","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3da865d0e422fea73c2d34cdaa816860c8ac11824e88d96d62c557bebfdd840d","target_edition_id":"edition.r017.id-id.draft","target_line_end":634,"target_line_start":631,"target_local_id":"block-075","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[631,634],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b067479e2b5140c2220efc07998011c5337f741c13bd740d55a29f85feb643c","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-076","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f283608774fb3e201f07eb6ca7ca2a96e4b7d5dd0174358fddb06db01593030","target_edition_id":"edition.r017.id-id.draft","target_line_end":636,"target_line_start":636,"target_local_id":"block-076","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[636,636],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ba276ec26ccb6639b095d2ed7d16f52d6736e8767499fa7cec6b84bddd238492","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-077","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"47e03a4e8ae6c34096ac5079e5ef4a91ec139a52b696fac4e86625e3410f1b2f","target_edition_id":"edition.r017.id-id.draft","target_line_end":638,"target_line_start":638,"target_local_id":"block-077","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[638,638],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8cf02e028a4648eca357ffa4c53fb8469b4d50d911a9c96a19d0ff846e52312f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-078","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1c4a975399c8b11cdbb6d8bde9d6e51bd7f93e7c2524304d086258a7a045043a","target_edition_id":"edition.r017.id-id.draft","target_line_end":643,"target_line_start":640,"target_local_id":"block-078","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[640,643],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a431e045adbabb7be94fc63094fa8fafdee64e2e4495abea4a0d90cfffcfbede","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-079","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e0b72c0f54511c029663dd96f08e53d6b65a38e0a1530cf4ecdbd81d0deea659","target_edition_id":"edition.r017.id-id.draft","target_line_end":661,"target_line_start":645,"target_local_id":"block-079","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[645,661],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce801764140a591ff53693ae95f6dafa441c4485fe29285fe948613fc6426603","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-080","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"10f83afb61425f087f38e39908e3a913532e7235b9de99bf1d654b745080f0a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":689,"target_line_start":663,"target_local_id":"block-080","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[663,689],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a40cf366bdfbafd366fe8a1c4eb53645817bfcae1e5b6800873bc0d7ceea8c5","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-081","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"35bd1c27c646fbe57e1e67f0721b86262900e442eaec936242b74dbeb9c43e4b","target_edition_id":"edition.r017.id-id.draft","target_line_end":697,"target_line_start":691,"target_local_id":"block-081","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[691,697],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2cc2df0a0de9d35433ddae7eb10cbab07bc93384c05691a83ce8f5d91fa84e78","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-082","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e5c5a1f897ee3959e7f479b1475e18c031fb47d365b245f6decd6e81cd1aa4da","target_edition_id":"edition.r017.id-id.draft","target_line_end":716,"target_line_start":699,"target_local_id":"block-082","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[699,716],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d516e65306d7915b0de7b1ae19c41d216304f04e7b8144d4bf00fcc2c6b2f6c","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-083","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b65739ce5615706ceed60825a2c0b0ab8d128200763d68333cf0bf80643a970c","target_edition_id":"edition.r017.id-id.draft","target_line_end":719,"target_line_start":718,"target_local_id":"block-083","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[718,719],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d24943f67f94d63d6cafbf98eb78467468c4ef1cf2ce825b4c02dbdd1138a2e","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-084","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"83916ffffdaa7f8562b5193f9f10961c25c0a880e17ddaf0f0b623587a2ac385","target_edition_id":"edition.r017.id-id.draft","target_line_end":722,"target_line_start":721,"target_local_id":"block-084","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[721,722],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a3a2d1a7f76f33dc92414733be2726d3c98f608e24f66ac7cf23499a777e4ad","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-085","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f9ea8afc152f60a1912d00393ba7d5b570e41d173e3f022f1f8468c7f7715dd6","target_edition_id":"edition.r017.id-id.draft","target_line_end":727,"target_line_start":724,"target_local_id":"block-085","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[724,727],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec38c2c6cec73aaa6e33152ab6d8f04e0a9291d5a852c6880dbd275a359b676e","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-086","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d8d5bd5f6704a21d9be9b39fa827da37db8f6df1a6cd96044bf3d4bacb970177","target_edition_id":"edition.r017.id-id.draft","target_line_end":731,"target_line_start":729,"target_local_id":"block-086","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[729,731],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61e5e0bde34fa404d2cf0be17e6aa98b4cfd37a50cc106faf55b15a592725404","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-087","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"615c29d13f326ec0150b0da44efe39f72ac3c9ff1f404772db00b3b7a65e46c5","target_edition_id":"edition.r017.id-id.draft","target_line_end":740,"target_line_start":733,"target_local_id":"block-087","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[733,740],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4080f84ec817d8f8aaf733be102b5bf5e1841d327b6121f84ef6a0d5fad36e2a","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-088","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2378a59eb7d4973502b729fb25688a6c781daf908de4600f4ccf53ff6de662be","target_edition_id":"edition.r017.id-id.draft","target_line_end":742,"target_line_start":742,"target_local_id":"block-088","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[742,742],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb80afaf887c00bfa58548871fb0004303ec7eff2cb767eb648519dd72afc558","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-089","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8bddd55284780b51ea76c36a45cd3bf13594c864ec881e68869a2eaf28ba4312","target_edition_id":"edition.r017.id-id.draft","target_line_end":744,"target_line_start":744,"target_local_id":"block-089","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[744,744],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26dc66404b41ffd96e934750427c88f5148c441c6520a0a03eb7b4843e863a0a","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-090","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ba119253d23bdea0598cfb63e7257b9092cfad18e041dc54a8304a7e9eb231f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":765,"target_line_start":746,"target_local_id":"block-090","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[746,765],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cba4a50241e0a642e3910f561b37966552c4c013049912875a3a9b7bdb20a8bb","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-091","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ba154bf4f7551cfd98090f581bb28a6a589306aed64082097cf4541ee88879ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":812,"target_line_start":767,"target_local_id":"block-091","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[767,812],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"97aa01dbc937503ee8bfdf3909ac20ed907e03f6010f83e16593bdda0562c384","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-092","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bfa6009db21619cd43dcb51bb3294db6837e5c91cf8a07c6c861a49ed56d2258","target_edition_id":"edition.r017.id-id.draft","target_line_end":828,"target_line_start":814,"target_local_id":"block-092","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[814,828],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a2a2b74f75325a651d281b2127ae29b6770bd7f3a762066aada15b18343b6d28","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-093","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9403c4c74b028665201ccbb9308ee314a5d718fdedca0e71bdd0e686a18e6333","target_edition_id":"edition.r017.id-id.draft","target_line_end":831,"target_line_start":830,"target_local_id":"block-093","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[830,831],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48fdba3a7c18c56d6f4b2f4165d5dd57c3ad211683d8ad7f607dba1b1e542f06","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-094","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":833,"target_line_start":833,"target_local_id":"block-094","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[833,833],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37c4cb8816e820d8f549a45ae7df90ea4274735754329bb9209b2eb45d3efddd","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-095","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"858b55bce656455e978618a2af4238d5e949892cd18bc4ca958c1c1719f0094f","target_edition_id":"edition.r017.id-id.draft","target_line_end":836,"target_line_start":835,"target_local_id":"block-095","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[835,836],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7f6f7f4d2a9d9f00a8d5fa1c49e59fe51b56b027c686bf6db8db0aca3ab3d51","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-096","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d9a7a14a348aad6f8c62e8be10286469681df9eada38a79b150a20a892f4d5d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":838,"target_line_start":838,"target_local_id":"block-096","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[838,838],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d84e649496f1f0929b6c06d0da6ff1aaffa7df5df8455d6d70587b421c76bf4","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-097","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4fe5189250a013a712272e016a2865a4161781f3dd9d36f8204cc40a99150c5e","target_edition_id":"edition.r017.id-id.draft","target_line_end":841,"target_line_start":840,"target_local_id":"block-097","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[840,841],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"45701a6ac720ebbfae1704656baf92cd1ac44feb139bc0a279e622e273621d21","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-098","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"157ce2ca4ec433c5667a28028441b90ee57a4c1310f04b24f3576b657da8eb56","target_edition_id":"edition.r017.id-id.draft","target_line_end":846,"target_line_start":843,"target_local_id":"block-098","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[843,846],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cba1e9a006459b8c27c6a89ea5a30b7688f4a0275ee2017076a6e43e2c0f68e0","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-099","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2e33b0391773ba86468c0815068cf558e28c28aff6a1bf344ec9dd913d955601","target_edition_id":"edition.r017.id-id.draft","target_line_end":848,"target_line_start":848,"target_local_id":"block-099","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[848,848],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2a026670d8f1a74ec6f6b7a74dbd4cb44c3776ed47a9198bfc1267947ec613a9","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-100","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4614bad2c60d975abf36d48eeffae10bd7600f664dd3fa49a3369f41882ae324","target_edition_id":"edition.r017.id-id.draft","target_line_end":851,"target_line_start":850,"target_local_id":"block-100","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[850,851],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"08805d701432d372d632c79d4412174af4bb68b0a18d6b6a118116a77d217ce1","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-101","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6916549ad1d7c57ffc731d1ee3481fee5e9aa057fb6aa5428027fc57c7e581b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":853,"target_line_start":853,"target_local_id":"block-101","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[853,853],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1190c00c532283d2e12a53afc7166ce0d1855efca45d25929bc5d8fbae4bb492","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-102","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3763d749ea11f4a77eb7723d9aab9e1852e5ced39b824ce802ba7da05f92ddfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":860,"target_line_start":855,"target_local_id":"block-102","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[855,860],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"adb0c9ce7c4932542be761f5c60908cb1699611b39b7fbec83ebe9418a1c831e","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-103","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"429c30aab7c9af06eceb414a56dbc7d0e1c8d2d4ba1c8bcfd2809865a6cce865","target_edition_id":"edition.r017.id-id.draft","target_line_end":867,"target_line_start":862,"target_local_id":"block-103","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[862,867],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0ac42917fc05ebd4da772073cf59b57056b0d6d8d52c2277645a79ea2f73be0","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-104","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ea83a2a3e62c391615084237fa468864d000b9e8639a5ce5fc9b6a344556f54c","target_edition_id":"edition.r017.id-id.draft","target_line_end":874,"target_line_start":869,"target_local_id":"block-104","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[869,874],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bd83c36e7bde6e1e764605b1bfebcf3d6bd4ca503f7c436c866276a0b31ccc4b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-105","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":876,"target_line_start":876,"target_local_id":"block-105","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[876,876],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"31611ad6b0741a464543349e612988eeae337e7baff230054e95829d2051e07b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-106","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":878,"target_line_start":878,"target_local_id":"block-106","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[878,878],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0142291b3b4c2b46cd8ca113788a7b10b54f529ee35dc6f105dce54e56a13834","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-107","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d6d19d457b1c47e5478af30bd576c548ea01ae431bc5efad1668f3325ccd30d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":896,"target_line_start":880,"target_local_id":"block-107","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[880,896],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e37a78be0850aadc0d1dd65e495dc37c4f06b72c3ccc1d23abb333a9e5a58b8","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-108","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"80af2ade462f1a8991005ac88981bfb34b9556c771fc422d92300ffb6523cade","target_edition_id":"edition.r017.id-id.draft","target_line_end":918,"target_line_start":898,"target_local_id":"block-108","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[898,918],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0eb7c0dfdf1ca9b75b4d790309a0b129afc1f9cb90b2093f740372577d55aceb","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-109","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c29653163597dbaf89115d100a1500de209b3c69e6a048faef756d72b42a4c87","target_edition_id":"edition.r017.id-id.draft","target_line_end":922,"target_line_start":920,"target_local_id":"block-109","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[920,922],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb17a85ae6a5c4244da3c87e74a4a2d4805f2754b8b32c57bed758e52d340cff","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-110","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e3f87b06f7a641556fe14f6828c82cf2c975b6a9ee5826c46c7cbd0d343ca7a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":924,"target_line_start":924,"target_local_id":"block-110","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[924,924],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8cfb83f5bc256510a27797ca7f76bc036897dcd3c05af7eb5a3b1d0a034fbab4","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-111","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8a95e635a55e6c08742cd8ec07458c0da20698834760462fabccb21900cf209d","target_edition_id":"edition.r017.id-id.draft","target_line_end":929,"target_line_start":926,"target_local_id":"block-111","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[926,929],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3f3458a3a81443e00b3fc6f1589bb2379afe3f81fb039d2f6883c3670343131f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-112","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3485247a90067ea7f6ec86c50148436209f682ef3f6f8e40532392328162799f","target_edition_id":"edition.r017.id-id.draft","target_line_end":951,"target_line_start":931,"target_local_id":"block-112","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[931,951],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"225b23145082a2e67a159275a4d532d311fe6c5fd4dab18284d95a94a8a98ccd","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-113","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c9500bd36abd693f677728c996a27b3b19a8443996123eeb73c1f4c980ccb5b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":973,"target_line_start":953,"target_local_id":"block-113","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[953,973],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"77475b25d0b6f896975d6008825e54007905a9ae496d632cb31654c0dfffbc27","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-114","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2d59a18969688683e5815668b6787de645052fdc969a3eb9d506a48bb35e01d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":998,"target_line_start":975,"target_local_id":"block-114","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[975,998],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26e0ba3ec9d83828a87a1e9a85b2f141bebe0b01904962eba7c78d3ff31badb8","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-115","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"16392fcd70d891d3fb72564822ae6d56ed4f20cb2c0b97f30972cbba9b90df47","target_edition_id":"edition.r017.id-id.draft","target_line_end":1001,"target_line_start":1000,"target_local_id":"block-115","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1000,1001],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef11f3113289a0121113a0167fe8f28cdaef5c59fda938e598e5426f547ed6ee","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-116","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0fdf008a6861883f9a39f37d0322cbb98ff2feb215182c9aef4a2c479b587b38","target_edition_id":"edition.r017.id-id.draft","target_line_end":1013,"target_line_start":1003,"target_local_id":"block-116","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1003,1013],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bcdd342410ff7b8422a261ee0d2185770597b11d893396ea26ec6b81adbcf532","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-117","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1015,"target_line_start":1015,"target_local_id":"block-117","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1015,1015],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6fe781a6e135d8f7faa1ea090862cdfc78730953d81357d5b714cfc6c4620910","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-118","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"478e8ced96fe87042192607ceebc441dfa2eef71532861d71ce05cfb16691bd8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1028,"target_line_start":1017,"target_local_id":"block-118","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1017,1028],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"009ba6f5570dfee5c5ab772e7a00dad9a68cc1334fdf62f7f35497878cb9482b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-119","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1030,"target_line_start":1030,"target_local_id":"block-119","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1030,1030],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"56366d2b6903bee1fcf375b70d17054206b6e5ae05f70f9d64bd73b79e65177f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-120","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b49500d599b5d339452d3ab7b5f3760573682da4adf7133dd3090e10d69aad7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1039,"target_line_start":1032,"target_local_id":"block-120","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1032,1039],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd0fd1f8305b3a2410c1a20e0a3b3be667a347de91857fa86a8365c2b82b3533","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-121","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5a7c51fe019c052d866e25f75541baf5ff511cb9d0d48737b288dcbb3fd56de0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1041,"target_line_start":1041,"target_local_id":"block-121","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1041,1041],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c3248aee3f22de47eb80c3507c23c9f23570fd3342e1210e8d962a2b82a474a4","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-122","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"69528a4aa50e44883038da3b2e89cbe05bfad6f0f7db32c17da8090661bd77a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1055,"target_line_start":1043,"target_local_id":"block-122","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1043,1055],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e34986d2e0657770552681d2d701446e32127dcc9e1c646ceee71d562ef5f903","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-123","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"185d296f51630ae44516f6ed25993b69fd56594bf24f169876dc4b40c4d850f2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1063,"target_line_start":1057,"target_local_id":"block-123","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1057,1063],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7fe89fdcb8530638c2966f233b0ab8009d8accb05ffc314e586162e517d959e2","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-124","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"94c27187483f661303ac0336b7d0d9d0d630476b1f267b54194beded4c4553ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":1072,"target_line_start":1065,"target_local_id":"block-124","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1065,1072],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e8475804014648baeffb2d15a248b4f9b34d953479a4996331603def5fa3966","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-125","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e56c47544f8cca5ae3ecfdcf00f3fda953dd6e63e28565546cec92f1f62afa39","target_edition_id":"edition.r017.id-id.draft","target_line_end":1082,"target_line_start":1074,"target_local_id":"block-125","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1074,1082],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b8e02d8ab091ebba1d0a17620e6ad17d73bb1eed685ed7b0742bbfb0c66bc673","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-126","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e893964d1bb2738aad023b22602c967cd504af614fd14ecc42381798f60a0379","target_edition_id":"edition.r017.id-id.draft","target_line_end":1096,"target_line_start":1084,"target_local_id":"block-126","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1084,1096],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"272f2939b4bd66a2a7115e9b580308d982f0731432c8bb5042314d08f2986003","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-127","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7c4176f9ca89c18c50f3aacc3b3a978ec2d874e6385a52e4b13e5c4d0a343459","target_edition_id":"edition.r017.id-id.draft","target_line_end":1098,"target_line_start":1098,"target_local_id":"block-127","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1098,1098],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0445c8349ccdff633df71f94a1f6faa3faf2de915b2f85063d351e0bb420a901","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-128","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2f1cd08a9301eafe47a47487d12d727d382469671108937093c6747b7308cd1b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1104,"target_line_start":1100,"target_local_id":"block-128","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1100,1104],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"036c469894ac4e26aa37908cba8e85b2b8d8e5de56d8ad31136dc961916acd91","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-129","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1106,"target_line_start":1106,"target_local_id":"block-129","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1106,1106],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c3146d80ba2f8f26b5a7a1e4c7358b9a1ec7dd12bd35f9d072930a3d51d0907","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-130","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"178d861bff5bdf529dee04742cb63bc1fdffa800aca48bc24e12393848e6475c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1121,"target_line_start":1108,"target_local_id":"block-130","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1108,1121],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57590fa2424394d3138ce2bec83477847d76eb267a69d8da1f7631c8e32d0142","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-131","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bb4c8b0b9860cfb9e081df63f3d4cb27eba2905c87b9694492440d0065719ade","target_edition_id":"edition.r017.id-id.draft","target_line_end":1141,"target_line_start":1123,"target_local_id":"block-131","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1123,1141],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"86349cd04ce2f14829cf15829236097183a92ccb437584bf8db7a710c3bca02c","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-132","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6dd671b097c1db712efc93df4b76d86f46ec93d14ec3e91d2d64865cc686dbb6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1144,"target_line_start":1143,"target_local_id":"block-132","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1143,1144],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c32bbc8cc152e9f7bcc60ab474ec74b13e4fab56258d07e2bbcdcfb64925c9b4","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-133","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3bf09e7adcd2eb3e4c2308769153e311f74451496c0e2780abc26786dcfced37","target_edition_id":"edition.r017.id-id.draft","target_line_end":1151,"target_line_start":1146,"target_local_id":"block-133","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1146,1151],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2846eb2edc3f8f81a1011c257ab45ad7523a74c5bff2344b556d2a20c6776cc","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"id":"segment.r017.book1.ch10.text.block-134","locale":"id-ID","parent_id":"unit.r017.book1.ch10.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fceae2acd208d998b25b66e0788c9d5f4f883e4e182965d51b1fa6c47bf36172","target_edition_id":"edition.r017.id-id.draft","target_line_end":1156,"target_line_start":1153,"target_local_id":"block-134","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch10.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1153,1156],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch07-sensitivity/sensitivity-LP.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82fbd045fbb7bd6bd3ed722dcd5cf1bfff7548270caf1c24969721546c1a934b","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c2675d8bee2bf96dff661fd5c2a64877c78f28e004be6216607612faad48b8bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,9],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"42fe082998afcd26f8656322f6cc77bbae67bc9c495cfcfd9e4dee243e4a1315","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"59a34122a051fbc41a485c85eeb18d30232dddb1c7c29eaf6730b7c0ff372b4c","target_edition_id":"edition.r017.id-id.draft","target_line_end":11,"target_line_start":11,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[11,11],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5395a6aa035ed2fccf39d72ce285621291d9aff82c847baa153e21560ea87a2","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"378891c04dd064a3cf6c12c8ec00f8d80c220187d70a021f4d401074426ff231","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":13,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[13,20],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d1d63529287907198cd359528ea8aa18289ab6b00e2641751fd0f235412cf818","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c88c77e660e52715fcb537cd5b58c3de6173783f85d9a296d8bdc7dd8a2b0dd4","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":22,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[22,23],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5cd55abde7eae1f3996e415c57c854e70b328928829d3000bc8767ae5033c8e0","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8ff28b96c263e71cbe8bfeac4f2a77bd259af7f5c64626730381f402dbda8dd9","target_edition_id":"edition.r017.id-id.draft","target_line_end":25,"target_line_start":25,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[25,25],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82868994d8b76276825fd1453f67e205a1b283cd207d405979ae06117155d2b8","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"38fd196b70fe4b6047d185889274cbfcc1db8db52217b2284f9b5f7a95439196","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":27,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[27,39],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"252961c2a81357039e526361ce57cfe85b8971da4a509702814818689580605e","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"524544c1baf08390a12e5f69cdac6e2c28a163110be1075dbcb9f4d058166d86","target_edition_id":"edition.r017.id-id.draft","target_line_end":41,"target_line_start":41,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[41,41],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"40633a46ccd7014ec9ad7ca3912b1ae27208c33c1174a3686cb1e5bbdbc33d8e","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c2b7174c1f6f1948fb1195e65c5564096a4b013a2d27694ced52d3bec7b2fd33","target_edition_id":"edition.r017.id-id.draft","target_line_end":44,"target_line_start":43,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[43,44],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7af54b04fd4f655c20e3624262fc1ae4194a8f2ea4a5c8153fe088ba8bfd83f","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"64a531b66d2500d5a8962c62dee4a8189754a8cf9fad355902bbcac62cfc5797","target_edition_id":"edition.r017.id-id.draft","target_line_end":55,"target_line_start":46,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[46,55],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"495b1dc72701020a5f85a8a6c78e0a18c1daa4a6fa15538dc09b68210e85e7e8","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5f2781e1e8ae74ad8f57cae1842080ec89514f861d2f81c129550e2c84a6a296","target_edition_id":"edition.r017.id-id.draft","target_line_end":58,"target_line_start":57,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[57,58],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5ca3822099e9fa25b02471e425d2f3a83d4e8bef96690b08a7e9f95c7ecd0582","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a9863fc45af3f5b894a44cdb262457c31982ac325d9ae5072d3b2acf60d73243","target_edition_id":"edition.r017.id-id.draft","target_line_end":60,"target_line_start":60,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[60,60],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3413b644891f025b19369f110538a09181cfde25737e950164ffb811a2ef24c7","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ca605548ad6c64ec8ac701979be97ff37762da0a1fd5b05e3fde7a55d71a5f62","target_edition_id":"edition.r017.id-id.draft","target_line_end":70,"target_line_start":62,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[62,70],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8441b05450e700ac92892d9deb48614efd77111ba1eb35221f12959c42fef2ac","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"40fd95b6973885ac469cf401da6ae5238b7deb7468182fdb5d61c5ca8926e993","target_edition_id":"edition.r017.id-id.draft","target_line_end":73,"target_line_start":72,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[72,73],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ae141ebe0098f6a4acbc30b7e9d7d49fe006217ac2d7fb2a3c9f5f91d7d96f2","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d6c43191a797e0dd1b2caa4691dcce091cf394204d180d3f05d184059de3b99e","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":75,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[75,75],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7411d70812d22074814eeb8b8e74d71304fa11acccca2ae155241d046a254944","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0c5d7bd3fc7abc68f8b7551ac1b8794b28d859563b475cc5518337237e2e7f22","target_edition_id":"edition.r017.id-id.draft","target_line_end":80,"target_line_start":77,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[77,80],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae5ea98195ef54064e04360493b1e235820c8e17fb9074968672c6e5d6ab2413","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"360cef3d91353c5863dd0a21ec689da9a9dc78fb945f8a1d284366faebae8292","target_edition_id":"edition.r017.id-id.draft","target_line_end":83,"target_line_start":82,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[82,83],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"11ce0a9dae663310048aa1f3ce022e150d66555f1e0a54aaadfd3a93f2af8809","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fefcd6e3a2336ef2fc090a391f015232841a245cafa87d02e01d757958fc273c","target_edition_id":"edition.r017.id-id.draft","target_line_end":85,"target_line_start":85,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[85,85],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae324f05db7844542b21221447b15e84a12fc3613d7087623f48139601f2fcb2","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"167d330aecd9e00067baf771d15b23e5f8b93e3930810358b6d62dae0f298ca3","target_edition_id":"edition.r017.id-id.draft","target_line_end":96,"target_line_start":87,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[87,96],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1f975e1a76ef2388566c0cf711f589fb35f75398ebd88cb39111a1e04f269a0c","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e1923e5dd1409ca46cec45623464ed675dd23b741595b2caa2e55373b169c717","target_edition_id":"edition.r017.id-id.draft","target_line_end":98,"target_line_start":98,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[98,98],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7e2d0ccd9c6b8e72940a895a26a97a10bff9edf43133f54728dfc5b23d2edd1","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f10379656504880bc66a67e3006a8f72b8d94ad4647823fad70f8f2b0c593641","target_edition_id":"edition.r017.id-id.draft","target_line_end":101,"target_line_start":100,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[100,101],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f43e82a525c9eee5e38bda85778e01493ad0204a1a5ef3da8e975547726d6c89","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e2d0e1f129839d1743fda7c464cace9189ba9479ab036db28c1c23819895ad19","target_edition_id":"edition.r017.id-id.draft","target_line_end":103,"target_line_start":103,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[103,103],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7bfb4ddf089269bcf1551de3714377260ab64c1688b1188d109429f5854ecf59","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"62278b71490874b1f9bf058f293a0d45520cef0cf06874ff1eee9eace2976c4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":127,"target_line_start":105,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[105,127],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76b8ff1f345d6fb1914b5f4bd84ae5efec1e62bd91488486e164b7f50791d0c8","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b9dc20676299cd6fae767b5c75b0b7c0e5d7b9c5aa2edb063bb3017414b1e870","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":129,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[129,130],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81a20ab7eaea7337e8afb860d16117b463f9f1eaa788ce8bf8b30ee0f8ed135e","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c3af0f93aa55dbc5513aea3b1493f92580f4df892ac69fc2d1305f7d6932a0c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":136,"target_line_start":132,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[132,136],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa9926a9042cfb1538c45443cea625cb942dd560bbd0b14f0f7e251eebbb6d2d","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5d8f06ddf51af3cb4089af55243689106b40448a93929a581295f2ec06638a91","target_edition_id":"edition.r017.id-id.draft","target_line_end":139,"target_line_start":138,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[138,139],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"848c27173357f74a47006196035a58a91328458518ad05cfd3549118b24b6d1d","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cb00b1f31f1f2f38f1c1cd80cf87c60ddad8ecf12c4c605e1e9cc50a20e3e6df","target_edition_id":"edition.r017.id-id.draft","target_line_end":141,"target_line_start":141,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[141,141],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e3484d16b5f5c9b0883494c39e604a06d4e8e033c831fc25d95567d5cf490860","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a57d7e8d23136f8750a2b3ea88327eed02e5dedde7e6533d6dfacb5d2aa912b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":155,"target_line_start":143,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[143,155],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"68148ba55539933c177e82a240fbff231d1cb7d43572dd198289db06c214e09a","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72158b0550c2de62136ca51dbb3a572012b8f05634f5f559e2a6efe3f243b714","target_edition_id":"edition.r017.id-id.draft","target_line_end":159,"target_line_start":157,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[157,159],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3bc7961809a715544e582cf42b30f699b1ca3d26d3fce1715325bdb9c2fc9147","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"399e49752f06c5cad164d86cbecea7fb5b8639485ba97841b9731f349f00e1bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":162,"target_line_start":161,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[161,162],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88ab548fcf4ad75a3edcaaccd49edfe90b44cc3f360c0597090060f33fc5c7e0","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d6c43191a797e0dd1b2caa4691dcce091cf394204d180d3f05d184059de3b99e","target_edition_id":"edition.r017.id-id.draft","target_line_end":164,"target_line_start":164,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[164,164],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e73d7d94c2889780b644d3923ba13c410ed3f29a14e7edc54d9c26eb3730c0b","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bbe5cc671021a9ec56c23cd525ba739de949a529fd5b767bd3d394945cfd04f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":178,"target_line_start":166,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[166,178],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7194526d3cf4050ac0d9cd289beceb4bf7fdd9d9658bc96ef1e1873e8efadea0","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b01e9bc6778f94ca60fed22311eedbd52a409e6c47b85a68b178a57a1a7a6bcd","target_edition_id":"edition.r017.id-id.draft","target_line_end":181,"target_line_start":180,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[180,181],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5dd05bcd3c0763c86828329315deb44c32c31ef199183428c278d66e569ac893","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"615033f6767a8ca6284fc54b7072ae4ed4dcc982b2dbf65d67fe108953ac4b65","target_edition_id":"edition.r017.id-id.draft","target_line_end":183,"target_line_start":183,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[183,183],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb3f44b001240bb200abc4d9c0c1051d7cdecf8dfd8b26bc6c34698833f88727","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a3c1b935484bf77ed2dbb73d3a261fce4c4bce4a450cae161b15a26f56f5049a","target_edition_id":"edition.r017.id-id.draft","target_line_end":197,"target_line_start":185,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[185,197],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bf8fcd826a8a11fea4a4e57ecfcd3fbb73f29a3ae509db7a57e487cbc9bd90ec","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5fc476bb319b6703ba55e3a2e415f9a28faab72c361e013f8bc74ac7809ae54f","target_edition_id":"edition.r017.id-id.draft","target_line_end":200,"target_line_start":199,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[199,200],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7123c0e126119ed9cede370cb594a91fcc6ebef3ad081fa29d72170d649007e7","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d6c43191a797e0dd1b2caa4691dcce091cf394204d180d3f05d184059de3b99e","target_edition_id":"edition.r017.id-id.draft","target_line_end":202,"target_line_start":202,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[202,202],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f731f8ba0a6b08f45eb5b0ee14e315fd98d8d6186e4bc6654b7cb3128406de41","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0827468250b45b2760eff95fe18511fedc8b5cdf5399b21c9416418a9f108edf","target_edition_id":"edition.r017.id-id.draft","target_line_end":210,"target_line_start":204,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[204,210],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"46b404b6285d7e5140737f8e7cf2e82506193b5501af1b4d37663571a9bf899e","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"93d817d4362d34c85fdd1a77c336ec6ef1d2d3fd8e7cd3c72f1c865d8f05059b","target_edition_id":"edition.r017.id-id.draft","target_line_end":214,"target_line_start":212,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[212,214],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9067bcb29e861fa6031fcef6876fad2c81219abc024c2ddb9b792a451afe203","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3ef9a575d4f6bfc2999913bb739e8ba079f1a9272a0bfa87f70e2383410b13c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":217,"target_line_start":216,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[216,217],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b317de66b24a43706a83cd9ee97a7cd4ae112babc34b47dc0e74f6e20fd77324","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d6c43191a797e0dd1b2caa4691dcce091cf394204d180d3f05d184059de3b99e","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":219,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[219,219],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd87ee1cf18e994415e7b25305e0db5954ab20df481d4d2758a6bef84d2cf7a7","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"803c15672e2602d2cca6b873af3e9c13c99994d0a8eba385602dfb67fb4cd906","target_edition_id":"edition.r017.id-id.draft","target_line_end":228,"target_line_start":221,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,228],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d47aec34b15f1501a83f225487b40990ad3c0a231eabb58a616154fc1fe8c854","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dcc9a00db75a2f27975012034e43d74cb96b11a606cd9775a41ec841bee9e2be","target_edition_id":"edition.r017.id-id.draft","target_line_end":230,"target_line_start":230,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[230,230],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1bafbc86b30454a5ebd22fa8d590c84820d6f6bff93b48fe655e563236cd0fef","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"88775d606fe2f2a6d25b5d0234b0f6ab469167d3f5efef1120f440ac941fd1e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":232,"target_line_start":232,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[232,232],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5ce97a7b8534d09de8a60dcce964f76abfa35dfcc5013ea1eed0bb3c9bcf64db","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-044","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"99ffdb5aa394f1d6b99bdce19e10e8ea12ac1dfad68906fb31aee4077b4d759b","target_edition_id":"edition.r017.id-id.draft","target_line_end":234,"target_line_start":234,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[234,234],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"13a9dfd487ab9c4f4d620d63d2764aec9eb7b4cdcb92329f3d299fa91fb6b9f6","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-045","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"10dc06ba8c78d0e565de706fde99d2f2869abd6e6dad2ab97bfedbf5d75f9602","target_edition_id":"edition.r017.id-id.draft","target_line_end":237,"target_line_start":236,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[236,237],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"deab2189fbaca7dd2d7b86ba3f836e3c4f5e8c6050c68ef13db46e26ea0e26ab","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-046","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8d96dcd281805884faf6a683c084e24f1cb44114819f963ccf4a4a8522374946","target_edition_id":"edition.r017.id-id.draft","target_line_end":239,"target_line_start":239,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[239,239],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"42310559a9c96b7c79ce4cddc4a47636ac458c931dc08fb3d6093eb02b155a29","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-047","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b630ab22b10587e1e79c47fa81aaf0ce07e7a2bebe627694f85b3db76d14ccc1","target_edition_id":"edition.r017.id-id.draft","target_line_end":249,"target_line_start":241,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[241,249],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a0fce97c54157d6835bbe1d9fd5a83775e6a38973763bb4d8ca6ba736927fdb4","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-048","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"804fed6cc17527c356e41c4e6e7f9a444dae79868c8b81c6d073c6d378aa3b8b","target_edition_id":"edition.r017.id-id.draft","target_line_end":252,"target_line_start":251,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[251,252],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a364708196cab087a8c3f10938b82c588218f48a99d8dbc532a81a92657c888","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-049","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"369f77b8cd50567e2ac5401ed11d0d83e76ea9a6a99ce6f17f380145261c8620","target_edition_id":"edition.r017.id-id.draft","target_line_end":255,"target_line_start":254,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[254,255],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9af3cd83b75760bf3dbddd7e16eb9bbff4eea207ad56e7d9b451523f413000b5","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-050","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fc1968be173e9f16e7a94ae1eb6633a2a0979f4a8101593f82ac2d6feeec69ef","target_edition_id":"edition.r017.id-id.draft","target_line_end":261,"target_line_start":257,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[257,261],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"681dd2864b56cf4d730c6050f5feef0cf1cee7d0905beeac3db7277cec04b109","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-051","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"edebe5b8cf93f98d4f7e6aa77a626b19e504909ec1afd533ae661aa376fec6f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":264,"target_line_start":263,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[263,264],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e63a32ddcddf17b65e9bb4d595b6abbf71a1790f0883ff4d9ba7fd10f665157","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-052","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d6c43191a797e0dd1b2caa4691dcce091cf394204d180d3f05d184059de3b99e","target_edition_id":"edition.r017.id-id.draft","target_line_end":266,"target_line_start":266,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[266,266],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2b2d4131d86e921f3249685b6b8dc53bedb9f1cdd445b8f100239f5c71f0a05","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-053","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f02e2c51f38b2cc1f0b520f042067f37768a7efdfeb1ed0c3b0ea1f39d0e911","target_edition_id":"edition.r017.id-id.draft","target_line_end":268,"target_line_start":268,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[268,268],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4b9a35af4664d53692159279d0378d858761291ea9e38c810ad27d638dda0bc","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-054","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7b6b65927397accf6e3676adc2f01c23531ac2e0e2f6d0b0249bd265db140512","target_edition_id":"edition.r017.id-id.draft","target_line_end":270,"target_line_start":270,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[270,270],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3b793babfe002bfd1eed6b10a74afbdd3593a0eacf170558bf98d8a10041537d","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-055","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"413334a1babf38f8e473e056869a7377a76d3aac322e38450a0eed8c61fcc1a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":272,"target_line_start":272,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[272,272],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cf99a8bccf2e203c30a9443b3fcdd27904686d657a5644e0ac08ed4bbf2f4e9e","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-056","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aa1a4deb06b1c1810015d40171f4ef857a05e9e9ed60b5ba3c4fd3fb4efbebc0","target_edition_id":"edition.r017.id-id.draft","target_line_end":275,"target_line_start":274,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[274,275],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4af4f0c15516927bc4479fd056aab6f098ad424ecad03aada519ab0044a1b449","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-057","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9d5717ad3c4f7a3dc04fb13e48f10b65c0538f605410d3f9b4f47903b1551fa5","target_edition_id":"edition.r017.id-id.draft","target_line_end":277,"target_line_start":277,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[277,277],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"827502b6081b676b2c18343cd80650c5ab29a95de3ea6816e9d3c0c0fb1cd6c9","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-058","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c7be26a4073107308acd29237c5ea05e19231fda47a59dcaf8bc1e893c3d5427","target_edition_id":"edition.r017.id-id.draft","target_line_end":313,"target_line_start":279,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[279,313],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d00638d18401febbb9b3fcdae20e5d3912f75b4f276cd74856c135af0c360af6","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-059","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1a225e3e145ff1a39ba9a6400eb01caacd218a095540d853f16ccf9a79b538b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":316,"target_line_start":315,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[315,316],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"17f9bf21253ada65d62a018961a6799678285c83d79158c980990fe9da294fac","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-060","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b922cf512a2cf6ace241efae89ddfd5ca39ebb247b7d5e05ae094938dc45029b","target_edition_id":"edition.r017.id-id.draft","target_line_end":318,"target_line_start":318,"target_local_id":"block-060","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[318,318],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5fa64ac95396667ee522d1511f23d40743d5bbc023ec7eaada72282f36041d5b","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-061","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a9fdc8b5ac9d84f01969b241e892624c76afc3541e6a2604b7c6374d102572dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":347,"target_line_start":320,"target_local_id":"block-061","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[320,347],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a2d36a5aa22a19eb5b3b29fc94627025b8a046625463b9175e68452425871bcb","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"id":"segment.r017.book1.ch11.solutions-manual.block-062","locale":"id-ID","parent_id":"unit.r017.book1.ch11.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b279abd9e8967e9a010b531809c7fb771478d43801e36755e979f785338a9c3d","target_edition_id":"edition.r017.id-id.draft","target_line_end":350,"target_line_start":349,"target_local_id":"block-062","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[349,350],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch11.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"beca508f06ba340cf7997037aa40be52027af753a3baf7b8c7d3622bf32132fa","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"05e2e9ebc6ede61e38afbc55d2c98c17c8756f0721a99ef5927c8044fda0a4b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,5],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"93066ac9175b328eaf37ec22c27dd2dd6722b5353e5d2a10410e5ce3479edba1","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b4f48ee2e8c5ef975dc6d3e5c53042972c3ac8f87769c2f94d529bd13dfbb134","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":7,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[7,8],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84f9309a1f3976577978ef49d5af0c203593b0ad784007d5766a69fbab2e4747","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cac34b912ac217d28e7e4071a83ac815ba5a0cff6ee0e6a31b7d187b1808d85b","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":10,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[10,17],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0d875310da2a09b7ab607d6c5aae7a66d42eb5607d0b7803824b152565a292d","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ae7681288f84126499316c4f0e6fb7498a12472ae9f358ecee565777583e782d","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":19,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[19,20],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f66afb69dca08410b242e53db922081210284488953a3932cf5dbba6c416eb7e","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1c5538b0fddf2f1a210438475e956565d3bfcb8beb148d632afee931d1cbbfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":22,"target_line_start":22,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[22,22],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c2254156c331548e83a4b88206e84244f21a798c8afec522fa7e6ff0ad1a3e3","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"845c202f0b124dd018bd73567fb3f2e1c7116f6a78b3ca28b152546ae38d2e2e","target_edition_id":"edition.r017.id-id.draft","target_line_end":25,"target_line_start":24,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[24,25],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90b6862ab4f28f632f8873a489ef79bc4fb2d3dce41a893b93265245624c72cc","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bce0393a7068a9b2aacae9b4eada9401090bd50f6a75e8475a00f256fbfbc2f2","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":29,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[29,31],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a42b05fc0552b394224f853d230ea99c6fb3bdeaf43b36b4e713af66ea6dfc9","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"669a34d91ab771363282ae386c7a6fa924dae8e52df4496a0255614e284243cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":34,"target_line_start":33,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[33,34],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9170a588d1a179c895f296d586c3eb3fb52c28f3b056e073b80ad64cf5012137","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"14fe67656840ed67b8657d013fdc065606df7d5fb355537c31d6ad838df7f958","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":36,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[36,36],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1bd78132cf89996a1e5204e8a023e8fd16a7f635eb6b656537436abb0f7e61d4","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"526c7643c7a2ca9960d9cc6f7d222f94a02f91cf817de5b8759ce43b328185d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":38,"target_line_start":38,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[38,38],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e87ad973ff5464f8255716299b7dab903f381d2c95df395b873918dfbc3ec76b","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1d420260887fee8ee3b24f5a50d86ddfd4bd1f3cde69e0ad19241223defe7ccd","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":40,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[40,47],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"577754ed647066088e127cc350e40aa016688a9490e2c21407cd6dc3c3e5bf3f","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1c86fbe2c4384f669a2f4b436dff3d7e51e32b0a5590e95968ca1b9a22a0494","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":49,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[49,49],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"306940f36d8cfa248c2c7c7a87a11c93be8a6404e4d7ba8498939aae7562c891","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8468bc24d215bb6eb577e41dd453991bec09a2b48db4b06b802814385a4201c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":51,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[51,51],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd4db6c543735084f6aa1098009220924d217a624614b493a83d572060ff910e","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b8d5b1b42f8d2e7a678b03670667babfcfcd8674c1ee3e33fd9e34365b15387f","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":53,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[53,53],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a129f925813457dd1a105bce6faea1936387041bc386d29545b5d6efd8aedfd","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e4e98f9f7f96f12964ef71d67625c4dd8de6dc4b8a81db48a47cc0bfee69fab4","target_edition_id":"edition.r017.id-id.draft","target_line_end":55,"target_line_start":55,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[55,55],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9650d4e063ca60616a0bfc9d324587abcfdd9ea3cc2afbbd8fe2f660cac52dd7","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"25ae6fd42be3847a5414f555ebfe4af4fb27f8db414596142172e73d6125b587","target_edition_id":"edition.r017.id-id.draft","target_line_end":61,"target_line_start":57,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[57,61],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"71cfced5e4de81e8d2186b51bee234fa7870a4ef17ed017b2a9d1f11279286f6","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"623c8eea92c7539155aed5d4cacb95cfa41a2f05773d38a17277a145789596e5","target_edition_id":"edition.r017.id-id.draft","target_line_end":65,"target_line_start":63,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[63,65],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6fbaaa2040f1f3bf22cee5e51094e616d11d1f0da1274239dd7a30b2ba46bcc5","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9b02aec8a762baf1177a986d119939df573eefa14621a2184b6c34e8acd784b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":67,"target_line_start":67,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[67,67],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"492392c9d24a640c4c475eea21cec80ff0841f032507fa565f3290f78dd12c45","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3712c54af12fad787bc7f995aa28829628fef50a17ab7e2c6c3c19cefa8c292c","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":69,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[69,71],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ae3a6eae3d77dc1184536d6daaef068940142e5e742c62449d1371c4b2df465","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"068ad6295f446af3cb2be553275722f24cb32d7076bf54418d8cb2a4dd5beb19","target_edition_id":"edition.r017.id-id.draft","target_line_end":73,"target_line_start":73,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[73,73],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed92d69f1962eea793a121771b7410d687fa3c8f3b64b49b78de050ab1a6e4e1","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ea344cbf753001aef56f89af86382b230917470d2cd644639cba121b1754e073","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":75,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[75,77],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bd81487594a1a524232268cce5e50179f5d38fb374ce254ade630e6eecbb955c","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd82e2cd69be4a168fc7e2e3eafc33f4b1982e8158a6f5267e872ac7b75befbb","target_edition_id":"edition.r017.id-id.draft","target_line_end":79,"target_line_start":79,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[79,79],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a700fb9610e72094c90a59cd9207067cd2fdcccf9795336ec762c35e2009be7b","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"375470b6afec103238c623149a1a9157ff63e89aafff848d8393b6286bd42302","target_edition_id":"edition.r017.id-id.draft","target_line_end":83,"target_line_start":81,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[81,83],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7aa760d0aa0cbfba987cf70ad1660c141b10e7a3135ea87680b6bf867e8e6ef3","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"44c9ee666280447f0fdc1257ef2cb8fe54af1cac58d25a1d31576aba36d8fd81","target_edition_id":"edition.r017.id-id.draft","target_line_end":85,"target_line_start":85,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[85,85],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aee50ec3e9d0250a264f7951e8ff14cfc3e4ba127d82773b86c1fdc595d416a5","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8e3fe1ff1d681bb7eebe35aca932e59a15de99c89d4478290e567a7522798ba0","target_edition_id":"edition.r017.id-id.draft","target_line_end":87,"target_line_start":87,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[87,87],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b1db9e63569fbb3871772c942df0292017074154e1693f114e6afbd27d3668f0","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c15dfd406fb15d936e11e9b898a65b0927b3f4013dd561c99b47b3c4a134bd6b","target_edition_id":"edition.r017.id-id.draft","target_line_end":116,"target_line_start":89,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[89,116],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c69a7f89b936ebff03d50079560470e8267e02023edc41f4c7f5b0eea3bf05d7","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3acb81573ae5a494a7535248652af73a56d46aa62642fa7de2a3b02609ad853a","target_edition_id":"edition.r017.id-id.draft","target_line_end":120,"target_line_start":118,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[118,120],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a8e4395d76ea4ff8561cace793c2af0fbe1325711d428c94b9e4c9a8eff84173","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bb24ffc95ad58cfee753cd3e8091a67e8ad2dbc7b1dd5153546b6136a5125eb2","target_edition_id":"edition.r017.id-id.draft","target_line_end":122,"target_line_start":122,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[122,122],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"631faf386efb3d9013c800cd20250f4021be03f4e66aca0db51aef8f480eb86c","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8b99feac9c07d1d279bde11a542c4ce875a638a4576dae7f63cc097bf51c5214","target_edition_id":"edition.r017.id-id.draft","target_line_end":124,"target_line_start":124,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[124,124],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b5c083f94594af21dc933b4bc75f0af8fdeff176037232e71862c0a039e108ed","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2c60d0e0cedaab02fa0e76f3d14232f83ef786a56bec8273a1e12676b6edb592","target_edition_id":"edition.r017.id-id.draft","target_line_end":132,"target_line_start":126,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[126,132],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"07239f37b89203fc148ee35d1d4c70418bf8639ae03ab1145a7f18b5a4f6282d","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf6fb6c58db8f00934aa60a0732655ffabcd163f7871c952eb45947ffa558d83","target_edition_id":"edition.r017.id-id.draft","target_line_end":134,"target_line_start":134,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[134,134],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e645cb89b0164fce9cdff442c9929d76bb9d9f7662cb78710887e1ad31bbf8c8","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bfc3d81aa9416380f6fbfd812677d43a36df0d850323a04f681f48c7e286bd49","target_edition_id":"edition.r017.id-id.draft","target_line_end":138,"target_line_start":136,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[136,138],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"60298988ba63f53552debfff939aa8c801ac2a2f75c387d2bfa4b6d7bf53566e","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9d4c50027c017b8260100280aa11d4a39f99d1e69a64e05f339acc28d4584f3a","target_edition_id":"edition.r017.id-id.draft","target_line_end":140,"target_line_start":140,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[140,140],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16554dba74b4e1e3c9d8fa4f3ff8757466f5ecee7e8b96f9e35dc382aab7fb9c","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c86e7f65d2307d3192d53876ad90f45182c16aca1891118ae2497abafb6ca4fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":144,"target_line_start":142,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[142,144],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c3d154433988f10f28917a8738b958e7f6b32c2354dc617f8b96e95b284df80","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"56449ee2a196021580a7ca17fbba667ed7e2bd83d7e32c077d22fdc90eed32d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":146,"target_line_start":146,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[146,146],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7e9c8f31afa2d891b48ba78f6e5365e95a59dd7d73ea2b24d02354fd482f151e","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2af332a94ca83770c1437f169c267633ccd1a166132a88a04206facfe176af43","target_edition_id":"edition.r017.id-id.draft","target_line_end":150,"target_line_start":148,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[148,150],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7aa55d4797f29c1aa348365dc63b60392d0dace81c40dbf4545d59970a1fd846","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b3afff9cd2e9485a85dcc165f567558d9db2a8338c5602e36cb695d6ff68822f","target_edition_id":"edition.r017.id-id.draft","target_line_end":152,"target_line_start":152,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[152,152],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e276c48d3c7a88f1c3216892d787e2589d9597bad1c45c1724246ccd1889cadc","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"75bc69dbe0944ff2e4bcbdb0965a599f77be4f9ff8bed18316dcf853bf8c5a67","target_edition_id":"edition.r017.id-id.draft","target_line_end":160,"target_line_start":154,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[154,160],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"66138864769cd711a5f2b445a3c07d4238784ffba483bebea02892f6ef6aa9d4","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"08e0471aa1680093d36092c56571ee43d86778b19b5dbe7b655c3aaf006dd3de","target_edition_id":"edition.r017.id-id.draft","target_line_end":162,"target_line_start":162,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[162,162],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d280b7a70542cba30ce86d63995060d4e16ee36a0f99385c97a65dee23ab044","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"012fdf8b240297b13944d0dbb3e974f9856827a5198e8c6c200aefc682bdf3fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":164,"target_line_start":164,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[164,164],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3748dc6268ca8602af27f93890177f8cb555518f129d14c8f0c690ff330d7de4","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a3525e44c4a7eb72b05d459f8e1321ca1ca1523bc9c3eafb1739b3a4f17cceb","target_edition_id":"edition.r017.id-id.draft","target_line_end":166,"target_line_start":166,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[166,166],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"441362d9814f5822d96c7a13062be5d457af23e9d9138d9bd82046789bfaa82e","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a4c577cbf45d130d2d9a91aa952a1e8c676b07b4e5183c02a2f940a76d513d83","target_edition_id":"edition.r017.id-id.draft","target_line_end":188,"target_line_start":168,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[168,188],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"05ab20e05ecf233f2199f3827acb1934060ee0b9be49dd798a47a404234dc658","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":190,"target_line_start":190,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[190,190],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aacb1cfec528eb599cb61f4e771431dd395ee1a3c69dbd892f5dd5f59bca7656","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-044","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e54f4b74b3df049b6a4ea59c2dff69554b71e63fa705a22127717dbbec931f69","target_edition_id":"edition.r017.id-id.draft","target_line_end":203,"target_line_start":192,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[192,203],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"44e1cbdb9dacc535f48afbc8506b97d92fb80354bbe9fef84ebe457a2531fc7d","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-045","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8e1a1c7b122b747684f6b6b1b64d36122ea600bba6c8ff5c1da9139935f4fb4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":208,"target_line_start":205,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[205,208],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5c4ceecd62800ec3a4a15bc1c43ee70b44e76b6aaf96325fa7074f113735f6b","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-046","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ebfd36a17fa5313149413acb33f951a00bb25f61779e2d7670b08b64c86bd4b0","target_edition_id":"edition.r017.id-id.draft","target_line_end":210,"target_line_start":210,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[210,210],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d2c61f1bd13db10c86b6d8f9be117579ffa66aeba233fbf6065e015bfa5ed750","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-047","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"191d460595c9dd4155ea496a465ca9c47d84678d93696eaf92e1b07b0866b738","target_edition_id":"edition.r017.id-id.draft","target_line_end":217,"target_line_start":212,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[212,217],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c4c8f90d5c776795de2e0435c8ff5f9ebacd1fa8281f59c27cba6f3cec8d051","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-048","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bfb1a9f45f05b08726cbf1b0e0b7cbdf678aece219fdb079f2452cb09418940","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":219,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[219,219],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb01d41d801c152afc375919c2d092f5b0fcb1495ede5b94797d38d8b065b3d6","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-049","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"627dd8746386929ddc2665402c018fdb4316e5aeb9fd0f78ea1c66547cc32b39","target_edition_id":"edition.r017.id-id.draft","target_line_end":243,"target_line_start":221,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,243],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16ee85cba509758e2765e52c087631a4ad671d1c6e2f3558a34547b00c0778d7","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-050","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2908d0f255bac1cf034e4afbf6619302793c8445e4b367600db51a5d3436f601","target_edition_id":"edition.r017.id-id.draft","target_line_end":255,"target_line_start":245,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[245,255],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2d5a95ece4760724d9c8f74562ef7af6a6eaa4a1667e7a04e8a687a63f29ac6","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-051","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8b1e8280a044803435bc0814a4a6cad95e910cfbd05b31dd8b09ff4f2cf7f52f","target_edition_id":"edition.r017.id-id.draft","target_line_end":257,"target_line_start":257,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[257,257],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"95aa5bd420db77f6579a55893b2bec153acd19e467e1d14659e56bbc4a818735","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-052","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"20c839a3fc5e91de509c1c7d4a2637e8c5f4010b2d04fadb9e8a97ce73ff4f43","target_edition_id":"edition.r017.id-id.draft","target_line_end":269,"target_line_start":259,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[259,269],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6dbf6253556fb2e9dc36bae4970d9675c9ee500b29c8453d446002f4c0058970","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-053","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e05f00795a23042c5bb0ab21f1eb4c46a9d804845a1f8bc410d83a87e76aea12","target_edition_id":"edition.r017.id-id.draft","target_line_end":281,"target_line_start":271,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[271,281],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8884ebf5a96c38a3ed9eb93f42ddf6e32d11f0fc4b0f093912e4681134c9b689","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-054","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06c263565e160ffcf9e6c74f8f2c6615398d045d9787097ae638b94c59ced0b2","target_edition_id":"edition.r017.id-id.draft","target_line_end":283,"target_line_start":283,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[283,283],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec0e2ac66679c66fc4f50d4d2c82f718c93caea6ff356a43fd24c54f579de2a9","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-055","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1b9969e5254c2c282aada2d1de65da4b572848e972661c48802a74c5239ef583","target_edition_id":"edition.r017.id-id.draft","target_line_end":295,"target_line_start":285,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[285,295],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d032f2c8d65dcae7bbec2479abdae854474606a2abe39a03a283ecb417dab5c","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-056","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"132f246dffa1179da3c2f14c4a0a57c3237c97d6e77685ace47aa60034fd4ddc","target_edition_id":"edition.r017.id-id.draft","target_line_end":297,"target_line_start":297,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[297,297],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d3f8456fb6f58ac4afa10ee77f0591bb523cd3854be8752aec110718e1a17938","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-057","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a94401ed746eb2e665198eb1c0aaa5bae1d314f001190092fa9fd3a96ffa963b","target_edition_id":"edition.r017.id-id.draft","target_line_end":309,"target_line_start":299,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[299,309],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"21e28d5a15d41aa379f249dbca28ecf17513f12a022c41dda0f299addadfb969","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-058","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9a50d2d89f9d118ddb194333671aea6bdc44f9ca5e443adae0eb2d99999c4af1","target_edition_id":"edition.r017.id-id.draft","target_line_end":311,"target_line_start":311,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[311,311],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"410dc037bf1b625d25cdbea9bb8b2ec7eeb662dafdf61e386af924e8cb728040","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-059","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1fbdc398622da619ed8a75e0116769b7c586415157f4aa4b5468f8235ab7f2cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":314,"target_line_start":313,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[313,314],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ea3ba57787011e6dec7ee8d15bb4834f085537c6f152bbbf955c5451e274f697","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-060","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dcc6e6495f0be6056a856e63d1acec01ad2634206bda52c32dde5e473fc70e99","target_edition_id":"edition.r017.id-id.draft","target_line_end":316,"target_line_start":316,"target_local_id":"block-060","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[316,316],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6f8152c0da6c0430d55d6880ae932e9762aa2e02cc83e49f98e1604b8eea79a0","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-061","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"58de3380f9ca63c6628050a20f8a799218f9eaec1af7c91385f52cf2e2e0c446","target_edition_id":"edition.r017.id-id.draft","target_line_end":319,"target_line_start":318,"target_local_id":"block-061","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[318,319],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"38ab908e5f47e065276cf3c77977eda87b69fafbe2bdd38f854d1f23ec154ced","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-062","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"098dacdf9aa6d21459b5de67a8ac6710cfc26a5bf3814b0a2d017b7d87f30bbe","target_edition_id":"edition.r017.id-id.draft","target_line_end":321,"target_line_start":321,"target_local_id":"block-062","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[321,321],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4bd2837b64ee9c3cef9de71c132fc61cc2fc3b4d81c99121aeffdb69aa6f0bf5","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-063","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e1c3456f621260ffaccec91eaca381626073731c3174a0add0ab6f35aefeb6c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":325,"target_line_start":323,"target_local_id":"block-063","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[323,325],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5fae0c1ce06cd6112b0a1ad5c0906f228a07e820c084778ea098a26504d3511e","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-064","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"415343902de32178402d5df0f41c7f424db8eed948b77d7b9a67ef840b2e0ced","target_edition_id":"edition.r017.id-id.draft","target_line_end":328,"target_line_start":327,"target_local_id":"block-064","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[327,328],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"136542d511748b8de54fffa1c9aee1461c13d765c85b8542175df35fadc50742","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-065","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fb6956cdfe6d3b5b3a22b777c32a1fdd891610e0e1ca1d61b1a1bea46f89bb01","target_edition_id":"edition.r017.id-id.draft","target_line_end":332,"target_line_start":330,"target_local_id":"block-065","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[330,332],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"775f8bd8debb7154e41e6d489eb7601893e082a0f87a1802ebd6a5fce68c6048","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-066","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"26d346b21d02e60453da72287b23b3a33e728bb1bd6bcadca3693f509f6f0c98","target_edition_id":"edition.r017.id-id.draft","target_line_end":341,"target_line_start":334,"target_local_id":"block-066","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[334,341],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"77ebb968ce78426bc84de1ff1024b0ede0f3907a7baa3b82d25923561cbbc07b","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-067","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"88533c331dc567bb548b5ba26360240aa317cf54505313b832cddc01cf929d7e","target_edition_id":"edition.r017.id-id.draft","target_line_end":344,"target_line_start":343,"target_local_id":"block-067","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[343,344],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0796015347e91a11c1704f89ec2c108b8970afee0ce5ddf3f9abea5a56c3c29f","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-068","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"76b5b37855e941fc78846db49ccd360cb2098e8556802615ced2c784ce88a0cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":347,"target_line_start":346,"target_local_id":"block-068","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[346,347],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"229d92ac8d522802a16f4a9341ec2ca3cc8cfcd4631d22b029ed152a3a7dedbe","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-069","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9410bbfa20bf16af1297037ab89bfbd7a20d36431f18d0e0effa451522f2d8b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":357,"target_line_start":349,"target_local_id":"block-069","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[349,357],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de7570a8ccfb16a372ea5921ab76e69411a994024d0be20df36eff90e2c8e695","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-070","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ec0901df90f6e3450835a1edab926a85ec8592497351ad12e505cd64116052a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":359,"target_line_start":359,"target_local_id":"block-070","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[359,359],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c3ca9d4e655830d8b8a942acfe1e23618f819ba26832b8017defecdc3630c8e","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-071","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"89655c9ac4246a87dee62a32239d5c5a6ccab45be95d03f5b9d80833a741d12a","target_edition_id":"edition.r017.id-id.draft","target_line_end":369,"target_line_start":361,"target_local_id":"block-071","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[361,369],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"35e9d9cd15a97405add19da68ec4f3c053c0d75a1e54ce26a28345c0b0483aaf","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-072","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"431dacfec113dfc1dd78dff9b672d5ebb7f4fc29c475d1554f30d8e152018763","target_edition_id":"edition.r017.id-id.draft","target_line_end":371,"target_line_start":371,"target_local_id":"block-072","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[371,371],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1dd524ca60fd1a8f26c139ed2d2fd626ca845f3581f0819ea13849a3fc299903","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-073","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fe4b015781222af1359e0e55aeaa680e40e423d43a43f8dd952be9412ccf7066","target_edition_id":"edition.r017.id-id.draft","target_line_end":377,"target_line_start":373,"target_local_id":"block-073","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[373,377],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f46024d2b867251cf8a6cb9576a5ce0356cb9b1abe4623963a168909e69744fb","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-074","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"33e1d191d8c89e311058c99b96d1699af923c10a37e6b07fe82ff895307fccbf","target_edition_id":"edition.r017.id-id.draft","target_line_end":379,"target_line_start":379,"target_local_id":"block-074","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[379,379],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"11b6cb822ea73ebe4a462be6afdee7a5bf8909b8fa9b3166f1a1295ee08d8ada","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-075","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a9170193c938515d1665ce0498d779f0e0e1c4826559bc786573ae02904e41cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":404,"target_line_start":381,"target_local_id":"block-075","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[381,404],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2a546cef07b11beba046ea92ba8f47408ccb3708a8e31c6322126291b7f5bb80","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-076","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"941d4e34500d93503bd7e66aea4e2ab66384c867c307a7d924b00e5853d0407f","target_edition_id":"edition.r017.id-id.draft","target_line_end":406,"target_line_start":406,"target_local_id":"block-076","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[406,406],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10f929024d36e76d8ba5fa0e719192ec72c94a1ec219afd8311087f61223cfaf","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-077","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"17ed0ab49367a6792624d8bff6424083eb907f1c32864809e3d3f056e96799ee","target_edition_id":"edition.r017.id-id.draft","target_line_end":409,"target_line_start":408,"target_local_id":"block-077","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[408,409],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2cdad03d4db6ea21ba16c91e4a6407153da64af308cea8f112c6a6b01f448d47","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-078","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ceef308307c9852d45cd393bc866e71455164ea5219da115436cc7741b7a2774","target_edition_id":"edition.r017.id-id.draft","target_line_end":442,"target_line_start":411,"target_local_id":"block-078","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[411,442],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7096a24fae01d21cd2bef8678263dcd9e5305c4d23174c286e1a1bf64520047f","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-079","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b10732824a4e9abd91b69f2ff359ec5c7298f6de41e5290c0849702c860111bb","target_edition_id":"edition.r017.id-id.draft","target_line_end":448,"target_line_start":444,"target_local_id":"block-079","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[444,448],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6033bb140b750db4ed8de78bf744958bc07be1a8e8ab02267edd390e222dfb69","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-080","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9ba25142843ac12ee7029e4b9a22f4c50981ac28958051c0f03082da30ccc593","target_edition_id":"edition.r017.id-id.draft","target_line_end":451,"target_line_start":450,"target_local_id":"block-080","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[450,451],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"add36f5fa05c092e4c810d91ff2ea8cdd37d72498ce879c6b6fba30be0df399e","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-081","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d33d4829b0df4a65d279041e3852df8e551d09cec7dc7f66d82948443b228880","target_edition_id":"edition.r017.id-id.draft","target_line_end":455,"target_line_start":453,"target_local_id":"block-081","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[453,455],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a52be8898332d71c2d13bacb7cf2c0fa868fda6e796fa7cff614b54fc235e7e9","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-082","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8b90ebe22b61ea889cecccdf6cc7e1c0448a852cd864d1387cf7e38116610d39","target_edition_id":"edition.r017.id-id.draft","target_line_end":458,"target_line_start":457,"target_local_id":"block-082","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[457,458],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"821e3254c77869fdbe56e8dfc1a3fe868626c290ba9d24a3e46994ec3866ce88","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-083","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d61e5488ec3747b472e5326fc0035fb317d59af846cb886d3ae29dd4b46d5e86","target_edition_id":"edition.r017.id-id.draft","target_line_end":465,"target_line_start":460,"target_local_id":"block-083","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[460,465],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6bd092a88775898a89fb9e6afab43f1252834fe20ec7b9807968d114738513b0","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-084","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"33d23f16cbac57d132667d7eb592de543624207c10732fc781be5c3b93617806","target_edition_id":"edition.r017.id-id.draft","target_line_end":467,"target_line_start":467,"target_local_id":"block-084","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[467,467],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19519debbed2e3275d8cea0d456e11c4a01c0da393075b961c8445d1c3aa371a","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-085","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fb65cdee5d478357349034afc31e28942327952486860e05a15f2e2def75d043","target_edition_id":"edition.r017.id-id.draft","target_line_end":472,"target_line_start":469,"target_local_id":"block-085","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[469,472],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d27fb051f7edaa16acc9feb03b5e21cb23a6c9aa69cf402e740f92ba5803eafe","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-086","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c3201581db0c68d200540458487bf3cb65637a27fd19feb066f7190e8f3102fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":481,"target_line_start":474,"target_local_id":"block-086","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[474,481],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e17977065b6c9e110a05cd008a1ee21d75e6aaf90c856689ac68a835c904dd7a","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-087","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d84b77dfd8700c584a53df5b9b32db72be3b7137e1faba40ea6d363346e78e35","target_edition_id":"edition.r017.id-id.draft","target_line_end":483,"target_line_start":483,"target_local_id":"block-087","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[483,483],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"556d1c5c5228036d3b27dd0fc1d8211569f0d3fe12036f8c2658ea97a819767b","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-088","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"50e22bf2a1a8eb0fa32dc9326104b8fa593528ab24be8158f197a56a142c4679","target_edition_id":"edition.r017.id-id.draft","target_line_end":485,"target_line_start":485,"target_local_id":"block-088","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[485,485],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0dd0d018f2b9d23bfd7284986e3bb59a786fea2759fd695a8d0afd5b3fe1b6e0","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-089","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"add7f5b34d4851a9b2fbe887d3ba6afbda110a018c1ff573c178040903f0824b","target_edition_id":"edition.r017.id-id.draft","target_line_end":488,"target_line_start":487,"target_local_id":"block-089","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[487,488],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b91e990c9622f422ec5e2dca9a9378d13f4250ce85f2a4f2c02123b81f59069d","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-090","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9713dba39d1365f6c73d928f3032660ad07fb9bb6f4124d941c9591f87b9004b","target_edition_id":"edition.r017.id-id.draft","target_line_end":494,"target_line_start":490,"target_local_id":"block-090","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[490,494],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4fdef1c8811db7f72adf4a44ffa966a458142512b75b5e9207748e987eb75daa","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-091","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"60f1c9904811d82417c31a55138fb6d95f24752112f49f961567d5f0bdb1ea23","target_edition_id":"edition.r017.id-id.draft","target_line_end":496,"target_line_start":496,"target_local_id":"block-091","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[496,496],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a48b34125d82c3c97afd3fcd0a9a00e8bb47f850f9df5341b4f9333e1cd41e58","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-092","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ed683cbccd6b60809f663e07495ccc0b609e91ee3686bc35e11802b2372a20cf","target_edition_id":"edition.r017.id-id.draft","target_line_end":505,"target_line_start":498,"target_local_id":"block-092","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[498,505],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5bc0957db5d9a08af6614611c352615a11032a88f639234c3b98afa457a63ed4","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-093","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"288b2ceebde06baefb5b46edaa625356c28e8c2871201452c4e1fc9dbf7cdd0f","target_edition_id":"edition.r017.id-id.draft","target_line_end":514,"target_line_start":507,"target_local_id":"block-093","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[507,514],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe72ecff8260c1e4ec53e1179c0857d3f97fbc7c1c97169040a988af7751378d","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-094","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3bc162baed4bbdcef7d32032e8a853124091eaa287f7b0701fb4260b605f86f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":516,"target_line_start":516,"target_local_id":"block-094","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[516,516],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"117e2f84f833e868fc551b5f76494e43596b2ac3027f33776160cdfd13c1d580","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-095","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4ee12a02bebe4dcaf8ec582eb9e2880a759b6075e21b9f62325a5ca969001953","target_edition_id":"edition.r017.id-id.draft","target_line_end":522,"target_line_start":518,"target_local_id":"block-095","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[518,522],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b0a8ba84677def2916bccf2a46b185372a02d3b8cda30229b743ed43b68cf734","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-096","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bb37a0e387f20814723258e5295934d59a5242d33d15812e8b065bc3e1d2665f","target_edition_id":"edition.r017.id-id.draft","target_line_end":525,"target_line_start":524,"target_local_id":"block-096","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[524,525],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f77bcc20184cd1d1e9e50c5ff77591cf3fa6b2b652801c4d91be2e27f591831d","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-097","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4cfd66b0b741abd2d9bbc61a29ec88433e7b501f2762330f61cdcabc1b22616e","target_edition_id":"edition.r017.id-id.draft","target_line_end":527,"target_line_start":527,"target_local_id":"block-097","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[527,527],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5a35be45059a781a84ccc3ba9c9115979ca8537b0c44ba3445813f792db09606","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-098","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"23b29846be580aed832541d8102fb754075ea41ad58ab89c171c19a68b0c63d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":530,"target_line_start":529,"target_local_id":"block-098","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[529,530],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9dfe3abaf2667f505d01baf550699e07b959692d190ddddc09fd014d4cc40d14","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-099","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a35822361d7e05e50dcdde42d08a3e6e36cdd71d0a5b407054b3b73eea327ef7","target_edition_id":"edition.r017.id-id.draft","target_line_end":541,"target_line_start":532,"target_local_id":"block-099","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[532,541],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e58c1d340cc63b91b50e96bfddec6d31986ba87e21f89fe1add7949d36afa9f","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-100","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":543,"target_line_start":543,"target_local_id":"block-100","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[543,543],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c3c76b3d6f67fbfc86b72e03da40a42d765dd849594a284d9bcc7c1de1041c0","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-101","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3077c1c8b1158a819c56f1acc9487275506272110a9141f521929757d2a6ab72","target_edition_id":"edition.r017.id-id.draft","target_line_end":554,"target_line_start":545,"target_local_id":"block-101","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[545,554],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39b093da1ba995d84652a4f92d90fae2c2e86fb6d5cd3653023be1fa9de6d961","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-102","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"efb48bb0e2c3b66afca36650269086bb7425ec3b70c833bdde6624fda4319348","target_edition_id":"edition.r017.id-id.draft","target_line_end":557,"target_line_start":556,"target_local_id":"block-102","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[556,557],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02e9d80a1b55bd6d6fca11284df0c43602d09a6a6f70e6ce09fa7b9985752e14","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-103","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dc42bc51b63f02520cc67fb5087dd99179f3f351e709da60e24fe6faf1f5a1d1","target_edition_id":"edition.r017.id-id.draft","target_line_end":568,"target_line_start":559,"target_local_id":"block-103","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[559,568],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6f4f173afdb2eaa32ea1fb2b2f9e482a217e821519fdd04a8a0e180344cd0ecf","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-104","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":570,"target_line_start":570,"target_local_id":"block-104","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[570,570],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7e9aaecad53c9e3a3d6e5aea18516995df8dfd44284d3c0bb74c98a77c21395d","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-105","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c61ceb44446e08b0cc8658b7507a8dc6267216197afb88a26f2a5ecb6916e507","target_edition_id":"edition.r017.id-id.draft","target_line_end":581,"target_line_start":572,"target_local_id":"block-105","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[572,581],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48e2e169f48c47327fe5d785ef9aa415404d668005288dcb3ae48a9c75a01b7c","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-106","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ca1bc5590120aa71363fdf7d19752540d23a972dbf7d65a6a2bdfeac74779e68","target_edition_id":"edition.r017.id-id.draft","target_line_end":584,"target_line_start":583,"target_local_id":"block-106","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[583,584],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"787bf95b1539a0953f456203948686a53c38eea8c078e8dd7f541092aeb51bb8","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-107","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7ea5e57fe4dd94e8df4e0c2fd54f5495527e146dc0de4b36c54155fdcdc8971b","target_edition_id":"edition.r017.id-id.draft","target_line_end":595,"target_line_start":586,"target_local_id":"block-107","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[586,595],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"beebff9e2c34ebc39752c4ee4a172f01c5a26b840efe8eb4708343581393eb6a","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-108","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":597,"target_line_start":597,"target_local_id":"block-108","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[597,597],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c43f2644e6ea15f21ebd8c92105d7cf26cf65e319273497cf18563e7d8f27a0","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-109","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4aa7e538c0410c1ec590bcb3fc91b190d4013e61e0b2a566246b2aacdfe3a0e7","target_edition_id":"edition.r017.id-id.draft","target_line_end":608,"target_line_start":599,"target_local_id":"block-109","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[599,608],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a1a9533d76697eb8fbca66b6a9af5a6b46d8fb4eadb71bb4bed4642789cfb23a","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-110","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72891a54707b2ea63bb6e7d5595d2ea506682bbee7bd32c4bdf84523b7dd525f","target_edition_id":"edition.r017.id-id.draft","target_line_end":611,"target_line_start":610,"target_local_id":"block-110","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[610,611],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8383b1637c6ff30da408cf1223f0df596cda7ead326eef2838a723ce86e01de2","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-111","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6845d73803e3b675e0929f2397c12fa2dbabfc2b5d4014d5c1ba1f3eded2a094","target_edition_id":"edition.r017.id-id.draft","target_line_end":617,"target_line_start":613,"target_local_id":"block-111","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[613,617],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3518eca5a6fa600d8655f727699a9b3c9afeccf52f0a3744e3beac16a1b33b99","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-112","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f36fc1688a38a218bc13b2b0cfe6b332c2443fe269d4f1900bc8787995fa149a","target_edition_id":"edition.r017.id-id.draft","target_line_end":619,"target_line_start":619,"target_local_id":"block-112","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[619,619],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b99b0da442e2f69cead9243b47de87896b1f0762c0bed03b25ae42285e51a4bf","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-113","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9cb2cb6f3f8173a2b131a77555cd08ab270a1871d4589c4ed2fed879e84db3a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":621,"target_line_start":621,"target_local_id":"block-113","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[621,621],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f24d90104b6c79975fe18ec589613944a3110435237aafb8f13623934c453ae9","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-114","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f355aeef31758c3465197b47b77e1ae8e4ed2b42e5731834b1cd06e909ddbc9f","target_edition_id":"edition.r017.id-id.draft","target_line_end":629,"target_line_start":623,"target_local_id":"block-114","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[623,629],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b39226c83e9672cf5f2d445d06cbc7a819ed752f690bb706be3114bb9da4907","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-115","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"04d66c1f49403bd37850ee0228b75d1b7d1f4ef4abf6f111bcac3f11f4a1ead0","target_edition_id":"edition.r017.id-id.draft","target_line_end":631,"target_line_start":631,"target_local_id":"block-115","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[631,631],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4cb69a822f61d57388b5259d1ffadf529c0c61367b545fab01c731ab7c35e7fb","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-116","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bc268cff67a0f508d5bd8c91f0018a12906441a6907cb61485bab4e191677b17","target_edition_id":"edition.r017.id-id.draft","target_line_end":633,"target_line_start":633,"target_local_id":"block-116","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[633,633],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"99cb508dc5649af0ee6755b11b4f368677d82c653e5d6a5a92f6d3cb7e935b89","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-117","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fa825d30079aa88e6ef10d3a33494cb75a917e4e339974dc15d1db186b8ab900","target_edition_id":"edition.r017.id-id.draft","target_line_end":642,"target_line_start":635,"target_local_id":"block-117","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[635,642],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e3b8c5229e0e469f3627d2b1b335086d2e2f7f56df59d5b40e2dfee1df7cc27f","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-118","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"22563a599271a12085f3e19c220d9e55fade72a08f2da715178c85eb7a223ccc","target_edition_id":"edition.r017.id-id.draft","target_line_end":654,"target_line_start":644,"target_local_id":"block-118","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[644,654],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5ab4c442307a42358213323eb86b4b2387ac28fe8b1b3caac766531ce87f8946","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-119","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"acf428fc1a1d81f9de54ae5524eb9b831cab63301a348f731022c9455a0263ed","target_edition_id":"edition.r017.id-id.draft","target_line_end":656,"target_line_start":656,"target_local_id":"block-119","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[656,656],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"268f25b5ec9c4967c0d0e39249aca3c95b338d273253a0c5294bb7e7f08b6be1","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-120","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"17e1a0d9736b74d243502b02a8f1d5fecb9e2dee7270abe88251a9b654edff4a","target_edition_id":"edition.r017.id-id.draft","target_line_end":658,"target_line_start":658,"target_local_id":"block-120","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[658,658],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"696b1ec8c7b73e45f5753d76a02a94d814f80e17e20fece0bb542ded94dfbd81","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-121","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dc13621cd6ce2305f7379cbb5e55888049a309dbbca98699c98d0bd95875feb5","target_edition_id":"edition.r017.id-id.draft","target_line_end":667,"target_line_start":660,"target_local_id":"block-121","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[660,667],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc4c80dc7a5a19aeb9ea583015ff1467c9c7b226a1c0e0838f932bf4d6b653f2","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-122","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"496fe806725f1df66c766eea2b686310c9acdf9ed3e26f9a8c236b05b4053acc","target_edition_id":"edition.r017.id-id.draft","target_line_end":672,"target_line_start":669,"target_local_id":"block-122","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[669,672],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"816627a562569c479e93a73c81c3c7678e0f63eefaca1c8b2ab4ddf9c44b1002","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-123","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f4f97cf32a73b0c42b6be3e708c00729b6534db88bab2b55364c7021d5b5e98a","target_edition_id":"edition.r017.id-id.draft","target_line_end":677,"target_line_start":674,"target_local_id":"block-123","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[674,677],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"988c04e048deb3dd5a7086d79a08b478071a6bfd3f6117d6e5140623de02b6ea","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-124","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"55720508efb6f19c1c01e4a94d9fc4493e47e2ab20b6498099b48882f6522ec1","target_edition_id":"edition.r017.id-id.draft","target_line_end":682,"target_line_start":679,"target_local_id":"block-124","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[679,682],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d6ca56b1a42eb02f1fa164f033f1c42f96e669e9750c74a60d613a89a888ca86","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-125","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2f26d10ca3c63de365b247077d5b4ae491d249293a7a827e8359b58413df275c","target_edition_id":"edition.r017.id-id.draft","target_line_end":684,"target_line_start":684,"target_local_id":"block-125","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[684,684],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7da6cbb72f79cdfea7747344c1c2667f72f5f623b8efc2eaa2370238820238ab","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-126","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"565e5903b682e24740953c67d92569648130150a8761a0ea6381921527e3656b","target_edition_id":"edition.r017.id-id.draft","target_line_end":686,"target_line_start":686,"target_local_id":"block-126","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[686,686],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5fa9851ab76f075b89cfe9ce5499fa6df120b7f87a829d5ce21e6e6e025d5db8","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-127","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"33eea401eb5705c0972434ff9e07e697a553dbdc54e8eea6d0fc3574fc3f8a2a","target_edition_id":"edition.r017.id-id.draft","target_line_end":703,"target_line_start":688,"target_local_id":"block-127","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[688,703],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c9edc07d213238649f8296c52728a0a5f0cdf7f1b86b6c9b7940200ab5f5342","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-128","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"303497308c034c2f987dfb5ed57f94b97cce287572a2c19984453aae3fa5f760","target_edition_id":"edition.r017.id-id.draft","target_line_end":712,"target_line_start":705,"target_local_id":"block-128","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[705,712],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c3101cea43e9d6da8085eef90aee8738b692c7c103a2596d461eb052ec3537b","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-129","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d2d31b7cb8a7a56c9edae50c1fe920cb0f921e6d5b578788ab530a7169ad9a3a","target_edition_id":"edition.r017.id-id.draft","target_line_end":714,"target_line_start":714,"target_local_id":"block-129","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[714,714],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df9094db98ed84cb115e4f2cbef305a0fea8af5622a0ec09324f1e6b7b195d27","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-130","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7b7153c5dcc3f84449ebd0cee1b5d3cb9027ae140f8f6ee20fa7d1ea2576c247","target_edition_id":"edition.r017.id-id.draft","target_line_end":717,"target_line_start":716,"target_local_id":"block-130","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[716,717],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8f4d245f84299c20f553f474803fb0316280bdddc69f3ece84b830f3150c0ab8","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-131","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a272852ea62df2e72ee3514a72ced7a5ef418625a9fc09a7b0621a5580a77a97","target_edition_id":"edition.r017.id-id.draft","target_line_end":731,"target_line_start":719,"target_local_id":"block-131","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[719,731],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20d543cf9392bf8a1ac6a854af53255bca0452ab16284378252f6dcee8ca2967","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-132","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":733,"target_line_start":733,"target_local_id":"block-132","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[733,733],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f4348b360252666c0816ad8a5370bf3881bda36e81c626c41b0f6de047abab85","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-133","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2286f5d79d255f135baaf5cc7f44fa0b8567e5b6ef27c1296d05adcac70f0d28","target_edition_id":"edition.r017.id-id.draft","target_line_end":746,"target_line_start":735,"target_local_id":"block-133","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[735,746],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7df56a6b600a1d78fa0e435fca8ec10b22f8e979f4d823c398a7c4c445fd8f55","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-134","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e26742cfe4597ee670a1e1968a0708f7a585c5876895f924b1d68c7dc0a53d60","target_edition_id":"edition.r017.id-id.draft","target_line_end":748,"target_line_start":748,"target_local_id":"block-134","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[748,748],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d6b7e669e7208632799f650073031988226266d43a181fb9d80ac19506c3675","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-135","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"38b7968a8a9f8d53831da75f8786efc6560b36fe47c342dc578752c9ca812cbd","target_edition_id":"edition.r017.id-id.draft","target_line_end":761,"target_line_start":750,"target_local_id":"block-135","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[750,761],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2108932c7f3904f8cbca1be240b42b320add106e7fffa6316f0809af0fd23a50","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-136","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dcbc6e31481110127bfc187ee653bbac042e1b2a641ad1fc99dc26dc78e56ffb","target_edition_id":"edition.r017.id-id.draft","target_line_end":766,"target_line_start":763,"target_local_id":"block-136","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[763,766],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ede9edca0bd7629d14768834e9d12173c45d30f7270d49ebc8e9d2bb9343569b","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-137","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4c6870e8f641aa5a734b29f7728b74219f9b33f3c01a1521a971a6c46674ff2c","target_edition_id":"edition.r017.id-id.draft","target_line_end":768,"target_line_start":768,"target_local_id":"block-137","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[768,768],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"755d5cce2d139e672adf52dffd013f4d4ec9c7dd07ea0c5c82817df9ebfe7f70","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-138","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"abb376cf3f84961ca01dfb40746e1878823db4783186808bd99fc63bf98be54d","target_edition_id":"edition.r017.id-id.draft","target_line_end":772,"target_line_start":770,"target_local_id":"block-138","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[770,772],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"22df7029bda061f7b65f62eaaebe83c7eead149b63dc8f073ab7af3c66275a14","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-139","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"69c985a672e8af80f9e983371a98732ba3949f75d266018c030d58db518d8ce4","target_edition_id":"edition.r017.id-id.draft","target_line_end":774,"target_line_start":774,"target_local_id":"block-139","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[774,774],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e6ca1f7a86b86808de2dfab9e09558f85466df2733c6717fe59b07c9664ec71","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-140","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5979ee74c9798d7bf3a49317e7657a4f86f6ac0cc2864f083094b7a090c60b34","target_edition_id":"edition.r017.id-id.draft","target_line_end":778,"target_line_start":776,"target_local_id":"block-140","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[776,778],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c7fce5022db0a9e9603c906d013b7a06d2a13e5a09d8edfbb7c0faa17ecd81b0","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-141","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b7eccc151ac7536a0061d41d6f4c3efe1219b100cf64787c630448c1d65e889","target_edition_id":"edition.r017.id-id.draft","target_line_end":780,"target_line_start":780,"target_local_id":"block-141","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[780,780],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9083a0969b34d59931f69db76fe96bd0fc05a7d988fa5c907680ac8a4b15d886","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-142","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0cd8f45845cd829064c1fd8fe1b1505fc6e9292460d1883180a093b18df50727","target_edition_id":"edition.r017.id-id.draft","target_line_end":784,"target_line_start":782,"target_local_id":"block-142","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[782,784],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3907b13b3a62996d99846ae06bbcdeed27affc2d5a87e0be6073758ee4154fba","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-143","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5634746f0b7123bf9ccb073680f2ddf4169238c3fc7720cd52a4abb9bb299d4a","target_edition_id":"edition.r017.id-id.draft","target_line_end":786,"target_line_start":786,"target_local_id":"block-143","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[786,786],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9c447691eb7a67cf2e7c0c08d35ede8a69ecdbeb68a3d710e09010e9eac3a31","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-144","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"391c9d2ba0e6dcfc99833d8eec469026cd67179569f922a8c3b23e4a95196494","target_edition_id":"edition.r017.id-id.draft","target_line_end":788,"target_line_start":788,"target_local_id":"block-144","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[788,788],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"12e951c7c493a2a89d9c1a38b66bea9146025c6b00c8c3b9e4bbb0dfb685a5ce","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-145","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"050c7ef10b84a1794feffbc0692f6f3d98ac8940c62e0ebcd60aaebbf7677957","target_edition_id":"edition.r017.id-id.draft","target_line_end":792,"target_line_start":790,"target_local_id":"block-145","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[790,792],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9010375d59cc60ca639f33b5e0e2eefa782118e91b247f52fcfe9648840c055a","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-146","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"22c790c45f5b2edc1d07f1d62c10ca9d77f350deef4aa17d4acd01df7d0dbfdf","target_edition_id":"edition.r017.id-id.draft","target_line_end":794,"target_line_start":794,"target_local_id":"block-146","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[794,794],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f53724a70d2b45cbd309532d35ef6d0c2f40bbb61fa4286a7eccdfd5f1b78c30","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-147","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f0bf6968b9a5b1e63df0a6a492dd083c826abeeeffc822aaaae3a0ca23996c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":804,"target_line_start":796,"target_local_id":"block-147","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[796,804],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dcf607176751a03e3225da4ae224d797f27d77628858308e188c321174774883","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-148","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2bcc9b115009ea3623f19d8b685135181d197197d8c28cda6468e76fd763d5d1","target_edition_id":"edition.r017.id-id.draft","target_line_end":827,"target_line_start":806,"target_local_id":"block-148","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[806,827],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"45a61c1caa51ea58da5c72b750215f3a986e2f66faecf93b7fbe280e9bab3a48","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-149","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3be0c1a00ea650130daa7b945c36e2553f32163efd5457eb1b729c11bd8e520a","target_edition_id":"edition.r017.id-id.draft","target_line_end":829,"target_line_start":829,"target_local_id":"block-149","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[829,829],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6185a5551478d850d12a35cb7e77273147206cce7eaee892d62a01943ae15be0","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-150","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f16faa03f3fdd6c1429f103bcbd9a77a8f15c47f5b783dd976977b2d32f00a0f","target_edition_id":"edition.r017.id-id.draft","target_line_end":850,"target_line_start":831,"target_local_id":"block-150","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[831,850],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64dfc9420832f735a2638f22a1f8850e44fc265eecb8f1f2046cdad6eed02c2f","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-151","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":852,"target_line_start":852,"target_local_id":"block-151","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[852,852],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dff399955ee40d8c896cc9ced629d5e6dbc4e65dd429ca05dd087d07a62dc060","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-152","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d6d532a48329d4783dc782636157db1d1c7416403bbd5c4ae36155890d6aa4dc","target_edition_id":"edition.r017.id-id.draft","target_line_end":872,"target_line_start":854,"target_local_id":"block-152","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[854,872],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"11cfd8b50afdbaa3bc8765e2a99cce8dd625657bebc99c2acfa3198382eee80a","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-153","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"663886cdd33ac4a42c30d9bf2884ddde323347cae95948e0c126e6c09037d6eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":878,"target_line_start":874,"target_local_id":"block-153","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[874,878],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"780b3b4c11bb8de9f619e5aed353d3567ebcaef80dc6e43f2ecf430057a235e2","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-154","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"38b4a64040a4e140b02e0ecd2944b24d947dc900bed8cd42168ba0f3c808de54","target_edition_id":"edition.r017.id-id.draft","target_line_end":880,"target_line_start":880,"target_local_id":"block-154","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[880,880],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2dea5a90734d76bda510c5714357b0eb660ac3af3673c5642d7099860bb0d04a","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-155","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dc44677992d572f648975ab32cedaf96cd79245731844e4c7d973bc04a49810a","target_edition_id":"edition.r017.id-id.draft","target_line_end":882,"target_line_start":882,"target_local_id":"block-155","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[882,882],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"46a82875bf95ada141a631f64c3f9b60514cf1d2342cb8947959ba698955fbaf","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-156","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bfa26d354d7d129c918b0627e5a42cc11003a0e9be6ae995a26e12c1a15f01e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":897,"target_line_start":884,"target_local_id":"block-156","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[884,897],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e66f2913f5fc4e0a0a72bddf451cf915c03190c2330f6bb9a55e0df0e90087a4","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-157","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f5d99ae55dfa2e50ad3520821d8bc4385f0a7eb2fe7ec8fae33873b5938b18ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":900,"target_line_start":899,"target_local_id":"block-157","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[899,900],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52cdc2e709b0e8cd3da77367b1776dc8b38f0bdd8e5f99ff672caf5310b7719f","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-158","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"229a7cdd59e87068fa3b585e52de02f16db71e6f16c37010e54b148a4904b1cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":917,"target_line_start":902,"target_local_id":"block-158","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[902,917],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84d6dc6c9ac92c58c78df040a9ff1e11cebd8953ea3829a4e88cfae363415b6c","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-159","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":919,"target_line_start":919,"target_local_id":"block-159","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[919,919],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"49e34c7e7215498f4e0547ec3c717f4b942d92ed5625ba343367a94ca699c7a7","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-160","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f6e459951df18a7458f5094a80a9ff935ecc68f54b1191a717208dc10e15df13","target_edition_id":"edition.r017.id-id.draft","target_line_end":933,"target_line_start":921,"target_local_id":"block-160","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[921,933],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c8afba8a37117857c381ebb910478f4f45d104bd3c46dfd92ab47bb204edb99","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-161","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"94e79effdfc389338afc46d2a383a7781fb5d2883e22a972e7409582d5ecab42","target_edition_id":"edition.r017.id-id.draft","target_line_end":940,"target_line_start":935,"target_local_id":"block-161","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[935,940],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e7ca9f4398e2e9bca2d8b1a9791103661ebdeb1cece7af8687597a11f08e837","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-162","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"79ecb1701e9d1db7f6c82f4d4a2fc5852ac4a26ef3c6b85b8310e2e159b98273","target_edition_id":"edition.r017.id-id.draft","target_line_end":949,"target_line_start":942,"target_local_id":"block-162","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[942,949],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f97df42539cd392d6b83f3477dfa46396d1132e88a43ac8640aeb37eda4a06ff","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-163","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5f79423979efcdf14268ab6fbbe02876687b6f805cbe34a1e2876b1f8fdfe0db","target_edition_id":"edition.r017.id-id.draft","target_line_end":952,"target_line_start":951,"target_local_id":"block-163","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[951,952],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52beb1fd0e40725c6b836f43481f8e9035114428f270977712537255118d8262","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-164","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e059c92a21264b4359b9915479367684709c9b31c899ac3d2b9c5c2a9a84b87","target_edition_id":"edition.r017.id-id.draft","target_line_end":954,"target_line_start":954,"target_local_id":"block-164","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[954,954],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2071a677cc1c429c4ea6121e5fc73f6c95d56e0221265c3c005ce15d36a9126c","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-165","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1b96d27e5720675e1d6a99289202f4bb7b8b416130b184dff2b242f9e7a97a1c","target_edition_id":"edition.r017.id-id.draft","target_line_end":968,"target_line_start":956,"target_local_id":"block-165","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[956,968],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a382c7f22f2b1f1135f140f0266030b835db6cf6eb27fefa460d2f161886960","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-166","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d78d9c2d7f2ee491692839eaadc3ad62df8409ddeff51fdf4fcd9b2577e1b922","target_edition_id":"edition.r017.id-id.draft","target_line_end":970,"target_line_start":970,"target_local_id":"block-166","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[970,970],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a899f9b0bda06dcdb85c683f1532b4b02264ba1cd2d06b8ef79226e95a9929d7","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-167","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7d64bf6989b9639a4183a5ce90567bc606e6b414ad2724ec9bac173402e29bb7","target_edition_id":"edition.r017.id-id.draft","target_line_end":973,"target_line_start":972,"target_local_id":"block-167","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[972,973],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"08c87c71f69c3e9b70d5a70869dd5ad1aa350d4d6814c9240e0beb694a5af4f0","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-168","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d06966f89ff34857368cbe15e1fd695ba889b97b12be3481c21b6f9f97fcc1db","target_edition_id":"edition.r017.id-id.draft","target_line_end":975,"target_line_start":975,"target_local_id":"block-168","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[975,975],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5900bfddbf1c1e94677f13652371658f6e85992b04fbad95360de88cd2b2751c","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-169","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bf46d5ff038e20a5d2a70e0a3d5529aac1764bb245450451b8edd19228932970","target_edition_id":"edition.r017.id-id.draft","target_line_end":980,"target_line_start":977,"target_local_id":"block-169","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[977,980],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"767bca165f832bf2c5fb8a34b13a70b35d9b1ebfc147947b2a393ed87487191d","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-170","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f63f42a8622169c5dfd8bdfe9b2095b699e189883199bc6b941d60086c8dfdb1","target_edition_id":"edition.r017.id-id.draft","target_line_end":982,"target_line_start":982,"target_local_id":"block-170","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[982,982],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f668985005159b5bbd79b0640a3c5edd416ed241a9fec49917f12caba8c4fcd","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-171","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4a532df3817c6342c9506fd16d18c3cefb6e4e198af5bc1823a39ddd8f0d74cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":986,"target_line_start":984,"target_local_id":"block-171","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[984,986],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88a848b0013ac5d6611e4aeef9a231b7d399af5725e4c793f00afa37db57d125","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-172","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd350f315435030e3f76ee948a0d1bc7022e634d474c009fe19adac6a3346199","target_edition_id":"edition.r017.id-id.draft","target_line_end":994,"target_line_start":988,"target_local_id":"block-172","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[988,994],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e73d1685bd23c7d46013b92ad642edcdc99260133cc18c49c53421f7e22af1d5","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-173","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"15aad7bfdec36b6eab8dac94d6fd96492ca8ad7b7eba6dc49968418796526a99","target_edition_id":"edition.r017.id-id.draft","target_line_end":999,"target_line_start":996,"target_local_id":"block-173","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[996,999],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"08c52dfb2cce0d2ec244728385251d2ef4cb9fb60a29b8be91bd979254c2a71e","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-174","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"78e39023b46376f78feff4763e4245b06c8d0b85544a6ed62c42aad4ac39e024","target_edition_id":"edition.r017.id-id.draft","target_line_end":1004,"target_line_start":1001,"target_local_id":"block-174","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1001,1004],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8674c05bbc1996347b3baf920e0b0347ceab9f557517c55c4dc5979d6a76c5d9","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-175","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"864363b615d5c2464b76083342e72ddc7726205d43c3c120d3108ed64eed8990","target_edition_id":"edition.r017.id-id.draft","target_line_end":1007,"target_line_start":1006,"target_local_id":"block-175","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1006,1007],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb6d6b4afe9e8445b2f9d613ed89b743442932dad0b4112ffea18a8a6837a2fb","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-176","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"54ed94af1bf33e05e516065a15625060c9aa23c70eb5fc4a3527bc8330948f29","target_edition_id":"edition.r017.id-id.draft","target_line_end":1012,"target_line_start":1009,"target_local_id":"block-176","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1009,1012],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"edc1cbd1cd0e9f00a3040c7cfb848d53cb67f37613aa786e817d8e8d3e441776","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-177","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c33b0c150ea29324002df02bb7489c927a612dbae1f698b7e61f86c1699e4c71","target_edition_id":"edition.r017.id-id.draft","target_line_end":1020,"target_line_start":1014,"target_local_id":"block-177","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1014,1020],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26a512b05d82c2c977d8a6d5c0480cbea64284eade513f1cc55188a0fe5ec3ec","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-178","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fa0524546ab567a212c1e1e0f2ce67402f6e48d0a9c59a69c38993a457356987","target_edition_id":"edition.r017.id-id.draft","target_line_end":1023,"target_line_start":1022,"target_local_id":"block-178","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1022,1023],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"afd09a7c25f4ffcb7aa8a123860e649638188ecdcfb61237546693c2c569d0f3","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-179","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"967ce32d44124cc44aad67a1abd6fe3da40bb7441f58affd7f06442c66deca42","target_edition_id":"edition.r017.id-id.draft","target_line_end":1028,"target_line_start":1025,"target_local_id":"block-179","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1025,1028],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb0fa6a51d1eee8be38be042a277e0855f9fea8de1f43897b3d6ebe256221ae7","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-180","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5a43d5f9fa22a2ef14fc73802aba83c927784b05a34c8736befc52b0a4eb628e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1039,"target_line_start":1030,"target_local_id":"block-180","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1030,1039],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6b798d47152a574a5feb4b711bc8e016b4f7435f889abaa5f6288b6215022c35","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-181","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1392cbb39e83c1631bd716bbd5dbecf420e2870ee60cfca6d9cf0bed17cc9fd","target_edition_id":"edition.r017.id-id.draft","target_line_end":1042,"target_line_start":1041,"target_local_id":"block-181","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1041,1042],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f3aec775b42726ff965e00a6a8bb1060149f3f6eea05198eeb805229e7d813a8","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-182","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a33fdcb08cf540b50ba9de38a39bbb9935cc61f3dadd2c2371435ab84e88b6a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1050,"target_line_start":1044,"target_local_id":"block-182","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1044,1050],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1f34228f16126495f628ae7aa592d6755b6d6fd7023d6c467c732e1a22088a57","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-183","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3865b2778708492f31c53d38f0f5b8c69e445c677999a2348b8ec433a3d92f76","target_edition_id":"edition.r017.id-id.draft","target_line_end":1052,"target_line_start":1052,"target_local_id":"block-183","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1052,1052],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"33eea1562541d9eed67ffeb409d2b88a3195ef58f28f057dff202b3ce1862771","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-184","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1054,"target_line_start":1054,"target_local_id":"block-184","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1054,1054],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10f2c42dfaca894e0ebf13f6e073faffc734b11939d18a1f6eb54ff0be0408e3","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-185","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1056,"target_line_start":1056,"target_local_id":"block-185","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1056,1056],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2ef221e7b0d38fad4a68ff74675f0e2ed09023fa481deb7ec1e068cacf6c381f","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-186","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7ab814cfbf47e98d1ec9f4d7d0aa0a8875d6bcf469866d1e7f80c96cc4a1ae46","target_edition_id":"edition.r017.id-id.draft","target_line_end":1075,"target_line_start":1058,"target_local_id":"block-186","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1058,1075],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"07affeab78a1b980c7937c31496d4175efb755d8dd8c23de726195668b13f76f","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-187","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2a74ade891733e9b92e05eb06f5a0912339f4bae1d6c883a28643a0509e74e0b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1090,"target_line_start":1077,"target_local_id":"block-187","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1077,1090],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f487ab3b403211f1e50325e755e00f70aac64a44894b28bdbc2c231f90223dce","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-188","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"428c1602c7e26759fcabf5ba0bb26557f34f8005374e6679ad13c337869b9b20","target_edition_id":"edition.r017.id-id.draft","target_line_end":1105,"target_line_start":1092,"target_local_id":"block-188","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1092,1105],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a9f8f58a061c7dff3f5562efd72912db6d040efec3f9e653320f6541b50e4ad0","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-189","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"abf2c5e5a256d0173a5339eead0c2401c0fab3f053abd8ea94a8fd736024fa64","target_edition_id":"edition.r017.id-id.draft","target_line_end":1107,"target_line_start":1107,"target_local_id":"block-189","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1107,1107],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b3acbe458378a5c397330cf30ef1eb107686ac573d2d094a4dd4f1a6977edc9c","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-190","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"84d28c6394fdf414191d1afc018dcd312225b750886d18958d757cd20db738f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1127,"target_line_start":1109,"target_local_id":"block-190","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1109,1127],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"abb21a100279183d5f5df9a140cd687038b8adee2e4798369e7f120267194fc0","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-191","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5d91ec2f0ff53383a3222f21c821524ed8c03a91d25829cad337770d06fc1c23","target_edition_id":"edition.r017.id-id.draft","target_line_end":1142,"target_line_start":1129,"target_local_id":"block-191","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1129,1142],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2994eb8c3e1476703a6e4cec98d01ea2555cbb51d8921c06914038b38137557b","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-192","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e4fad7307c52a5735ef68f9aa26fbe90ec3381511ea98e34034fe04e64c4cbb8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1157,"target_line_start":1144,"target_local_id":"block-192","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1144,1157],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cae800eec5b7d2de798f01fa1d059975914d7941feca01d99f39901d56d28ade","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-193","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"efb8945c1a1f6aef63fd1ff9ddd05ce5c8494c33cf906a8b12cdb230e6f340b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1166,"target_line_start":1159,"target_local_id":"block-193","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1159,1166],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5af7c181af84d4ae69b3081b049723b8e151556a0f35f744f6925a45f3654c9","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-194","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bcb9cfdc095abeb878268c53cdbfdbddc4bad82b4323ce4bac09d8b36021761","target_edition_id":"edition.r017.id-id.draft","target_line_end":1168,"target_line_start":1168,"target_local_id":"block-194","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1168,1168],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"28866c8cace571e6910b9654021976048fdd87c60c48b5a7bf53291a5b9d5ae5","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-195","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f010d77fdaee1c883327c018d5b8357e3465488d4c8b14111a6cf91ee4c9dcdf","target_edition_id":"edition.r017.id-id.draft","target_line_end":1178,"target_line_start":1170,"target_local_id":"block-195","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1170,1178],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f72042aaf756a5c3a0656ec05217c2a3efe1d226081d810027da6b32cc21305b","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-196","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"67bb5fbcc9cd8e8a7d9734e2648deca0b3a3e5eaee6615ff3b61e822a7b04de0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1196,"target_line_start":1180,"target_local_id":"block-196","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1180,1196],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e27a083bc11f742c88ce2fad694a9db9de76f6f475fb860cdbf654b682ed3fab","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-197","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"02bc411158e8112c9dc4199c8d99675c3a91d7015f2998ee73306674c0d2dd8d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1198,"target_line_start":1198,"target_local_id":"block-197","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1198,1198],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"36f6d53a59d840218c43d038e947408917f4527a8974c0d437ea40d97d90edb2","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-198","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7fc78e1fcc1f3cf40532b5e76d5bf2076ec333ccfd53020a499a0c060f4811c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1210,"target_line_start":1200,"target_local_id":"block-198","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1200,1210],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"353834dadf4c14ef52edda6c4531f2f7f0dcc613581b6e219b01148501b80324","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-199","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"12507c686f001ee5b8d63689f6a3d41beb1025b919388e235a379903b732cdd5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1212,"target_line_start":1212,"target_local_id":"block-199","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1212,1212],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"918c80a7aac53fb9e547e76d32682a65c4981fd2d222adcf6ad44d8f8cfa58ee","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-200","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d6ff173055c17a76e649c666b2edb8a052871d91da9c6606081788262e4a3a71","target_edition_id":"edition.r017.id-id.draft","target_line_end":1226,"target_line_start":1214,"target_local_id":"block-200","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1214,1226],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb51197804958bac20483fc60cd4f8d1a3f800d78efed11fc8fe5cb428b6cf99","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-201","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9772533590a4c1367ec34166f7f403d3853f652dc747c3316a85f5b03a766555","target_edition_id":"edition.r017.id-id.draft","target_line_end":1233,"target_line_start":1228,"target_local_id":"block-201","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1228,1233],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ebc88220ea8e44d4c59425161b9fe7c2c2a780b41c0bce0b3e5e09d8506c0022","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"id":"segment.r017.book1.ch11.text-a.block-202","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-a","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ad09a5411f2e79d2299927296a765e5753179ba8efd24ee32f0820ec907ff304","target_edition_id":"edition.r017.id-id.draft","target_line_end":1250,"target_line_start":1235,"target_local_id":"block-202","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-a","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1235,1250],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/duality.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"affc9001c7849f832e8da917ec90dd1655b259a2e6a909574f0edf7efce0c1be","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d27481fe00dd63ba8a213eabb9c457154adbd5c96be9c1ca5baaddc29ca09881","target_edition_id":"edition.r017.id-id.draft","target_line_end":2,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,2],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd5ae77af9074196a117b92f8aaa5f3ffeb7d65f7f320e9ff85de4b495f1122c","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"89f2b1689ad18d2eec2149ca07b1f06f1ea4be8bfe3246413b3131bbf4ed749e","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":4,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[4,4],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9fde09ed3be17dbc6eb3bc583a74bdddc8d7cb2ca2064bbba171bb320312ae69","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e17f79776fdd4f57118bd99cd87331ab6f88c019a92c343ac90dea452aa0896e","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":6,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[6,8],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5eb0001e507d5bc2ad7024ad8b6e0bd40528e159706b2b496735d856a1805bbd","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cfe7372898927e19f17d08bce8ed9963b04d3825350d49e799aff882c2de3015","target_edition_id":"edition.r017.id-id.draft","target_line_end":18,"target_line_start":10,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[10,18],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c84575b2bf2ae4f2ac0cf1cf3baad64193704018159c449121c204f0f21269dc","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a1e7cb7d4a3d070e76f41e9cfc0a842fbc90329d92173b9b18761b6ca188bb9e","target_edition_id":"edition.r017.id-id.draft","target_line_end":29,"target_line_start":20,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[20,29],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1611ee4bcc5dd5b709dbfb421bc0050db76161401b320a44daa75d564344acd6","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a168d204d3831e9839d19d46cfd65e658e4cb86997ca4c659ef636e41aec26e4","target_edition_id":"edition.r017.id-id.draft","target_line_end":40,"target_line_start":31,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[31,40],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d3361232b7bdf9086c54b54173057fc9aac20e3945f3953399933079321f459f","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"27e9d48cf9d389aa58c654e298cb9e9875b6b0c8c48af7077d3b1b9919ef7378","target_edition_id":"edition.r017.id-id.draft","target_line_end":43,"target_line_start":42,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[42,43],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"17993afc3eee25672ada6e4657d1290215c0c6564a13c6c1ca43c27aae5a58ad","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"092856b16bac14b53a267918341a5f2c4d7c4babdb2413c94f94c99bd0d70ff1","target_edition_id":"edition.r017.id-id.draft","target_line_end":46,"target_line_start":45,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[45,46],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d1f7fd94df712bcb46b728933f64183766d596c4fa880d7215c45a66ea791612","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cd5bffbd219b6bd6fb4a8d0b315cac8d30f014c07dc9f703524b4c4389725005","target_edition_id":"edition.r017.id-id.draft","target_line_end":54,"target_line_start":48,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[48,54],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"22ee54e01d0409c9373ed896b74ab4801d23b31c129124d4a296ddae944bd416","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"89a6efd19553bf59366920c4ea910be4ff08d7fbe44a8a85362d893dcd822c8c","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":56,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[56,62],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ba44d609bdd1e7eaf7ba30d468e41cec43eae75c47d2d0440478127ac2fa06a2","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e378a9e707e0a1b88c42a984f5ce8e4c179fdc1139c0ecf108ce0b714e09d4da","target_edition_id":"edition.r017.id-id.draft","target_line_end":67,"target_line_start":64,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[64,67],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab974a2728f1a0e7315f24814a8601ebb6f4dee76acf1e4863b36ff8daac30c3","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"db09fb3fc5b8ae73f144c643cce2dd9ce5f041933ad02e79b3fd1a79b59dcb79","target_edition_id":"edition.r017.id-id.draft","target_line_end":80,"target_line_start":69,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[69,80],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0c1e8b9104b012981227f5c51018d95460394339f90ed7ca89a2fc5b2719f4e5","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"808e8146dd5101ca105b0d26dbb1ba896952351f251d9eff44caef75f7d24fb8","target_edition_id":"edition.r017.id-id.draft","target_line_end":84,"target_line_start":82,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[82,84],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d48ec7158b56d546877ad45f3ff081188cca4cb98a0cbaf508aada24681552a2","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a8239ed7434ce4aac00e2d8f30c02b0648d1183a46b838383ea7aa44e4328642","target_edition_id":"edition.r017.id-id.draft","target_line_end":95,"target_line_start":86,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[86,95],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9508ab66687e65670104f5fb5f17ac01a48f45d2162690ee8b0c82fc0fdd8b81","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"695dc40833fb178e02d255ebbf34c91a06d66da32235ae5dc33e65a566455920","target_edition_id":"edition.r017.id-id.draft","target_line_end":101,"target_line_start":97,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[97,101],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7a74b4ddf144b6ef03d91c280330e3193206b6e77bc1cece8f237cc3ad617d0","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4ad24ad210f73d4ed91d7d98a5f833fbf7ebd2b366805bda5bdffcf2a3b4b820","target_edition_id":"edition.r017.id-id.draft","target_line_end":103,"target_line_start":103,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[103,103],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"533a49b5a9cba5ef9f9fb83f622b2c66997af6223b81747476e9366a858ad649","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7484535a14ff19bd1eaeac3354a242be869dc038e55a1c0d193f41a5de9a3cc8","target_edition_id":"edition.r017.id-id.draft","target_line_end":106,"target_line_start":105,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[105,106],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c1c30ffb0e3612f73c576202cdba7267dc763299c72c9cbc135248555a6fc882","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3bbb8f02571adf702cfff7cb0874bc6dc4c27e879ca794058f450381cc26a923","target_edition_id":"edition.r017.id-id.draft","target_line_end":114,"target_line_start":108,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[108,114],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5725ffb7869be48c26401caa1906cf136785c81afc920c6964690fa80f147823","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f8cb2e2c85a86d21d222f6c5c57f21ecc5adf26a8d835ffb825670cbed6c0df9","target_edition_id":"edition.r017.id-id.draft","target_line_end":118,"target_line_start":116,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[116,118],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"75c567c0f050f23bb2696ad1ef2fbdde064a513a2d1d9b81a2203be898ca5005","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5677af42c26859b7b0a3ccc878469569af5e3a9eb7310c7850cae0e5fd2ae9be","target_edition_id":"edition.r017.id-id.draft","target_line_end":120,"target_line_start":120,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[120,120],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7ecaf7ef256f54e0d5dc972e707f614cbb1e3db6fca28a4277942db50974b7c5","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9df7cd3d12428ffa4284dabda03c590dbce24a77226b974e9b4d1f9324a28df1","target_edition_id":"edition.r017.id-id.draft","target_line_end":123,"target_line_start":122,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[122,123],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2b10780fea7c38c34e79b93040926d4f9acb7cd80819e205dec5225cacd8c625","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b0bcd799243024165e2a26d98c1f1f3ff67d2bbd198423e39b01094611b7f17c","target_edition_id":"edition.r017.id-id.draft","target_line_end":128,"target_line_start":125,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[125,128],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"45b2d4ce514133b4994938ab62f7968701e7a29fd15da5cbafbca2fe43511954","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"80f89958e69d206a0e6611a6b8f25380ffa2d41ae4b639ac1cb6b026dd02f3a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":130,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[130,130],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a2d41275198240df42e6f44671d428f68d9f3bbe499915635359058144cc1a3","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8639614820b47e6428fb1d52013f03cc8cd990a97ac6ee26d097cfc21c15ee0b","target_edition_id":"edition.r017.id-id.draft","target_line_end":132,"target_line_start":132,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[132,132],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"baadf35dea600627db95316bffa850198b61e1ca6c1e746baa3002047540aea9","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"582783acee9227bf5e83aa8fe6e292c07d2b972ee84f636a9e1a2963c8301dc0","target_edition_id":"edition.r017.id-id.draft","target_line_end":138,"target_line_start":134,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[134,138],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f6de7b71782dd86f17e94cc37e7db277c5b40019d6600c8084b4a6638bead6c5","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2aef2965750cd99f931fb68950beac3b9e22a377ffa4a7da3a948d7a54dc0c4e","target_edition_id":"edition.r017.id-id.draft","target_line_end":140,"target_line_start":140,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[140,140],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a0c945f416037f968a615bc2407b6c8344bda1c3653a0e2ed0b4ba845374027","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1e83c020bf754ab57f0c3f2e8c107aa41baebff0f8606bc3203bb1347c5b992","target_edition_id":"edition.r017.id-id.draft","target_line_end":152,"target_line_start":142,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[142,152],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9da99c9d5cdc104b05194de3672e57cd7fdd05ea2bc79cf8a8f4973b792278d6","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c13b7b107c6d129058a0e65cdde303de2108a264a2526b81e173a6da4f841710","target_edition_id":"edition.r017.id-id.draft","target_line_end":155,"target_line_start":154,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[154,155],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d284feabf5c840e2de99193d164e8aa50767fb65ceecce71f6a8ba2eb4097921","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ad3586fcf41f10b0987f794448c5e3cdf76ec0d53115dab4bfeddb29cc3d3be1","target_edition_id":"edition.r017.id-id.draft","target_line_end":161,"target_line_start":157,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[157,161],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0e90314a578281497604ba164344344c269efb7b96786ddbf44ae86825719d6","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3484ed80ee0bc47109731b586be8d6d27e6b2cc5e206044d089cab6c6616ac79","target_edition_id":"edition.r017.id-id.draft","target_line_end":163,"target_line_start":163,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[163,163],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aeb256bd5a7cc703a578317e0e00e3d24424c335e1e6d51f09f79158710921ab","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bc540865feba944bcce1b388d06955bd8502d962817063de799f32def1e7de12","target_edition_id":"edition.r017.id-id.draft","target_line_end":165,"target_line_start":165,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[165,165],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1bf06e4bba57c91adf45011db8e5ffc1f6ab5a9ceeb2261c390cd19268bcaf05","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0d4ffd997697e1bb6574e8ed6beea2ecf06ddfe475fc48296b6247f5e029d052","target_edition_id":"edition.r017.id-id.draft","target_line_end":176,"target_line_start":167,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[167,176],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"49b6ecb7254b371afc916af27f1346b2492a1ab4f7292d2b484b9344f2b157c6","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ae6d3320b580e8e57f94e7af185b9f8bc876c01f2dd806ad9cd29bb7768d7823","target_edition_id":"edition.r017.id-id.draft","target_line_end":178,"target_line_start":178,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[178,178],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b20ac35b4cb471f4f533f54c3679dc871edb2ed24ce79595c460889dd5747078","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c4062aa875531e8aa48d63d17a5448679faf0caa311f73e95e4b68c657478ded","target_edition_id":"edition.r017.id-id.draft","target_line_end":182,"target_line_start":180,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[180,182],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c794c76e5d7bd5f18f123e6e56304dc40a0413c96593f5e3019a7a1a6c5a774","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"75290ed8c22a02f1166b5eee58b708c2b33d8f1cabdfa3216c75dba19ecf3676","target_edition_id":"edition.r017.id-id.draft","target_line_end":184,"target_line_start":184,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[184,184],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e746adffb9884d23271dbdd7c22ab282edc9e92576b996738620f356b3892e94","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2cdb7c5d249bc3780971ce12d3e8a73e01e2c981c579e100ca5b746a1d98e9b0","target_edition_id":"edition.r017.id-id.draft","target_line_end":189,"target_line_start":186,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[186,189],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6a348c219d6ed5af66b069bb352e0ec5da4b7667f862bc2da6ef9a39e75d3419","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"22c86da361ad6051d8fe89f63fc9cb72c4e6cc4421c6c03b6ccbdd6908daaa8a","target_edition_id":"edition.r017.id-id.draft","target_line_end":191,"target_line_start":191,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[191,191],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"22def082bb849feb11bc69a2b3d32beca35fc06aa981773a6e93a782a0a23582","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6d70babbb6bf17228d43a626e139308112de897d0f33883441f79905d8ea7dc7","target_edition_id":"edition.r017.id-id.draft","target_line_end":196,"target_line_start":193,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[193,196],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ffa4110132f6912e44b2556606ad0d3ed34a10e6980af7040f379614d552d790","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7f02745947cc919702f9cde4923955033009210d7bedc4f7c6f7edfb2464e950","target_edition_id":"edition.r017.id-id.draft","target_line_end":198,"target_line_start":198,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[198,198],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2def8a1c3ad6ed68a165732ad1044a418832bde5fd622c7e9cb33b62e3ed367","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a4f6175b5bfadaace3cdc5ff77417f4f57e74bf3bda2cd44ce5ad9e585fa43bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":200,"target_line_start":200,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[200,200],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f32720c172336ef9e93c2fd315c425b1f5899dc5e2f7caf779cb04211583f1cb","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"996079bba208c28d31d85b7c28cbdb1a7a4bab2a2a9312b35dd4dddee1ef8117","target_edition_id":"edition.r017.id-id.draft","target_line_end":203,"target_line_start":202,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[202,203],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7e5d3a8ff3b7ef52bc22a50270ef668bfc6e4da3b40349e6303c08e44dc1487c","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":205,"target_line_start":205,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[205,205],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a84f84634c7f33da5238c8c6cee950b24e171afed7ade3d1cb5ae188790ac819","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":207,"target_line_start":207,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[207,207],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"883f029ea1cff1ee406379533acb5802da98eb9a6bf9ce047221c12ac14087fd","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-044","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"20b792b9539c1505a950e4bf41acd4c22d256a8a10dc7c8c156bff161c0321b8","target_edition_id":"edition.r017.id-id.draft","target_line_end":234,"target_line_start":209,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[209,234],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"58cd6b7911d5915c11daef8c4e3b10755c174dcb7a16ee7f3d4d6d2567481f08","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-045","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"abf2c5e5a256d0173a5339eead0c2401c0fab3f053abd8ea94a8fd736024fa64","target_edition_id":"edition.r017.id-id.draft","target_line_end":236,"target_line_start":236,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[236,236],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de278c4ec7cd0c53b02a8c6f8c44549195852ebc0f3c2f9575a1f0a1dbfdb5de","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-046","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2db55c1b8d0fec3793fe7f55d96bde6d5a35c3163e1bf221007ef8d09ff2e8d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":240,"target_line_start":238,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[238,240],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7bedf8fab46c5e2621c3b3cc86946f915caf4401e7955228fd92a523a5b66a1b","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-047","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b05b4ee7f984e07812a180f607c192e9be47b19e57a6be2009d59061485eb91c","target_edition_id":"edition.r017.id-id.draft","target_line_end":244,"target_line_start":242,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[242,244],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c279e6c8aef0188154a5882dc968d579241c4cafa4ed370abb9ea450a1f77d56","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-048","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"685da980263760988b4783c2c3da9d26cf15cd1ef5c31afb3acf55764c97fba8","target_edition_id":"edition.r017.id-id.draft","target_line_end":252,"target_line_start":246,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[246,252],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb15b631c74b1d0679e1bcfdf68cc67ea9c0ffd38fa6c7c5b8c19d01069cef77","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-049","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b1e2d880f9645a14d734f0194fa8d6581db1672de94304be725eeef90f6efbb1","target_edition_id":"edition.r017.id-id.draft","target_line_end":257,"target_line_start":254,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[254,257],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"41d1d6e81eea97710bedcb02d28a6e43814d8d7cb8e80a8d36f3984879cedc22","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-050","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d0fc59766637942dc9723d0faccc85c7b408cc5c54f1823120dda8ea4baa9801","target_edition_id":"edition.r017.id-id.draft","target_line_end":271,"target_line_start":259,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[259,271],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5b21f70b5ea1dd1aafc4b1ed695b0f7ec59d7c26e72b28122fd3e498e8af069","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-051","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0ce849d4c6efbae15ce2c3499aa75607fa93eaf8592cbbe18e5fc22445fcd0a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":276,"target_line_start":273,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[273,276],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70b25afdf4a3ef7d1d09f8f0a815dbfb4f8d69d307262040a09dd0a7d8205a5e","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-052","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7179f3abd5149af39fe415cde275d1c0c8e595c43bab8165edb1ea06195d8fd4","target_edition_id":"edition.r017.id-id.draft","target_line_end":278,"target_line_start":278,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[278,278],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b614496d7a23e94879ad2008b57c7ffdc55127b5fe650671aa6b0b4f0dbe19fd","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-053","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9a7b636ce6e7e110e94063ebb1d8f8ff4feedec10764b8017df1cdbc26c8837d","target_edition_id":"edition.r017.id-id.draft","target_line_end":282,"target_line_start":280,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[280,282],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1275f9a0c4c8fc67f41250e36c9209493238ea4e1ebedf20e6615c1523c100cd","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-054","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"234d1498948db2284c1f42324ab0c42539d50d18be4dbecacc580091afd48fb5","target_edition_id":"edition.r017.id-id.draft","target_line_end":285,"target_line_start":284,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[284,285],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3284d0e2b8ced2e32e1d4a7831d3187e286e1c7b419c8ab2410fdfff7949265c","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-055","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f940bc0721f42e52812ca73fe0ded39311bdbf5a198f4c8b6b74eda03fd13524","target_edition_id":"edition.r017.id-id.draft","target_line_end":288,"target_line_start":287,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[287,288],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"376f12cc6edf4f1a7288f5ddadcf00ba9580c37799238c555712b3b06f3d1249","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-056","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7a0f850d0930365dcc87af19a346ef20a4562e373c11397756b54977074cbc4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":291,"target_line_start":290,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[290,291],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"96dcb8951e49161ae97cf6deba69adcb7a8eac6e8f6398cd2f22c70d82b88b19","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-057","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4020ea6217cb1d0c3da54b8546169e162e955bad4c246c1d6d4ebff9adeaef96","target_edition_id":"edition.r017.id-id.draft","target_line_end":303,"target_line_start":293,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[293,303],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24a80aaa47174891701bcf3ff7ead08d1369b93833f6151c5e97f845b34a3e0f","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-058","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a600325c222a8d971e7c8a9556c612b4e85cfb3189f6df4c75ff60e79638a7c5","target_edition_id":"edition.r017.id-id.draft","target_line_end":307,"target_line_start":305,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[305,307],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"279150145ee583f2a537a51d80455d5d3c40d62087ef3f5d8930a2e66a7886af","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-059","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d3046a53e150787701a136d7b87defe19dc8688f262f6b5984f3f436a364bf8f","target_edition_id":"edition.r017.id-id.draft","target_line_end":321,"target_line_start":309,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[309,321],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"43aca0f1c641e35a9d47c15a4bcd88eee9b533fe774304071fec195242ba193f","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-060","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"58634aefd8745f0e84be8b6bca4393ad8461353afef7c1750c9435a96a54b529","target_edition_id":"edition.r017.id-id.draft","target_line_end":323,"target_line_start":323,"target_local_id":"block-060","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[323,323],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df41171d46fbf69cafdfdc17509e660e3873e33c51b72605905ae910bba898c0","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-061","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"63e72960954957c086dc793905b6b6e980c85d3d7a4bd51a2e60dfe0f4b7df38","target_edition_id":"edition.r017.id-id.draft","target_line_end":325,"target_line_start":325,"target_local_id":"block-061","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[325,325],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce83f9752d21f58def994521e46c7269f2f9719d7a5e247cd1228d7748d9452f","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-062","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e9f5aceb248e944758e193fde23c0884c129ba6e6ea7e1ca9f4647b8442c0073","target_edition_id":"edition.r017.id-id.draft","target_line_end":327,"target_line_start":327,"target_local_id":"block-062","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[327,327],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c5d4c99a05502b831e87c993e7902357ba3918e92bb9b9b1e0442c4b85491f1","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-063","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06665170ad377fd0f5ec3de786f2f0a3d5321d60d0bc6c87fa56ba7fb916d3c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":332,"target_line_start":329,"target_local_id":"block-063","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[329,332],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"033849592f461787c1083ecc2c3b28ab77ee309dc6935ae49917a8362e71dc82","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-064","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"11bd7d9abb5df2e2f94616f4426da6797ce081753fc002aeeaa80050afa25ec0","target_edition_id":"edition.r017.id-id.draft","target_line_end":336,"target_line_start":334,"target_local_id":"block-064","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[334,336],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a1c39065e964ccf292f0506895fcd061558293809bbac655cdc2a400d247def","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-065","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"257551919a7e09e54947460071730bf7cdc8bc6315fbabc5ef3479d5b2d28f5e","target_edition_id":"edition.r017.id-id.draft","target_line_end":338,"target_line_start":338,"target_local_id":"block-065","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[338,338],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"536dc2f4cc0e5e563233dbf0950e2dfc987718c065c94fdf03071ec937cac403","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-066","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ff1de644ae1afaf5aca30e4eac3ff2d1c52645027a7e988932c276dc252a7ba9","target_edition_id":"edition.r017.id-id.draft","target_line_end":347,"target_line_start":340,"target_local_id":"block-066","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[340,347],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a7411c2c65233b6659be1315a40a0d4e6c275762cfcb356c5e5027f55b49527f","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-067","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e22e48ca615a0cf0f017cd7fe588d070f054e4ebd6ebed93443dad88829b7481","target_edition_id":"edition.r017.id-id.draft","target_line_end":349,"target_line_start":349,"target_local_id":"block-067","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[349,349],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c6d2290d174912cb13bc77efb9353d447f6562b3bf20a73fd5303ff099bdc010","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-068","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a03128068443088c280cbbde6e02effcb5cccc78e1d202255e2133c6c2c0c77a","target_edition_id":"edition.r017.id-id.draft","target_line_end":358,"target_line_start":351,"target_local_id":"block-068","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[351,358],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f9e2cd28e99dba450c2671d3882158c0da1b4704d4dfc527b051c8ada8ddf8e9","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-069","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d70e582a4312c2bf02c289f88e1f3a09aea45a4c706278b66ce28cf7c89d8fca","target_edition_id":"edition.r017.id-id.draft","target_line_end":360,"target_line_start":360,"target_local_id":"block-069","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[360,360],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8855ffaf94aec025f6987ff85182088e4147af9ea5e2f2820c1155219ba572c8","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-070","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ab306e83932ee87d0404217e55aaaf28deb7c3c9c2b4fbae057d719c65cf1151","target_edition_id":"edition.r017.id-id.draft","target_line_end":362,"target_line_start":362,"target_local_id":"block-070","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[362,362],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"15a7c161b5cb98d5d332ff92924114c6ad7df81645d0cc03e58f9979bcf44da6","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-071","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"16faa3d5f531be8d091ee5a84d6a4ef00ffc27d6e280c311d2d124e1e60ed36f","target_edition_id":"edition.r017.id-id.draft","target_line_end":366,"target_line_start":364,"target_local_id":"block-071","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[364,366],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d258a748ebc2885ff2b296bed471cc25fcc5224e7fb50d5bbbc205263173ca4c","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-072","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bcb9cfdc095abeb878268c53cdbfdbddc4bad82b4323ce4bac09d8b36021761","target_edition_id":"edition.r017.id-id.draft","target_line_end":368,"target_line_start":368,"target_local_id":"block-072","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[368,368],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3fea40191798f8e18a4cf9d7c77f17b51bae8a1a9767d97b8a7b7e1170d18308","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-073","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"96b0a564cc639a8d5367203d90be65774e206b828cfa49237e8699d723d36160","target_edition_id":"edition.r017.id-id.draft","target_line_end":378,"target_line_start":370,"target_local_id":"block-073","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[370,378],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a45f24ca0a676bfbf89c89a32c5cadead678d57e08d54fd68e65813aa89943b3","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-074","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"507a45bd7a735f4cf18bd9d51d0dfeed8b2c2b5d8d17d2ef833de4855fbc7405","target_edition_id":"edition.r017.id-id.draft","target_line_end":382,"target_line_start":380,"target_local_id":"block-074","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[380,382],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a27684103463ad472e128e6a8c07ebbbcbb7ce9e01edc0c311f9ea77b013cddb","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-075","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"702412878cf174df8167376a3c16402c5b96e8beb15833a8fa5618d292ff05b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":384,"target_line_start":384,"target_local_id":"block-075","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[384,384],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88261973822fcf1bef7d881eeb87eb32340436386730c0167142f230b9a57ca4","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-076","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4a1df1f7c6ee20e6e8f6331e30333ad5a3f6ca39abb7b4b3fa74eaac6820aa15","target_edition_id":"edition.r017.id-id.draft","target_line_end":393,"target_line_start":386,"target_local_id":"block-076","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[386,393],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b8c7358188a852f4c2cfbf74c3e97a60fc210fce19952254ac6b7e06759ebe1","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-077","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"18ceabff51d4201c5f74b6fe9e33d35dfaeb208ff3ec394d5b83a5c71ccecc30","target_edition_id":"edition.r017.id-id.draft","target_line_end":395,"target_line_start":395,"target_local_id":"block-077","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[395,395],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb71da568f4212d81f4a544ad985caef3adb8923662a7a7d7e8ac51af2838906","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-078","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2e4ed7cb40c042e49618f48824c9970bf9a936f148cf6e86347fb2a1306af1a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":404,"target_line_start":397,"target_local_id":"block-078","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[397,404],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"35de6b272c7ade4c76ca26fa3d37ef5debb507989eabbb78bb681d40e5483db3","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-079","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ab7af84f38cc67a86ec2e382ab8bb03bcad8b8319b5b9f59c8287d547b7f590e","target_edition_id":"edition.r017.id-id.draft","target_line_end":406,"target_line_start":406,"target_local_id":"block-079","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[406,406],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6f3c7241952d008c5f6ce170991128241f782c89f5d63392530208249002df2","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-080","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2a4e2a47cba8fb40acf0a0b673c43f3051b0682c993a221e247b00e3b63eaee5","target_edition_id":"edition.r017.id-id.draft","target_line_end":408,"target_line_start":408,"target_local_id":"block-080","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[408,408],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e17bd5ddea9beb84932b297fe64e634d56f5fa91d53f217aa37fd5e0066618dd","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-081","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"55df87c70f77fdfcb27214775c0a1a26c50c191a5e10592a5dc8a992bd6c1ccd","target_edition_id":"edition.r017.id-id.draft","target_line_end":410,"target_line_start":410,"target_local_id":"block-081","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[410,410],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a8c6c05c8664c2e2745a3891cf7a13b41e5f636d7c0edb83c38de0afec20ec8d","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-082","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"edcd40990d3ceb036f9f7b97e9d0dc8ca5e97d3c3953abb120067dc9d549c1cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":414,"target_line_start":412,"target_local_id":"block-082","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[412,414],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"868d6ec54f5cd64a9609d2701823d0eaf172fa8f33f3e854c46399fe11b03e25","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-083","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"02bc411158e8112c9dc4199c8d99675c3a91d7015f2998ee73306674c0d2dd8d","target_edition_id":"edition.r017.id-id.draft","target_line_end":416,"target_line_start":416,"target_local_id":"block-083","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[416,416],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8af4fda6c8459be6d6c44585cf854c6dd1d5ab0d379d4fd6912859d160684f2","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-084","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7599dac86e3f821fcbb061da8051065b0ac67d1f60378adeeef19a52894357c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":419,"target_line_start":418,"target_local_id":"block-084","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[418,419],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a8ebe455f4b45d133e3cd77e9cc34257549f2a3de30101b3102833d0cfa9b937","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-085","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06f5cff23dc2593c0095651546259dae34278b72401332862e1d79de9f894f03","target_edition_id":"edition.r017.id-id.draft","target_line_end":421,"target_line_start":421,"target_local_id":"block-085","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[421,421],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f5642f0b508d2af151bce082c560fcfe3b9b1374308b5f7d2b7def682d64a35","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-086","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ba582387ecb2795d534f3571b6538ad5b85a9494287b978d2bb9da0953e6c38e","target_edition_id":"edition.r017.id-id.draft","target_line_end":436,"target_line_start":423,"target_local_id":"block-086","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[423,436],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fab0cc807a4d00854a21dbd3457f1e975be16a8543d5789802502984b236bc96","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-087","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":438,"target_line_start":438,"target_local_id":"block-087","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[438,438],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"17c15931d6c4b3985c27ac650cadba6f45e9eb4bcd2943baa3ba37bd7a337829","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-088","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"75f15aa0676ed80cb7e7e345f64102204d70fc6d8ec358490470760bedb9e45c","target_edition_id":"edition.r017.id-id.draft","target_line_end":444,"target_line_start":440,"target_local_id":"block-088","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[440,444],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8be0d1ba5f120673cd94b08e8eb919e006516ce40c0aead73f82820c610a905b","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-089","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ed9a01a17f4f1bc1c8f1e2d01bb479f9b66245ce35e8bc6696f49b59a1125d4e","target_edition_id":"edition.r017.id-id.draft","target_line_end":450,"target_line_start":446,"target_local_id":"block-089","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[446,450],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3f1dd4ba533ba950c122618454f0765a5e2c21b0957d30b981e4a41171759e12","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-090","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0da92f6c36cfb7406ed67d61dddf859e6072698c8a1351e6b6486585830a99cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":465,"target_line_start":452,"target_local_id":"block-090","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[452,465],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"86713799c82e9842050ed53e6dc52e43f9122b7ab6d64a3425a41f4fbe8fd1e7","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-091","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":467,"target_line_start":467,"target_local_id":"block-091","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[467,467],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c054873e2e3a713235cc523777db7cb0106cb708c5d4a5d05df2b76571c8de90","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-092","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1d4e1398dc8493e791e968df1822590906c156642bc7241d2be78ede6e053463","target_edition_id":"edition.r017.id-id.draft","target_line_end":475,"target_line_start":469,"target_local_id":"block-092","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[469,475],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2c01a430a4d9cdf931f278baff041fb0e327a14d1d8e907e9fbb9d1c91b08ae","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-093","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8c8eebb6f040524795b21389426bf9780465989038be76473692717a8a4e055d","target_edition_id":"edition.r017.id-id.draft","target_line_end":480,"target_line_start":477,"target_local_id":"block-093","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[477,480],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a8188bd19b44193df2f2a3b05968767bfc3ef8f1f2b86e0b73250058ded020a","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-094","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06dbb367f7fcbec024afd83ec7ad97cbfde128873553977b326b518f74007d4f","target_edition_id":"edition.r017.id-id.draft","target_line_end":483,"target_line_start":482,"target_local_id":"block-094","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[482,483],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b8fff0dfee20deac1517a842da835f4082bba8a22d358e69db7861790c585bb7","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-095","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5b0dd827777d9e44ee52cc832890234cfa7f71b4c0e90bc4132261028c36ad4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":486,"target_line_start":485,"target_local_id":"block-095","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[485,486],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d35e65d90b4df87adf411ea8de17babaa1f4e4240f740d353468c8bc82965fc5","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-096","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e3577454f5396455134fb15fc7ec6b9cc20f82bd52f4a2eff82fdbbb5e037a15","target_edition_id":"edition.r017.id-id.draft","target_line_end":489,"target_line_start":488,"target_local_id":"block-096","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[488,489],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7daa2baab6135439b26deefa68180162f92f51bc71bf2cbc801c6b34d54f2159","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-097","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f722d0819754d480d9c12f1520391660daef19799074bae608345f27e19b627a","target_edition_id":"edition.r017.id-id.draft","target_line_end":495,"target_line_start":491,"target_local_id":"block-097","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[491,495],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"781f5dc7a58e624478408c0f8771f9f89b71b74e2251a3ecf47d0ab0a6232f99","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-098","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4ef7f40c88aecdc31ca491bb8800174ee758e96b6e7e90a0f734ce65526d77e9","target_edition_id":"edition.r017.id-id.draft","target_line_end":498,"target_line_start":497,"target_local_id":"block-098","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[497,498],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"354feff092724760436d16d06eee8593e6524f44aca0b63deadc7fdfacb836bd","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-099","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"de1c1f2364d9a8a9e8e1259dccdef568d5479496e1ad80f431ed8c1160a40370","target_edition_id":"edition.r017.id-id.draft","target_line_end":500,"target_line_start":500,"target_local_id":"block-099","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[500,500],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3621a30bcdae8cdc10ed6e1d524693b442f098793953f2a1baf66ca16fe4014f","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-100","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"24fa9b136483083546222a8e033591436cb13fe2ac995f2856423e1b8995f876","target_edition_id":"edition.r017.id-id.draft","target_line_end":512,"target_line_start":502,"target_local_id":"block-100","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[502,512],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d0ace27705134251ea8fad7c31d24643aed14ccbf719ea8da73c8f0521b8b74","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-101","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":514,"target_line_start":514,"target_local_id":"block-101","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[514,514],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dbc8997c0e0900d6607e3d8d7782e93920a9f3865d654d22aa1be67864fc27be","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-102","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a96d55c9033d07aee2b89a75faecc731d11749ca766c4a058735edaba0d54d8b","target_edition_id":"edition.r017.id-id.draft","target_line_end":521,"target_line_start":516,"target_local_id":"block-102","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[516,521],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a0b421186a36f7241b9339d9d7346f9599ef2ded3751865d32a9b60cfa413d16","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-103","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"53f9f875b2faa3d2b654077425830e64f6981425a2af986f9ff253bacc7133cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":523,"target_line_start":523,"target_local_id":"block-103","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[523,523],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"501158fd7fcf6b01333782742a13108e24ba72da94a216ee2fb6420553be8d63","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-104","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"85decf8dce5b93a67942ba3c7889d60a9f3c48a90a126a7599f200e5c304d756","target_edition_id":"edition.r017.id-id.draft","target_line_end":535,"target_line_start":525,"target_local_id":"block-104","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[525,535],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fcfd4d8814f27d2d7e122fa35988b87cc15b9c44d6629a80c9b58b96f9f2033a","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-105","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":537,"target_line_start":537,"target_local_id":"block-105","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[537,537],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"064d6c09bb83a60cb6ed849ad093de238fbed4dd571e930ae0f6b96cb03d12e7","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-106","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8b1d1129c87678cb012625db9575d4926b03745a2b1682b467b31be58665ea84","target_edition_id":"edition.r017.id-id.draft","target_line_end":542,"target_line_start":539,"target_local_id":"block-106","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[539,542],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39b8aa85e083d9d7337232d419f3b0412e6534dceed160ca487e9cc6abf5ec85","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-107","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"be83a28902b74fa7182c6125d08bc8441813f50b6c323ebd4636bebb532e9cda","target_edition_id":"edition.r017.id-id.draft","target_line_end":544,"target_line_start":544,"target_local_id":"block-107","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[544,544],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"220d3713f6e788fdf59e972e04214d98ec70ca3562379f8f6f7cba0dde661554","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-108","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"645da8608dd1358c6db65080946ee8d441e94e0b2c7913aa33e65bd441d725c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":556,"target_line_start":546,"target_local_id":"block-108","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[546,556],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3f351aa2ce9de1375509f2a99c523ae9e93a33c61dc5938266d5a21ea70f3c18","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-109","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":558,"target_line_start":558,"target_local_id":"block-109","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[558,558],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"291d3fae356babe19a039a610e6c33ba2871d58ff908353e27e75205ebbd96de","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-110","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7e537fabadedd97670000571d7643e01181ecf16c3f084ea13e79d8beb25b3b3","target_edition_id":"edition.r017.id-id.draft","target_line_end":560,"target_line_start":560,"target_local_id":"block-110","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[560,560],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"405ae118a8b6d0b12aafb45b03030056e0c77b190ac23ecc3fee369ff362bb6a","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-111","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b5b6e944dd43a8759c8a17ad3c41adac22a6a264b09e524643e08023f82b09f","target_edition_id":"edition.r017.id-id.draft","target_line_end":571,"target_line_start":562,"target_local_id":"block-111","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[562,571],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1cbb318e570863a443f531c10e9717076e9c58f57dc43ab36983abfcf86b0adb","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-112","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6d590a6d0262a398a4fbb09ed311d8b1638c909ebe09f55e3bb04ad1bd843bf0","target_edition_id":"edition.r017.id-id.draft","target_line_end":573,"target_line_start":573,"target_local_id":"block-112","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[573,573],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f9a0dac137dbda030d6f2eab1d9771648fbb6ad63c3b50612aad340f587a999e","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-113","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2e13498c9da696902214ec006eda920420fc3b68001f0313bffaea20f5b66435","target_edition_id":"edition.r017.id-id.draft","target_line_end":577,"target_line_start":575,"target_local_id":"block-113","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[575,577],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0b7fd15d405b5a0168a15878caecd2f8c3b826b1c4a49993f76cbbe79db64fa0","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-114","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7b7246780295568b978a7573a7e3c7498b64165ec895d395dca5998283ecfe9c","target_edition_id":"edition.r017.id-id.draft","target_line_end":580,"target_line_start":579,"target_local_id":"block-114","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[579,580],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a9c8341922211444c5a3316632e463c10be20586626fc080fbcbec2666920780","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-115","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"715f1d6b55ab18ab8b4e4d42959c11f3722df013e9c4a44bae292e7c4c83f41a","target_edition_id":"edition.r017.id-id.draft","target_line_end":583,"target_line_start":582,"target_local_id":"block-115","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[582,583],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39624f9788f1403814ae6953316d64315903b36a5e5c91e5cc06ac962a318b08","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-116","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"066777d000d2d10be66a150bd240bed373baf9567ff7469d49ec54e2ad804cf1","target_edition_id":"edition.r017.id-id.draft","target_line_end":589,"target_line_start":585,"target_local_id":"block-116","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[585,589],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb08c8f6740f3b0fb6f0bdb1c00b824db02f1dad666cc6971c02d740a19ce67a","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-117","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"12507c686f001ee5b8d63689f6a3d41beb1025b919388e235a379903b732cdd5","target_edition_id":"edition.r017.id-id.draft","target_line_end":591,"target_line_start":591,"target_local_id":"block-117","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[591,591],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a98f731873ddbd7fc5534d6ff5c0369ed439b5336fcbbb3a0c0e3b8c125e6190","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-118","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"71fbc7846e0c91e76815759c98bec6b73207b04efb75037864061ce5c14cb270","target_edition_id":"edition.r017.id-id.draft","target_line_end":595,"target_line_start":593,"target_local_id":"block-118","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[593,595],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f6853d7ebfbc5fef68d7d684d6a715e353fd29e98353102d545c1662015b26c","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-119","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9d32e4f70290055dfc1d37785c0c860dcf196c30aef43eceac488a2d54e7fe21","target_edition_id":"edition.r017.id-id.draft","target_line_end":597,"target_line_start":597,"target_local_id":"block-119","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[597,597],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9b7eed0f2b42e508a5bcc6f03dd87b7506437c707f61b35ca0e0c130e1db0f0","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-120","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"104f5eed4add71cb29153754e147f829a8d56e305494a066d35fcc134c2c16c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":599,"target_line_start":599,"target_local_id":"block-120","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[599,599],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e98a43ea4b26050e2a8d1c91799eb5735075dd6cd2446c5c3d954bd65165d91","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-121","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"51f280f51533d9de049d4663402b42a87e616513f623ff4d9b4eddbb3d9dce5c","target_edition_id":"edition.r017.id-id.draft","target_line_end":601,"target_line_start":601,"target_local_id":"block-121","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[601,601],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"83f58712783df3519337cc4f822250e9feeac89f76ebed2f579d1f4361cd14f5","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-122","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"36cbdb518186bbf8f02f8444b570324919122c678a0dcb213d1b21f26d9121a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":605,"target_line_start":603,"target_local_id":"block-122","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[603,605],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ebe754fdbc774753335d3ae0dee4828dd68f529cee9d8a7b50a50bc59807eade","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-123","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"545adf4b094633e5425b72013c5f5caba53e74a99266425cc7755ae251dee4d1","target_edition_id":"edition.r017.id-id.draft","target_line_end":615,"target_line_start":607,"target_local_id":"block-123","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[607,615],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e55e6f824064fcdd554662b1d373d7c686d17b67e290a7cede5c43efdff83ff","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-124","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9c2292b51f6845f2b14b16e95c50e96f8a1b275331c4c2ee79d92e53dc77b5fe","target_edition_id":"edition.r017.id-id.draft","target_line_end":617,"target_line_start":617,"target_local_id":"block-124","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[617,617],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19e0d3d2ddcfab184014a995ccfe0781227610919ddf77596d2228628f562a20","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-125","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f5ddc6ff55eef15f755947661f0fe43e1d17b6987e7692e645b4508810790502","target_edition_id":"edition.r017.id-id.draft","target_line_end":620,"target_line_start":619,"target_local_id":"block-125","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[619,620],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5decaf0876beec93ef2dcdef3f8107deb259f8db3747f775b6cba1606b0ffc93","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-126","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ca7026b46ec058a7859718a260818f2138ac0bcaf581f1180307ee26a6fc861a","target_edition_id":"edition.r017.id-id.draft","target_line_end":623,"target_line_start":622,"target_local_id":"block-126","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[622,623],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8348af741898139dbe7b16977101a04cee8f5ed6dcfd390fdcb8186bbe6485f5","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-127","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"37cae5bcdd7da18dd522849664637634b08079fccc381ee97093999b56277e93","target_edition_id":"edition.r017.id-id.draft","target_line_end":625,"target_line_start":625,"target_local_id":"block-127","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[625,625],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"25af3199c418b204f1c3110279b5037569e072803ce07fab5288ea6a914d2d7a","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-128","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"94acd3a48d9c0f3c07e4e7dbcea6abe7aab7c12f2766044f8c9f43a401c4a72c","target_edition_id":"edition.r017.id-id.draft","target_line_end":628,"target_line_start":627,"target_local_id":"block-128","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[627,628],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"928e6626be9639b934e1c32eb0a63e648d1ff6b00caa47f08978a3f6f6507525","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-129","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d68aab5c6acf1d085be3e3ffb253eb10b103b6e742391000164a8073e320286c","target_edition_id":"edition.r017.id-id.draft","target_line_end":631,"target_line_start":630,"target_local_id":"block-129","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[630,631],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"72dba112d8a40cbe2b2fc4d7354161c254973157d0465fb93463c4b43b3cb680","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-130","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c372c4affedd257e0ea4c867ed72caa46043be347296a66fdc1fddc7d6c5c547","target_edition_id":"edition.r017.id-id.draft","target_line_end":635,"target_line_start":633,"target_local_id":"block-130","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[633,635],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7910eeb497a2cd6d2796edea6ab6708691d8465c9509c63cacba1285d2f0a2d","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-131","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4625e3a50e5d8539f7b7702704837e488e2f74cd42c22ba757340a690f46a1aa","target_edition_id":"edition.r017.id-id.draft","target_line_end":637,"target_line_start":637,"target_local_id":"block-131","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[637,637],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6d353c7f3326eae800ca0abe86c935504835ae7647edef28323aca3e0c7def7c","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-132","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"347d0844a38810ffa642f3bf6d57f1877221735e4566dd89e113a1123c4a6608","target_edition_id":"edition.r017.id-id.draft","target_line_end":639,"target_line_start":639,"target_local_id":"block-132","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[639,639],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a9f5b2f0ae251a2ebb545764592273d7ebfe6da5f40b428d56355d7ae22e1e21","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-133","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":641,"target_line_start":641,"target_local_id":"block-133","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[641,641],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ce921a72b220344aa8f3836d89ae7b346bd006a2a5d1409c26cbf211fee7891","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-134","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2b94eec98f9799915c412ebde403138519221aa79a510b9931b78c7941f04f4e","target_edition_id":"edition.r017.id-id.draft","target_line_end":666,"target_line_start":643,"target_local_id":"block-134","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[643,666],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d3c2839ce975a73947748dde8accdeb2b1ae8cbfedfb6e187ba2433c5d31a6d4","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-135","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6bb6877a7b5675eb096b08d0f2657c3632f9d3235049f662e75cf3ea8db294f","target_edition_id":"edition.r017.id-id.draft","target_line_end":668,"target_line_start":668,"target_local_id":"block-135","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[668,668],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"887ba5a2d881cebd9f73105f918708d5c7cb3c601a633337e5ee24a9b0239757","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-136","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a33500e860b84689e140128be0565e19a6227b7149f7bd14620ba173f83b5e10","target_edition_id":"edition.r017.id-id.draft","target_line_end":670,"target_line_start":670,"target_local_id":"block-136","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[670,670],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe3ad33a357d2129baffab40c6ab8fb622db9b2ff0edd1987709d73c1e145012","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"id":"segment.r017.book1.ch11.text-b.block-137","locale":"id-ID","parent_id":"unit.r017.book1.ch11.text-b","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"74d7e11438555167fc2a23dbc0db2ab9d37cb44a0d96b774a142b657fc0e7e1b","target_edition_id":"edition.r017.id-id.draft","target_line_end":673,"target_line_start":672,"target_local_id":"block-137","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch11.text-b","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[672,673],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch08-duality/complimentary-slackness.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fbd4ab227a16af047dc9b6ccc1609b8e9d018f71bd17ca12d87d7e7444d5a349","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"741d6d00bd3d14891784db1bfacd11eb70b256a9b545e2e4d6b7a2b41c0428f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":6,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,6],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5af7b7e68591bf464259787933c4c72e5d2545eb4ce4fb01fbe3d25cdb1daa6","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd4953c8508f3895b50299afdafa5b06a2cec0d338351099c91daddd88cf9303","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":8,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[8,8],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8961f2e43e5cb667b4683902dcbf89e872c6ff72fc02c6f8ea73aa314b63e049","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"facc3304026c50b536657df6e5f4bfc5d373f308d21652ad357ad562aaf470ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":10,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[10,21],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e3ff16353e1bb72d32c0b679c58094f7409f7ea3f1fc3194fe29c7fd6eb430e","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1dd58ec2338096ac0cc338efaeeababecc9c0623dd1091c58f111fc0319de65","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":23,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[23,24],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"32926afc4a4202061bf3484b2adcc2a8163dae1b99d9744aee56508aa4bcc297","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b6e2662dca42aa905dca4e9762ee33013752e605860de8244798d5fd2cb8a699","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":26,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[26,26],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe907c4e93cb617775e458475d21edd178802556009d0301d59e74d42356749b","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e7633a3341665c5ef671e3cd0bdb4cb79c2d9a7432f84e93b399304bb329ddfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":29,"target_line_start":28,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[28,29],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"60eb68c5038c18c455c4d1bc314204ce7a07ac80e57eea04e7080eb4c4a086dc","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ae577f7776503e650ec4d45689720b7f1b96acde8a40a23dfb25efbebc942141","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":31,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[31,33],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b8b7863b30a9142900141b29869fe3a207cf2aef942fa1e9fc3ff966f2d4eae5","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"24c70ee06217c6aa2d6b76862cb16bca03b8f9b66020c2c8e1df6413c7d114cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":38,"target_line_start":35,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[35,38],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a290820f4988857cf9326b39247849224cf1b2bdef49022b4b5baf4d8848d88d","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1674b803e0b7deee0e41a6e7d2d187340d71ddc5b3b3d852ac43e66a7252c926","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":40,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[40,47],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c684b92f8796c97e2baa603b2cfea709edcff423539537888cdd05efd18f777","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bf7a1180d6f22206c2b718b44d76b566aabf3a8a658e3a68a99c86b04040017","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":49,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[49,49],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"53994cdd3d29e664dc34508576fde9a4a5eafca1480e9d155ec4399ab7758ed9","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c142c710bf7fccdff52d5ff8f0a43f686a478f7e16fe750ec993330368cbf3e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":59,"target_line_start":51,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[51,59],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"657c17bc90b733442401a69f054cff589cfa7b8a8defa59400e2b4be8acfa92c","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ec43b3fe7ef4173197e10ed36d7738316b844a4f67872e3d3867fced4636edeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":68,"target_line_start":61,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[61,68],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70a22d238f48aa068e327f759e384e01384fdbd5f16ca8d9779f0ad14d6fe387","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9beb191718e4e86d4c4c61cc104caa2892f85307137c596b620adf0b88684832","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":70,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[70,71],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a0b750fc2f33b0019c8dd4162c9ebf955880f2f457d34b0060101ea29bd319b","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d0144f565a134e7787c046c6ceb356f4b2293dbe7e1de2c6ed0e3af4c3d46c9f","target_edition_id":"edition.r017.id-id.draft","target_line_end":74,"target_line_start":73,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[73,74],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"251c98a93d4c390ef95ab451f0da36a6b6a0cbc6e8c787e91cd8c1ce7baab424","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e7633a3341665c5ef671e3cd0bdb4cb79c2d9a7432f84e93b399304bb329ddfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":76,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[76,77],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"43406beb74d5a075e64c52f412b84213d84de91478cd4f9eb2bab6bf4d5ea9aa","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"58b318f3b7f7069a7601d3388ae0eee2bf09794880eb7964cfe3c9ddbc581bbe","target_edition_id":"edition.r017.id-id.draft","target_line_end":84,"target_line_start":79,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[79,84],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eaf518c2f0c4fd316b251415c4d80d6e2211f9f742e24b366f6889100721de83","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7507779cf128e07825a9475385376a8f78294b102b1475a5d7968ec4eff3781a","target_edition_id":"edition.r017.id-id.draft","target_line_end":90,"target_line_start":86,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[86,90],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ca3786e2d873384a13ebddd7ff3f6cc93b22155c37cddb5cceb78ad6beeb7ae","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1f8231619a6857737953754af91b128fa865989b7f29ff173ca215cacb4e9fa2","target_edition_id":"edition.r017.id-id.draft","target_line_end":97,"target_line_start":92,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[92,97],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c00186edc6ac1ded28cf9e8bbc07a2492f088b414f58c7e2df29f407ca4ff080","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bf7a1180d6f22206c2b718b44d76b566aabf3a8a658e3a68a99c86b04040017","target_edition_id":"edition.r017.id-id.draft","target_line_end":99,"target_line_start":99,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[99,99],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"063abb759731ec485e38b6ed71e8591e40f654c8159af660d8f5623807514ce6","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"04a1f2f4b028ad532001a9dc65fcf1fdef3cc26b97993efb78c39e7348ceae48","target_edition_id":"edition.r017.id-id.draft","target_line_end":106,"target_line_start":101,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[101,106],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec56a82461f15fa01df5f47364f248b39f7a30de1c31df4ee6da2a0e3d342461","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"93d93e331651be43ef7c511947d239d4179794b4751117f893f6f71ae534441d","target_edition_id":"edition.r017.id-id.draft","target_line_end":109,"target_line_start":108,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[108,109],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f8e0018332b3f9d0ae008fc613ce2f586bed00f3e895558372335b9a9741ea6","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"81a51e8cf71988604ff7067e1b3935a32ea0f89ee78d525e6314063074076ca3","target_edition_id":"edition.r017.id-id.draft","target_line_end":116,"target_line_start":111,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[111,116],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b3ccf456ad3ec80bce6b3a4c881d6437c02704955a6d548a6f71b3bbf126305e","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c42230e33162ce689381eed4fbc9e9f9328ba7fce0d0f6c0e83a8f6f60082eca","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":118,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[118,119],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ff9c35b2fcd54fe6a2e464edef4bcee8745bfae1499d760f3b2e2c7b2573833c","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c5c7a14103ecaed093fce7e75e9f94ed590dcfcf62dc4da65721a3ffe2fe50d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":121,"target_line_start":121,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[121,121],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c0547b09532ebcceb2a70b1cc937f8aa249bad8d154fb2e60615fc4a5fb99765","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e7633a3341665c5ef671e3cd0bdb4cb79c2d9a7432f84e93b399304bb329ddfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":124,"target_line_start":123,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[123,124],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"621f34a99107a9dde544490e9a38e906945d494403f21c3e5b506d02c649cbf4","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f136689fa18cc37dfa89a369e5c754475e83a09d38897df1bba35b7369ca2bc1","target_edition_id":"edition.r017.id-id.draft","target_line_end":127,"target_line_start":126,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[126,127],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61f55030ca633222439eda4e6963b2978482613b6b8ba19ba178b923ff95492a","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cc2a601ed6fd555b739477db31382199ce26f7dbb3c061a988dcd9a86ccdf85f","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":129,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[129,131],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"49b7490ca54807b25a8dfc9045859d2da7d4d14d0d35f2a48717e2f86e9a621d","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e8e31bc25952a0ae91baf52e92bfefcf6f25c601ebb3ccaecbe5decde0f00d9","target_edition_id":"edition.r017.id-id.draft","target_line_end":140,"target_line_start":133,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[133,140],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2669114ee014ddd5bce462ecf8aaec46501479de000e358add6e3d48f87871bb","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2f06f01b64a71f9a58271ab64150669d1c9dd52818276ea5ed9f769661180807","target_edition_id":"edition.r017.id-id.draft","target_line_end":155,"target_line_start":142,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[142,155],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a2b3a50e1bab63434389bdcd2781492bd2288c1c31f53843d61eba1599141880","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0679f3465f84bb3be3de028b0b62869423ebc29640ba2c8db4abb08ac7d8292e","target_edition_id":"edition.r017.id-id.draft","target_line_end":164,"target_line_start":157,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[157,164],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d930c5cf9b5b2c8fab656fa6957541f0755b526835b60064967560679745804d","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bf7a1180d6f22206c2b718b44d76b566aabf3a8a658e3a68a99c86b04040017","target_edition_id":"edition.r017.id-id.draft","target_line_end":166,"target_line_start":166,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[166,166],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3bffd289ab0775110709a4099dad278aaec4f37adc40fdfa9871a1dd9eaa4f12","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ef1728095e8220dea5be4611e659f5bc16a61345fc2d8f4d2c62216382fd7b31","target_edition_id":"edition.r017.id-id.draft","target_line_end":174,"target_line_start":168,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[168,174],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6751105ce9130c60679d9f24824ca81220bab5495477ba1bb85262e0eefbda07","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e0858f5993531574e6c1bce0ff45e432ce1cb47076da799958f0a6acf3a4ec09","target_edition_id":"edition.r017.id-id.draft","target_line_end":180,"target_line_start":176,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[176,180],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"610fa602ea4287d2778a9eac282221996bbde755c1579161c314d0be7bae882d","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a0b47c3c5a22cf1ea5b4f65b8846db6c37aee2ce9a4bfefec4f8003f19a30b02","target_edition_id":"edition.r017.id-id.draft","target_line_end":188,"target_line_start":182,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[182,188],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"78e78d8de4fdad1f76b32bf0bab7db8f11c1e89e600e57d1f69724eb057fe7d8","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8c2377eeb95419e4691141170c84c9bd87688a601eec42a90fdc528b80ebc3c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":191,"target_line_start":190,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[190,191],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4fa5fb8c08e840a4a06ad2b4e044faaab35b450aaa4251e1f3d37050d52d9c55","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e7633a3341665c5ef671e3cd0bdb4cb79c2d9a7432f84e93b399304bb329ddfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":194,"target_line_start":193,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[193,194],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5629912e2bb78cfca1cab0a8971314b350ebcfe9a82fc5331ad6326f47e68aaa","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1e12e6e028c1b7773a1fa59a1dac213e4dfefb26a56e2d25d35c07ca29aaa568","target_edition_id":"edition.r017.id-id.draft","target_line_end":205,"target_line_start":196,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[196,205],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd608d28061a06564e16e0ea986ce3e2268761410d4afe378e71fb1cf7a1d170","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"20f210fa82862427dc385f47e7a830624a7da18a2b0f9bd3ed9e6837c027533c","target_edition_id":"edition.r017.id-id.draft","target_line_end":210,"target_line_start":207,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[207,210],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ff2506bf6df73725e16e11b1756e97b80d41e5d47717059f36c6d6416c143e8","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"722b4dee7c4f0464420d21faa0b2e816096afc8f293ba377ffb10e826e9a428e","target_edition_id":"edition.r017.id-id.draft","target_line_end":222,"target_line_start":212,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[212,222],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d8ecd81366af7db292c0f51d0abb0470e3f7b3229367b74a0df82c859ce2b2e6","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c91faa510449fde45a4d541ae6974bb2edb6a831dcc9c36fcb2ddc853085dbd7","target_edition_id":"edition.r017.id-id.draft","target_line_end":236,"target_line_start":224,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[224,236],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"51cf2adce72737053d542fd14a0b45a2befbacba14c8b83a95c6d7b4d705da32","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bf7a1180d6f22206c2b718b44d76b566aabf3a8a658e3a68a99c86b04040017","target_edition_id":"edition.r017.id-id.draft","target_line_end":238,"target_line_start":238,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[238,238],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6daf9d29b40366f183d95dfcf8b0bf32eebf36ddd7e95108c45c7f98c208e28d","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5ee31ff13e821d08ea6f24d173b7b416e3c6a18f3f7becb1b71398c7a85ec4c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":250,"target_line_start":240,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[240,250],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e881b69d0f640d99f5a2330b1a514db813d2f5a0a8580eb98156bc9ba3641fd2","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a9e2b49e468f47a9a41cc27a269bef66a278167491ba1d535252592344d1caee","target_edition_id":"edition.r017.id-id.draft","target_line_end":260,"target_line_start":252,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[252,260],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"faf7f517beba834310010e3785fb4015bfb9799ffabd62ca343c8ef4a0d4f974","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-044","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cd036d32be222ed3e2af91970f6a1df82967a88a40d2e19886c0aa8d0e017cfb","target_edition_id":"edition.r017.id-id.draft","target_line_end":263,"target_line_start":262,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[262,263],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8f2145383185570d5115c578215cd049b7f6ce48fed1a9e15e42c03997ada71a","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-045","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5f0ab3aa91a01b8466a9651b21c76daa3b24d478cc5b61b5037793d4e561a538","target_edition_id":"edition.r017.id-id.draft","target_line_end":265,"target_line_start":265,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[265,265],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"791cb112e54663b6916eb82207c3508430a661c314694084887dc427c27a02f3","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-046","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e7633a3341665c5ef671e3cd0bdb4cb79c2d9a7432f84e93b399304bb329ddfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":268,"target_line_start":267,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[267,268],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"38485244bd49ce84e3bfb9583c4b1f09578c5374e6e4b3c1f3daba217988f5fa","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-047","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"451e90b233bb2d635697972735d6b7be40ec694279fa2b841b85a7269a40ec92","target_edition_id":"edition.r017.id-id.draft","target_line_end":277,"target_line_start":270,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[270,277],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da802e5d76b17cdfe277f19c13dff52fa6fb96bfda9982ee1759806f9c4fa683","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-048","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b754f3a40b49ac13b62c76b81860c5a562b39d2eccfdaa65f23b3744b21b73d","target_edition_id":"edition.r017.id-id.draft","target_line_end":285,"target_line_start":279,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[279,285],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c5c4c6af015d2395a75ccd46ed3217d463a91f8ca28ec0c36599a652feb5e99","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-049","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bf7a1180d6f22206c2b718b44d76b566aabf3a8a658e3a68a99c86b04040017","target_edition_id":"edition.r017.id-id.draft","target_line_end":287,"target_line_start":287,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[287,287],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7e3ade98e87ee60cdb9384ad097e5262b877327162e5699f347a54e1558dc566","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-050","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"67bdcf2aee9ac5c658bfb838a41a693afa12a97852c6d58197310af1d5cbf01a","target_edition_id":"edition.r017.id-id.draft","target_line_end":294,"target_line_start":289,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[289,294],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"56d087c57432dbe9d45b403faaa2f0d025bea19016818e42d698847334faedcc","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-051","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e01244bc24a50abf903b42ecfea6e5ea74ddedbc763c1febd7b1db3ea2b2b43d","target_edition_id":"edition.r017.id-id.draft","target_line_end":311,"target_line_start":296,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[296,311],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6d3044935461a2165ec5223715b2c27a6af42d9264b81dfc62ed4e297cd0c6a","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-052","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e39dc237437039634b5634ab186c227b9700d2843e23e7ac0c30cd139ae45e9a","target_edition_id":"edition.r017.id-id.draft","target_line_end":314,"target_line_start":313,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[313,314],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8af451419edcaa0bd5a50e1cdfe7b0360010fd8893cf025c4c4c2ff4ef159475","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-053","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"924205d0f80215d2470e8a3837b4609545654a3e200e461de0419392cf9a8f26","target_edition_id":"edition.r017.id-id.draft","target_line_end":318,"target_line_start":316,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[316,318],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9ab2377379d522921e471a3f3626abf169f0503df9bb7cb8b0f733ef8d2ece0","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-054","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e7633a3341665c5ef671e3cd0bdb4cb79c2d9a7432f84e93b399304bb329ddfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":321,"target_line_start":320,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[320,321],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"43e96da10f93435c13a3ab7214761d82c84ad886c1e6508745f2101c4cd7b95f","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-055","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"50d2dbdb415f6aff0dd6d7bfae7dddd5c3f42bcf4d63c9709d0b9bcb282c275d","target_edition_id":"edition.r017.id-id.draft","target_line_end":336,"target_line_start":323,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[323,336],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10bb9e9f82f74b9ec54c973695754f7b509244a9e337b5cb1842a2baee7cc02a","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-056","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bf7a1180d6f22206c2b718b44d76b566aabf3a8a658e3a68a99c86b04040017","target_edition_id":"edition.r017.id-id.draft","target_line_end":338,"target_line_start":338,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[338,338],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f1ab767f8014dcf6b6fe2ee507d0315744187b2ccc3eec1d1e83998e148c97fb","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-057","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8e3915eeaf911faeea6cd04fc57ac71020658ba37c7672beee1fefb6a9bf3772","target_edition_id":"edition.r017.id-id.draft","target_line_end":347,"target_line_start":340,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[340,347],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d713d1d79b64c310328e0527ffc9c0f55e6210d31f98cabc4943b2cf2f0a0fb0","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-058","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c8e3790fdc4eebd6036df0b6767cfb03d9be912bffd5614ec70a1db2a086399d","target_edition_id":"edition.r017.id-id.draft","target_line_end":361,"target_line_start":349,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[349,361],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8063c45611b6b8de7fff3b6a28ad1e2d5a7a0cf74cdddd3cdb5e8e3057ee6bb5","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-059","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"54df14d9f8debc9f9a59b9a8b1a058a08eeb900c2fb12f9f12cbf32ba6fcfdd4","target_edition_id":"edition.r017.id-id.draft","target_line_end":364,"target_line_start":363,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[363,364],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bd65b42d001a1c5a33cc0ad0e1f6372944537a9503415fd316cc5f385c2526c1","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-060","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8d080e947ab3d56e4f9990fdea59d037ee59bf169e5bdeee2c53176edf94048f","target_edition_id":"edition.r017.id-id.draft","target_line_end":371,"target_line_start":366,"target_local_id":"block-060","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[366,371],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7ea42a82ab4ee86b0a054c5a761694e0e037e1ba6266c07ec8534dd9c627bfc7","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-061","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e7633a3341665c5ef671e3cd0bdb4cb79c2d9a7432f84e93b399304bb329ddfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":374,"target_line_start":373,"target_local_id":"block-061","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[373,374],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc75e3890a1861373deb94c75405d442cde00ecc1e9524a80684fd64d582e646","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-062","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b0d59d4fd8d66dc312f7ca942324eacb6801592ab77d7c54d5854ec72b283e3","target_edition_id":"edition.r017.id-id.draft","target_line_end":389,"target_line_start":376,"target_local_id":"block-062","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[376,389],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ffcd9c98c3dba597d69d744f7c30328355bc3a6aba55d11f4b75d312a409d970","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-063","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8bfaf285aba7e8910e37daa2ae2538c1e4b3b0ac8e438dcc20d68da8c84d34cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":395,"target_line_start":391,"target_local_id":"block-063","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[391,395],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"17a7a1ed33522ef57e64945d607683c093c5d8ecf2e7a143aa0d3fb0a7b1c934","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-064","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2781818a587d3d3fc12917903c4c52054905446e4ea51dc2d9f38e190bc9939a","target_edition_id":"edition.r017.id-id.draft","target_line_end":403,"target_line_start":397,"target_local_id":"block-064","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[397,403],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"def82ffe86ad67e81644d044bf410976441008cf02febec2825b39ccb200b797","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-065","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3403e7d0e7cf765ff27b1ac9ef5f39629a27b11bfd3ca04db4ac5df24cb3ebe7","target_edition_id":"edition.r017.id-id.draft","target_line_end":420,"target_line_start":405,"target_local_id":"block-065","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[405,420],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e07379e94eeb0ece719bb40a8070bb85a9872722b1dd54b0c44b42e424882a6f","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-066","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b72a0954f7059a87d125146c10992fb357d49a2654de82b2fa148a998c8f8842","target_edition_id":"edition.r017.id-id.draft","target_line_end":430,"target_line_start":422,"target_local_id":"block-066","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[422,430],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1fb9743da2a1c506ba437bd9e12ff9fa987fea2d882beed0e76677649b7d4752","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-067","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b0187d26eb5abb5aa4a0152f63df8640adfd30b615ee15923232b37c84c5f28","target_edition_id":"edition.r017.id-id.draft","target_line_end":433,"target_line_start":432,"target_local_id":"block-067","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[432,433],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c399bb03f59def5889b0fa082cb49ad66abb29d388c642d18c70d25a66cb90b","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-068","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7f69896bfbb060d9c3bb009c40ef90a225bfeb13a51e6b34b2f5df86888b4cd1","target_edition_id":"edition.r017.id-id.draft","target_line_end":438,"target_line_start":435,"target_local_id":"block-068","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[435,438],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0237dfc867a72aabad7d41751773fc22852bad0e27aed6bd7b42b53e8f1a3db4","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-069","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1aff739b6f2482bbbab31b87eb967eef312d1e2d23e6f10e3d434b431a5062d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":455,"target_line_start":440,"target_local_id":"block-069","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[440,455],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7402271cf5c3e2da22c6466fba8eea3c8de7ac1a379f602eb3d1c1d3ccb4a0a5","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-070","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f695af85a9cb918423e2fa82a6d0d8e376b4bb65dbe5deec71d9e265c7634985","target_edition_id":"edition.r017.id-id.draft","target_line_end":461,"target_line_start":457,"target_local_id":"block-070","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[457,461],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ff3a5e8492901972ab37a1f698668c4be2f87585f1562d60e380a4b1993b5fd","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-071","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"08f43d649d8ffd4afa11eafa9f5e0adef5d8e586171ade4e93c5c2fe55eb76d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":474,"target_line_start":463,"target_local_id":"block-071","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[463,474],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb831be31d17067e98e6a0e046bd7722890431ed2ae441ae28fdac3a44ab760a","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-072","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4d8710777a79672aa364198ae7b51b86b8a81a85000ff499f3561d0918d87f34","target_edition_id":"edition.r017.id-id.draft","target_line_end":487,"target_line_start":476,"target_local_id":"block-072","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[476,487],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"226f677267f16cb12fa29325a4b4a3037587953dcc682effa046b9b11a42c6d0","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-073","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6037919017e6676324a08eed0931a31d1d2c357045b0e97ffb8246587f872207","target_edition_id":"edition.r017.id-id.draft","target_line_end":490,"target_line_start":489,"target_local_id":"block-073","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[489,490],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ea0887a7fa8373f3f44e72baaffa4783b524bdaad0c9c35ef7fa656588f2961f","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-074","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"086657f1f1ce546cf60370aa6cae5cc82576cf1895a46860503326736baff9c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":493,"target_line_start":492,"target_local_id":"block-074","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[492,493],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fbea799514e0619511605107133bd0ebf9800763fefeeb6d728d4d293eef0d2a","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-075","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e7633a3341665c5ef671e3cd0bdb4cb79c2d9a7432f84e93b399304bb329ddfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":496,"target_line_start":495,"target_local_id":"block-075","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[495,496],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0741884031926cb9deaf63865ca740c816b050dda95acd543b04cf621e657ca1","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-076","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"415a32bd91a1189e00098ef58013b293636c58285c6527c4fa6b760f78eb376d","target_edition_id":"edition.r017.id-id.draft","target_line_end":509,"target_line_start":498,"target_local_id":"block-076","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[498,509],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c1242003e120b7c79589e8afe312ae9f348d58cbac925224c70da60229578d3","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-077","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"33f982939c43184dcc50789026222e3c6d8bbe70cc26186d271483964559eab9","target_edition_id":"edition.r017.id-id.draft","target_line_end":515,"target_line_start":511,"target_local_id":"block-077","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[511,515],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4f4d0a1649e2399333a1e11492d63ea69ccfd933d7d4ce89a70f6047eb538ca","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-078","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bf7a1180d6f22206c2b718b44d76b566aabf3a8a658e3a68a99c86b04040017","target_edition_id":"edition.r017.id-id.draft","target_line_end":517,"target_line_start":517,"target_local_id":"block-078","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[517,517],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b5774dd3c4dcf7768a7c42071d3198373110f280dbe80dc6fa966cd73bd48e1b","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-079","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0929f6d07e6a129d9a6386bfcb5384397b0e08745717de393ff9d85243b55bf9","target_edition_id":"edition.r017.id-id.draft","target_line_end":530,"target_line_start":519,"target_local_id":"block-079","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[519,530],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"985dc9b648a39e873a25ee98e1c4a832704c7f83b15bcc650bc2b90ae47353b9","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.solutions-manual.block-080","locale":"id-ID","parent_id":"unit.r017.book1.ch12.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"26bfd802474b1eaec3894f874376366b759c864d94d6c1f481fc7194227e31b0","target_edition_id":"edition.r017.id-id.draft","target_line_end":556,"target_line_start":532,"target_local_id":"block-080","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[532,556],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch12.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e471783b063e7596a0d0638d09ce5ee5ba048012d13d642958b99a0255c0c4ff","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e1cb62bdd68803b1975d606889618b4cee4d8a7f0f507c61227bb720a4dfc781","target_edition_id":"edition.r017.id-id.draft","target_line_end":2,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,2],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9fe5d99a136bb72df9086dcbbfd544c4605edfa9014dee1025507e56f4399fd","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a83e9c451fee610a1076ac1b51c8969bb76dfde53a63043873a6556e0feb3e56","target_edition_id":"edition.r017.id-id.draft","target_line_end":11,"target_line_start":4,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[4,11],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f4a165bd760c96768b16436135f68e26bf3136024fa61d77819d1cf1395f5eb","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"faf7b2b755b4ef150604082d12316d2a3a93419af4b48a03209bcf0d44547f47","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":13,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[13,15],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c7c5ef42e53036f0d7b052a82404b264a90a4caadd2175fb2e16d6cea07df9b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bfae7deba586a5ffe5e62ffafec1863b0a448b9599522110cede0d3a6f873218","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":17,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[17,17],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a1227cdc6d1b5faf7db71b6bb2b22aacfbb1ec438a2d86394503b33f40c40030","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"39ec01fb79bbbdce0977159db87ee4025c9c41d9c176e96b40800c71fa197175","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":19,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[19,19],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5ac1f6f35eabbb26619cfe6f85463c6a65cba427c83ecaf300477a8d4d67e37a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"60edb2afb3dfa6e45c57dc7beee47c6f614263eb94d70512ac0716e8dab8d01e","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":21,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[21,21],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0446dd712e5af10f8867baddc9fdb099a984d999ed1f6828d7034730ae47253","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a354fffb133f615d4038449a500ea0228a1c58d67b7bed1e98f2222e42482f11","target_edition_id":"edition.r017.id-id.draft","target_line_end":29,"target_line_start":23,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[23,29],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"768da6765c253a56e25a184e00fd1f2723f0fb41946dbdeeacb52f483f1e4a81","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9c1f0d493b7d43322a315d1d2f04757a667f82cae0fdcd8ae77cdf33828a5128","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":31,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[31,31],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4642bf4d3fd2f633b6349cd9227c3c1ae24415c13f489b820a5ddac0512d42e0","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"857b813ab1f44655212bced3d8c37c0f154914a5f877c2330002c635f0363db5","target_edition_id":"edition.r017.id-id.draft","target_line_end":42,"target_line_start":33,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[33,42],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c0add5b650cf6240c6dde7fe4c8039938a9a3495555554d554dbe70300688e7","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"39650c3ff94a6e0fabbb1d49c7b83e8e0413c72914317c5292bfc1c790d04364","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":44,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[44,47],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e1deb556db37f66556e4398bf176d2a1bf0a133a59c37a7225fb6a48940f54d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b3c22cbdab61f7eee7ff704c04d1bc9ceb696f43d894a7e71438971ecc2b14a3","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":49,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[49,49],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"58d9fe8817537a1bec2bc58ab2c2fa5fce3274d07051a60833590610bb0fa4a4","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aa561c423a1ff3b659e07167340e9f70562792db8efdc4e09fc2b6989894c99b","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":51,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[51,51],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0bdd7920c9d07ac52fbaf9d90f110dab48453109e9e970bbe54f3ae152d42564","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1e20011348367150879e46133da1765e21285b3189f23443c7aa3ba2285053ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":53,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[53,53],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88f5cb16b13b810cf7bc0d74038453c7a05223ee1b303ef7d869acdf10bed64d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f70d78853d2589dabe86ae261ecc60b8b6f8d914c1e970ec33273ab4215b2335","target_edition_id":"edition.r017.id-id.draft","target_line_end":60,"target_line_start":55,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[55,60],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bc57170f11c3313940d1a77fcee1b2bfbf047bee2746152f9c19d7c16ae55fc9","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2a7e388f7de1352b802df0125f0dc61ec29396da5ec749e3f02a2f08b86c0aaa","target_edition_id":"edition.r017.id-id.draft","target_line_end":68,"target_line_start":62,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[62,68],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b8b5855c4b59aaa48ef16334d68a0fc4d3726425752b76ecca2264d308ad7fc8","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2d5a7a5651b93a3c5da1d405d051595034bc3cbf949eb57c4437b306ba89f642","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":70,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[70,71],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"207ffe302af1f564b25aab230c9ab583ee14f44abccd32ff92a8fde996bb4cbc","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5aca3b80d18c678afd35c0fd240cf5bc3bee0b64579255fca61131947cfe6bab","target_edition_id":"edition.r017.id-id.draft","target_line_end":78,"target_line_start":73,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[73,78],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e361bdcdafc88535c03bc321df674eb376ae862b6c7cd2fc64655446d27890d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3fdcf31a8fd21311b99155b111c6c553d24826a5cf48c8d5285606cfee1c07ea","target_edition_id":"edition.r017.id-id.draft","target_line_end":81,"target_line_start":80,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[80,81],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e8c7c6bcadbecd1cd032a2eec7373b677d047ac2ac900f27cca15f60200d84c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"829b45064c7dbce1d8bb9967640a58e90a1926d9bc3eb940de6919e959e15d3d","target_edition_id":"edition.r017.id-id.draft","target_line_end":85,"target_line_start":83,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[83,85],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52100a9401c2e48a83ee598c752b1e082dd434f2c2fec27c8dc49bc675d7c6a5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"19fbbcea55e3920384f2acf59f4425dd36b2e33fd49785302c3bd81a697d787b","target_edition_id":"edition.r017.id-id.draft","target_line_end":87,"target_line_start":87,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[87,87],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ff2d16fae7061d2956f9ff5ae7dbf7e76636b3ee0b0144bcfebb3d6e50ef3f0f","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a69492098ab3c75421905ef418f731700345339a3cf34c6c0be8b895b386764d","target_edition_id":"edition.r017.id-id.draft","target_line_end":89,"target_line_start":89,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[89,89],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"efcc049a188bfbf2c1f65a170f8f9c5b7e3a239d6013f8c26a488dddd5f7d3ca","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6173ba4c1d420cdcbcdf619faf350f6369ded27a47b0f12a58d2ece141bebc73","target_edition_id":"edition.r017.id-id.draft","target_line_end":91,"target_line_start":91,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[91,91],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"488bb2626e80607dfdbd2dfb96ef03bbf3f2c3ed37723445ec7dcbc9e39c63b8","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2a9a5dc90415ef75e7031d5040c8a34f1eb1ea67ac9c9c5c8f93332a56417f23","target_edition_id":"edition.r017.id-id.draft","target_line_end":99,"target_line_start":93,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[93,99],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7e881ff790e541d98fce71250a811eedef5fb5ea09136e9b6467e0e860225db4","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"35657527b461d1edf0a7e080d6670f09eb620da7867191e06f1c8010bcfa8141","target_edition_id":"edition.r017.id-id.draft","target_line_end":107,"target_line_start":101,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[101,107],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"08b94e6f85b3cc3a4e88942a4f81d07ca6a5b7152f962a87f3f519ec9a4ad61c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e3887a1c1724b83cbed47acebf7f1a6a1e344b48e7800290d6a3eb7ab11c89f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":109,"target_line_start":109,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[109,109],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb93e392c7c6c84359000763cac6323010be0b5c89d1d5114abe6f44f22c3146","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d7a179d2d5015f4723759eb9580571661878d4e8edcb1b9ce040d5e65ee154bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":117,"target_line_start":111,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[111,117],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"40675d4e8e5de2987aea684dc90fe1aae758721d6d35488d9cfd4f26242d1754","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"677d5260780186f7f58dbc614ec1eaabda35a4a8c33da9f6b33b21b0cbb69415","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":119,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[119,119],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d8cc984a0e2e1000960c5a54c4d76151257806df2d678b87059e66339ae79e1","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7b9e5df2e0a5e44d3af88198cb971952cfbc678d660e6ba8988eb9d386768a90","target_edition_id":"edition.r017.id-id.draft","target_line_end":121,"target_line_start":121,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[121,121],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1402e28eaedfccbc5b97afe840805c5c3854bb8a8a403cb3b64a9629d068532a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6f668ad753892b96b8e93699b96b0f5db73e27d5fa798791783b1b6fb701d8d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":123,"target_line_start":123,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[123,123],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"daa6faefb12d2765265f0b646bdb2dcbb7d6065c76fa54a3cdb2f166f31bcf3b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e34905bb63be5f12823a7396c0bb7b62f709ee6367b78361b300cae59e47d923","target_edition_id":"edition.r017.id-id.draft","target_line_end":125,"target_line_start":125,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[125,125],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a400b4fafca3cfbe7ee0ed960f6793b431259d48609fec61ed45c925d275cc5a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2fde61de108cf9c30ee8c8820461cd9d63072f08800130ae46c51d2273741eb0","target_edition_id":"edition.r017.id-id.draft","target_line_end":127,"target_line_start":127,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[127,127],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b08e42052ea09eec59e56a0b588e84de4b634bc66b65f8c9fcc51b09c993aab1","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4900f06d5e8f93327adac638dcb280fe404de2b9c2888c88b05a332b29f8a696","target_edition_id":"edition.r017.id-id.draft","target_line_end":132,"target_line_start":129,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[129,132],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d5e20c2729ba0b1ed9040f6b0f68a485ea48e8a55e388d0d46d72b6b4f9707da","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"279e20c29cf900c69b5a8b0860b5b18d6ac629a75ca0ce31843c755e96b8ae38","target_edition_id":"edition.r017.id-id.draft","target_line_end":134,"target_line_start":134,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[134,134],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b52730a7909df4b623f7cdd8a730117c8b7b8b05ffc0b88e33fc72d9794d6d8a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"279b112e5aab0938a9abad216c5bb504bc9a444ce977acce2d12617fa220652e","target_edition_id":"edition.r017.id-id.draft","target_line_end":136,"target_line_start":136,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[136,136],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a77251696b1b89c03b99495aa4039920d83b0950c0fde1f728b41e236c4b553c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f4806ea2f6ba464b6a44fe3ba0b4654d32e1674f0d169b2f75b01294c3c7f1cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":144,"target_line_start":138,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[138,144],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"447939156ea4b214a82dd44eaa95ea9edd96de5cf618cc1b7f06b87a4292402f","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9cc0bc732e77d97b38039ab30e42da0b758b7c0d2bf35fd7baa54072651f05f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":152,"target_line_start":146,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[146,152],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0aa53ad8fc0f6c1bcf50486b66d0e23c94d8c411b2e984ef43ceeeef416553d7","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"235edd73c6600298234b76e746efeef6658299ffd4ee6011b14d01ed360e4a47","target_edition_id":"edition.r017.id-id.draft","target_line_end":159,"target_line_start":154,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[154,159],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9c9a105f52df4033b0de3ffeddbbbcc56306f61cb393180452f922feaf2a501a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5e7e75fa0173a2639d576a5cb8f1ca4b75be7eac94d2c35fa7d4f549b928e9d9","target_edition_id":"edition.r017.id-id.draft","target_line_end":163,"target_line_start":161,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[161,163],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb24990c15a1d837180e5de5ba1c257ea5b9d354d38fea657701220bb5cb59c6","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d14e1ac66cab667aedcdf09a00b6a094e6265896ebf486bac2a439c363189bb1","target_edition_id":"edition.r017.id-id.draft","target_line_end":168,"target_line_start":166,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[166,168],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"58bcd86a5e370f3c4e4906599f5791dbb0b30219c48bb0952bd3d1bcbc50712c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aa2d2e298c378fa9c6e5af2865e63c7236ad44ff0e2c0e71bbcca1cb182334b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":170,"target_line_start":170,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[170,170],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e96e2117ef2d1f301124454135313e455d1ab1a7ecb0e7c536da28cd8fff744","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1c75d569499180733ef9b017a7b856011d9be45f86bb9330d338037edb93609","target_edition_id":"edition.r017.id-id.draft","target_line_end":174,"target_line_start":172,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[172,174],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4bd4176096e78fc894be3ebd3df2ab3a3cc375f1f6cbb24b38d8c97125ffdebc","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"18cf84689ec0a37462961eb08939683e5232fe9a1c7d16cf670cab6dd69446b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":176,"target_line_start":176,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[176,176],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"991e58d77534d109d47de901f4fbbb85d4ff20610d09805e7406a342e99d6a85","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8f0534f0c60b5a40107afcec1b2fb8d82fa9da55c0e0201fc88135d4c031510","target_edition_id":"edition.r017.id-id.draft","target_line_end":178,"target_line_start":178,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[178,178],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64b396357cb933180bb99d60ee70f9ab71079b8251c018ada2dead786d984acd","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-044","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6fa49690ef244524a916b1e78639b5a83462a088bd9740300c0d1162f540b958","target_edition_id":"edition.r017.id-id.draft","target_line_end":185,"target_line_start":180,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[180,185],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8ee881762d068654ad5d8e0fb1cb649a01220326c3b4f4acd133dcbf01954fad","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-045","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"527c68be8c1e1ee3f6a9b901acd78e601cacdb386600c658ad88d3af6596c904","target_edition_id":"edition.r017.id-id.draft","target_line_end":192,"target_line_start":187,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[187,192],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1693ba64ed8e298cceabf22bbcf4b840cbf43407b4bcca962375cd578eaee55e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-046","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"de0fac3fb9dda9ad9e708e395f98481b13482dc9adee21e00a5a5c5b20aa6fa1","target_edition_id":"edition.r017.id-id.draft","target_line_end":196,"target_line_start":194,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[194,196],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2d88478f669da0c4ae9db9abcfc5648987cd3b892d8930daa42d89f6e5a7205","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-047","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4438d71c2d5e9bca1161aa0e1af3139444d21b6f4e268ed244c0d4c3d4eba798","target_edition_id":"edition.r017.id-id.draft","target_line_end":198,"target_line_start":198,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[198,198],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10916c50b8859debeb3f8b9c2b883f2b264ef24964679389bbf8e8ed847cec49","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-048","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b1e751786ef53c02c63972f8e30075754f1b232940a850199a4c8184d80c7e43","target_edition_id":"edition.r017.id-id.draft","target_line_end":200,"target_line_start":200,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[200,200],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"668c9d94d6c560d9d1c90529c8a0e86ae12c8015efcc1cfa5d7595b49c85feab","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-049","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"880510fe62acf707ab58dcbaca897d9c0f27f11bfdd269e0cc73e2e1f7f531fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":204,"target_line_start":202,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[202,204],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4835c35afe4fab5347c65f75eacea7ecee4c0e439b21d0f170057ee3b2899edd","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-050","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"518b43e3b61820dc090d14f84a75ce0b396e9e0a9f93c0d77d1af3d40e6b6b48","target_edition_id":"edition.r017.id-id.draft","target_line_end":213,"target_line_start":206,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[206,213],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d208cfd64a323dd211d1b97ccb36308d43263d03144cd6fffbd117f193be865","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-051","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b2250026446d55e4fcd09a99ea1b0f14fd0e785a6b7f0c879da6dc353f473366","target_edition_id":"edition.r017.id-id.draft","target_line_end":217,"target_line_start":215,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[215,217],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"307e570bf10db45ff26a8db187557a4920365976dad6363bee29d4e86067b8f2","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-052","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"48585a06418d77537fe6d49623ca15f6a804900d80dfb2c42b07421b51527fc8","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":219,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[219,219],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9821c8c49d69f01ec204b43a83907c55ab21f810f6b2e40ef4f4922775e0cfb6","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-053","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8cd78547b7b38610342cb7209851c9af1ab515b4cb0f6890e979f755c3ecf1b0","target_edition_id":"edition.r017.id-id.draft","target_line_end":221,"target_line_start":221,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,221],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"740e5b93f8dbcee6f26d65a7825fa15a343aae8ddf02231a9459795f3cda6857","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-054","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31e07bc63058b784caa145b598c96ae47f9ac6d9fd96a1d9269be318ed057405","target_edition_id":"edition.r017.id-id.draft","target_line_end":225,"target_line_start":223,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[223,225],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"01e01e65e5e970f03a247286256e8d258e180878b63f2c8ed076f4758e023788","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-055","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"70e2cf8a30d9dfdad3015ec61aeaa25fce32d6195c3595fdc3e62cc550fbae72","target_edition_id":"edition.r017.id-id.draft","target_line_end":228,"target_line_start":227,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[227,228],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"051762254eeb9274da2894923050da8f8ed8bbfceec5b26d92725b9b4e9957b4","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-056","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"00e4df994cce008a408e16d38aaaf61ff9d39eded870dcd575edf60c875fd568","target_edition_id":"edition.r017.id-id.draft","target_line_end":231,"target_line_start":230,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[230,231],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a608d3413dc5a98d14bddcc5ba8397e8d4e6dd02d7543dd0a7ec5951d5f1567","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-057","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1020cf9410033750605458743db8ad8d71afa362476d4796651feb2888a1852b","target_edition_id":"edition.r017.id-id.draft","target_line_end":234,"target_line_start":233,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[233,234],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"41099b5d8a8186263836119ca2ea317e4dab7e458cd853eb8978e72c906de482","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-058","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"42d4334166772a7427a000e777b66b262c6052d421b7fa4f17466f26cfa8e979","target_edition_id":"edition.r017.id-id.draft","target_line_end":240,"target_line_start":236,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[236,240],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f28ebff35738394310c59215a351432b78c3740e5690dd3e29848412096753fa","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-059","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"805feb1be23a70b210eebc8cf6fcdbf443a301050bccb5e3d3b93ee8f2fbb0e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":242,"target_line_start":242,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[242,242],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"448c58c0ce1e0c75dab1bbf505fce2a009ddd9b28707d39f3d82c358afbf98b7","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-060","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c6e06d2b49ae1a0782ad5e9fd8dde31c60b07edfc5102e2386728a17e5fb1739","target_edition_id":"edition.r017.id-id.draft","target_line_end":248,"target_line_start":244,"target_local_id":"block-060","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[244,248],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a1c4bcf77b03976b18cac52ba4e435b0ef68c27f3ed08d822de117459b2b2d7d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-061","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0876d9eeeaa0534d1582bc1adb5ff781150b8cc00d2ad3cd9bdb807538c2df47","target_edition_id":"edition.r017.id-id.draft","target_line_end":254,"target_line_start":250,"target_local_id":"block-061","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[250,254],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"798104a8ab13573b63a0dd20ba65f4c5e11bd8767c4e84cfc67b5920089c4b9b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-062","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4f986d84b67a5e956cda8557bcb98194f20ae98ce9076fcafcca041b8354d47d","target_edition_id":"edition.r017.id-id.draft","target_line_end":256,"target_line_start":256,"target_local_id":"block-062","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[256,256],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2849078a16c8b62f11a5621260320d66cd0f58f09d243edd39ec6f8ee3729d1d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-063","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8c4ee33581b893937ad7199bc246e91c3abcea137e688a124a0dd6308a0fc33a","target_edition_id":"edition.r017.id-id.draft","target_line_end":258,"target_line_start":258,"target_local_id":"block-063","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[258,258],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6244084bd541873d4acfe171d68fc12b6a50d8de3244773f3916c6422678160f","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-064","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"badf6482115c606eeb9e69bf082a216e9c636195574284d9c61b0441d48ada5c","target_edition_id":"edition.r017.id-id.draft","target_line_end":261,"target_line_start":260,"target_local_id":"block-064","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[260,261],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c3736aa73d4104769533ec7e77b0a38c8268a73cfba7c2c928318cc1302dff18","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-065","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7f38055d2b5c089e443aa3c39b6835d99fcfc2132d6975b7faa661f1c8b1c655","target_edition_id":"edition.r017.id-id.draft","target_line_end":266,"target_line_start":263,"target_local_id":"block-065","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[263,266],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ea3f4d282362737efde147607cbb40703153efee827a10dfe7d2f59eecc0e23","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-066","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"09d7fd7b8b41ec740390973a1058d8108162ce00b4933a19a4651d30e5900daf","target_edition_id":"edition.r017.id-id.draft","target_line_end":271,"target_line_start":268,"target_local_id":"block-066","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[268,271],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c40c8aafe6675ee60c71799c1592b0620f3b697014c58db3279ceca2b0bb3dd","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-067","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"46e177eccf410173e479c15ff50f8da28f8b73d94a704697061d14296b426615","target_edition_id":"edition.r017.id-id.draft","target_line_end":275,"target_line_start":273,"target_local_id":"block-067","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[273,275],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"089b284e5c3f0ad905d7b84fc7c51023894ddbb6a8deb5b871f9f95b3fe9097f","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-068","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c725a283f91cde276a700f956b5375038b9638f363335077e163f9940f025c04","target_edition_id":"edition.r017.id-id.draft","target_line_end":279,"target_line_start":277,"target_local_id":"block-068","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[277,279],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9742d97165a66159bdba8be7bbbf79d0c90f440d335a14489a47366581b4db2f","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-069","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b7dabe6bdec502b7b5b6ab30664abfef377534a44f13dc61044fdf5043814dc3","target_edition_id":"edition.r017.id-id.draft","target_line_end":281,"target_line_start":281,"target_local_id":"block-069","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[281,281],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f164b1851c80035b74a24bbc21ea6aae21e48de7098f92677901448d852aae92","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-070","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"adecf5078375ad9c778f0f17a89a838e74e3d162e0e97b142b5cb95ee45216a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":283,"target_line_start":283,"target_local_id":"block-070","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[283,283],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5adece82bf6f9b52fee67992dc701d862d796643ca3fddcc5482f1b77aad44e9","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-071","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"909668d3aa53d9ed1212e28a355abb28f90926ff871e1b536f66a3bc832b662e","target_edition_id":"edition.r017.id-id.draft","target_line_end":286,"target_line_start":285,"target_local_id":"block-071","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[285,286],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"318f894686be2ae0e1d8ee71244fc2c640bec1ca708d019cc6fa966fd1c9d19a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-072","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0cbeb28f5d072c9f10945b5d59e2cccb24aa832b85b24cbe15f97906dc90a967","target_edition_id":"edition.r017.id-id.draft","target_line_end":292,"target_line_start":288,"target_local_id":"block-072","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[288,292],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c661420ee379fdbf08abfa332b02fdc37d2e1911f2fd8d8a3d97c510e9a0810c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-073","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3292b78e173ec76aefe5c742161a3cbbc8822108ea1184b104b2a82ee606d160","target_edition_id":"edition.r017.id-id.draft","target_line_end":305,"target_line_start":294,"target_local_id":"block-073","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[294,305],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5627861d39c722e683000c3c71f008fcee0d70e794613950da467f58c3adbf96","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-074","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8e190efdc5b74418e74e88090a80c88d01d529bddb991a9f5be491af302c92ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":309,"target_line_start":307,"target_local_id":"block-074","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[307,309],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"750f20b2f85d9ca1fe525480d605ac623f55fdc8a80cdbf638aa242deeb7f9c0","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-075","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3a16cb8bdbef749f3110a9d584d35cdd82292ff37109e8c08b0d004adeb68276","target_edition_id":"edition.r017.id-id.draft","target_line_end":311,"target_line_start":311,"target_local_id":"block-075","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[311,311],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"883e884b689799ac4e9ff51e82e42fcef7f133d13fe285322fefbe36fedf0a52","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-076","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"024718dd92b980badc9ce51413a604d1140050c8e6c509ce27cc9a9f6c1eeab5","target_edition_id":"edition.r017.id-id.draft","target_line_end":313,"target_line_start":313,"target_local_id":"block-076","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[313,313],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b30bb165ddd30df8be7cc329f0e025eb08b99f92859891802ab5ce0c34193a6b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-077","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4de25555076a151ca35e84d0fc10ae431bc814deb88ad56413ef71cffc35c4da","target_edition_id":"edition.r017.id-id.draft","target_line_end":315,"target_line_start":315,"target_local_id":"block-077","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[315,315],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d3d1e30250cf6f52cfa112004c1be989afa14a44e61bf951099e660a0ca15641","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-078","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fbb6983a984c06021cc9a42e38c9b2b3f688d74ea6679e2eebf6b3f2d1ed2df0","target_edition_id":"edition.r017.id-id.draft","target_line_end":321,"target_line_start":317,"target_local_id":"block-078","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[317,321],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc4aabd808ae23abc1e978d21799cd104d558e603f50e378516f7a6a67587f79","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-079","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9f692d7e24628c3eebbec14ede79e94a052da63a6fa2b3b77d0896581111ed28","target_edition_id":"edition.r017.id-id.draft","target_line_end":325,"target_line_start":323,"target_local_id":"block-079","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[323,325],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6bb65a3a3a044dbc769eb0e17a58437b8d978e227e9bddb53f05df2b0b0199f6","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-080","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"50d83e6341b7d0070dbce375123daf8b9183622c2c3b41ae8d78e5734bbc1f42","target_edition_id":"edition.r017.id-id.draft","target_line_end":331,"target_line_start":327,"target_local_id":"block-080","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[327,331],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"629b1a63b8e0979b00287747c3eec778ff8be4675985f32580a27b28f4602b27","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-081","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"db31e27ec6e3a0c7ca5a980d76ad946ffdfd72750132d711a3131ac0f2288d2b","target_edition_id":"edition.r017.id-id.draft","target_line_end":333,"target_line_start":333,"target_local_id":"block-081","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[333,333],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"faedbce76e962ca3b717005bb0f660d08f89207b64035f3919276ea528a7a8b0","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-082","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31616b736ddcf2d1172166f57fd84c33f79303bcb03263d40b5a7fd73a97b58f","target_edition_id":"edition.r017.id-id.draft","target_line_end":335,"target_line_start":335,"target_local_id":"block-082","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[335,335],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e84b47971a570756fdb31730467c5d107e6bd3d2e6b85a63d76c4b088d9ce7b5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-083","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2da724fe493bc289b990f21a0653c6895e65598cf37fd60b184f4813756be38e","target_edition_id":"edition.r017.id-id.draft","target_line_end":343,"target_line_start":337,"target_local_id":"block-083","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[337,343],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e74c4607e285b40eee85cc0cc8f035f5c1711fee4b6ab7e830661800e34ab860","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-084","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a62ab382a2b2d83f0804adddadc87c5dfc6c7269d8872677d11dd11aad6c451d","target_edition_id":"edition.r017.id-id.draft","target_line_end":345,"target_line_start":345,"target_local_id":"block-084","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[345,345],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3831d1eab7ff0714337185c68ac46ca2889ad003949da44d92dc57856fd6d2ec","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-085","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"beb59c01d955fec224b691c6b7cc0c1c2c19b8cc5e929ec94889b4e45e7c769b","target_edition_id":"edition.r017.id-id.draft","target_line_end":347,"target_line_start":347,"target_local_id":"block-085","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[347,347],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fea6303df68f47cdeb0b9165ab59faef627f5bed1d069b38ce3394f6c85bce5e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-086","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b3f53578aaa9860aa47f8255fdef3bb75e78ace7b24ff4cdc8c83ec0cfbbe13d","target_edition_id":"edition.r017.id-id.draft","target_line_end":352,"target_line_start":349,"target_local_id":"block-086","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[349,352],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"29ce2448f4340b8cab0db7a471be1478f205612c7934571b0e376a0cb25f7be0","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-087","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1e3d5f3d50431097ca294f2ad72aca40b7ef07ef889cedaf77a2b60368b98481","target_edition_id":"edition.r017.id-id.draft","target_line_end":357,"target_line_start":354,"target_local_id":"block-087","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[354,357],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6195595dfe1b202005d58fb46c38608e8211a3c98fa3e9e2f45b51ae496ae77c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-088","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9d1b4752396f89730be841c3012798e1c07aa62f278077a77a3387a6e7039ecb","target_edition_id":"edition.r017.id-id.draft","target_line_end":359,"target_line_start":359,"target_local_id":"block-088","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[359,359],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"333c20e8c0e14dcb60b8414e30e37aafe2eaab0c9b3f2cc16448d68364cfbd82","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-089","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c0b8e0eb6b127ccf33ae37c10ba5b39ae6ed21b85d158426d680b3edf4954632","target_edition_id":"edition.r017.id-id.draft","target_line_end":364,"target_line_start":361,"target_local_id":"block-089","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[361,364],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"704bd3ccea5f304bc9c64e8cc8e506e1bd398e6d0a9fdaf6d38a725822caba35","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-090","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b17cbbdad86f261dc7cc8d60884fbf9d229fbc484f880042bff20b1797e81778","target_edition_id":"edition.r017.id-id.draft","target_line_end":368,"target_line_start":366,"target_local_id":"block-090","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[366,368],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2d642c26a7ab626a2504a1cc1cadb797f8d32d2fed6ba8e5bce32698a4c348f","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-091","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ef675adf6f241e6a2e23a1fcf501425f0c8045bd68201a7a3e321e55a1d9e465","target_edition_id":"edition.r017.id-id.draft","target_line_end":372,"target_line_start":370,"target_local_id":"block-091","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[370,372],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d6d04c10e64592b4120274ee831ab6ea854e5fc1ce03df4f4101a6d41aff5510","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-092","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"19b7f65fb86dcd81d666912f3c5e4ab4e2d20fd79e5cf648add51e7648ac267f","target_edition_id":"edition.r017.id-id.draft","target_line_end":376,"target_line_start":374,"target_local_id":"block-092","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[374,376],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7d267277749f6b7c7aa4ca91fe9815f7ca76c51cecee1799e602b1327b1aefd8","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-093","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0765b5342f327ebce5e70ce1a8fc1aedf6f512dec143d925053c5af4d5ad3fff","target_edition_id":"edition.r017.id-id.draft","target_line_end":378,"target_line_start":378,"target_local_id":"block-093","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[378,378],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"29875ce444ed8a68847f77440c3afe7c4828c8f533f4077260a67db75071f2dc","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-094","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2af30411b489920513598b17a0a20180d325fd263557759d68d6f0b5597ea9b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":380,"target_line_start":380,"target_local_id":"block-094","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[380,380],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"67e600c23a21d9c54491472f1b098be37e2d8d29c360bd6bc9f6b0d54ef998ae","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-095","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4167c7954a089b37c66544407647b329df74a3a321bd13613bd722a688ce2f7f","target_edition_id":"edition.r017.id-id.draft","target_line_end":387,"target_line_start":382,"target_local_id":"block-095","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[382,387],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef286b3607d14ce76e84e03971521085719ce6aab78decb9545e55ce1424f0ae","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-096","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"914e6a29b85727540a8c0a185bf4a3e1e1f51395b84b3d166348595225b78165","target_edition_id":"edition.r017.id-id.draft","target_line_end":392,"target_line_start":389,"target_local_id":"block-096","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[389,392],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5a8c587445b2ac5cfdf913a6e8ada1c1ff64347c1b9f0842b8cb21310d1dffa9","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-097","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"02617e6d266ab0c0aeace224dd2a774ebcf06b118835182107d3a6a2fcdb904d","target_edition_id":"edition.r017.id-id.draft","target_line_end":397,"target_line_start":394,"target_local_id":"block-097","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[394,397],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ada2be717f172717e449d0f454b12f1b18c3ccd34ab20d41ab332e6c5fa8d2db","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-098","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"85354bbc08a15713d7f3cbef096a749ff15dcc19196b07f1ad8af99079eb54c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":399,"target_line_start":399,"target_local_id":"block-098","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[399,399],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"309627ec8d12965084d2d94c73bddaef3cea24697b583ab045c91ab46bbbb694","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-099","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ee7807748d418fc8d3257ae5b04cb1a904aaa301eeb5ca1a0d2007e8df5e1f46","target_edition_id":"edition.r017.id-id.draft","target_line_end":406,"target_line_start":401,"target_local_id":"block-099","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[401,406],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d0d148427efb7a4c457c970975923600518d86eb30bef0c625b8eb504879c350","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-100","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1e405fb692e853b46d041d257b290285397f00a39bbebf94b50ec5eaed348ca3","target_edition_id":"edition.r017.id-id.draft","target_line_end":408,"target_line_start":408,"target_local_id":"block-100","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[408,408],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ac49436dd8dc7d68f02eb17e36a198d0a55aa64c824469b1ce5dede14a3e7032","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-101","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"87acd95e015814a8e8795f6b957ef2713fffa8d8b7b37b29cdf13333ad8d4ea3","target_edition_id":"edition.r017.id-id.draft","target_line_end":416,"target_line_start":410,"target_local_id":"block-101","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[410,416],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e5fc96aa4704ef5ee8952bf733b6551f5b56b9d0228dd01fa2c7975bfd01af3a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-102","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"68e8d65fdc57b61204395abb2833be63b1702036660bd65639d83162675d53b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":418,"target_line_start":418,"target_local_id":"block-102","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[418,418],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a7977e3df544e41ad2db455a523c520df4bff042e2991b375314b7f028b6a3b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-103","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5f8842110f490aa4d9b17d044116cc8d46811587a95de9f6ee1fe90ad9c5927c","target_edition_id":"edition.r017.id-id.draft","target_line_end":420,"target_line_start":420,"target_local_id":"block-103","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[420,420],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a4a2c1c52f3c0444bd612d2dea67e3306dbaf0f87d27b49c0973907f034a5fc","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-104","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"76309c0348f07684fae0496c934c3ac810046d6bfbc8ae38d580c3eaa15501e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":428,"target_line_start":422,"target_local_id":"block-104","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[422,428],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6bd2077ad0d1ef344101cd3e9d25abbf4f1c822fa72490cd3086bfa262472b40","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-105","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"931b66a7898435553aa639a0af54625115c213973377763087200f5a6d61c22b","target_edition_id":"edition.r017.id-id.draft","target_line_end":433,"target_line_start":430,"target_local_id":"block-105","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[430,433],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f9decabef5610d7f7760b635b95d0f021b907854e3ab949ee618dff9fe695165","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-106","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"33e32e5d236ac1948ffbef063a90f67080a04a706121d1ad42c57ac93997ee01","target_edition_id":"edition.r017.id-id.draft","target_line_end":435,"target_line_start":435,"target_local_id":"block-106","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[435,435],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"97fd5e188946fb0b7adccbd1b15c16962dbbc5768c0aed7d226a9dcfa463b83f","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-107","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"26ab7c4d5467fba291181a8d055f39174433c2825818f162073143bae976d406","target_edition_id":"edition.r017.id-id.draft","target_line_end":447,"target_line_start":437,"target_local_id":"block-107","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[437,447],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"08512f288492ba2cd0b2e7e78388b3b0bc61f905b4028b725348795a9ea0195c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-108","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fe05271ce6cd60ab12de1800e59b5b1872c2d5c2ff38823e2eb0af57e5380537","target_edition_id":"edition.r017.id-id.draft","target_line_end":452,"target_line_start":449,"target_local_id":"block-108","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[449,452],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e27e642293a6fe4ec10516c01ee57e713207eaa614c3b984d7a351cb9374564","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-109","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2aec5379f57ba6c7aa1f1759798c45c08a7794fc69b6ba23e35c486ffdc6d7bb","target_edition_id":"edition.r017.id-id.draft","target_line_end":454,"target_line_start":454,"target_local_id":"block-109","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[454,454],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"87a8e731a1e16f5923276d8e96f2ccabf4fbf06d44869da6bcd558392f074cf1","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-110","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"afd98796a653f5cc8c0af8b519b1e4ec6f0f2e233f61d89b6cc912d99b1ac733","target_edition_id":"edition.r017.id-id.draft","target_line_end":456,"target_line_start":456,"target_local_id":"block-110","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[456,456],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81856171b411d6940296a1ed4fcaab12d31e6583a669a7690b7445fc1e76024c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-111","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"738cd16847a6113664b0e3adb9486385862f5760a55a2b048ed4c6e1f9ad4f82","target_edition_id":"edition.r017.id-id.draft","target_line_end":463,"target_line_start":458,"target_local_id":"block-111","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[458,463],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"67a2ad80c33cc68c48595d06972382f8042375a573abc992ee3378847cb96f82","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-112","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a0c0eedbd5ba0c35ed428e01bd1b4e059d0eb453a16ab8cf110fdd6b8a7407d1","target_edition_id":"edition.r017.id-id.draft","target_line_end":465,"target_line_start":465,"target_local_id":"block-112","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[465,465],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b8d4cbd6d608783bea0d69b4d22d5d4b4600dea0f15079e7c02e3b806ce455a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-113","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"91a172894fc424de20baca80c12ad831e0804355947e59441ddfe4b798426d06","target_edition_id":"edition.r017.id-id.draft","target_line_end":472,"target_line_start":467,"target_local_id":"block-113","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[467,472],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ba82ed5269b22c0a55cd7859f9f6fd38d8742adfd20c39fdb91373c2f22fd994","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-114","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"36725bec89cefe26fbf18e3bff99bfaf07d40080cdd3e080091d7056647e79d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":478,"target_line_start":474,"target_local_id":"block-114","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[474,478],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9dd5030cea818e579a0b1e594e3cc5cd3310bcbfa0aea615aa1f2f39300c0b33","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-115","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6d21f0bd0c13c800d8ac5b4e6035a485c9e0b3a441741a02ed89d62ab93ab0f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":485,"target_line_start":480,"target_local_id":"block-115","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[480,485],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"43224376aea12bd6c9f01394b499e22026978522ab9e2f8fe6ca0e083765e597","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-116","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b56edefb16c9698286650d59c4f1e670d0d3b002f7306b57487ba2e421f1e680","target_edition_id":"edition.r017.id-id.draft","target_line_end":487,"target_line_start":487,"target_local_id":"block-116","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[487,487],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6142fddbbc227dc90be827a993a26239e790c8339ed1cee61fbb992c5d01a846","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-117","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"47c8d3dcf9c01078ff5f9b01a15d72d718bbc1a5ecee8bccb4cc8d2ccde06c25","target_edition_id":"edition.r017.id-id.draft","target_line_end":492,"target_line_start":489,"target_local_id":"block-117","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[489,492],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"198adaaa9dbf8a8980d9af3aad20f684441ef87528c34013809acbd1f8fc614b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-118","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fa5d98c25d62baf7629244e326709d84bdad92904b03ba97b9f60a025cfa8dcc","target_edition_id":"edition.r017.id-id.draft","target_line_end":494,"target_line_start":494,"target_local_id":"block-118","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[494,494],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"11ea91a2f064f5b2d5ec942c73442c309decaee721e62eede86e2d854069d815","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-119","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"78276f3de3efafc6f2c3f0f4e39ce8cc566da46692fb3d8f607c2d157faf94bb","target_edition_id":"edition.r017.id-id.draft","target_line_end":499,"target_line_start":496,"target_local_id":"block-119","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[496,499],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"68c8e2a4335d98f0730db4e743d2863bd7a136219fe30c5bfddc7b6876c05c9b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-120","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"baa2a5a0896cf4b2525d88d158eec0a5fbc6cb37f83674c484c85ceb7b118ab8","target_edition_id":"edition.r017.id-id.draft","target_line_end":501,"target_line_start":501,"target_local_id":"block-120","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[501,501],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a0c33c1fdffa4583f7b8d601908a1e070591db143b8c8b50d582c9b4c9ca440c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-121","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"04d231a62d2f8ec610788fa31f6ed0948898280f1f112c1cabab6a74c0e91a15","target_edition_id":"edition.r017.id-id.draft","target_line_end":508,"target_line_start":503,"target_local_id":"block-121","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[503,508],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3e1dc749072f979e96b01c209f0cac5b14fd6a750bb544470f02657c0a14e1c5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-122","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0c68992676d445219c411f584cf54d93962d322c7c06783308e0972bf6b874ee","target_edition_id":"edition.r017.id-id.draft","target_line_end":510,"target_line_start":510,"target_local_id":"block-122","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[510,510],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24b56135f0dcfc29c2ce79cfdfb2892dd70f11fd353611e74bbd6aa49f338df0","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-123","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"807f1ed5a4b3df53db248eed8c1a8548620c2f07eb7df56b85ba67ccb8cfd6ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":512,"target_line_start":512,"target_local_id":"block-123","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[512,512],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10da18a2c06b2f11a50805c0597b8214b66834e5581acef04c4468b95b635a4e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-124","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f505bc78beba5917b314c5c02e8307fea3ddae2c33a8c37dd2b890317ba0ffc","target_edition_id":"edition.r017.id-id.draft","target_line_end":514,"target_line_start":514,"target_local_id":"block-124","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[514,514],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b799bd40199cd20367ee3c23ad67ad07fc5ab058ce9cac5d76c20682ad3756fb","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-125","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"53c83193b171bd47dc0b9ddafcc866cdc05273491364334d1f981fabff6b5133","target_edition_id":"edition.r017.id-id.draft","target_line_end":519,"target_line_start":516,"target_local_id":"block-125","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[516,519],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de4460b804ba93e3b35f247578439e230fb3a694788836a83f8839c92b473f4e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-126","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"95957fd9c49da9d0ef2682d3197f27f23d7d3030b29099c73443f2e6494c51f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":525,"target_line_start":521,"target_local_id":"block-126","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[521,525],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e1d5cf8dbb5f066b5090902e28d22d38937a4b52c861ad4cabcf6f4fd298e427","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-127","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1d063daac59b3ab8abde9f8d90a392a1a26b4e23191f9ec5cd67059563a3d57b","target_edition_id":"edition.r017.id-id.draft","target_line_end":527,"target_line_start":527,"target_local_id":"block-127","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[527,527],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5bc42c5e6968c0b9ff391763a29853301994b125da3b0f5c1b5015ed3ec3203d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-128","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"da4d36198704dabf235557480437af91732986f4e9068e70ff55a4e095aea0a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":533,"target_line_start":529,"target_local_id":"block-128","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[529,533],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"05b37a6e445591396088c43e168716f610410d65519f292e0baef86387437c5e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-129","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"92c1858727085cac2ebc10adc89a28534033d838b0c51c7c8e4de225b3494f74","target_edition_id":"edition.r017.id-id.draft","target_line_end":535,"target_line_start":535,"target_local_id":"block-129","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[535,535],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7ac7badca10085a034e4bb948732bf89458dcfe33bc963ed55b2880da41e213","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-130","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"87ca174151114af067f6b048027320b62005342c6e0f0b99f265d588bf1f1fb3","target_edition_id":"edition.r017.id-id.draft","target_line_end":540,"target_line_start":537,"target_local_id":"block-130","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[537,540],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb526b478e9defd0acf4a02f1429ddc7527c6172b7c5c4c17974215a4bc6dc1b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-131","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8d36264b65165575993a762f22f4ae1bbd42423be927a0a67e97562f1e13a2e8","target_edition_id":"edition.r017.id-id.draft","target_line_end":542,"target_line_start":542,"target_local_id":"block-131","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[542,542],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"49baebe6edac6eeb7064816d5c7f823f5190c06300376c21cbc002897ca0477f","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-132","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c8da222352597ff144b76bcde7578450296defd5590a28729c968dc2989496fd","target_edition_id":"edition.r017.id-id.draft","target_line_end":544,"target_line_start":544,"target_local_id":"block-132","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[544,544],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"72931b27e294dda119fa9e6e507f888c4ffeea8ccc13f670161c8523b4e45983","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-133","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"501a9305c90fc78724b7b102ab1bcedc3e29831d9d5377bc3908ce51e0bf2585","target_edition_id":"edition.r017.id-id.draft","target_line_end":549,"target_line_start":546,"target_local_id":"block-133","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[546,549],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b121e91e3797c85fa52a03d8d00d0e1e33fe8e3938d631e09b99bae2c6876fa0","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-134","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c93db4cb4e033b549fe0f596b0ec28c60da9284e617dd298ddebd774aea15910","target_edition_id":"edition.r017.id-id.draft","target_line_end":553,"target_line_start":551,"target_local_id":"block-134","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[551,553],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0fe023e22b3dd238f6e2650cb99c334e576e7c7152d6be69a16123509d6d7753","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-135","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"43f7737ce5cdf0e205996f085a4c7d6765a2eeb497c22e6819bafeb742b26603","target_edition_id":"edition.r017.id-id.draft","target_line_end":562,"target_line_start":555,"target_local_id":"block-135","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[555,562],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1493b5fdbe3a2c0047de083237520aea93e6cfaf9938ff5acad7886d18856e33","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-136","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"79283a551e84e36075c00781f0e92145e43d52312d0b4d29debfe3f18fd5cbbf","target_edition_id":"edition.r017.id-id.draft","target_line_end":564,"target_line_start":564,"target_local_id":"block-136","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[564,564],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0faea3546569185296a5e1a47ec8d33ab9c4368cf73da3de433995eb805634fd","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-137","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a23fa14de66d541fea1ee41090fb0b0ff7e606aa11212607229b6c76f1cd34a3","target_edition_id":"edition.r017.id-id.draft","target_line_end":566,"target_line_start":566,"target_local_id":"block-137","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[566,566],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c706bbd9bcc7c45fa7532d66b84008f3fb7131226ed0ebfbadffd14bfa59f617","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-138","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5a5c21db38b862580a2f53e75eeb3c972695600e47ae67f0828b3a778e2c21db","target_edition_id":"edition.r017.id-id.draft","target_line_end":572,"target_line_start":568,"target_local_id":"block-138","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[568,572],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16f33b552904b4e54dd80d855a132089fe54ea2a6cbc180a29c80b5fbd00027a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-139","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c8508635ce7ec12b3ddf824a1020b82da4ffd93d34e75f85554072bbecc5cf82","target_edition_id":"edition.r017.id-id.draft","target_line_end":576,"target_line_start":574,"target_local_id":"block-139","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[574,576],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"725fcbe2384ae028a4238f25fc63ab8a858e42faa0ab94996fe2ed55b9f50b10","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-140","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c3eefafdfda8890f6c45dbfe4193785afff7703ddb17c3d1243dde599107c116","target_edition_id":"edition.r017.id-id.draft","target_line_end":583,"target_line_start":578,"target_local_id":"block-140","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[578,583],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"71cd8874580b13cd4c804be2d6b84f2826f8acfc90daa71d73f2c164042dcfe9","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-141","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"710a9f044880c4c2ea877da672b1a0a2fcdea4e56b4733d0feeb634af16bbcec","target_edition_id":"edition.r017.id-id.draft","target_line_end":587,"target_line_start":585,"target_local_id":"block-141","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[585,587],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20aebdeb4212201406736879cabd37ecef76b0fa53553039cc70c300b74b1c90","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-142","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"83d9a76a0a81a8f90fe680879fd5aa9dd19803d1d34b6072c7470344ddee9835","target_edition_id":"edition.r017.id-id.draft","target_line_end":589,"target_line_start":589,"target_local_id":"block-142","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[589,589],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd9ca18791ce6044fdfad8feaebd1e3cc6b4caf035f9418ae5d2845ceb7f406c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-143","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ba155f4c360e9cc5282d9a4df181956b6efab3392020b4838038201bc1bf0e40","target_edition_id":"edition.r017.id-id.draft","target_line_end":591,"target_line_start":591,"target_local_id":"block-143","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[591,591],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"41ecfd33d30768dc16da0b4c053bd8f6bbe499450d29191219b81bfa7cba6f7f","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-144","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d6487b91b9295865dd319ce507c5e7048ddd3dfdebe100e99e834fb617ef568f","target_edition_id":"edition.r017.id-id.draft","target_line_end":595,"target_line_start":593,"target_local_id":"block-144","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[593,595],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab2e173bca1a108cfcf55fb168e0576b59cc6fbbb0778eaf2957ba26411c4664","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-145","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"264b57e4f7300e10846b56004d09c07739ef277b68ca99c1eee883fe95b0b5ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":602,"target_line_start":597,"target_local_id":"block-145","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[597,602],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d2d228008accf9a2c2e79c611fe9b22d4343cba90d0705abaf19ffd3116251f1","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-146","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f211fe0f643ea245b2d79fb303e82fe6c1c257f464f250db49c065ebaf52a122","target_edition_id":"edition.r017.id-id.draft","target_line_end":608,"target_line_start":604,"target_local_id":"block-146","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[604,608],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18e806f644d0fe825d41161be957f687f61c8134ff6a7291ac35151760c729c5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-147","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1a0fd99058f91fc97f3803e7610f3349d35aede791a0d8106577d30b3191d1ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":610,"target_line_start":610,"target_local_id":"block-147","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[610,610],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8282ed301f019e3ec8533608afc8a89c31ff2cf3aa0a41255b61cb525319dad8","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-148","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f9531f97e8459f129491e384840d861cddf0e0d8808d5f0764699e01d73cff0","target_edition_id":"edition.r017.id-id.draft","target_line_end":612,"target_line_start":612,"target_local_id":"block-148","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[612,612],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7cd60d05467e39ca8050d39d1146da12c39be9c453fd22a612b995f6571972a5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-149","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f55b1ce3beb144fe8900e0573ca33610e517b42be6f8bf6bb31772977790f459","target_edition_id":"edition.r017.id-id.draft","target_line_end":615,"target_line_start":614,"target_local_id":"block-149","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[614,615],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f66b3d32a0aed26343e238a3de56a2afe56ec6437ffea614ca9d137c73a815cf","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-150","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7153a5a9120172b6ae712e59e5369381553c20893ec97e352a377fb1a1ce9d2b","target_edition_id":"edition.r017.id-id.draft","target_line_end":622,"target_line_start":617,"target_local_id":"block-150","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[617,622],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc2a5bda7226e464bdb8ca8bf6353fa9c2b92e237d45739c0631abec076df441","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-151","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e9be82defbb8893b2b7f63953d0d8bdffd147ae3ad66123fbef059a403b69571","target_edition_id":"edition.r017.id-id.draft","target_line_end":628,"target_line_start":624,"target_local_id":"block-151","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[624,628],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b312e092b83f1ef64bf167058776df642c710035a8b5dd3706668106e2250042","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-152","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"798b886202c94565f7d778d096acd6cd717200166286dca6b00e0a9a57d7c167","target_edition_id":"edition.r017.id-id.draft","target_line_end":630,"target_line_start":630,"target_local_id":"block-152","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[630,630],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"40032fae9efbd0d8f180589d8de46233d623cbdb3c6de510f40fd88c7fbe5135","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-153","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7a60fc6bdefd6dedeeb2113de13cc194d7f3da0f56be33345fae1039d231d1a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":632,"target_line_start":632,"target_local_id":"block-153","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[632,632],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3b30841101d542273b5a5a86b48735953dd1db737fdb7687ca44b35f94f13f7d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-154","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"86b53c26d60b9f5eaeacccaf00a2dc50c4c87ca4b15adfebe84aa2cd5b7ed46e","target_edition_id":"edition.r017.id-id.draft","target_line_end":638,"target_line_start":634,"target_local_id":"block-154","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[634,638],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a673b4dbeb8304300713c5ef3f37e7e86e784feb34ffbfa4609c2422c094f2fb","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-155","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0ff2297aec4a910affcea3984803fb6c7bd5d19419a7f1e193ec8fa782383618","target_edition_id":"edition.r017.id-id.draft","target_line_end":641,"target_line_start":640,"target_local_id":"block-155","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[640,641],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b557e9b3f9b94441c9415efccf12f9566a5430c2860567311fbdc7017bffcf76","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-156","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ee71c26a653654583d5008dea9a914321f883c2198da1fc7d578df2ca6ef8c90","target_edition_id":"edition.r017.id-id.draft","target_line_end":644,"target_line_start":643,"target_local_id":"block-156","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[643,644],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80d2594f700298c504d8c82fc8838a305e816a2f780cbc18f24aecf1b27f0b97","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-157","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f4f8e5c5af590d5d9f29615d9f20050ceb90e42111d0e0c277b461c5010703e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":651,"target_line_start":646,"target_local_id":"block-157","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[646,651],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b53cccfdbbac220c6ba3d54303be2edf18eb1792e9d00203bd778789d8be1109","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-158","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5bd66892866ef9704830884ff434681b5e66a03c191a5ed8b1533328f4f5e700","target_edition_id":"edition.r017.id-id.draft","target_line_end":655,"target_line_start":653,"target_local_id":"block-158","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[653,655],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c971a700268722751150601e4848cef559014cdaa287e6f05d989c9116864cd5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-159","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"00044edd3712fce32659840c639ac11f9e926d7e5dfe240c1b215d85a2ccc2b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":657,"target_line_start":657,"target_local_id":"block-159","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[657,657],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"655b2fc8c906671e0188dab10e4bedbdc5cc4c6ff42487b8625229c0cc118758","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-160","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8ac71dd880df7bf33ab247619963dd5d3fdd4e52d6d4197479efc09549085571","target_edition_id":"edition.r017.id-id.draft","target_line_end":659,"target_line_start":659,"target_local_id":"block-160","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[659,659],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3f3b3443e722d034b2ad449752b0b12a3b4dd1d4bfc53901e5a8525ef55d99cf","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-161","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a681d67ef4251664227ec1b53a9698e8bb72e040ddfe8a2af778eef2b0f3478f","target_edition_id":"edition.r017.id-id.draft","target_line_end":661,"target_line_start":661,"target_local_id":"block-161","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[661,661],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d1f0f17ca6c54ece6bd76aa3aabbf6a069e54bd8cdc37e861a82cde70e224322","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-162","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"515f2ed427f993aab33adbe6c5b2670da98e9120ce20a98c1b0aa1101578bbab","target_edition_id":"edition.r017.id-id.draft","target_line_end":665,"target_line_start":663,"target_local_id":"block-162","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[663,665],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"85df6def1ada894a893971814c1e6bc35ffc63c5369ffb04110c4c0f3cafa3f0","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-163","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b5151ff8a005de6dbf0860c2283cef2887706ed90b10e4fde31e4db407201c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":673,"target_line_start":667,"target_local_id":"block-163","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[667,673],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2235a9bf885a0da0ad164fc723bf0aa79cd60cb3d5ab320e395c9dea30373dff","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-164","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f21428fc484ae532e7ca3a6c5475dee355273fe793e88041b461c8e63da7bb81","target_edition_id":"edition.r017.id-id.draft","target_line_end":677,"target_line_start":675,"target_local_id":"block-164","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[675,677],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a7781cfff43808378036c78cd8ab9112062cf63e747da2aa6fd9ee1085f042c3","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-165","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1b52416b1df1c36b6dc1b4c6b33355f8201cdd6976c62edde2826840a3052c7a","target_edition_id":"edition.r017.id-id.draft","target_line_end":679,"target_line_start":679,"target_local_id":"block-165","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[679,679],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e53376e35d7bad52564a1a15cc3b9cdbc12ef99328f3c2cd0e373d8ac4a76e8e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-166","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7be3b293f90fb8ad51d2aa140f13ace60aca675b53222bb7b1dc27fe0e62712e","target_edition_id":"edition.r017.id-id.draft","target_line_end":681,"target_line_start":681,"target_local_id":"block-166","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[681,681],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"644af9c881edc35a0d272f3c0982f8d9d9b66559f171bd59cbc8870f7473c61d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-167","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"62f980a25cf7969caa21f2dbdd2d7b04ac0e038f2e5aebb3014e4a518df38723","target_edition_id":"edition.r017.id-id.draft","target_line_end":689,"target_line_start":683,"target_local_id":"block-167","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[683,689],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"789923bf7f4c8f9b0d529fe07b7beb52f653c04c2c29b52bbfcc877c0569b9dd","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-168","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"afff9842818b5a18ed2cfb0a92cf1130055e5211a920aa3dce49f0733f9333f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":692,"target_line_start":691,"target_local_id":"block-168","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[691,692],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ad368e2d9861f9fae56937ac3fb453e9a1bcd73092509622c01dda96aca9f3c6","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-169","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"075748ecdd30078c60088d1c5582644bf7ac1b6dd977a57dd704b641ef566cbd","target_edition_id":"edition.r017.id-id.draft","target_line_end":700,"target_line_start":694,"target_local_id":"block-169","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[694,700],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"690cd0d1f99e63213e09f48b7692db7dabb23a93b49b88dc3222410d1b054740","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-170","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8375f004a689c16bb3aa2c2ecf8d348c56ee98687f2665ad099788febc4621fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":702,"target_line_start":702,"target_local_id":"block-170","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[702,702],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c94d4a44965d50782df57b3dfd40e8ecc01ae38f684d8e5dadf57cee8531935","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-171","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"419da3dd0be892d0467b6ddc8867e2755a733c9430a6a843e799eb4984e88d2d","target_edition_id":"edition.r017.id-id.draft","target_line_end":704,"target_line_start":704,"target_local_id":"block-171","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[704,704],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"836a31ed72d22cdf5fa470ea0ac6e6c3ffcaea94c930ee23b3bd48fb28a74c8b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-172","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b51e246824d6e2ed54a85476fd7f1e6ae6417bf9383e272363d773f47137679","target_edition_id":"edition.r017.id-id.draft","target_line_end":708,"target_line_start":706,"target_local_id":"block-172","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[706,708],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ebbae93e4024026f46c40a6bc9deb7e2079dd8ade0fc21686d491d572185a78","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-173","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dca3bb72a3e4ef3b3d9a2cc483952a8aaacbb1f2e8503202998618e283e3e644","target_edition_id":"edition.r017.id-id.draft","target_line_end":711,"target_line_start":710,"target_local_id":"block-173","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[710,711],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0ca8ad06da827ade25cfae37e803562207d96268048344024c63253ac70b00d6","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-174","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2c7327b7109a1e56627b5cbf063dbaa219e89f98d09dbef2d5c5e9a87b531077","target_edition_id":"edition.r017.id-id.draft","target_line_end":717,"target_line_start":713,"target_local_id":"block-174","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[713,717],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d40f1024fc74714b391f54036340b68a22ba4c88fe6fb570960c45035fc6424a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-175","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"618c23ce021d1ae28c78b4ce80deab3ac1e8e4cb6ff0a69be5b8b3eb47749f4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":719,"target_line_start":719,"target_local_id":"block-175","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[719,719],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a52059113798dde2cda8b831056754668860a0e3a3a607c907c6357ee4f87979","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-176","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4304a2108c4457ed8b9d0af308ccbe5ef20d127527f0108fd49a59277ea0db7c","target_edition_id":"edition.r017.id-id.draft","target_line_end":723,"target_line_start":721,"target_local_id":"block-176","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[721,723],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f2b668514f74f493bc1e4c57f2729b2f0d04a9d53679d75ca53f7a2ec17499b4","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-177","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6f7b3847e65a96518390fc15265117821c466e2d915135882f69cecc9c3af4f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":726,"target_line_start":725,"target_local_id":"block-177","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[725,726],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"162cbe0c9462429807572554cc784d791b9404add8f720ace7cf123721d3194b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-178","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ae69cb602b945377059eca2541a0cc7b37791b1bcf9bbc4a43acd6c610599bb3","target_edition_id":"edition.r017.id-id.draft","target_line_end":731,"target_line_start":728,"target_local_id":"block-178","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[728,731],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9743ae53947e00db835405f3c3aebe8d8c45a44b79c78fee66de6f9f69330794","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-179","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d1922a89dbe48ebd99b115c611d7c59bdad55b8832da1eb8ff404a8da2fafaf0","target_edition_id":"edition.r017.id-id.draft","target_line_end":733,"target_line_start":733,"target_local_id":"block-179","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[733,733],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80ee3adb550c73c4a0f249275fc06c2c457490df4a5c9f30cf44c68a4f9a6298","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-180","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"050ab5dd98e2010c89140dd20393a9c45b7dcb3314b4d53cb143e9e214d0fbe5","target_edition_id":"edition.r017.id-id.draft","target_line_end":735,"target_line_start":735,"target_local_id":"block-180","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[735,735],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2059b5977885119f6cc6230964ba1016b107cd3c79a9b39daced07d2a061723","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-181","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"34f063e48f75e45ae89ed930cbc8002f727512710b25b560f8c19ca4c02c0f1d","target_edition_id":"edition.r017.id-id.draft","target_line_end":740,"target_line_start":737,"target_local_id":"block-181","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[737,740],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"34ec2b7ecbc9c612eb14441cca5207dbdc53bbf22b5e6837c34091c37ff6c50a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-182","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cd8e1939b0fb1e5c85a0d4c2cf6ffead1acb07c49289c4c1cc76e2e887d42c47","target_edition_id":"edition.r017.id-id.draft","target_line_end":746,"target_line_start":742,"target_local_id":"block-182","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[742,746],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e50e69dbc5ba4d01707f533981ad7a6e392e64f5f240709d6c2a0a5990660a19","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-183","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c1d685bf6f65c9646168f21c2f280c9d37836bb83e32d2eb3cc205458cdf8c10","target_edition_id":"edition.r017.id-id.draft","target_line_end":748,"target_line_start":748,"target_local_id":"block-183","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[748,748],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"907900c5819b4e7b6a0b79606fccb4fde0f0546756a3288decf4d145509cbeb2","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-184","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"744b0d442d87b79b1e281e54a6a5a90f483300c7323a00a4f31bc60458450882","target_edition_id":"edition.r017.id-id.draft","target_line_end":750,"target_line_start":750,"target_local_id":"block-184","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[750,750],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"325aafae528e741e30412bf3943a2ea11e68d63906b57f31a3fc2e94e4f2c375","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-185","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6408baef65547da526bef9d4e43f9825a73fea2200f790c503c419296285a019","target_edition_id":"edition.r017.id-id.draft","target_line_end":758,"target_line_start":752,"target_local_id":"block-185","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[752,758],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc66e566aff4df101a2d300af26195089acc9e486f6db42d88db5ecb643254e7","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-186","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a61e1ebb6a22d56980473204f2d1f0635679ef708adf3e30ad4467dd6a5d8b70","target_edition_id":"edition.r017.id-id.draft","target_line_end":764,"target_line_start":760,"target_local_id":"block-186","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[760,764],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7341d9090a68913d36c08b009f332e4b5c50ae6aaffb11af5621ff8835d36632","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-187","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f4ab46094d4034948a525064f61c129a326ae5600410bcfd6df46d808d207f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":768,"target_line_start":766,"target_local_id":"block-187","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[766,768],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e91e15ae6a769fdd51fe1e1d61e0a5ce28a02419e01ed009c12b47ad50e4c3bb","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-188","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e6bc18bf68194e7e16c324656dcafaa0292dba49d628d5206adfc6b3b74bd8f","target_edition_id":"edition.r017.id-id.draft","target_line_end":770,"target_line_start":770,"target_local_id":"block-188","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[770,770],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84dee86f09bc66a98ce270a5500f842917511f401c26168e92d13c437d833676","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-189","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a82c66c6b473666a767c76ff38c444a0d16f9a7a891433c421bf07faa526b292","target_edition_id":"edition.r017.id-id.draft","target_line_end":774,"target_line_start":772,"target_local_id":"block-189","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[772,774],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"01e3eb2422ab6acb29ff7052e3b6a38b58b8ca504da2d0e1f6c158d2667f58ea","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-190","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0333dfdee972b09ec792dfd9f7363724ea83a05805a8b329a8b2d185ebba8fd8","target_edition_id":"edition.r017.id-id.draft","target_line_end":776,"target_line_start":776,"target_local_id":"block-190","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[776,776],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6fcc11ffb412d1d4584f6dbebe962b7b522f6692ccef3887ac513216ee4fec1a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-191","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"15aa40eb9cbd6852e55daaec74eb931edcf3fe05614136bbb4588bd13c696f7e","target_edition_id":"edition.r017.id-id.draft","target_line_end":778,"target_line_start":778,"target_local_id":"block-191","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[778,778],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92c98af222d12b8f12fc8cb4532eba88d9968fdac912591da4d8a3723693f5b5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-192","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f76ffc9c3087b87504a73ba2af1ce71263cebad3d7bd29c37ad21667f6f06495","target_edition_id":"edition.r017.id-id.draft","target_line_end":782,"target_line_start":780,"target_local_id":"block-192","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[780,782],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94250d20d3a01b9558a9d4225dee6c1c7267c2a646eceec64c169bc9da70e590","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-193","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2990308f6d769f4a1135dcdd5097c4a79c68a11b60e65be47643bb8fbb1d381d","target_edition_id":"edition.r017.id-id.draft","target_line_end":791,"target_line_start":784,"target_local_id":"block-193","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[784,791],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f8dedc3cf9cd056ab0efeb4205c40da0b018986f89b51bc135fd6f50f97f256f","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-194","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6c416d5185f1cd0cb4526de87fdd9f6a74971755f150f9b280f5a438ad84be95","target_edition_id":"edition.r017.id-id.draft","target_line_end":793,"target_line_start":793,"target_local_id":"block-194","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[793,793],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"008d57e857fb31e74a7a83648e9b965bedad165e63421f7b558326c5578302fe","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-195","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"11fe1223f0f005526d614c4ad88b05689bdc4ba4071b43f3ef6923a0ffab918f","target_edition_id":"edition.r017.id-id.draft","target_line_end":796,"target_line_start":795,"target_local_id":"block-195","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[795,796],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b1b3754c948fb507e7094a3db3637dd89c19eaae36f9de4273440a534ac33ec9","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-196","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"02d6052ccdba9f73176b61b75732db3e8ed01d5bd0357679af6ef999798fbe5b","target_edition_id":"edition.r017.id-id.draft","target_line_end":800,"target_line_start":798,"target_local_id":"block-196","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[798,800],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80fd4efd6cfcc186c44ba96b703848fe51747d039d2849dcdba6cd63d65a3e4c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-197","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5bae3763adc54e79de94d83229ab50bb95b9002c595767e527143973f52b84cc","target_edition_id":"edition.r017.id-id.draft","target_line_end":803,"target_line_start":802,"target_local_id":"block-197","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[802,803],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"127527a07a3d20200564a176d751c8911f0e5cab2e48927eca87c42e25e4ed5a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-198","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"26fd9c69fc61e86daaa0d3b98ff7ff59877e2d97f0e2dec04776494bbb54948c","target_edition_id":"edition.r017.id-id.draft","target_line_end":807,"target_line_start":805,"target_local_id":"block-198","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[805,807],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70215c3cd3dee585bf6ee1afc8987c78ec3807f37dcbe0f2172e343472fb4895","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-199","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1cdcacefc1e7afe7254fffdd9f24c957cdf18d84f9e35979998c2c3f57918bfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":816,"target_line_start":809,"target_local_id":"block-199","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[809,816],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"769bd8dacbc8e2f3150c930982b56b572d8a0ac6d95dc8d365be5c2d7157c196","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-200","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd2302c8299b2d58c81b64d75edf1ab011db24e1af2929b878185d674511d943","target_edition_id":"edition.r017.id-id.draft","target_line_end":818,"target_line_start":818,"target_local_id":"block-200","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[818,818],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"039145c069ba913a032102f9b5bfdd051d89b0ac99eb1d2be9fba286613a38c5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-201","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f640631b284f7ed50be60cc5f75694ae6e0980a8c8f5681776605149ae0c325","target_edition_id":"edition.r017.id-id.draft","target_line_end":820,"target_line_start":820,"target_local_id":"block-201","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[820,820],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a33b946e50b3077f46300b5cf2254591925840ea14fe84c80afa70db9ee61e2d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-202","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a9a1657999801f69932624c9a79e2c6d4f44680f1e0e6aa48476af649853bd56","target_edition_id":"edition.r017.id-id.draft","target_line_end":828,"target_line_start":822,"target_local_id":"block-202","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[822,828],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6383a17204ed6aa3914f8ab97bd81e5401dea607822dd16099d82739a5a56410","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-203","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"16ccd19d0a41626c39923059bfb734f6c2f124fcb35791f47353ba73f805b7ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":831,"target_line_start":830,"target_local_id":"block-203","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[830,831],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"841dca170986a1b57e0895e1c01e8e7cd0da2438801266387a5a0b0c446b04ec","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-204","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b95d0e94b8a118a971d13491032aa97e630becd0214b250dd60877b56d5f1e2c","target_edition_id":"edition.r017.id-id.draft","target_line_end":840,"target_line_start":833,"target_local_id":"block-204","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[833,840],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a8a570488c0ad0b8a1a3c12346e7dc1d47e4bdf00404224379958cd6e135c54","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-205","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d5d80880af634ba527700ec6b8348197e3770d1e9a09dadaca92486ec930e795","target_edition_id":"edition.r017.id-id.draft","target_line_end":845,"target_line_start":842,"target_local_id":"block-205","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[842,845],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9add40f3e5e48d91636fcaf986c246e3abc0b2db1a9582104669b594355aebf9","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-206","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7a4c7a159558ec840a68b1f36033fb7bf0d973e9b9ab32a1b3c7bee915bb10aa","target_edition_id":"edition.r017.id-id.draft","target_line_end":849,"target_line_start":847,"target_local_id":"block-206","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[847,849],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"54a8f8d41a3914c94dcc740ac98cd3ef572ea135daec4fceb3d2228fc77386eb","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-207","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b8d462d440fe1146efa4aece84d92bacd383a1ac9d8627bb5acdd18b972d89e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":853,"target_line_start":851,"target_local_id":"block-207","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[851,853],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02b7215b3e5b0bbc0c5e05b2b569825f0ecbe5f12b0fb9c9f8fd935d038fbdb3","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-208","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4979f467d1deabc7de262345628765808b371a513e7e05f5fd22eb280c6ceaec","target_edition_id":"edition.r017.id-id.draft","target_line_end":855,"target_line_start":855,"target_local_id":"block-208","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[855,855],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76368fe8b024026b1c012606cd55fbe461f02765f5aa729ddec23ed79245c0c1","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-209","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6769801737ddf7704199a65e97aa5858fef3638759ac81294bc5d3b3cefb57fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":857,"target_line_start":857,"target_local_id":"block-209","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[857,857],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"66a79b496aeda62ee3df424143a592d424af377e70026c3e43bb94de702d6994","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-210","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c968a22330256b81c3b1bb872f7e79af1910a52c3f19cc4229671d928a82046d","target_edition_id":"edition.r017.id-id.draft","target_line_end":859,"target_line_start":859,"target_local_id":"block-210","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[859,859],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5f73c74aae8b4dd83f46e9a7aff80188b7ebe8e93ece0c84e75a9a88d6df565e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-211","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"41c699529ae8cd430ba762b88e0dccc760c0b2251c86786b3e64477867ec9830","target_edition_id":"edition.r017.id-id.draft","target_line_end":863,"target_line_start":861,"target_local_id":"block-211","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[861,863],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de45ed8ef042441e1d4d25cdde67f1acd18f42d744b78fb986babd1afd319221","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-212","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d32e3d7c310eb286e022b522971fa3b6e3b5de14d32575b667974d845a2fa1d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":865,"target_line_start":865,"target_local_id":"block-212","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[865,865],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"673c76fbd1aa4a1563b4fb90c2876328dde30192ecae3f9ded553b7ba7221e5a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-213","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"01af4d202afb9f8f1d0169c8960a1a8c0daa0cd245bf2c57c9ec4e4399555314","target_edition_id":"edition.r017.id-id.draft","target_line_end":869,"target_line_start":867,"target_local_id":"block-213","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[867,869],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"938a34c60aaca1502154de64d739cf4c701084b37caa5ec37726a6a97b755a3e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-214","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1c35fd105fcf11ccedeb622ee6908b1c7c0d145ffce60551d15daab19e59c1c","target_edition_id":"edition.r017.id-id.draft","target_line_end":871,"target_line_start":871,"target_local_id":"block-214","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[871,871],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c5b991e94ee0994bc1defabca7561a9c3106f15f753102b2ff960f3c3d2a8084","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-215","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"96e41b6abadb142ad013e664d0676d11baf4cf7cb4b6b787833ed7ffdb014bb2","target_edition_id":"edition.r017.id-id.draft","target_line_end":879,"target_line_start":873,"target_local_id":"block-215","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[873,879],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e6ab56dcb0f803cbc2727301be329356d9ca554cc2bc61323baa631b3f86db31","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-216","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"96287d35b4abdc7c0d6e15811eae4772e26bbdbafe78b9b95aa13016b033205b","target_edition_id":"edition.r017.id-id.draft","target_line_end":881,"target_line_start":881,"target_local_id":"block-216","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[881,881],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a593b86cd419f0ff3f539a51d004e29e96b8d466498731969aa4bb6b9be30198","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-217","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"55d9f1ef001995deb94b9f509f7ad3c9cb7a3399c7911bcd04f07d7993259de1","target_edition_id":"edition.r017.id-id.draft","target_line_end":883,"target_line_start":883,"target_local_id":"block-217","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[883,883],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"13698c40d8acb9bc2338451ca8d886f263820a3ad8d7b0dedf049c8486355bdc","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-218","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"495702a7cc2e42defd5c52b4029344260fdce35c28cb3ffd5d99f29e8d196a6a","target_edition_id":"edition.r017.id-id.draft","target_line_end":887,"target_line_start":885,"target_local_id":"block-218","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[885,887],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4fbdc6f724885d12c9da4a19f1e57320961382b6e341228e3036fb7aabb05ea4","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-219","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c78685ab26d4db47ea482ae1e9fddba74141aa4cbf4bce7e09c8e31ae6cd17b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":893,"target_line_start":889,"target_local_id":"block-219","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[889,893],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4252c2e5c45dfefc7602211aac2b06c459c226f76402a9888465171e8e608f9b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-220","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3d779f53ac1d7b53fd659b9852cb883f22532600084a1fb40701e9ebdb4ce33f","target_edition_id":"edition.r017.id-id.draft","target_line_end":900,"target_line_start":895,"target_local_id":"block-220","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[895,900],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"220b6f3ee5a04cfb407637871377583486bb61eca3d801f48146723f84a0f1af","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-221","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"38ece29aa6847a78865069b32ce6bf32b61a1e9ffb08e692a85e256af007eec0","target_edition_id":"edition.r017.id-id.draft","target_line_end":902,"target_line_start":902,"target_local_id":"block-221","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[902,902],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"75b9c190efa95b81863cf49e2049c32b066622dda24906582a92b9c4597048ee","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-222","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"adea229938b81e90a91cf9ba68e72869f9ea47612334c670dd8f2cb07ba3213f","target_edition_id":"edition.r017.id-id.draft","target_line_end":909,"target_line_start":904,"target_local_id":"block-222","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[904,909],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94cd0d83ac2a6aee892f15d98c88dbcd6e4f8065c7a0d3b0e2128512ce447e42","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-223","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c795ae3da96f36a80f43d2e19523c92e97f21eacdf3a15e27546aae336c4de6e","target_edition_id":"edition.r017.id-id.draft","target_line_end":912,"target_line_start":911,"target_local_id":"block-223","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[911,912],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"261278055202993a34964222eab783cffa93b049d4cf50e6207b6018d674a13a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-224","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"221de6db5976ef67b7360cdef9b26d2244058b4fa33405595363123d0de16134","target_edition_id":"edition.r017.id-id.draft","target_line_end":915,"target_line_start":914,"target_local_id":"block-224","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[914,915],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e754960a4197274c98f228ac92871d43c824cca6a4293df1f3ca7a37b2783969","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-225","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"44b8d12ade30da453f05d1e2e3fe005ae44c0ed61788b3e316d0c749bba8c47e","target_edition_id":"edition.r017.id-id.draft","target_line_end":919,"target_line_start":917,"target_local_id":"block-225","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[917,919],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4b1800db625a72fbfb951873f293f79435d891926889c8b67de07c44973b788","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-226","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4a22ddb8c17bd3a714deeac1334bb787de1f86345d32dbe4e4925acda37988bb","target_edition_id":"edition.r017.id-id.draft","target_line_end":921,"target_line_start":921,"target_local_id":"block-226","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[921,921],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7711601caf7bb5d640e6c24155642aa1e3b64cded5c1db4092a35b5336dfca56","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-227","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a4a836a8b5a548472e64d6b2411b16df17c028f4c36009e86438b9ef7a3c5faa","target_edition_id":"edition.r017.id-id.draft","target_line_end":923,"target_line_start":923,"target_local_id":"block-227","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[923,923],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6513f64a88457e273d05b127d5c6fbbccd1302ead3cabea5fa5dd81a937872a0","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-228","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"afc6ea64a2eb48b339f993147cc2b7ff7c67517e065e3302e28298563978a1ed","target_edition_id":"edition.r017.id-id.draft","target_line_end":929,"target_line_start":925,"target_local_id":"block-228","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[925,929],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4e115a7107fb16bc6e2f16c03ac8a6708d12f210ea17bcb7bf83aba4d8a9909","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-229","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2db35c33d1d5f7516b7c71cf9764d579c9bba1cc2f921dc9cb6c720862e11699","target_edition_id":"edition.r017.id-id.draft","target_line_end":932,"target_line_start":931,"target_local_id":"block-229","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[931,932],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7902f2b91e0915ed6dde0cc871836af51189d8e94135efdc452bf36f02f9ea48","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-230","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a0ae940c044c1893f529fa453173b339220570d2691ad1f566013f2ffd3058f5","target_edition_id":"edition.r017.id-id.draft","target_line_end":936,"target_line_start":934,"target_local_id":"block-230","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[934,936],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f8c6068667ee76b61198e4c5097f7edb22ec9e1e41ad739a6dd386d16e112057","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-231","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f22f6fcbe19a464d483fdb577e01651b9918a4dbe157c94c7cf4690d4184843","target_edition_id":"edition.r017.id-id.draft","target_line_end":938,"target_line_start":938,"target_local_id":"block-231","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[938,938],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed3965f64c9cd9385619deb914aafce70183d474fa5629c98e7e121200d5bcb2","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-232","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aa551d33af1fbde497af84af93b8bf7ae950358be5aa6c3afed0fbcb20145dd2","target_edition_id":"edition.r017.id-id.draft","target_line_end":940,"target_line_start":940,"target_local_id":"block-232","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[940,940],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"603044de8c78678cc3b688bb82448032c0ddd809de5f1914e973f67884e3f12c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-233","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8ef049a3f99db59f81df586a3194f04931cb84572a511ac931aec5916c8874a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":943,"target_line_start":942,"target_local_id":"block-233","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[942,943],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e1d78a0fb1639e2101e0f0253502af735cf32a14cff2f6ca42a1aec8ec460854","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-234","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d75a05bcb6f72b3f343dabd42090d5a5947dbf8fdda8e47b85ca83d47355b116","target_edition_id":"edition.r017.id-id.draft","target_line_end":946,"target_line_start":945,"target_local_id":"block-234","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[945,946],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"98b099af523d4d4e19b6305d488dee229bf70cd923e913b7d26f6dae4fb69aa6","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-235","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f9b1951a1ce3a11f26e72c68f9e2e473e98707b7f5c06984303e4dcd8ce7157","target_edition_id":"edition.r017.id-id.draft","target_line_end":950,"target_line_start":948,"target_local_id":"block-235","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[948,950],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b01ebf82b530a6ea030e1cfff6a922e8d829056482871421759958d4f99a4ec5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-236","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5fc0649e6f6cbaa930f05d00394f90434bf0fb5da16ef37aae7707454cfa7f46","target_edition_id":"edition.r017.id-id.draft","target_line_end":954,"target_line_start":952,"target_local_id":"block-236","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[952,954],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"34e4a39781ad35ff9869ae6fc40dbf5220a8dfec969bd34bbc94a58058d49f1c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-237","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"81f6df080676d12d7ceae16203848afcc3e0fc8c79a31d22b0817090e68c4100","target_edition_id":"edition.r017.id-id.draft","target_line_end":957,"target_line_start":956,"target_local_id":"block-237","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[956,957],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e4beb0ca843509c9e962991e7bb06eb0e9973073cf27b9c916b3405c36616610","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-238","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"82d3db500e47c3c03a2dd05a61fa9e3ee2f19c95a6580f813a044fafe74ea062","target_edition_id":"edition.r017.id-id.draft","target_line_end":961,"target_line_start":959,"target_local_id":"block-238","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[959,961],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f63d5c107a6a73ee6999d0436fd6fbf1f11e127249ee8980f308db9cbc11e529","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-239","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3929a9efcd67f48d746c069c1a5d45319dc06e91e7f8f23de97482fd08cef525","target_edition_id":"edition.r017.id-id.draft","target_line_end":967,"target_line_start":963,"target_local_id":"block-239","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[963,967],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9bc144e038a4bd17306e490124e7daa73fa8a993d0ffa2abeae140f0c917e777","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-240","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a8b13d31677b9d5336f2b9aa7be9e0ccd77ee8be8af661fa2be686e00d15758d","target_edition_id":"edition.r017.id-id.draft","target_line_end":971,"target_line_start":969,"target_local_id":"block-240","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[969,971],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f42ce46dad199de71bc9c44b9439c7c9de0b4cc3918f19cd0a0d51711700513","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-241","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f2b932993e593910dad6a4b63c54f86fb7010595647f39fb59c7c34e2fd2dae9","target_edition_id":"edition.r017.id-id.draft","target_line_end":975,"target_line_start":973,"target_local_id":"block-241","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[973,975],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23511517bc3b32dd7eb0aab5111c5648bace57f472fd7c0880f287585a87cdbf","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-242","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d9928931ff1b9699adf745caba1369c4dcd3a17ad178681e4d7f27a6331e68d0","target_edition_id":"edition.r017.id-id.draft","target_line_end":977,"target_line_start":977,"target_local_id":"block-242","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[977,977],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1943468a7cffbf119a57d7e80c45d03c491d0288207b9659cfc8a3336b654097","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-243","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2fc984bf6b1973a8f963c22692efd43141b1816d1120143741d60b31a9049149","target_edition_id":"edition.r017.id-id.draft","target_line_end":982,"target_line_start":979,"target_local_id":"block-243","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[979,982],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5edb991a2378e111610e125244a4b96e89b7e3035ec0084a36cff2c300c57e08","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-244","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c916c1171bbb4a9601559f22dea84809e97d5717222e2c39cdafe54926780678","target_edition_id":"edition.r017.id-id.draft","target_line_end":984,"target_line_start":984,"target_local_id":"block-244","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[984,984],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"66fbcea354d373554dd6335dbefea70109c58eba3a98c17edb58d44e23c4253d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-245","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"81626603b84e302b3e30a7d228d41fcb8c1e9072c66b731e9c7e9951c147244a","target_edition_id":"edition.r017.id-id.draft","target_line_end":992,"target_line_start":986,"target_local_id":"block-245","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[986,992],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e9e6c2935fa7df822ce64f113499f31d9e4e94246750b94312ad687f6711d7a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-246","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6c369c4df4b0257849c0e72f95763a62288f6f1dc6f9c3ac35d0233b94b22eba","target_edition_id":"edition.r017.id-id.draft","target_line_end":994,"target_line_start":994,"target_local_id":"block-246","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[994,994],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61ebbfb0dcef93eb621ba8859901676e914bee933633dc980aa9dbe273c275cc","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-247","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a53921d2109d4be0a8ffaa7722ddc32904acf876c1043313af9cee17071c2787","target_edition_id":"edition.r017.id-id.draft","target_line_end":1003,"target_line_start":996,"target_local_id":"block-247","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[996,1003],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0773c4e9191a492167881d296264b3122f582f9ad49747981bf3aefa202db4f8","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-248","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f946ad35901b5d40002c1452cd4f571b0f0583483e4b7e8b5e511620edc43d58","target_edition_id":"edition.r017.id-id.draft","target_line_end":1008,"target_line_start":1005,"target_local_id":"block-248","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1005,1008],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e300fa5db4a6d8cc0022184b29b595f4f9b4ed1b790fb9229b9b0968e14aebf","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-249","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd47870702b0415b020b26ac73801d745e569bf0f9420d08e48247dc0f4a28fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1010,"target_line_start":1010,"target_local_id":"block-249","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1010,1010],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d9619cac945b42b23be56477fa51ac2351ab0571554efc22b321f778908a2bb","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-250","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d6fcb6d8f80687ea836aa64fc6f7f71cb80354dc838861516ca32d4db76e3c12","target_edition_id":"edition.r017.id-id.draft","target_line_end":1013,"target_line_start":1012,"target_local_id":"block-250","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1012,1013],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"16091ef7f767140477e5466e3051e0c8e0c32dda409792acd519564ce7e78e56","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-251","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2fead248a146577e743b4f7e3a5d943d9daa8d0e1afccf74fe3203e95607b5d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1017,"target_line_start":1015,"target_local_id":"block-251","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1015,1017],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"99acbe2df2408248fd1c6da73f235ae096cf12c9d65020943c6ff0c3be7dc9b4","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-252","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"545e7cfc33a41e562d2485cf0a92742ba9427b4b3608f140472c1224d39ed882","target_edition_id":"edition.r017.id-id.draft","target_line_end":1024,"target_line_start":1019,"target_local_id":"block-252","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1019,1024],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26b9799998b349f69332da1d3921cd83052b9a3e8e0d72c35608801419677337","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-253","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a4a4d8003f50c412e6eaa976923b592f0d26c51954026c4ab5c534416a348018","target_edition_id":"edition.r017.id-id.draft","target_line_end":1031,"target_line_start":1026,"target_local_id":"block-253","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1026,1031],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb4fad2580ed43f9035ace948116d1bce82dbdfa00ada5ad5f09f5a730a91a68","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-254","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3fef2e3addcde6fecbf2f8694d54a1031c2cebffbf9ebf635cbabe85d808acac","target_edition_id":"edition.r017.id-id.draft","target_line_end":1035,"target_line_start":1033,"target_local_id":"block-254","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1033,1035],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4da3edb3dc373e25cc68e4e01a7e096c1c1ec4857b369621ad15b14f39c3135","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-255","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3ab38507e434e48a148094f72939c2053068d72aa9a26454c81a8cf99a193435","target_edition_id":"edition.r017.id-id.draft","target_line_end":1039,"target_line_start":1037,"target_local_id":"block-255","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1037,1039],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76fa57f03dbedd5fa29c814f11a124095d8aa5ae8e3a9d7e75f29d15dd1a8149","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-256","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"276fd9f5968e78b3c4a7d7c0dd6d6568cf1cfff9ea9a7260c50c84a48f113271","target_edition_id":"edition.r017.id-id.draft","target_line_end":1041,"target_line_start":1041,"target_local_id":"block-256","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1041,1041],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84cccfe50abad5c86b79e2b6a4bb58149228f57e6a6a97ed2e49921a7b22c149","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-257","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"457c6d41a3c4f67d79481e5f4d4f5c010295109c1c8b14eec5b9c680dcffa97d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1043,"target_line_start":1043,"target_local_id":"block-257","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1043,1043],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"86e5ecd1db8c29b30b5530cc03f8b7c1e8b883f0afbf089c004a46c9d53c28a5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-258","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6a7608b9b858eed07a4be886dc9ab2190b7ee38d6aac46991717c0ce933e7272","target_edition_id":"edition.r017.id-id.draft","target_line_end":1047,"target_line_start":1045,"target_local_id":"block-258","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1045,1047],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ba6e040a90a085a8ae22464b3f882365f87cce23e7ae3a3e3d62aa1eb921bda","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-259","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"99bc2703f847d8bdc7b16f0b2b556427c2c61a4d7ae62bb38ccf5f1bc8a98fdf","target_edition_id":"edition.r017.id-id.draft","target_line_end":1049,"target_line_start":1049,"target_local_id":"block-259","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1049,1049],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a404f8776814170ecff7cd7e61a0ac5d2c3fb92d88ba099723f10019503319ca","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-260","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"21a522f5d45aad7c86b58a570633a1d0f455a95eb74b924df35544910ff6416b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1053,"target_line_start":1051,"target_local_id":"block-260","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1051,1053],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48f094d1f9346116736da94153053d9162e625137cace611c951af8d7e82d2f4","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-261","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"84d3d6c3db34c4c9777e197b2168622d2387d2a21d01623434b7307d9c155944","target_edition_id":"edition.r017.id-id.draft","target_line_end":1055,"target_line_start":1055,"target_local_id":"block-261","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1055,1055],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c17b17e8c425bbe645f9161a2f6cefcecad5b535cde0088ef9d0322f1d66b5d6","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-262","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7ea2b6fd98eccdf022979245a8435be9197afc42fda2496567a2ca781e23f247","target_edition_id":"edition.r017.id-id.draft","target_line_end":1058,"target_line_start":1057,"target_local_id":"block-262","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1057,1058],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a62efd7ed984e2a79bfc962718704884d264c99148a013929dc67d63658be64","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-263","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b61a58e5210b0e0ae2bc9888a2666e09e135104fbaca1ec41adbffb67ffadf2e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1060,"target_line_start":1060,"target_local_id":"block-263","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1060,1060],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0425070ad459b88ef86e428129e984143411831e79544e4d186f82f7108f070","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-264","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"76f145d1b77cedecb04a5a2418197916d0a2548e518232a1a792083a32e2175c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1069,"target_line_start":1062,"target_local_id":"block-264","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1062,1069],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c291ef3d49e06c149b8de19fd89d67500b1eb05972808d5d1f23c005abbed26","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-265","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a83b3642890cbb3331da22eb207ebc436a87ee511ea771577ea81002652c7fcb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1071,"target_line_start":1071,"target_local_id":"block-265","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1071,1071],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3356f8d710b7b03851feb5624919dc6b10e18a363a3de1482a9996cde0c610e4","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-266","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e92b33d7dc881382f49ffd223c9960781408825f45757667f10472a50ee1a250","target_edition_id":"edition.r017.id-id.draft","target_line_end":1074,"target_line_start":1073,"target_local_id":"block-266","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1073,1074],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"741e086216a948274e2d012bddacb4f1b911a8694a1b6e3800ac2753ab1a5ab6","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-267","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ac083a9932fa7b6903e86d6ee93a9f3ff8642fdfb095e93b5d806fc97ca1fb61","target_edition_id":"edition.r017.id-id.draft","target_line_end":1076,"target_line_start":1076,"target_local_id":"block-267","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1076,1076],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d58793fc94baccdce49fd7307b8dcb7d081dfd467ed324fefae9619feedf6663","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-268","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"02bba89df75c174c53d7430a3a3900c9cf4ec0560519a3969d462713956e7b49","target_edition_id":"edition.r017.id-id.draft","target_line_end":1088,"target_line_start":1078,"target_local_id":"block-268","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1078,1088],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d623f50e7f24a98236cb174c647537720c26e86c71659b00291a6c7ca9cd4d5e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-269","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1090,"target_line_start":1090,"target_local_id":"block-269","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1090,1090],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e4aca2084007a8886631e2b78ad4096662f50b49cecdf2f60207209e7665096","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-270","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3eebca5c2123596569226bedbf0ecf761f436ca44fb04f4ba414c9a349945e96","target_edition_id":"edition.r017.id-id.draft","target_line_end":1099,"target_line_start":1092,"target_local_id":"block-270","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1092,1099],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d07a6040b1de07f96de2e3d497cae8c612cf0b98d79dba7b9ad35b86802890be","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-271","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0191fd37d078fc088304b5fbb0efe1dba884b429f0a59cbde1286169f11edb02","target_edition_id":"edition.r017.id-id.draft","target_line_end":1101,"target_line_start":1101,"target_local_id":"block-271","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1101,1101],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"42440049b3c0fd20505263c42e0697c2721821c3122186457d3aa947698824c9","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-272","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a0c2674858272127e7245078522776d184dba3aad901e536a86b27dd643b6152","target_edition_id":"edition.r017.id-id.draft","target_line_end":1106,"target_line_start":1103,"target_local_id":"block-272","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1103,1106],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"056e1b4c58c14cb7dd2604d67bcef5af802b1b3d504c73df42176551e6c9f402","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-273","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"595dd6a054e5fa8c7ed1767cfda2dedd26a44bcd23a5ff0235d8a7c9e86ba45e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1108,"target_line_start":1108,"target_local_id":"block-273","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1108,1108],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b55907d27ac7b052b8030bd9e675523acf59236ee642dfeda579f2dd14c6f983","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-274","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"54a1680b80c65d12e570d383c7c52619641de2547caf4979a898e566acc79d50","target_edition_id":"edition.r017.id-id.draft","target_line_end":1110,"target_line_start":1110,"target_local_id":"block-274","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1110,1110],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"67c15ab7b57154f2425336e5cb387fa83ee24b711948c334d273c5f5518a3dc1","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-275","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"849a128131e32edb8ee24e6d5b6cfddd81144362e9a202ae87063557eaaf3328","target_edition_id":"edition.r017.id-id.draft","target_line_end":1116,"target_line_start":1112,"target_local_id":"block-275","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1112,1116],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f1b614ab8319a7f816ac9fe5b8e265526c73857907dc6a2c11c87088dc6fdac","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-276","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f9b432d1493ef18495422ac9bf16f0d4a72e489a5062dbcc5ae2cdd5637d8b00","target_edition_id":"edition.r017.id-id.draft","target_line_end":1118,"target_line_start":1118,"target_local_id":"block-276","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1118,1118],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a314917bba16a00920e596e0e82ba5eb86b5a825940877b54bf8f5fd4d310014","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-277","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ef8560f6edccf7d0947f8fbae35abfaaedf25aeb34a4ead63f8ddeb793f5e9dc","target_edition_id":"edition.r017.id-id.draft","target_line_end":1120,"target_line_start":1120,"target_local_id":"block-277","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1120,1120],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c7d6e1e75f15c1e764c2679e0818abc5be26ed97a8a78bd3c999304a683d65b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-278","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"946f81e42955c9d960bc8da4a8294f4452d5c482bd7719dfcc799ef27b47b714","target_edition_id":"edition.r017.id-id.draft","target_line_end":1125,"target_line_start":1122,"target_local_id":"block-278","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1122,1125],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e9de11498722162e33d94f80b484b0f53786d7f79a440da47c946c7480ca028","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-279","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b4c4186a7b40cb95d73540bde5981fa5e445579dac87b202d478c828f229332a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1127,"target_line_start":1127,"target_local_id":"block-279","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1127,1127],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"facb65e46eb7abca8d5b0b182ac1086db13526b1f34021b203f0e48a65d37859","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-280","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8e80e38b360485627654a086ae56ac52ab697e216d832458edee28ef80ce160a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1129,"target_line_start":1129,"target_local_id":"block-280","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1129,1129],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a1c5975c2a064ef365aa148b2dbdac7017c7f7cfdf83e45b0613598ee98cd4d3","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-281","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4ae48bb9a643e6501fd412f6f214c3da722976354bbd0e8597d546989af4ac89","target_edition_id":"edition.r017.id-id.draft","target_line_end":1136,"target_line_start":1131,"target_local_id":"block-281","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1131,1136],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76834e7361e7977117c0f8dbb2e3b7141c1d852305406665e00cc04dfb467063","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-282","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2328050f2b023915eeaa2c30756a3d0c5b550f58fb12e27d143f66d2d4ef2c26","target_edition_id":"edition.r017.id-id.draft","target_line_end":1138,"target_line_start":1138,"target_local_id":"block-282","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1138,1138],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"70af584669dab44187847269aad64bdb071bb4aa3c3cead8863239db38560074","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-283","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ad108cb9be7a40ca77ea582e1d5c938c349602aa21521a9754526de2739b484b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1141,"target_line_start":1140,"target_local_id":"block-283","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1140,1141],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7084e8da92724c97b06f9432edb2a35d4ed8e5508e8d6ef1455438bf4a7a2c9","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-284","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b82247b6996e87b23a0a2b4c18c237960aa9efbc886d4358477c0bc62fd7d4a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1146,"target_line_start":1143,"target_local_id":"block-284","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1143,1146],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b3b369fc804c6133558c7b37176a364a3d476a64543d3f6410c2db045f5e7bf5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-285","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"67da17a60969d24c61a0b8678f7bf744d4647a423594329af66d11f141d7473f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1152,"target_line_start":1148,"target_local_id":"block-285","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1148,1152],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e050b22cb82e6e4e2baaf8c816e80bc95000cc14217986eda23c216b7d2859de","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-286","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ef44afef9c409eb221774b43110226292cfb96f68d485037449724dcd310d43b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1154,"target_line_start":1154,"target_local_id":"block-286","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1154,1154],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d1bb6fd546cf219d4d4daf9be1b78b8beb66df8f1bb85589fe3c82152f8de23","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-287","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c3ad995e3e865647150879b28945b734aac2678eb407972ce8b58bad1b9af4ae","target_edition_id":"edition.r017.id-id.draft","target_line_end":1158,"target_line_start":1156,"target_local_id":"block-287","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1156,1158],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b623431b43f747927fb83e82ef851058c82daabea8c6fc2d0564a2e817da9ef","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-288","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4fe054906459b5bf652f48f342e164e31889e117151565285d2d917d5692922b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1162,"target_line_start":1160,"target_local_id":"block-288","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1160,1162],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d873fc5fb460d67c93db8cf8cb9dc9afffaf06bb8a2e043e4a422db651ff598e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-289","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5a021b5ccfae538fae2ff539f3db175418f5de496d250a18db07ba0577ff027f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1164,"target_line_start":1164,"target_local_id":"block-289","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1164,1164],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0c2d827bfb4a6f97681d4820636f409390cbb1ef9f3a94f8c9731555e8dc258b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-290","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f06f8ebf629c03b4f36b80f758dc50fe076624ac1e7eb52ffde7e1001a7c896f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1166,"target_line_start":1166,"target_local_id":"block-290","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1166,1166],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7566e3dfb6abd66ac92a37123b4efe47c947ba5c0b0f3a65f0352272fb23b115","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-291","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5effc7c5990a4c3cdb3af16277bec515ddded421c5d129deeac9995f0bb1fb12","target_edition_id":"edition.r017.id-id.draft","target_line_end":1170,"target_line_start":1168,"target_local_id":"block-291","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1168,1170],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ddc4238de53ee0b2e8ccfc85f152b0828562841e7db4affae9c54209f142f690","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-292","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"55443182e8d5d4890bed5f240fd94a14982de5170920df12640640e743660a8b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1174,"target_line_start":1172,"target_local_id":"block-292","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1172,1174],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab61bd0998550534b4cecac4b0f824c71bf69b1084cbf2ec17ee8d7f552e158a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-293","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"902f5230e4ade7554bacc7dfc36274020adf59c6982ee25ba89ad175c2403818","target_edition_id":"edition.r017.id-id.draft","target_line_end":1179,"target_line_start":1176,"target_local_id":"block-293","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1176,1179],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e2e0e7864f518dc4b2e130343f4d85089ce231d7d3b340182198949880d453a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-294","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aa451c9898ce34c4893533cc574e7957724e734bd1ca27ebf372e1d5f09b3ada","target_edition_id":"edition.r017.id-id.draft","target_line_end":1187,"target_line_start":1181,"target_local_id":"block-294","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1181,1187],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f124e470fa35aba44584114145c2e1229abde393619def48daee46c5a86d5ee","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-295","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"538921c08781630b360df4a34c51fbd899502c8663bda3096d3bd57ed945b640","target_edition_id":"edition.r017.id-id.draft","target_line_end":1189,"target_line_start":1189,"target_local_id":"block-295","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1189,1189],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6b4debb54c8ccb29ec7830cbb99e415248d0550886c3fe9837df9ff3f695a95a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-296","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4f9f5148ab5c2b0e7c133497878ce0d1909735cc9a82e928a412a0bd111475f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1191,"target_line_start":1191,"target_local_id":"block-296","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1191,1191],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2ea50ce535538f7bb853f872d670f910818e4cf7509d608c180cc76a6d956c84","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-297","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"04c2575d3f862347bd4dfbe1940085cfedcb46ba609d6c6d20734b39ef1136da","target_edition_id":"edition.r017.id-id.draft","target_line_end":1195,"target_line_start":1193,"target_local_id":"block-297","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1193,1195],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6d907ad46110c92242b3e3f93c1c8b7bbce009b7d1586f59959ccb7c67e58ba4","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-298","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3c8932855a02aefff412796358adccca2961b9dc0adaaf2adbcacd75f8ed53fb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1198,"target_line_start":1197,"target_local_id":"block-298","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1197,1198],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d23cc37dbf8c52df43eae614523df7277a628a95bd98be88ef2ea15e57e29c5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-299","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6256a530a5f975f3591021823f27222b65bd94522eefdf50a470ec4a9b8e66b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1202,"target_line_start":1200,"target_local_id":"block-299","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1200,1202],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48685411ae6550bb36ab2b7fb56cddbedbd42b5514741c75335ef3d7836766dd","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-300","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5151653d1497b93ab2e920f0c0f1932916cc6f6057cc4f2ec8e3991954bb8877","target_edition_id":"edition.r017.id-id.draft","target_line_end":1204,"target_line_start":1204,"target_local_id":"block-300","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1204,1204],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"157648b339559ad051d7239f2128337b4e3285c1acac8398e6476cd6adf463c3","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-301","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"352570f0dd41931763122d70392989f7350e4d1e2eec9c1824d8486df93be2a9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1206,"target_line_start":1206,"target_local_id":"block-301","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1206,1206],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e4eeb8e96e394fff10390239aa23335de143ebeb16ca736bcaf974d04de8e7c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-302","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d4a9228ddaa07dbc74a039204188e4e312c13f8a077567b23ceb476401d681ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":1210,"target_line_start":1208,"target_local_id":"block-302","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1208,1210],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d73f766c50d1db2c72aee4054d449954a85de20d3d6878f64dddfe9d8bfd0d45","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-303","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"89833295b342d62662598e9b3de690d6de0cb6ffb5b3e7c251c5bf38d20595f2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1213,"target_line_start":1212,"target_local_id":"block-303","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1212,1213],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f5bf7698b7c8a57386aaf9d82e060b3ee342453bc3a3a3f199f14f3334f1cd2","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-304","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"24e6961604714397c2dce0506def06f4b487449027959cfad2ede7f90a52da2b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1217,"target_line_start":1215,"target_local_id":"block-304","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1215,1217],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7ee260493da03e88981497c0f0955624f2e043be5a7f9a555f6e883d382bd64d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-305","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9d1ae6b64dacea84d218afa878eb90a3e6a4d4590b11c4c26318456c8c61c6f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1219,"target_line_start":1219,"target_local_id":"block-305","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1219,1219],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa701db7e684b959dfc6dcf3289b4fe2bafaccae3b7e4c82acea5eca89fd634d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-306","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ef80deeeef8cb24ffec130f8cd7dd2ff3e9a30a802ffa45e1eb6f81988a3d3f1","target_edition_id":"edition.r017.id-id.draft","target_line_end":1222,"target_line_start":1221,"target_local_id":"block-306","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1221,1222],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e3ced1655884d1e1050b8fbd295a9bd4a98fe6ebad5042cee0d34533132fdb07","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-307","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fec0342515683da8dcf228ce3323ac3bcece33288be3374b062a633a8efa0310","target_edition_id":"edition.r017.id-id.draft","target_line_end":1224,"target_line_start":1224,"target_local_id":"block-307","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1224,1224],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3f90e2f1b561bea35fabd57efc6993c23b8aa82ec4dc9a107e64a4523990ffbe","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-308","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2597516b57fc21f6c3b788354149ba6c62d06bdf7a75e2798308684e043763be","target_edition_id":"edition.r017.id-id.draft","target_line_end":1228,"target_line_start":1226,"target_local_id":"block-308","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1226,1228],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76a824d5ce237c9186ab28aec1184e682a9b954d525afb24a3eac9516046e619","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-309","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a546fcf61f505015adb54f654ebb53f99cbb7842a16423d5e8efa20fe6592c1f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1232,"target_line_start":1230,"target_local_id":"block-309","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1230,1232],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a566dfbaa2a968c8e0b9658e8661dd681c39301f569e71e30b054cd3c7723e9","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-310","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a4f497a03e6df98eb3a65084aedd76110be6cb81c94fb0fea5cb369245ba529b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1237,"target_line_start":1234,"target_local_id":"block-310","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1234,1237],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e1a65d889f93c4fd8d37cb1c60f7687bca465d46c4b5511fd0e288fc956200b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-311","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"916b2d1514061fbedb9756d5b935b8963142bb1f24c9d883e20a6e9245939afe","target_edition_id":"edition.r017.id-id.draft","target_line_end":1240,"target_line_start":1239,"target_local_id":"block-311","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1239,1240],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b68eba1685c3ab20a5d128c76408a11a436a20659cf41e1296c18e69838e0f89","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-312","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8912a01b7014de5c39111ced824598012a5fac5dca57a20a7c38d1186cc1a90c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1242,"target_line_start":1242,"target_local_id":"block-312","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1242,1242],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b400ede095d04b5d2afa88d339efa41a278644f8c92a7b9a57787a8308d96376","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-313","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4e741aefb8a2a10a196681672908d0ace602f85f3ca805389f2cf0bdfc4c8165","target_edition_id":"edition.r017.id-id.draft","target_line_end":1245,"target_line_start":1244,"target_local_id":"block-313","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1244,1245],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7afb0ccda8c747af7ac697ea109afb777dc42f3f81f877f2121df4ec0939c760","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-314","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"245addec5ee4257448f6e44138f38f479a2a5091bafb45ac22d4290ee2e0ab03","target_edition_id":"edition.r017.id-id.draft","target_line_end":1249,"target_line_start":1247,"target_local_id":"block-314","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1247,1249],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1022996d649163e9669faa099bb7f4f883516367dceeb21853373bbace114034","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-315","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"00bc2d149f2527a5c4271bb95c8578a8ba8fc6c032bd0b5c2ec0d202f0df9efc","target_edition_id":"edition.r017.id-id.draft","target_line_end":1252,"target_line_start":1251,"target_local_id":"block-315","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1251,1252],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20b3f3d5a33fa2450a4b60d9048a23cff143c72d02d438dc13aeb9dec914eb25","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-316","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c280f70cc98026772f39122df52ba8fd919aed4d35a9552985f9813c1492b205","target_edition_id":"edition.r017.id-id.draft","target_line_end":1257,"target_line_start":1254,"target_local_id":"block-316","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1254,1257],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80bae6d1c1ce619496e789caa94a9202c923e9f19390956506323f6436da81e2","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-317","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"46e60548dae512017537bd3383e7878156edfb9a229fdd163b58094db69e5f5c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1260,"target_line_start":1259,"target_local_id":"block-317","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1259,1260],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e7f59b01201d3eabfd7cd66abc0cdedc8302a08d3718054cc2b630b842f9748","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-318","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fe71c36f6c567909c80cadf03630a79882ca84d313518498c947cee79a7cca32","target_edition_id":"edition.r017.id-id.draft","target_line_end":1264,"target_line_start":1262,"target_local_id":"block-318","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1262,1264],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"118a4833b888b03d664607a116fecb9e2370bf8f4140dbbeb52863a51faad061","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-319","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fb0d914c330c85854b5697c074a1c3f48cc144da81e9814a3e0a8d2d940b3fd7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1267,"target_line_start":1266,"target_local_id":"block-319","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1266,1267],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7088b4a7bf85473aafa317d6842df99650eb27c6217b35a29bbe3ea5f36d4de0","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-320","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"adea3b6d7d2113902d7e1fca510d41e659736cb4bb5322175cc01e9f3ccb9860","target_edition_id":"edition.r017.id-id.draft","target_line_end":1271,"target_line_start":1269,"target_local_id":"block-320","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1269,1271],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4525a4a9718f8351a760fd244df552c8a885f4c52e7458b46806a01c035350c3","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-321","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"78bb3b089bb68dc759646a996b3234027e2f5b8fceaf3b04f2d0fd09cf2b5416","target_edition_id":"edition.r017.id-id.draft","target_line_end":1275,"target_line_start":1273,"target_local_id":"block-321","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1273,1275],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6d81c364b8611a6c891d890d79d6925749b41c65b70da424866efe6c8abeeb8","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-322","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d4aceff3e3ce8ec20ee4425dde26c759a37620b6466c5c1389d5960871c66980","target_edition_id":"edition.r017.id-id.draft","target_line_end":1278,"target_line_start":1277,"target_local_id":"block-322","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1277,1278],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"684f9bdac6f4302c8ec03d27984df5fe9a0cab6beb7d5b842e6f6c4d970036b5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-323","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dab292b943140601fbd408c679103a5b1bcfdeb653379f9b31f2d1cc92fd5d96","target_edition_id":"edition.r017.id-id.draft","target_line_end":1288,"target_line_start":1280,"target_local_id":"block-323","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1280,1288],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"58673cad9d27ff5f924d771b7eaa22eba4a19eb6c8f729fc1b83b14d8f9a196c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-324","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8168d8500eb6f13b5e4c68926bfcb6d71437919109e393cc82347c90c5ed6f44","target_edition_id":"edition.r017.id-id.draft","target_line_end":1296,"target_line_start":1290,"target_local_id":"block-324","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1290,1296],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"05b577f277ca62bfa9e2223791589f5c1b09f01df0597a1c162b9b2b573389c0","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-325","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ad63cc20e2ea4df7efb3f1fa45a518c843c60c286569d1918f681bee2ef4a317","target_edition_id":"edition.r017.id-id.draft","target_line_end":1300,"target_line_start":1298,"target_local_id":"block-325","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1298,1300],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0636948c457a1b8b52ac90f3e6c5255f6b8a33685d50c0adc91a9915c5ef5a8","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-326","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6aeccbe666971cdd7a2944b5d6b855923a214e7c49f452bcdb164464da0fc9ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":1302,"target_line_start":1302,"target_local_id":"block-326","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1302,1302],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bceef03b9b2b7b1c4ad08427b0e7784370af3d3c0b5787184bbb847d4d938a23","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-327","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7b8c213cd2455fb135d3756cf35201360fee95ee673a7828e11e94a998f5189d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1313,"target_line_start":1304,"target_local_id":"block-327","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1304,1313],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57c79422cb80beb4dc103459edd3e39907b34dc7742b39e76965a1743a4cf30b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-328","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0deeefb44a24bad845ade105664c739f9a8f5bc1eea21a467acb6a7984c160a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":1319,"target_line_start":1315,"target_local_id":"block-328","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1315,1319],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dce43f06eb75db1573325c60f00a8d96e1784eefe3ee89057892f022afa1ed39","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-329","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5542719b9a766a6216e45e4016215cfb3acca98b745e201dbd2d8a69a89c0b5c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1324,"target_line_start":1321,"target_local_id":"block-329","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1321,1324],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f4ca6fc97b89956aed44838a7354698d99e3a4a0f004c5845239c69c97ccf554","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-330","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"af9fd36eb1fc94709bf137dd5c62adb866f795d60492ff58bddad7e289c505b5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1330,"target_line_start":1326,"target_local_id":"block-330","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1326,1330],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cbb1a21ca36d5f49242f385e7146f3b5e9b1baba25358cb49a29260dd25b768a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-331","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9200e4953c2ff16a5d67e4e2f2d8f321fab40fe3c0289862f58215ca637573b5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1335,"target_line_start":1332,"target_local_id":"block-331","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1332,1335],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"679bb25614024e0f5e4dafc94a4334ee9afa59da38944d9018c4bf62d01eda12","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-332","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6911a59fc3a23375b1ddbc951ed4c8e2302bb7f6022ca3c97750c2d0326f40dc","target_edition_id":"edition.r017.id-id.draft","target_line_end":1339,"target_line_start":1337,"target_local_id":"block-332","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1337,1339],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f6b4e0fb01710051597c6754d69d74d6df7f157dd492ec49fb7cff8b6b30ea47","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-333","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"67a1bd2558f56897b470d9d16919e39f73423f5f83a1381907bbf46fbdea21b5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1344,"target_line_start":1341,"target_local_id":"block-333","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1341,1344],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e084a3feeb0c2e28d6a8cc9a3e490982c15cc989813677274c8b27ef7a6cb9e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-334","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e64577e9c22e4d593822ccc71b950642b47a48ec42c35447aa76ebb8c3c41647","target_edition_id":"edition.r017.id-id.draft","target_line_end":1346,"target_line_start":1346,"target_local_id":"block-334","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1346,1346],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"78c4ae7957eddb20cea70d1d28a6b76eccc942d9fb859eca05ed9efe4e36af1f","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-335","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c9d96f727c7b50c91cf8a310fb95753f598eb3dbea4e303d71fc724621db1ec4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1358,"target_line_start":1348,"target_local_id":"block-335","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1348,1358],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c80123e55227207778037b33ff6b8d363a907dbed1659695ced20592d238a259","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-336","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ff958f8d83a786efaba3c96888c5057741b07983334a0dbfc46f877a617e7d43","target_edition_id":"edition.r017.id-id.draft","target_line_end":1362,"target_line_start":1360,"target_local_id":"block-336","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1360,1362],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"406cb6658cb1a158af5f325a7ec891e6ed0773e8b94d39b03e53892a36102c29","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-337","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1364,"target_line_start":1364,"target_local_id":"block-337","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1364,1364],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"783e4b3530cd706f924ef5cc76b3b970da66f8618be4b00d26ad89248a5e426b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-338","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3e7eb2a7c6feb42782118bf31ebd8361740d68d3fdc86b070d29a912b59a2b36","target_edition_id":"edition.r017.id-id.draft","target_line_end":1370,"target_line_start":1366,"target_local_id":"block-338","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1366,1370],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"831dae9ab0292cf2967f7c106c36f69488e4acfeea2f55389e77052b4c9e5f10","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-339","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6eb404b9c844ef47807b3819ff208f93384b7337ce9dc93d4de504c16ce2bc89","target_edition_id":"edition.r017.id-id.draft","target_line_end":1383,"target_line_start":1372,"target_local_id":"block-339","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1372,1383],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b4904206b8d5a6564f63f2b99d0bea9220272022c08549f8a6997e4300b5f5c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-340","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e0bbdaf37c3efa83787ae3c9344565540f7ccc8f3181a4024fe25f60b27ab225","target_edition_id":"edition.r017.id-id.draft","target_line_end":1389,"target_line_start":1385,"target_local_id":"block-340","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1385,1389],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c19b20e5202a4634b269c802fdb576244739e19a8f8d4b9d1e0fefef4eb4e71e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-341","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d2bccd9f09316d4797b4d59d8e75637c6c6d5e09775e0f9992e2851fc1c979d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1391,"target_line_start":1391,"target_local_id":"block-341","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1391,1391],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"78cbed52e53920dcf987900729ecde1daffe52df62146fbe307e10a720857b00","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-342","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7defabc87f24dcd1dc326e312b45a0dd7dc4ac09b27bb592afd9473f572a1275","target_edition_id":"edition.r017.id-id.draft","target_line_end":1395,"target_line_start":1393,"target_local_id":"block-342","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1393,1395],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f4d23bae3cc15e3e473ba25cb6bd884a9a1916b2d31f4baa43f742beeaf3c8ce","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-343","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"88853e76ca0eea445ba5f832d162c0e1a268e00ae964009def963896dc61226e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1405,"target_line_start":1397,"target_local_id":"block-343","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1397,1405],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a2d6f26ceedb583e2f505bf786f06e11c87e32792fefb08a28001f8439404f2","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-344","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1407,"target_line_start":1407,"target_local_id":"block-344","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1407,1407],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"163f9f45516f4942ffb6c21a7fb8c2d0d1d96a86097182ac4cacb60ecfadfd8a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-345","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d1d78dc33592be37ebda1d389cc41e4341f1a8fb04b5bf905f3df8454490a6bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":1411,"target_line_start":1409,"target_local_id":"block-345","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1409,1411],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"025e40f30dc546ba2917b2fdb65fbbc79eb8d85df23d3f9626e033684ca7c8e5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-346","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6fe0db304de22082b1df03dd688f903a73485aca5524dd11937169068549b4b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1427,"target_line_start":1413,"target_local_id":"block-346","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1413,1427],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4f8f7dee3df7dd222d0f16bb8f6a174eacdaf3993894a6145f009c8c429eb3bb","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-347","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"768c96826571fed07a692850518d38e857353f9357677c3bd06fecc9d658939e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1433,"target_line_start":1429,"target_local_id":"block-347","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1429,1433],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f785835ffdf505e71c9cacb76ddf932cd965e958ba5e39edc1cf6baa8ead8397","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-348","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd66b1733696f9d49c5f570c378b89cf90bb05482a4bbfcbe60db58be60d9de8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1435,"target_line_start":1435,"target_local_id":"block-348","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1435,1435],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7b302887527ab8c66355ca19ad8dde960c3c06bbcdb0199859d9cd5d854417e6","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-349","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"363e4dab03b7e466aff39b79b9f1adf5f9dcb11f7e1d1fb00e2a6d1963284825","target_edition_id":"edition.r017.id-id.draft","target_line_end":1446,"target_line_start":1437,"target_local_id":"block-349","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1437,1446],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"45e9c288f5bca47053cb1a28eeccb36b38daf95d16ed60b5b7c33b77293be526","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-350","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b0bd0b34e9ae59db9a7c6ec95713a95953495dea0014961d68072e403dd92cc4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1457,"target_line_start":1448,"target_local_id":"block-350","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1448,1457],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1f1003a482a58efbcb90cfba8178ae65b641714f5adbb7ef7aaef6dfc9554a93","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-351","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72823a77bd6c451cee7d8be45c62fa6af1b5834cc6a2ed8521211ea68e363a12","target_edition_id":"edition.r017.id-id.draft","target_line_end":1459,"target_line_start":1459,"target_local_id":"block-351","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1459,1459],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02471ab90ff74779796e0f46f0fd9e8691150e70aafd94c02679098a4bc4a231","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-352","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"76366b75f87c2ad326d96def356160cf1421e6dd631990bf81ca247cf0123902","target_edition_id":"edition.r017.id-id.draft","target_line_end":1470,"target_line_start":1461,"target_local_id":"block-352","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1461,1470],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c565883dd7ef47f35df981f89b1ba01ba5bbc15d0c36b127ba17711d6982d506","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-353","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1472,"target_line_start":1472,"target_local_id":"block-353","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1472,1472],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b6e087f13b2b7d07665259789a841583d45c9e368051a589360fb096065123c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-354","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"44daa8f177d0b7afc28e3046e6b7277457c3651d7f39c1f34f656e28171b0e4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1477,"target_line_start":1474,"target_local_id":"block-354","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1474,1477],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9cd483c2875b09e76c54ab4473226d9df78e2c9a9b7d3794e1186613b2933a41","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-355","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0e784cb6d7d749e374383a8a47f3a88ce99c88b0397a0f4f6494345e3bbe38cf","target_edition_id":"edition.r017.id-id.draft","target_line_end":1482,"target_line_start":1479,"target_local_id":"block-355","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1479,1482],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"89369f72edb74184eff23995618fcb90e8f86360bee1f1fb3831f6acb9abee64","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-356","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"65a72b2ba3be4726a997c052e90261d5c7520746c6396e69aa75c73024da6b3c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1487,"target_line_start":1484,"target_local_id":"block-356","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1484,1487],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"642f3da8b3fe379a20b56ef804e88c9ed8b68a79fab52fdaf64f3a365d6862c5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-357","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8d3096c35f3f7ffbd7db23a00477df1a0b3aa5e8480c2ab91722e18b247df1d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1495,"target_line_start":1489,"target_local_id":"block-357","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1489,1495],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"281e0e0c1e41b1df75817081905f5e717f45786deaf3a821960a3a21a710a5e2","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-358","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"20d5f112c556765f6374ff28318bcee813b0e1ffd8ee203d15f6b920b2efc37a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1506,"target_line_start":1497,"target_local_id":"block-358","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1497,1506],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b2042e4e04bd4e430a4a01643a80b4791f6b4b61038c03b1d07a7fda6b84faba","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"id":"segment.r017.book1.ch12.text.block-359","locale":"id-ID","parent_id":"unit.r017.book1.ch12.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ed10fc1f2deffe5616343d572c2f50794f1de796c2e34f3cc3293fa661ae1fc8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1526,"target_line_start":1508,"target_local_id":"block-359","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch12.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1508,1526],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch03-software/software-python-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6221602bff6bf708a702232344ecc4da1ca7b79042d3d11c24b1bcaa990a2f61","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6063875237d43ca58360bf47ed8048fa1ff7867ae9f357f2881a5910f8cf77ea","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,7],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6481236993c703b8f7ff7bb9058d64916df54c348da25917984eeb4267477d30","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f244930cd232afd1e54dac741e56c1bf329a57cc6c7212410194f101087449db","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":9,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[9,9],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3054a47f85a1da04852853b5e9fc2c0b919e4c6e6161ef47a6aa0e331a66d173","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4fe1c34e8ecf0dbfc1d261e86205ce9ceba7997b540a6d62b9ed0743716baea7","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":11,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[11,24],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4176ba0585ba072d3c25e47704fe71f205c355cba4f8315ed54fc91e1a67b68d","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"720d0a3042c65598bc889759052d628e1c9a433d206dac9ca2ec31c6fbf85238","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":26,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[26,27],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"216ad1fe2cc88744e421c13ae3f7d7c0282002b99ced28620234df628883251d","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d2979f48261e29c213a481e010e8bfcb76db9663392b670869940d5515f6fa90","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":29,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[29,36],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"04860f167ec021ffe7a5f682c6786f30cc9a7549c4cef34c8b751e4e8c918a3a","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d0205d9608d1e09aed05c4f0060826bf995a98624c1bfe5bb031d130a436980d","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":38,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[38,39],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"890ab6d1a7dbf1a3d6018099184ccc99b14d284608efa9237ad9b88a8c3033a0","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1fbb66fcf31d79b0580331807f69d383dc47d45606f5e6839b7b9bdca93450ea","target_edition_id":"edition.r017.id-id.draft","target_line_end":42,"target_line_start":41,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[41,42],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1eaea5c06c81424025f067a668bd790eb9d51e628849b374394e19f2ef2b2804","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c681fba4b4a10e5cc421e70d659eb1c72c081ab05d46dcb222bcdb141600aabf","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":44,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[44,62],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0bed3b244ad4dcfcb5ffebd3b83704aa028e3e8167698154e2f91616891ff2e4","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3b997a97935c8f91cae3b6b77fde8c9707be10efd5d694220b97b1c9ae49a260","target_edition_id":"edition.r017.id-id.draft","target_line_end":65,"target_line_start":64,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[64,65],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48083d747832c17fb63b20e7d94a1f576dbf11a7ebf40caab9e1339061672003","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5adf625b93175a276f0f0ec9021fbf78faf1782b30e33c88232f33ea69211510","target_edition_id":"edition.r017.id-id.draft","target_line_end":97,"target_line_start":67,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[67,97],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"788b8f9ca08ccd94a514a57182df56c5fd02dc88ae382a3c63ee76ba1286e84a","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"768936c6cfff6bbf7456a5cc6550f44eb83889b2e511c0764aae7b544da1bf36","target_edition_id":"edition.r017.id-id.draft","target_line_end":100,"target_line_start":99,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[99,100],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e04f54133138f419c0500257aff67d4b8957f8490b0161a8ff6f2aa72252fc15","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d089ff7452c050196d1db288c42512bc4c06e4dbc6bdd220845a658a9586e29c","target_edition_id":"edition.r017.id-id.draft","target_line_end":104,"target_line_start":102,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[102,104],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d319c025933b0d5bd27f13e6476824a87f10283ba0c9b45877b4fe49255ce988","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b422b5e4a65f7e3e920f5114e4525a1aa613c394928be386b1d0fa468bc5440b","target_edition_id":"edition.r017.id-id.draft","target_line_end":135,"target_line_start":106,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[106,135],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81fa477cf3c060ac2a84bbb6f1878a32fc746dbc1872c6742f73bf1222cfc56d","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d21b9077230f50ba70036cfdc4091ed9ea33032536661312fb25c07f07da3544","target_edition_id":"edition.r017.id-id.draft","target_line_end":138,"target_line_start":137,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[137,138],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1fea4144f98b122d2e15cbf4e86d8b37f6a49c7f28c264391f53f90ec5d87a52","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e9869983d8df8226b87e04fd0da8724c75febb9e6921062999a153c4d67c93e8","target_edition_id":"edition.r017.id-id.draft","target_line_end":141,"target_line_start":140,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[140,141],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7b0752bcdce1076211f73324c7e163626d97cb76df5274d28bd91a54193d7dbc","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"05ce2f2c169a67aba6ebf780c8f96fd974907b5eb7a5d0caf0b89507003cbe44","target_edition_id":"edition.r017.id-id.draft","target_line_end":162,"target_line_start":143,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[143,162],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7be612260dc13e01f3a6d4de6425656a0780f2680568ce7931dc9a41f8b14733","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9c2e27ddcf9b640ef03eaf4effd2b1ccdc4ff10d036c2d2374a74d753f491dbf","target_edition_id":"edition.r017.id-id.draft","target_line_end":165,"target_line_start":164,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[164,165],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d511c3f11b1e9a624024079bca0bdd1c485fc052a88d3564d05a96774e6c841","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ed6bbd3bf650c04efe913af03ad32df749a050d6e405ae5793223e0f55a23df4","target_edition_id":"edition.r017.id-id.draft","target_line_end":184,"target_line_start":167,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[167,184],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"28f2cc915e5dda5d7779328ddbc35f5bddd8a9497fa4a4a4206a10584c0fb1b6","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b5d741b6a5e77e513510b71101d61fe3997d88b0e0c1a4c99ae70cacbbfe2c51","target_edition_id":"edition.r017.id-id.draft","target_line_end":187,"target_line_start":186,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[186,187],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7cde7326b587d8baf25f6ba27d8bd224ec6faae6455bb54db9afd0d790aa8292","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bf1fca8aa03a3277b4cc675d4bd0b73295b98e5123a3480013ce46c15d8362af","target_edition_id":"edition.r017.id-id.draft","target_line_end":200,"target_line_start":189,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[189,200],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"304f5ef2058b14ced0b67cd42d3a1381a107789e81661607904e3b6099d29fab","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b1d5e7bfa3446440160da4bd2a9d84ce16f2026fcc4ac57d90ab5bf47d945d69","target_edition_id":"edition.r017.id-id.draft","target_line_end":206,"target_line_start":202,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[202,206],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bc4a31435dde1a41e123c710ac29ab8f723fbed6b04ad8f414ec3f8be642b7c7","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e0cbc332c444dddeecc54c686647cfece7aa375fa19caf0e23d8d702cdc55da3","target_edition_id":"edition.r017.id-id.draft","target_line_end":220,"target_line_start":208,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[208,220],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa7d032440f281a96ad8e389bfce81f3e2fbe3f3f2536ae09faa6ef74176bc1b","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4951ccfb8e22ab522ceb23f33d6098fb898fc59c783c0657aef3f6789cb596e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":223,"target_line_start":222,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[222,223],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"40fd11cc29cc955f7789493529e266408e7cb353869c441e791654eb10ee2f0c","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"33429622c713a4e19c9497247c1be52dccc152052433a949c0340c9e17146075","target_edition_id":"edition.r017.id-id.draft","target_line_end":259,"target_line_start":225,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[225,259],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3ab5c6c3814eee83cac40e1acebf5c2ecf74cb3770b36cb77cdf1e50d5170b97","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d09b0f9d0386e7fd9bc54d160be2a3fe79262b6d4669f5ac0116472f6830f017","target_edition_id":"edition.r017.id-id.draft","target_line_end":262,"target_line_start":261,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[261,262],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d8e8f12214e05f384ad57d1fb36179368b80ab0c7ae5c014a7ceefafea3cc983","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"25bca3149f1aae58e515a93307f919827eb77436d3a9f339726eccf065999cf2","target_edition_id":"edition.r017.id-id.draft","target_line_end":288,"target_line_start":264,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[264,288],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a65bd4d61f19fd63a498137530afe662837696d0304bdeb9ca6541872556a238","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"14e3f456d35dcd2114437bca7b1fc6e0c33ca12ebd0529bfc46f7e02c47f6884","target_edition_id":"edition.r017.id-id.draft","target_line_end":291,"target_line_start":290,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[290,291],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7dbb18b2d08821afac844464c65501138fffba3e12d1cd85c3923d77bca8ff3d","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"895ac502232ba721832776384553dc173ad47e1b4664df5299acd1406a81da4e","target_edition_id":"edition.r017.id-id.draft","target_line_end":294,"target_line_start":293,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[293,294],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"525cfaae2a5dfe1f21b6cbd1b96440567de98d560f209e1b0359fd678630b94d","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d128d26151bb346d5feb71188471252c6ba8ac81a33e1a44bf0729077b381c2d","target_edition_id":"edition.r017.id-id.draft","target_line_end":331,"target_line_start":296,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[296,331],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"45bdc914cbc43af40e78e56e3471ed3a5c47e3d6d2fb85f6bb50c5e450f23dc1","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"467dfb4c92df6a7732bc53c6bed2f816d7012f41321c4a99c3341ba3484f0df0","target_edition_id":"edition.r017.id-id.draft","target_line_end":334,"target_line_start":333,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[333,334],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20efb63ba150065eff7854c329977bf7150f621078bd32c5fce1f6f4e45fa6cd","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c0b5866e443a8410fc25ac9b8ad53c2b8c3ea2da52c08ab81710a947fadbc9f2","target_edition_id":"edition.r017.id-id.draft","target_line_end":338,"target_line_start":336,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[336,338],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"06cc13b9c5e2091fcbe89eda572d1fc16d3d2b59e9010228f0479364283276d1","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"id":"segment.r017.book1.ch13.solutions-manual.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch13.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0e997de47bade49b6aadc8832d4e07c8a1a1a80b0c250a7b2aaf10c32e05aaf8","target_edition_id":"edition.r017.id-id.draft","target_line_end":394,"target_line_start":340,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[340,394],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch13.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d3838f8b793e04c82af7896e9b65a3ea06e6bb8cce75b2849fbb3196c2d3f610","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7f697a21b36cd64c4a6e7b11dd8157cf46862c4b526e7dab6a46418f90182430","target_edition_id":"edition.r017.id-id.draft","target_line_end":2,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,2],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"859465c7f486bbeb4c30c4c3c0b93466ca1a9509d7b1c6f6bac7cd845d119e5b","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f7ce6addf4ab8e96918887adc48d0c0f1525ae3cb0412b3f9d0e31435662a68","target_edition_id":"edition.r017.id-id.draft","target_line_end":11,"target_line_start":4,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[4,11],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"520ad8781ea5c159fde42459e6dda18e44fd30e2ab37dabdc05928c7436e5a19","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1e9014a9f4b9d7cf33abb7b898fd8a1e7e59b42247f04eff0deb74e2f326e00","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":13,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[13,15],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f4102b05a41971a65d2822bf4d344173469a8b63952985664e0d6d0b26dc1b5c","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0394c0c5b60b2d7403ea2e3de235ad8e4cd3ace1356a58846df4263839642f3b","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":17,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[17,17],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e8a0cfd1a543bd27a5b90e1abdd44534e0a136cac5fa93f161053e3c58cbff50","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"323c0455d1604119ec1c0ec1b8de478762dd27b77e2b5be4ad913eaa7be54e30","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":19,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[19,19],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23cf6eeb02f28a6fae3c140c1657718867ee4a453d552dc81dee1723a9d69bcf","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"191aabc98bd9b62be7a1b4bc10484e1b1da8c8c575e01b83126f6ce3ac2a080e","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":21,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[21,21],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a991c440462b41e7ec326323af580003c6bdd20c5436808ec32947345df4934","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cc52dbfa285233cee9dbeee7ca2e9666954b454633d9aadcd86a7cf1fc2d32f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":26,"target_line_start":23,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[23,26],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bca701966b0c877d6aaa9d3453eb8c481e7db122cd7eaa2959d9f89f439f56de","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"39a747f66ca6fa43be3fca615cb6e52cd72e9a5dc0026dcb399fee90023fbe04","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":28,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[28,31],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"071aa02debc984266b2d5ba2ef69479d313afcb6fa9440faa835f575b265f1da","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"74cd7d38356de44f913c6fc4053e63f2fc87ed035a3cace1eee8f0e3d105d4b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":37,"target_line_start":33,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[33,37],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ca7f0f1c222ab3433c92c339ad749908d963792b95992f224b5632b7fb7bae43","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6ede21b15499d6a44bb7013ec5e205618e14fe3bf204add92b7dc0de156da978","target_edition_id":"edition.r017.id-id.draft","target_line_end":54,"target_line_start":39,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[39,54],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"87b7d476b217786598cc7116b7124d3eefb9d628304f6d921cb1096f8817a014","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"22ab27e58a8739d6ee739de21edba76c6413a60161aab15932cc1b16b999b937","target_edition_id":"edition.r017.id-id.draft","target_line_end":56,"target_line_start":56,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[56,56],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"31605e3ad7a35694765ab351e8ff3ffc84c5fca9c31aeb489a2937c1360d2e9a","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"18d82824a58779f29bdb925526a85b66a61fa561ac33d2964821d691e9e6ef7e","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":58,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[58,62],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b679d1ec9763113018adabf5fbdc47996a2c2c6bc7cd361bc71d35065077cee7","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f40c4d3c72ca485a37795821653435bec17dd19e750140eb33426fee51fdddf3","target_edition_id":"edition.r017.id-id.draft","target_line_end":64,"target_line_start":64,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[64,64],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb46e076f562a70f942091e3f9ece067e6fc8353698b5505b7d68f85a4a9a0b1","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2d62e7d14c66883f0e846b83dc16fca01c56e91abfa5e3f57253cdb073ec8602","target_edition_id":"edition.r017.id-id.draft","target_line_end":66,"target_line_start":66,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[66,66],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9095f825f2d185d923acf194076f544878fcf89397fd73aa9e4461c622a859dd","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c522e0280f593e02df9ada686cea8aae8cf0a2f36bb609c00ab9d917675b24ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":84,"target_line_start":68,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[68,84],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"06315f8e9a2a5cf782a667aff51bae5ac6c11596bb00b780d2e634cd35d20620","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"374497debefb835cd4944bc2189520233a3af99d896c441a2776d38edc294acf","target_edition_id":"edition.r017.id-id.draft","target_line_end":86,"target_line_start":86,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[86,86],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e87fd1ec00aa6246240f33f3d247b9a03f9b1e9c35c6da73bec14777e448ac2e","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6524007dde0fb05a8babe41a780eef21f4ed3360604947a07fb47c81a5508cb3","target_edition_id":"edition.r017.id-id.draft","target_line_end":89,"target_line_start":88,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[88,89],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd1808c4993958fdcc3b57d721e0aba354599ef42bbd1c65ee39f64e9d727971","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"023aebb793b77980017052f40d44c418dde75de4c4f173d9c7efb8c5e21750b0","target_edition_id":"edition.r017.id-id.draft","target_line_end":91,"target_line_start":91,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[91,91],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f2be8b647a0b333d2267c68a3da094bd50df2f1d36353a4f0317b3e2529a6c8b","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"89241c89b827327696732363467b9608754eb0f912748cf50dcd5378c149771c","target_edition_id":"edition.r017.id-id.draft","target_line_end":93,"target_line_start":93,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[93,93],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b34c455ddea890d90124d0e0b8dbdc7b63866dab9be8d7899a8059d04b2b6a01","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7535b1788063e5e8ec33d186d8c9521eac78282119a6ca0f1595a02581a7a04b","target_edition_id":"edition.r017.id-id.draft","target_line_end":96,"target_line_start":95,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[95,96],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64e1de2b807c2cdb91cafdfecf62148076bb8ddc5651eb098d28a49c94748aba","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7363b2525eb93e1f68992e38e6ffe96504b2d83fa6b231f63629893641d0c9a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":104,"target_line_start":98,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[98,104],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ba5c940015fcc05245ce7da0d35d2145b150ef5d8aede1f49020a18713e20316","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"62e20a2c805a3f01f0dd1c7b76ed2ab2b2e601cf8fd5405995e52497adef5dc9","target_edition_id":"edition.r017.id-id.draft","target_line_end":107,"target_line_start":106,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[106,107],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"481170ebeb093376025adfc3d8ced87f9d1c7233c20ff49e424bb0c74e8d5a66","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"929f0975ec047754ea88a6bf65da2fae30b35914caa666a49c6528ce41e7b635","target_edition_id":"edition.r017.id-id.draft","target_line_end":122,"target_line_start":109,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[109,122],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"29260da956ea672ef439fe81abbaf9c0144fcaa1ec2b0abeba6b750bed9ac157","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b170d75ccdae2b5e368f852467ff79f354b06d9409b8108c7147e9f40b1ad42","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":124,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[124,131],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20a592acd375989e784b8bfbf636eca6957080dec226760023e2b414692e4c67","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d0889460f159391b2a79569581c9da4ee0f51cf302582f2cda14613c5138a949","target_edition_id":"edition.r017.id-id.draft","target_line_end":135,"target_line_start":133,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[133,135],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23b17675b011fb8042ff3245b08a4dde585a59cab0da94b8b0e91e649ec54308","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"99ef4ea4fc5a40e2b85b819ea4de76e21e7ad2297f144981b28e174e80b47c92","target_edition_id":"edition.r017.id-id.draft","target_line_end":143,"target_line_start":137,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[137,143],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5504cd6280e812964ebcc6412d8abf71f58212e7544b26f5f78484e02cb9d741","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"02f2fe762e4e36bd02e89d29c6a82647eb9721e72fb0e82bfea411c32687ca49","target_edition_id":"edition.r017.id-id.draft","target_line_end":148,"target_line_start":145,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[145,148],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2efa8f33edfcfc19272b63ffadc743f3e890bc100bb4843ac8f582541450463b","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7addb600a5be53d50de12b521fc624bf24db41af26b385cdb6e97a394e621711","target_edition_id":"edition.r017.id-id.draft","target_line_end":150,"target_line_start":150,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[150,150],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9cd6e7f247ec420ce24aef4f71aae1ce515416a7eadf2b3357c8f5a1be75ac5","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2b4893c7b563bc2cedbbc059b403b243332ca826cadd28aeadd09f5e69a77b95","target_edition_id":"edition.r017.id-id.draft","target_line_end":154,"target_line_start":152,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[152,154],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b86480165cf6a904351342088905401b51f2c0490f3fbe6de8d26b821d0246e9","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1600839dc01594ff6a4ba458282a4c5f7b2b603ea994ffd467e57fb8907f78db","target_edition_id":"edition.r017.id-id.draft","target_line_end":156,"target_line_start":156,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[156,156],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"abbb34da69e580b02dbb1c22ed4662e5fdd1be190c599a6d5c2c7c438781c548","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ac010faab903ce9c8b652ca7f0b03a1f1dcca263d30e3ca6a67350717b3bfb6e","target_edition_id":"edition.r017.id-id.draft","target_line_end":158,"target_line_start":158,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[158,158],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"561ec5e9e85bf8e44f3fe854283a70ad9e28bb4358bd83cecb7a334e9e19c317","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"85d20793921e98e04b39a21ca476812260bae1ade63b2f2470ffaf4aba749332","target_edition_id":"edition.r017.id-id.draft","target_line_end":162,"target_line_start":160,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[160,162],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5499c59e06f039b9b035841c21c91bd81cb06f20dc0d99aa4f9af7cb21d44e75","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"44649b428c15dfc273095c4eab75dea7dea278873867bae030388a0d4cb8e161","target_edition_id":"edition.r017.id-id.draft","target_line_end":164,"target_line_start":164,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[164,164],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"78ba32ad5351bb1ce3380024637636473f74a4d6c0ce7e1457e0a1e3b4c26c91","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f3a8b3bf47265354581bcb887c8c4cb1ba87342d3c278cc28d6162cfe21e8af1","target_edition_id":"edition.r017.id-id.draft","target_line_end":166,"target_line_start":166,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[166,166],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"afe60675dd96c2d18f29b43da620aca319ab29f09b7d95ae3233ced588816dfc","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06a0d94673bc13b28a98ebfa0d1e07ad249e43bad50ac8c585f5b128c845c202","target_edition_id":"edition.r017.id-id.draft","target_line_end":174,"target_line_start":168,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[168,174],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2da74e6c6aa74654424022be85ed880a34a7959b652dbb7464f55e2b1540723","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8442d6da00ed69834b133e46b79f2cf4fa23dc8559d9cb27d7f8046ad216b86e","target_edition_id":"edition.r017.id-id.draft","target_line_end":191,"target_line_start":176,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[176,191],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"004900abefb6310c33233cb713e28668da2a18010b539c67debb942fc6cf9ffb","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b170d75ccdae2b5e368f852467ff79f354b06d9409b8108c7147e9f40b1ad42","target_edition_id":"edition.r017.id-id.draft","target_line_end":200,"target_line_start":193,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[193,200],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8892bf67060bb9d5197c37c921e290640de943ff23f25ed926549a9c8debb8c2","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a4eb284663da47aa986551c3dd214e85ae8f5cc48dd06e90b363659966e7ad3c","target_edition_id":"edition.r017.id-id.draft","target_line_end":208,"target_line_start":202,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[202,208],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"414dd0841b99dd161b94e9f816e7ab6320759c3138daaf9434e12f631045509c","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d0889460f159391b2a79569581c9da4ee0f51cf302582f2cda14613c5138a949","target_edition_id":"edition.r017.id-id.draft","target_line_end":212,"target_line_start":210,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[210,212],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"29c54bed94e7ad4378dcd596416a7a84457193fb941f5844edd1f5f0da8dc101","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"99ef4ea4fc5a40e2b85b819ea4de76e21e7ad2297f144981b28e174e80b47c92","target_edition_id":"edition.r017.id-id.draft","target_line_end":220,"target_line_start":214,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[214,220],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7aa7f7f168ec256a9456d350e900dc788c5bcf7b810ad4a073813d7528c1a5f5","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"009df7fcafcdfd9e9564cdb2359d2ae5b2c5b1c2943192fd1b6a1c80a4a425b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":234,"target_line_start":222,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[222,234],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7808d5a9ff0a7e37ae2a6a28de9a12715db08cd32759587573e9a70dc2f18c7d","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aefd628659f761af1ea7b8659ad8f0dec469b3d58d9af8bec01b424a56e2c02e","target_edition_id":"edition.r017.id-id.draft","target_line_end":236,"target_line_start":236,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[236,236],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c1231b8e79a75eded96bf61d1cbef5e8c30a546fa6ad0eeae34f21899554ce67","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fed870b44c3c01409e45baa79f1b8e84e32ccf815d594d9f5ebe252a8b76ba8c","target_edition_id":"edition.r017.id-id.draft","target_line_end":238,"target_line_start":238,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[238,238],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c52d1dfe83d4df8ad2af22267af1f879d32047eac01ec88aaa16ea64b444ba2","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-044","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"653258edf66dd20e56a7ab9961acbf4640508027f0688ed8d91af8ed762c0f75","target_edition_id":"edition.r017.id-id.draft","target_line_end":240,"target_line_start":240,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[240,240],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"607324873cb5eb53bd2d2508d65983b11c85747b4d4c11b9dd5ea3b53d30ef54","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-045","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9806bd28f6d87bd8575d44425438ec04182d2a39433b9c08ca4823df29ef7878","target_edition_id":"edition.r017.id-id.draft","target_line_end":251,"target_line_start":242,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[242,251],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ec12d3859c79046dabf7b7d82047b2aab60dd8913633d824085020aba8b6b74","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-046","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"62e20a2c805a3f01f0dd1c7b76ed2ab2b2e601cf8fd5405995e52497adef5dc9","target_edition_id":"edition.r017.id-id.draft","target_line_end":254,"target_line_start":253,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[253,254],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"77e961488ce5f8d9e8f57c0cbd379718e3125ca38f1a8999f6e54ea1e46c0001","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-047","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"118ece0d4a1aff8b11b0cce4e3793667e8c0b2439050bf9dbffdb80be5459fce","target_edition_id":"edition.r017.id-id.draft","target_line_end":271,"target_line_start":256,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[256,271],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d0b652341aecddef49d4c9f836ef5f6386f0b75d7f7b7f6982108753bdf22e59","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-048","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d682feb762fcfc47fe7b4dab2c8a95f9b650ee8c0629c1687e3460015ed2f8dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":276,"target_line_start":273,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[273,276],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0329907fe94d66a37ca7614feb71dc0dde133f39e7e7c1f4763a172b68735b1","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-049","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b85aaabff1e56aae771d10e97340654dfd593c7833557e61bed1ea25087a7170","target_edition_id":"edition.r017.id-id.draft","target_line_end":282,"target_line_start":278,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[278,282],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2a2da9c5427a10a91082cde8808fbdf5bbcb1600e6de85e5257e091f3b0fb99e","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-050","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8395f435c3f1866296787bbfa7adb6be6050e7a25b10b76ec8e72ed66c965107","target_edition_id":"edition.r017.id-id.draft","target_line_end":288,"target_line_start":284,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[284,288],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"09d142de91aaa3b8e014fcd7dc27cea5013cffb8f2d8495c55f45ae6df79ed67","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-051","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aee29dd74188ed027aae4b439bae83a7411d83e84efd155f31a17c3856a54b12","target_edition_id":"edition.r017.id-id.draft","target_line_end":295,"target_line_start":290,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[290,295],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"859d8214d67e5585a23b826f73e5b1e8bd1f94f9cc39a731c6008864d4c85d92","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-052","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fac606e190f8b3d6605f44cc54318ca0ff6853ddfb71c3051bb9c26c750f09b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":300,"target_line_start":297,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[297,300],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee2be34c1b0b1b0b8b5c23e02fa0ae49457527bc14ffdcbecfbdddb1e1e3ac8b","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-053","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"84cace361e25631908708fde309574819f40a74a5fcc65016fc3fdf558f340eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":302,"target_line_start":302,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[302,302],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7aef80b48fbf8432e3ff0b1c6f20ee2e609cd5bd1e2c099bba099f70b31f32a3","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-054","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3ee20b6a3c1477a83ffffee69e0634b13951ade938eee4e601048da91d4107cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":324,"target_line_start":304,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[304,324],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8316f386f647c5d6d4b3ec7da9be1791412357c9c1f421a724a517f1e44f8233","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-055","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"53e6b3a6c2b942990b7db72bf8ee29b7f38ffb2da7dca1fb04b89bd6e463d2fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":334,"target_line_start":326,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[326,334],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa43a85cea5f94ce1e813da1114493137dce7058b6bbb31680bd910265048c52","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-056","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"10a244834791a851f06e12edac7abaa382acb008d29e348f98b5f21f59ea7f8d","target_edition_id":"edition.r017.id-id.draft","target_line_end":337,"target_line_start":336,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[336,337],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"662fbf0e292c777410055d353bdae775cb6f06c6c42058f37a3148df461524a0","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-057","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e91d27b38ffc6b7f2385d605756b1c5f3438fbaff38d2194c735318d5692f7f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":350,"target_line_start":339,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[339,350],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df0b3b7d0d08542f5e5670c38bf84681cbe911e7d6263f0a7bfc8516fef25ddf","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-058","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"91e4330a9475ecc32d0c70330b5f684c50cb8c1a30f78419226516e487b4df42","target_edition_id":"edition.r017.id-id.draft","target_line_end":376,"target_line_start":352,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[352,376],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d219889e1664020a4e1c26c65e3d55020f4df4936ad09fbf4c22e240f515992a","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-059","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9b4612fa92b77f258e970e64570d40ae476d98b206e18e461976dd206fc9dd6c","target_edition_id":"edition.r017.id-id.draft","target_line_end":378,"target_line_start":378,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[378,378],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7d989844ed47769c5fa6346899c9ff6a96d79c974c045f0ac2491384a102611","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-060","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0217d4f9b296bdba91a4fe39531e7a9a2d99aaa47e9612e34183505ec02f6700","target_edition_id":"edition.r017.id-id.draft","target_line_end":385,"target_line_start":380,"target_local_id":"block-060","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[380,385],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f323e27ed09f1cf2140929d30355893b36652da3a67ed279d6055aa4db2553a6","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-061","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8a16b905d64653de96ce2307d2da7db6d1015e9696eba19027deca23ec086c0d","target_edition_id":"edition.r017.id-id.draft","target_line_end":388,"target_line_start":387,"target_local_id":"block-061","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[387,388],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6831940457737217fc70bcb00f35b874c30b855f5eddf1cd230bf2f1e1c1b66f","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-062","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"94f026cc5863d0ec6e2427d8e651281a81eb475900beee8d7fb685ee7f756f45","target_edition_id":"edition.r017.id-id.draft","target_line_end":391,"target_line_start":390,"target_local_id":"block-062","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[390,391],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0403e2dc53d19a8d9bdd09176ea927dd7a63dc3031ee6ba65fbec900b8953a7","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-063","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"daa88fb0ab2462384d258a03673c51a493021c82c4611d736724da00a6ad4d56","target_edition_id":"edition.r017.id-id.draft","target_line_end":394,"target_line_start":393,"target_local_id":"block-063","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[393,394],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"87706e234d1bcd34ea466b47bb85d39f4671413fd3043ec5cadc566430e123d4","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-064","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a4e180ca3551d5360a49889ee4760b3a650cb12eeacb2235be7e98c41391cb03","target_edition_id":"edition.r017.id-id.draft","target_line_end":397,"target_line_start":396,"target_local_id":"block-064","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[396,397],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d74e4900e33be67fde74c91716df263bede4696cd741536ec6c3a59f59d2ac7","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-065","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"025882f59526a32caf5bf82bb2f90b2d6ea649d5832badc7b13d1556ddc86ff8","target_edition_id":"edition.r017.id-id.draft","target_line_end":404,"target_line_start":399,"target_local_id":"block-065","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[399,404],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2cb594919da22a8fde84d205d0756eb261763de0b6db902d83568a591dc1043d","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-066","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a9997253bc7d434b17d4f896280f4c6f4b707ebdf9a6f0244eb663fb93bee84d","target_edition_id":"edition.r017.id-id.draft","target_line_end":406,"target_line_start":406,"target_local_id":"block-066","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[406,406],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e680662d5147dfc5b76c83c59f4d1ed364aa5db170e1c12873459270e561b8b","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-067","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c2034ccb493c0a335afbd54d5d481a4c7bedf95490c11f30e9c749c3daae2feb","target_edition_id":"edition.r017.id-id.draft","target_line_end":413,"target_line_start":408,"target_local_id":"block-067","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[408,413],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7bcc9b7da8e3b45f71290e11b0771c492a2055e1c44dea9f0c5618d161b1e4ef","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-068","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"878bbb3262eb8264cce76925d8bfdab70bcf4b844d2208a448c733d2902fc635","target_edition_id":"edition.r017.id-id.draft","target_line_end":415,"target_line_start":415,"target_local_id":"block-068","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[415,415],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"041305087109c24c9fda0f05bb65c5141967be79ca93b4ad86be920153d90f29","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-069","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c8c688617bdddfc626dd6213a26499ca72da4877be25bd64fcd4ad09de9adf89","target_edition_id":"edition.r017.id-id.draft","target_line_end":417,"target_line_start":417,"target_local_id":"block-069","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[417,417],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fbad98170c8ab007d6ab4226082d9d6f859990149c99dec071cceabd3842d8d5","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-070","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c93e258a5eede24420314fd97d1da5b73218e6b24c72a65de41f7230bb1b0f2f","target_edition_id":"edition.r017.id-id.draft","target_line_end":420,"target_line_start":419,"target_local_id":"block-070","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[419,420],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"714ba5d434312338c4f12dbdb5101accf5888d3c60960b60c91232a5d6f48ef4","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-071","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b5c07859eca9151dfc6280689b694253de89f18757d281b5da019060742f815","target_edition_id":"edition.r017.id-id.draft","target_line_end":433,"target_line_start":422,"target_local_id":"block-071","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[422,433],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"43fb8c95f689cf585ad4642c6198de319bd9c50e85207f2ebcae0559403d6749","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-072","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"407eac2b4bc830cc4f226fd4846e797578be59c55b741057b8292667697b044b","target_edition_id":"edition.r017.id-id.draft","target_line_end":435,"target_line_start":435,"target_local_id":"block-072","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[435,435],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6f222263540e5bd5f4740c84d079200fc3ed75148b22938225cd956014164809","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-073","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":437,"target_line_start":437,"target_local_id":"block-073","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[437,437],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4f6ce439ef8aa803d8cac09fa9dc7c4e0f4cbd6d99a45a9ce794e57487db7049","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-074","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":439,"target_line_start":439,"target_local_id":"block-074","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[439,439],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4194104d08f8ad982c32459a094015ec05b702a6388b4614d729d9e506aa07e2","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-075","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4c25710a5c5236bb5fe5f0554a99c9ea9dc81e9e3b786fefa76d06fc4c2c0252","target_edition_id":"edition.r017.id-id.draft","target_line_end":445,"target_line_start":441,"target_local_id":"block-075","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[441,445],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"be07b86d225dea82c925ff0df6b2bc4fafe49772637da043fd7af19749aa73c4","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-076","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"268c478abbcfa806e48afe0e437f279bc49abd8f3021d4c4da513961980975ae","target_edition_id":"edition.r017.id-id.draft","target_line_end":449,"target_line_start":447,"target_local_id":"block-076","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[447,449],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e1c82e0b88e361419e2a84dcdd4b5dca6f1d0613aaf7ab2d68af9d27608b0275","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-077","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fdc26b4a8be88b7747710b349cff0b8a5c33ab65d86f4386ca47e34c37616b83","target_edition_id":"edition.r017.id-id.draft","target_line_end":457,"target_line_start":451,"target_local_id":"block-077","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[451,457],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6723bf4081297fb5e141637528eeb0e90216374ea7ce67d1ec18660aa3b5d918","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-078","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":459,"target_line_start":459,"target_local_id":"block-078","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[459,459],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d4155a4cb7e2932e6a35a283fecbe7f3abd6d2912cc8725970a6ae516265b7c","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-079","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2311b9a4fbc3395c01d7a22f4bc7ed7f4c18e3f914d471a6c3aeab1b9013d2c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":467,"target_line_start":461,"target_local_id":"block-079","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[461,467],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0ae3682be9ed82434963829711e31d8fb0382aaaf4d0b98aecda00ea43f3cea8","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-080","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"86864b495d5d125bc1b8076db91de19d32a2dc48e26de0d5dcaafde4f8cc77a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":478,"target_line_start":469,"target_local_id":"block-080","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[469,478],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c6882e5fe8be8c9ef9d6323245ed255a6be52f555a273cfabf9aed9c24ed2002","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-081","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e3f87b06f7a641556fe14f6828c82cf2c975b6a9ee5826c46c7cbd0d343ca7a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":480,"target_line_start":480,"target_local_id":"block-081","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[480,480],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"54aa2700e79e83ab3fee997f18e7e9b18c9c8f17b7dea5eae87ef1c5d8933928","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-082","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b006ebac8e4736b2a14b91acdf1f2c2b16571780abdc7487c96f7d35d82aa051","target_edition_id":"edition.r017.id-id.draft","target_line_end":485,"target_line_start":482,"target_local_id":"block-082","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[482,485],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1927d0cccae9b980a0a4c66201a58a5d775c0b5c67b66259427dd2347ddc0e04","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-083","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ebc2648c30945b3c523a38566189f74554cb54f108178f4dea29acdfa6874723","target_edition_id":"edition.r017.id-id.draft","target_line_end":493,"target_line_start":487,"target_local_id":"block-083","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[487,493],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b5367c225f4b0ca5a015c1806bff5f2a32a13380ebbd6c15dce357e279a40252","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-084","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":495,"target_line_start":495,"target_local_id":"block-084","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[495,495],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a06869ece29b8c5843812b20ed438f9006c9dbf84ca491e61eb38c323f799541","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-085","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4704d6f5dab1aa747959b65b265fd7e54f5f5c7535f5392ff06398cc9d344998","target_edition_id":"edition.r017.id-id.draft","target_line_end":499,"target_line_start":497,"target_local_id":"block-085","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[497,499],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3977e2263a7acfa9961eeef00b5d9a97e4867e51da44ce2fb5881b062a9d082a","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-086","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"411047549578c3041f7370a91cf9b626df83d865dded671d790318ebc3ee62f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":501,"target_line_start":501,"target_local_id":"block-086","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[501,501],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de5e8b563e0690050611fba3258ea16f3c9b2911f847ba7cd2dd8cec8986a303","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-087","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"245465671b686fa3688a2e35282a007c10eeefc7e8237087b6434fab28d1d86c","target_edition_id":"edition.r017.id-id.draft","target_line_end":503,"target_line_start":503,"target_local_id":"block-087","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[503,503],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"12e1ac263d6b03c5f7760f2ac0ae5971f799e70cd443bb4a965962ff7bb3ff17","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-088","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bde527830d4d0096b7e631568fac1f1498a18a7df0abc31b4f72320fda84007e","target_edition_id":"edition.r017.id-id.draft","target_line_end":505,"target_line_start":505,"target_local_id":"block-088","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[505,505],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fdd20ed8e951789ad8f0c3d550ed6b89d06a30e1ba5a777498e71120f90136a1","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-089","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"245465671b686fa3688a2e35282a007c10eeefc7e8237087b6434fab28d1d86c","target_edition_id":"edition.r017.id-id.draft","target_line_end":507,"target_line_start":507,"target_local_id":"block-089","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[507,507],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c06d64a9e84d03016ba856ef1e32694530adf2bcc5b40e6d7fa2dc30d3c6be9","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-090","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"934b6a8d0b8f75e1913d57d49e74396d667aebeef0156883886c86b7db272da7","target_edition_id":"edition.r017.id-id.draft","target_line_end":509,"target_line_start":509,"target_local_id":"block-090","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[509,509],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d5acc77e9e595364904f91c944ebc18942d1240bd14870f17c80f1d58fab3b61","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-091","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8d17e276a7a8166c42c78bf615436aeda25cebc25353b9e5067e3016f6a06839","target_edition_id":"edition.r017.id-id.draft","target_line_end":514,"target_line_start":511,"target_local_id":"block-091","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[511,514],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9cba2b897d48b2d0abae2d20afc475e61b872bdb99c2e9d806bed1119663557","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-092","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"173ccc970948f15c293c65b4cec8e1c559c88a312fe3467d916c737d38213c56","target_edition_id":"edition.r017.id-id.draft","target_line_end":518,"target_line_start":516,"target_local_id":"block-092","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[516,518],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"220c40a7914a0088a5b9af1031bd91c629a2874a715b765cf3dffc211bb4d9d9","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-093","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ec953f367de50f5de9e64bc13bea20255508e949cef6939d9be1b2d0e79d9b66","target_edition_id":"edition.r017.id-id.draft","target_line_end":528,"target_line_start":520,"target_local_id":"block-093","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[520,528],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"550b8d15383ac2ef85c4659d81ab8498408147bc38b49e8d91348f07d33a0fc4","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-094","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":530,"target_line_start":530,"target_local_id":"block-094","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[530,530],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f2c96807e106a77ba8656f265077bd481bd8db59beba88737e5caf96a031d78c","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-095","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7c5e40d83850af01e447676328ed82bf59b0e601bd595cc3bd6d5246dec7e9a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":532,"target_line_start":532,"target_local_id":"block-095","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[532,532],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2ac6a238c1a7b25cf2c75d66741c2caf1a0f4f8a79e8dffcf4bb0c50043d612d","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-096","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31cb580514d66362d834a91afcd989e71bcc90ef9ad06962b4a2deac495303c5","target_edition_id":"edition.r017.id-id.draft","target_line_end":540,"target_line_start":534,"target_local_id":"block-096","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[534,540],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4685cf674fee8904b02b04f591ca40c9760c94e8265226622b0439167ffea9e3","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-097","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a7891755b99539cdfc83b4fdce65081f8ee421223257f79aa7af2ca4d166a348","target_edition_id":"edition.r017.id-id.draft","target_line_end":548,"target_line_start":542,"target_local_id":"block-097","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[542,548],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76c2600cf89abbd16c57b060d7cd5faf84c9a86cdf1facc61ccb118b08ff5139","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-098","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"37b9f1f0457a7737890ce4499a74fc6816b84af3609c958cd19f025571a04ac3","target_edition_id":"edition.r017.id-id.draft","target_line_end":556,"target_line_start":550,"target_local_id":"block-098","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[550,556],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f213854e8c632729ebf7b8334fcd9639db043af21312ca0337d22ee108ad539","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-099","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b50d954f9fa8bab0d47cad7d3c7ea6c6d6c53cbc569424c036db20dcf32aab63","target_edition_id":"edition.r017.id-id.draft","target_line_end":571,"target_line_start":558,"target_local_id":"block-099","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[558,571],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8b96ac94db8b25bf2031fb1fe2388b8aae3c9a07967d1bda90cbf972b3e578a","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-100","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5513e4adc5c78549cb94282390ea1b19d4f683344fd7abe486af35805d498a09","target_edition_id":"edition.r017.id-id.draft","target_line_end":575,"target_line_start":573,"target_local_id":"block-100","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[573,575],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6539e76dfc676207aae62a9e4f56d5bd1e5cafc0ff7d1b1bd69850baea1f5393","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-101","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f6e2aad8d538b1a8e97cabf3e0f05275ebc89711c42d19fc3fd54f10993113d9","target_edition_id":"edition.r017.id-id.draft","target_line_end":586,"target_line_start":577,"target_local_id":"block-101","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[577,586],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bc0bfa4ffa026859f16ecc1a1d2af37718e08924abdc197cc3a804e964030d4e","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-102","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":588,"target_line_start":588,"target_local_id":"block-102","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[588,588],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"06412661e6273b800a0b4d07dfc2767ade94e39220b1e2b2d232b2772513b26f","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-103","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7a244230f1c7e2630c06c058d93918fdd4923a01baa43c00b41a36d5f3c3f44f","target_edition_id":"edition.r017.id-id.draft","target_line_end":596,"target_line_start":590,"target_local_id":"block-103","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[590,596],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ebe09a185ba8c7ff66420b39490bb8cd96e953650d13242bd263b16c67e09bc9","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-104","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"520ab868da83210c841c8bdd57eb74edf569b22811a1f773856789039ef6256f","target_edition_id":"edition.r017.id-id.draft","target_line_end":598,"target_line_start":598,"target_local_id":"block-104","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[598,598],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8347437c2d3df90d490077b8c6c2ef98b297f983e4bb9db8923b0e96ccd9cd4","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-105","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"347c327f42147089bbb7532f2ee54adb6e3803fdc245643a3430f41667a80a85","target_edition_id":"edition.r017.id-id.draft","target_line_end":613,"target_line_start":600,"target_local_id":"block-105","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[600,613],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"08a994f7f7616dbbe9f414fdac5d7b4349be478c5bd1b3fac25f9c8416ca5a1b","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-106","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0699774a73d6783c05eaa67b8b421166ca9aa88282336ec02b6f88e08db7bc2f","target_edition_id":"edition.r017.id-id.draft","target_line_end":624,"target_line_start":615,"target_local_id":"block-106","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[615,624],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b7f79b79adf2a11c36385ae9c253a11ef2c231925ab755f5165893aa7272db4e","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-107","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7c4176f9ca89c18c50f3aacc3b3a978ec2d874e6385a52e4b13e5c4d0a343459","target_edition_id":"edition.r017.id-id.draft","target_line_end":626,"target_line_start":626,"target_local_id":"block-107","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[626,626],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0b5bb9368758bdd80b34d4c1d89f5dea1aa929b547ac659b1692def7ed5d889","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-108","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"111873bc091731cd89b76e6f8cf68550c6692e3fc4d8f79b613d882aea4f3dfc","target_edition_id":"edition.r017.id-id.draft","target_line_end":641,"target_line_start":628,"target_local_id":"block-108","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[628,641],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8422121329d6c7f5f5a4c494ae2e8a2c588c525cd5f72047723f9a456f696daf","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-109","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":643,"target_line_start":643,"target_local_id":"block-109","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[643,643],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"581bc44ad670b468cde405ab3aeceb43d28b2abb352f4b162eeb709eb24b2617","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-110","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d294996e282976441285c5ea587776ec2a4b015d2b523b18e0c941febfb8ac52","target_edition_id":"edition.r017.id-id.draft","target_line_end":647,"target_line_start":645,"target_local_id":"block-110","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[645,647],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6d6df0878b392b6b8ff9d0a3877307c62ad2e0782d875f418ee340add445e2d1","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-111","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9dd510e1b9637b8cd1b27667db978cea42c67e33356c6211da884c64d88ec465","target_edition_id":"edition.r017.id-id.draft","target_line_end":650,"target_line_start":649,"target_local_id":"block-111","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[649,650],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"906bbb6f88ef1cae7cc785ef7604fb9eda14c25d6e94a453c5f17271d5bcafad","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-112","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c652af2a131cc3984bea74656cbe41895f0d6b6718ca0e8148aeb0e1114b9e2e","target_edition_id":"edition.r017.id-id.draft","target_line_end":652,"target_line_start":652,"target_local_id":"block-112","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[652,652],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd0e7a4f409cc1cf08ac96f41bc257f13f42963b959bd5b18f6be80caddcf1c0","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-113","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bc3f9867070d42cefb97255136906d1650ef4c0a1b4d52fb1c99f47027c18e31","target_edition_id":"edition.r017.id-id.draft","target_line_end":655,"target_line_start":654,"target_local_id":"block-113","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[654,655],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a99ab8e180b6a6480890b8aea46b758d202fce6470d042960a89f2b33b08eed","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-114","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"43f8ab8838090993c3755173bf1ff26570fd9137b20cc1eb46d148c88630a28f","target_edition_id":"edition.r017.id-id.draft","target_line_end":658,"target_line_start":657,"target_local_id":"block-114","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[657,658],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d304159213ea435dd3d1467870304f7e417548e5013728ac57b54707ba6ecc3","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-115","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5803f7658494470402aa20b656a48fe01d4fb9bd0a3395adeb8bb5853015b923","target_edition_id":"edition.r017.id-id.draft","target_line_end":669,"target_line_start":660,"target_local_id":"block-115","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[660,669],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b6c4292d13d075d4487eedabfa22b2b449a0ebdbac71682ee83868ae25da105f","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-116","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":671,"target_line_start":671,"target_local_id":"block-116","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[671,671],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3f0b2f885f2d5b227789300d8e330fc97c08bea73ca45ec603272dc8c91c4e64","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-117","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b192776471007bb9e1da01ebd03593c681a1091baf6121f81d82f9253eed4c0c","target_edition_id":"edition.r017.id-id.draft","target_line_end":673,"target_line_start":673,"target_local_id":"block-117","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[673,673],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa83b8e2324abac7cb0d13e5db8c78d2fece3112e2078678b8a727d31434a122","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-118","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3b06725a7f48d17bc5b3c72bc71eabfa958ed02341835ded96efd1eb61edb31f","target_edition_id":"edition.r017.id-id.draft","target_line_end":676,"target_line_start":675,"target_local_id":"block-118","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[675,676],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"05f98de92e6cfc25ad312b761080a649aa3e062bb5d3042e8aa7b6eeec4cb297","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-119","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2de8a29d105821d8d94ede0d46690b115e239a5259e7eb2bf2b55a9be00d7aa5","target_edition_id":"edition.r017.id-id.draft","target_line_end":685,"target_line_start":678,"target_local_id":"block-119","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[678,685],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6cea409dde6dbc77cb7f7918ebf328b7b667d77805aa803732e864b27985cb92","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-120","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aa4968610d528c024faedc3235da196980aaca49f1bbc801c5aa6b4128664e0f","target_edition_id":"edition.r017.id-id.draft","target_line_end":693,"target_line_start":687,"target_local_id":"block-120","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[687,693],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20319054fe9b712be595de08b0465efa53d7ed31c1b00a4df935e9ca804c00d7","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-121","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a410632bf144c8efcfb6915c0c4f3cc3a4b7966b4c36a2c2f4116d49c0e85431","target_edition_id":"edition.r017.id-id.draft","target_line_end":695,"target_line_start":695,"target_local_id":"block-121","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[695,695],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a71c126c23e3b0e53bcd794045ca844136f5175b53536504e377eda01eebf118","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"id":"segment.r017.book1.ch13.text.block-122","locale":"id-ID","parent_id":"unit.r017.book1.ch13.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f845e47f7f97b29eb119407866cdf5aa906e02400ff539c9fdf17c24413166e","target_edition_id":"edition.r017.id-id.draft","target_line_end":699,"target_line_start":697,"target_local_id":"block-122","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch13.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[697,699],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch09-multi-objective/multi-objective-optimization_updated.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f450eba91586fd5d8966b51a6ee2086f83df4787279691f44de70f6419baa7dd","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0955106d6e26d1d83b840396603a9c9666096cbb9f0152c785c9a09e30d88257","target_edition_id":"edition.r017.id-id.draft","target_line_end":10,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,10],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d35a1517c280eaeeda6ba08f6e5b8a818600e651c0ae61f9787c366a2c8a1db","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e59dfde9ede2f23e1009fd5dc3f0f41aab112e2ecf34f3ef85f5b670dc4b3223","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":12,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[12,12],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"04467007f07df37c24da6b0323f62b7bf0b5b96dcf0d519c49ee10c1771f229b","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f7223288cd05fb65448316c99afe267c04bddd59a8aea68fb9b4cfe24b61a46","target_edition_id":"edition.r017.id-id.draft","target_line_end":14,"target_line_start":14,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[14,14],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b7e524980f41e4ae9fbd1146bf5d44a312ac03d6051af5474e32bcdc720f7ba8","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a4d43991f2a5281ac67bf6d17b10a1dd0681b26f68c88decb74f069edc684849","target_edition_id":"edition.r017.id-id.draft","target_line_end":16,"target_line_start":16,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[16,16],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ffbb7d98526b0e58629248273deade4bf761daa21ed7b1e3daba0d1994b3267d","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d8a88b2b7726df49cfe3a9708de29de2bbd59eec32ec5145c61b0b892a0b2401","target_edition_id":"edition.r017.id-id.draft","target_line_end":18,"target_line_start":18,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[18,18],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ecfb151dbd44897ff32fa3a2d4ed2affa6c52c663b7c854c98d8d1bbed5ca3cc","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5c5f6ccf6942856257a35ad89bcf385a16b60210b9219e679903fbac5a5ce858","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":20,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[20,20],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"11ebe71816655231622d38508c1d68350856ca6a1a669e2726dd14ee3d2abc97","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"df627f26984c518051b2e4023f1e42945a17990c54021ebcff3d0068e2e2dc8a","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":22,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[22,33],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b128090cb08f2b6a687c58a8fd66a04f368634e7cddc78f7e32e4b600893fcc1","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"377d7a41086ae9dda98b5fe99758c920b5fabdeaeab817b01eecfc29804ec939","target_edition_id":"edition.r017.id-id.draft","target_line_end":35,"target_line_start":35,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[35,35],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57c82abc60c8f997ad1b1ecbb9523683c37c98ac42c6be83d94febabf7deee54","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7c0981f38082aa9e2ca4add0a393d0f58de89c9e868aedb2454b196788848491","target_edition_id":"edition.r017.id-id.draft","target_line_end":42,"target_line_start":37,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[37,42],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e5738f2f004eee4ed236a2a2c58a815b0418ea28050a6658ee433529dda9a2d","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"568b6679067bb639c2a15ec22562067ffbe08c746d78e59e339d119451743311","target_edition_id":"edition.r017.id-id.draft","target_line_end":44,"target_line_start":44,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[44,44],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"187335568262bef34f7da187a6213fe11283287988e4ebc836682845106b5567","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"508dc5f96a37d3cd7b7d2146e80ca039a1780260a1632628e4ada3e987eafa07","target_edition_id":"edition.r017.id-id.draft","target_line_end":57,"target_line_start":46,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[46,57],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d846c60bfa27fff788140332de0ae915edec88eb44e72259397797bb0039f43","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b5e6b9cbdd64c82cf2c03e04f83338ca656f182dda47c1dbbd7edbba5e2430b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":61,"target_line_start":59,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[59,61],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"32f8e6ca0a1e96b98f3b8e81944622d0acfff511ac716e3cc30941536fa8a215","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e571cc56827afd4aa8025a7f3759e86290a2e57c34aa38f12d49023b4fb52c25","target_edition_id":"edition.r017.id-id.draft","target_line_end":63,"target_line_start":63,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[63,63],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7dc9cc111a6af2b12364858e6a6bfd614ef427ea855559a285e229349e064ac8","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6756c272b5be1ae6555e7a188e0079fb34c7bbb25a1f99c07a6a98d001f8f82d","target_edition_id":"edition.r017.id-id.draft","target_line_end":69,"target_line_start":65,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[65,69],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9eaef30609d9e67a3d33750caf934908587d5d320d3f5e96e93f36be568ceb9","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"92979b2ad314102626637048abd30b656f73caae4b91a9cd0c5b6d6a4a9c98de","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":71,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[71,71],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"47c0c66197e6fcd67b877882eb1f08c789523651746c0c7992caa87e3b50a0fc","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e759a69f12b826f3037f7268de31c3cd8598bbaa08c5625851c8f35b3376762e","target_edition_id":"edition.r017.id-id.draft","target_line_end":73,"target_line_start":73,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[73,73],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb28c72f3850f4c2076fd2985aa0f901bb69f59193b403a08fb7643c3f9e7324","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"40d22635b828cb5a9bdc15e5d9165ebe2ffdc3be3c346b174008a7039669c93c","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":75,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[75,75],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0bb527c35d2444b8596c5d24b99ce63d43858e13e61b2bef5f18ef8c4c099a3c","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6a6e3ddd11738491a6ee0a62b7356bbde6b76589756f3916c9f4f879c1fd509d","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":77,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[77,77],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cee07173f207b3901975580430f41cf66db58c5b38211cce75c01fac13fab69d","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"397e252b99a05f6109378b2e3a704ea877455ffe1ce0ef705b226699ae792f40","target_edition_id":"edition.r017.id-id.draft","target_line_end":81,"target_line_start":79,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[79,81],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"501fb0a137a1a962e3f2b61ef621fc4d5a177579ed9808d37b1831c368ac1e3a","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8fe745f775c5abd241ec07f54a35606d3568a0eb1143180d95eadaf68a5c7b85","target_edition_id":"edition.r017.id-id.draft","target_line_end":83,"target_line_start":83,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[83,83],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ad1b37212dbbd4c555eebbec44f3b3579778315d70434e62942809c23cff7f28","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e29aee23e09ded4d1e8b4a5a4dbe7e3281dbc0c8bb07c9232e03fc41d9ee677d","target_edition_id":"edition.r017.id-id.draft","target_line_end":87,"target_line_start":85,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[85,87],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5069322ffb9571ba258558f57083bf62b7ecef462004a5111d0eb78728fabb5c","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"65c04019b8948c67a93705ec2c08ff2fdfd119c39a18751a40a033dc75241974","target_edition_id":"edition.r017.id-id.draft","target_line_end":89,"target_line_start":89,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[89,89],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92125dfaf27392d58243cb7bff715baef87b4ef1a69e014cc308a6790ea59c29","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c620ee581527945bbc7b9b48aa10741d5bfaacc12434f7587eb962dda9e3302d","target_edition_id":"edition.r017.id-id.draft","target_line_end":93,"target_line_start":91,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[91,93],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e4fc8e891d8a53b57dc68b137ee77874a3d19d84fab728b2d4a4e29aa0ad695f","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cb29a899dff67b3ca2e5204e243f80edb8f108b98afe5ec05498cce6c65e684d","target_edition_id":"edition.r017.id-id.draft","target_line_end":95,"target_line_start":95,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[95,95],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc12aef260d8a78235d5451a0831b178e6b623a0a8e697b9b9e49c9470baa7ca","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7fccf1231e3f200aeaab29062d45af260cc7b45f135ab647a5bbf3c587ba42df","target_edition_id":"edition.r017.id-id.draft","target_line_end":101,"target_line_start":97,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[97,101],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e26fb1f5efdf64dc998db59345b36556736643c1174156b52cd6e2caa930c2e9","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6728f9ae7db311bb2a64b24bc74c5857c43af4317ec538e8745e70ca074451aa","target_edition_id":"edition.r017.id-id.draft","target_line_end":103,"target_line_start":103,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[103,103],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"508d1afb172d10142e69c08fd41ee9db5e78670cecde79dcb89ee059c872ea07","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"10d873afe7fbd68c328df1a0553860f5a12611dae95f5c5606d83f062597f591","target_edition_id":"edition.r017.id-id.draft","target_line_end":109,"target_line_start":105,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[105,109],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9f293f2dcbedf7beca8e92330acf406247d9ada479ddf0e1404d1a426bb6343","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b671ba1837e9df064a798c42d2ab91bcbba342d38430185149f9c432839f9dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":111,"target_line_start":111,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[111,111],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7e5417d9c55fb70735846257963bb0f57e613e6525d2c9d9d66d96d57779a67f","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a9a7e13959468cca94fa0db016f24d83d92137a2cbefb169395b73bb53087213","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":113,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[113,119],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"666729e48936b30fe3aec89abdbe9dd6c0fd7595e9f8861a506a2d8febc28278","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"44f085dd62297bff7fbb65c51c7a7329e7b2779ed461f760f5da100a35f21c1b","target_edition_id":"edition.r017.id-id.draft","target_line_end":121,"target_line_start":121,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[121,121],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5deac3ec939023e83fae5058bc6c5e6eebaf41e015e92b244098d1b45dafa2c","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"301fe8e309e833bf0ef988f69784a568aef413e247267cf0ff7cf892da0549ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":129,"target_line_start":123,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[123,129],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"85e77c9dd25e4eaa2bc329309815c7fff63b7efef822a6efeacbd8c09a034f69","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"881c772ed21a64a45b065e50b8267d629a538599f86131541f84d5f20d16c1fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":131,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[131,131],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1f29d8f3720066e673709e607f2805c3e14e3f6d88dd5efa61c7e22f79bcc53a","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b427da51310249694c64473fd755904d0b5db38f72a4fba779975384a798d109","target_edition_id":"edition.r017.id-id.draft","target_line_end":146,"target_line_start":133,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[133,146],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c221ad2a9e9a1192ab1affd8ed551fcd37d2648ce04e0949428dcd302272bbe","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bf4b3dd6d8792039241b6f851d2244b77cf10f3c496673ffc2689d368f72e29f","target_edition_id":"edition.r017.id-id.draft","target_line_end":148,"target_line_start":148,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[148,148],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb56c7ad4704235702aced38ecb1a1fe221f2311fbaee840632c545f28129cbc","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31c42189b881222783b45174c6a19df7a41b61f6280c6a70deadd1f3faca3143","target_edition_id":"edition.r017.id-id.draft","target_line_end":155,"target_line_start":150,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[150,155],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d201d6147c4ebf249fb5080dbbc040983429823cdf23d5a36e7138d9dc08773d","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e0c9dc771ea5a9aa130382bdd17758e8ae127575ee3131345d09a7ccd68c4acf","target_edition_id":"edition.r017.id-id.draft","target_line_end":157,"target_line_start":157,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[157,157],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd85590136718f9d763c667d3e29551f8c683a32c68fc3fa08914860815d20f1","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"98540eb9046ff1d2159f369248b3ae1358c2fd3ebdad99e118eb2e88026bc580","target_edition_id":"edition.r017.id-id.draft","target_line_end":168,"target_line_start":159,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[159,168],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"404ab2be2041258b6996f554ffc348927b0593696b641d9b92486eb806d665a3","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6a4f2f4f7b4a8aaf26a8fa7d0ab0d6e7cc1911a8f0a378c6f50ac7019f8cd35d","target_edition_id":"edition.r017.id-id.draft","target_line_end":170,"target_line_start":170,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[170,170],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8957f60fef714e8882fabccf0fdc0ddf92714b3f4175f75bdbbc42fd8e27d0ab","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"43c7eb34211b87c6895b61bb76c4505877eb60a644999f3bbedc05a3162a8399","target_edition_id":"edition.r017.id-id.draft","target_line_end":172,"target_line_start":172,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[172,172],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"881ff2a958d1cddf4a6ae582adf92176534bff84cad7b16e96be346d048cf910","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8549409835c7798b0aa808cea581e88f2948b073fd7e7f4ccebe1aac3d167407","target_edition_id":"edition.r017.id-id.draft","target_line_end":174,"target_line_start":174,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[174,174],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3eb91058333f2205471a257417918519807091b45e94bcebf1c54a236bfedcdd","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"66d36776df1a266df120d07e4feb5d8196881d2b5c49506343ce9bcc69254076","target_edition_id":"edition.r017.id-id.draft","target_line_end":181,"target_line_start":176,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[176,181],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"296c2c14481041b4245fe1dd93ef451e379f20b337d068dce8551d94bde350fe","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72ac586d82ded72f8e2660950693e5d1a3a8e0970b6dc83365923d8d71b29d83","target_edition_id":"edition.r017.id-id.draft","target_line_end":183,"target_line_start":183,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[183,183],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c893af30cb4de6ac5e6292c7653c3d145fc0db19c5e9a6e782b500305c62befe","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"517d60b351559b646536f753001b2dc5a2e4a3bcd53ca779e5f52d2ebeff1ef5","target_edition_id":"edition.r017.id-id.draft","target_line_end":195,"target_line_start":185,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[185,195],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"07b6ad04e55af67e6a197abf9345df3e7b0966c856fe1958b97675006143f85b","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-044","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"75a837c0495250e8d7b0e90763dc3fb378293fe90702f3ed9f3d971e4c34c813","target_edition_id":"edition.r017.id-id.draft","target_line_end":197,"target_line_start":197,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[197,197],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b355c3005a87ecb5556e2f6b16b73c99a13721e538d3683411278cc7a44b5d62","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-045","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"44ca3e3d1feed4ebc98db3f71f9965b7c4bdf6f60c8d768976571ba7bfa977ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":199,"target_line_start":199,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[199,199],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"65f79cc7a580f4002a1e13c4f8610ebab05f76b4894f7ca16d1b68d3a14c7067","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-046","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b5206d6bbbbbef71ce22e255c6f90d8dcd968f045a7dfd13d4f3804c448c9ea9","target_edition_id":"edition.r017.id-id.draft","target_line_end":201,"target_line_start":201,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[201,201],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3dec1a68eb517753c299640fc1f9f11df160262fade42018d5458e0dc53007c3","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-047","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c7301e2e4f7d6022f21be7900d5caaa79d52a301e99422e667390ff9ac3ba8d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":203,"target_line_start":203,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[203,203],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a14b24975eaac8b41a4910e2c030c8564e06dc19c421a5771e3433ce7f9a8003","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-048","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d9e426809b8242d327be5e98ed36ff98a9c014cd1c55513b80165046a08f58b8","target_edition_id":"edition.r017.id-id.draft","target_line_end":205,"target_line_start":205,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[205,205],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5df6007bd1d610151aa929df3196aa085ef06c06d93d6cb5d5586d7cb5476090","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-049","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0535a141d2e34f83771087e42ee45327762220a6967958e0f4702c240874cb2e","target_edition_id":"edition.r017.id-id.draft","target_line_end":207,"target_line_start":207,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[207,207],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd05467bad7a6c3abbbf205f940ce7e6735f8b048ca857267eb68815815e020d","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-050","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"54df3537013b1e9a65686dd635e9980080eb8c1a706793632599d2260eb4b8ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":209,"target_line_start":209,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[209,209],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2d85c674a49aa8d1864308b7daeac5115b68b11dd15a9618869a070b140856f8","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-051","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"745e001991d78c02bbd4aa943322b5e50b9440e907dbe4ddbbc151cfb4f0ef0c","target_edition_id":"edition.r017.id-id.draft","target_line_end":211,"target_line_start":211,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[211,211],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6a5b72edfd6c2a41cbe09abd0b3aa85253e2be816afb47afc267d7891341a81a","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-052","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7b63c5e7a9a8081b7bb16a7da837738091f44e00ebb0d182b76d82207372ccae","target_edition_id":"edition.r017.id-id.draft","target_line_end":213,"target_line_start":213,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[213,213],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d62cde1e1dcbc3c681a1201289df1d39ea5059f7bd03026ea2e0e8637867dcde","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-053","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b5d051b188a15ff26b49e04e2a49c7c3114435cd53db7d0d6537e600d9367cfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":215,"target_line_start":215,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[215,215],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a4aca9f0207f1132dd7fb8c40483d67d12bc649d878c84ec47356558c49c9c9","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-054","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6408f4f5cf983f9a4a33fa4d3a17e6eec79f72e9d699f43d86d77b44664659fe","target_edition_id":"edition.r017.id-id.draft","target_line_end":217,"target_line_start":217,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[217,217],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2e454f2a4d185c3dedaa495589e4fe3c1ad1b12d5b09d14045c3ddce25a60ec","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-055","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4692d90f52dd1149a9a3ad0354dbaaab099332896275a9d3716dbc778c79013c","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":219,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[219,219],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9521c1f648c08e47df10bd0bb6887bc2e757ba369a7d7219093e49b41873b33","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-056","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9ae4627cd1918cffbe8408129caa09570709093ed94c3c8357b8e5d289ec6fb9","target_edition_id":"edition.r017.id-id.draft","target_line_end":221,"target_line_start":221,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,221],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"185fa537bdcefafde21f47b1e977d2ef1d4bd8cc887808ed95ac0dd9e9c376ae","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-057","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9ead6956ced26cb4399cc60af9cd2d7b818d720ed626569e18564d7caadb0521","target_edition_id":"edition.r017.id-id.draft","target_line_end":223,"target_line_start":223,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[223,223],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9e01001bf0321b72cd460f70a70271529c0829fab4b6094a5a495c3010149d6","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-058","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"45d39fe6ba2ed040d5161bbba3b8f659cee3bd5b58356a081e4935599d26afe3","target_edition_id":"edition.r017.id-id.draft","target_line_end":225,"target_line_start":225,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[225,225],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7b22770966bb32fb96c19cb319ebbbee7205df6c691612533a7ac5144656b802","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"id":"segment.r017.book1.ch14.solutions-manual.block-059","locale":"id-ID","parent_id":"unit.r017.book1.ch14.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0cc19f23524e8b29cc8e0b064a2234371b53fa92da10f240c489bc1ffac655e3","target_edition_id":"edition.r017.id-id.draft","target_line_end":230,"target_line_start":227,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[227,230],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch14.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"93515f175a0c929c74edf506a6f3ddbe632534e64021a808479e1054784e53fd","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bc01ea0e813b8dae801ff43080e695f1f2954dd594c2ae64e8c231292e402189","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,9],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"556455bf0d0d2fa8d3e59d9afeaed67a14fe4d51e300cdf0fd390a16726eca4a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf2e9b1eab139b4b5e68c953a68a4afdb790a29e689c8a33b30df8d2fa4671e8","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":11,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[11,12],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e78e94863ade80fc5f970740fefd4c20e6a926357badc4463457bfaa2690d9a2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"740247e61e931707d00b5462e262dd38a46c79738f1838c65ea2af762c6b730c","target_edition_id":"edition.r017.id-id.draft","target_line_end":16,"target_line_start":14,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[14,16],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d04a485f6af46261b270a3d3ecd71111c75d0dfbc5dbb645507d682f2a3ff4e4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c4c6ad8cba7f2eb8bdd9830a2bbbcf11c62ab7bf325c7185d48d94d16dfaa902","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":18,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[18,23],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f8109f15621b5eaffae1025ad869bca8d5c993eaf631bcb0581b51723711831","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":25,"target_line_start":25,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[25,25],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1f39b70352f57e05fb5825236f54f4f3bb21227e647f474d8a5792b3cc652290","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"95edd02fdf19fc4564fcf526e407171105d006b023d671eee34082fca5971834","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":27,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[27,27],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc03dad84308f0a8f944a0f4a13df5fbd61d43b8a56880f5d0d0877b643a47a9","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4bcc1fe1b25daef521267ab17b09ba6cf9ea8c9b30e787fada3710e4a3d5e8a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":29,"target_line_start":29,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[29,29],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5969e8d2fe78bb4c87f9284e00d84f5136db8f344ddf20b638f1c1c681269457","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d7bb69c8ea26515d06bd700d34565271c8f996e6b0b56df29eed203664c6d790","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":31,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[31,31],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fde42be9487095b9ecda0a103e458c79ab837f77595d26973759fe45682c29f2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dcc6e6495f0be6056a856e63d1acec01ad2634206bda52c32dde5e473fc70e99","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":33,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[33,33],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ddf03dfbad308ecdb4d3e63a26552863c5ab82a4052e5b929b9a94a1f9fcf0ac","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ccdbdf1fcb5df043a41c3e32dedd7a9e1aab51cb92aa6a7dc01fba1601ad8bf4","target_edition_id":"edition.r017.id-id.draft","target_line_end":35,"target_line_start":35,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[35,35],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b4be99bbe97e53bdffde293a6cda561916db282b1f586bbb5a7537501e2f363c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1661675951e4e75da3f3423c60804f0064f19615efe7ac5d6efd93b6bcaa8bd9","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":37,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[37,39],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb29a403f4b22ff18970e2a9b4a5e2e89b6cba59dfa1c9b7aeab2ec819fb943b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"62d1718af739cb5d6bb9be9eaa3cf2ddfcfa79525ddf6a6e691ff310559f7eae","target_edition_id":"edition.r017.id-id.draft","target_line_end":41,"target_line_start":41,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[41,41],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a8633d697d35688caad18b4d866b4cea333fbb11eddb082a69f244430c999e4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1b85dbc6ff4c37e3838e7f753941d0515670d85f15b7a1f156499b6544754db0","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":43,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[43,47],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0129048da80fcc974a0d152aefe91c48808e2f454570ec0dc021a6edd5c84f53","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"de7471ca5293a7e4292537a8f4eb5e325c1d13f7f7062a2613df7c225101406c","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":49,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[49,51],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94c6dba439a84475d4dcda40d908fbd59c5a23d46786a59768814d3aa1d4650b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8912ff127af0611701d02fe02e9897c7e47440dc3ee8690763476db083089471","target_edition_id":"edition.r017.id-id.draft","target_line_end":58,"target_line_start":53,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[53,58],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cea738ec69add1ef2ed577405ac45bae7d6d3a1511b9693eedee672b9317126f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bde944a7d5c418c0d5806f2e2ea2b2020933f29270ef972b15ca75479c168201","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":60,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[60,62],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"785fc9e3ad0e8b2cd856058d30b16d25cf175cc5a5f586c4346411de83b55153","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"df663527fda86ea9aaaaed8cca0833585168913558e1444da25d8c67cbdf340d","target_edition_id":"edition.r017.id-id.draft","target_line_end":64,"target_line_start":64,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[64,64],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e465792d46994901c073ab7586b8707acbe57dd440a1d3fd0ee77ffcf235fe11","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cb667cbde9e3fc649e337a1b3ea3a805278f159e5b5def05a971cb7db138f5f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":66,"target_line_start":66,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[66,66],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"11cc376235323b6dde7b815ecda6aabeb393350b5f5b89de4decfc915b639264","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aea68d9b2dc1d4f39f34e8d5aa0306e45751e506c6a5b4e5c9f25d6600719944","target_edition_id":"edition.r017.id-id.draft","target_line_end":68,"target_line_start":68,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[68,68],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8cc7568d33aaa5b3b9274e307a0d8b7518521d1a33d4c18adc4b196af3de8b8a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"998d9ee931907467ae7532064c5b3ade69cbcaca9e1b5ac411ebf86093e0400a","target_edition_id":"edition.r017.id-id.draft","target_line_end":72,"target_line_start":70,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[70,72],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"776d7c6cf7e44a98ade61dcd93bc6b77a15195f7b02051df69694b7c4b4408d0","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e5242dcecbe9e66b2ec98891333f5bdd9fbe0c25599c215eeae10aeb3eb23ee6","target_edition_id":"edition.r017.id-id.draft","target_line_end":75,"target_line_start":74,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[74,75],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"796ab1f582290fcff184dddc061aabf225a42b5f4b0cb51b24f7e7807d67c9c9","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3774918bd07b989720c2dadc82340463a25239eb033e6e68e14bac6ed6e255bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":77,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[77,77],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"89075608b4a83265fc4dce013c3c4dd8ade64cfbbe7cd562bfc2979af7c61215","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6699c3c458cbda67d515c229ec1e82ff329bf8981b05505e91cafafc0380b9d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":97,"target_line_start":79,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[79,97],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc2783c827da66e331b637d0a3ce3e8f898be42c1b58823d83de75ed9fed16b9","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"775d7239ce9e4cd97ca269af1ca70b0469e11c2a1bb2f461bd238e5a280dbc7d","target_edition_id":"edition.r017.id-id.draft","target_line_end":110,"target_line_start":99,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[99,110],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7cc6654a1566825de17d0fe8918aa94628b02423eb9260e54aa68018e30de60","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ec0b2188eaf65672a16f8e83329eac66c4a50b328d67e9540b1de29216c8edf8","target_edition_id":"edition.r017.id-id.draft","target_line_end":115,"target_line_start":112,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[112,115],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb53b9f47f264c87b7745a77984d6c237ffc275d97968ac17a94d770bfdbbb8e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e88a197e2a9a8320324f0e9c9779cdc7e88fbf6f28a3f9ef085b430a052b7d9f","target_edition_id":"edition.r017.id-id.draft","target_line_end":121,"target_line_start":117,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[117,121],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82996adb7dec93aa62687ffa8e8e2400017251d1a4b6c3c8dae85c1595e41703","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2bf66a7988084c1cb5fa0b6e628007f86692aac6740349727124da02620a20b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":123,"target_line_start":123,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[123,123],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb263ac7a417d7ca5dfc7c31d38ed04ac051f7d0254656898161392068a0957f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":125,"target_line_start":125,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[125,125],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e30a6b8ce453dfd518b5ffc9775f05512395860f83f048a2aaccd9160adbf8db","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"49dcd07bb4ba09d1a7a3aa10017400e36f4665e131b6c8470ec02e47008f362a","target_edition_id":"edition.r017.id-id.draft","target_line_end":127,"target_line_start":127,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[127,127],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd260cec11d37a68a4847af7b486c94683a17a71397ef29936eb32a02c146e02","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0c24ab85147de2116d1da22b6938790be7559481aa082337e66dcb623e854bdf","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":129,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[129,130],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f2997c6fed16c8c7d2bab9280085a2befd22966ec8b280bd459037e97c7241e5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"886908f0511229461e176f9b42b2420143a21ede531684962b5d5717e713927c","target_edition_id":"edition.r017.id-id.draft","target_line_end":133,"target_line_start":132,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[132,133],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3d7b3199e8e6b2c3c34a24641b3a6c0f31404183cc1347b6cc9ee38d8afc56b1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"74fa89f0d2b972e3cbe24078ba75fdbf11a351223e1aaa969bef52d029291b76","target_edition_id":"edition.r017.id-id.draft","target_line_end":137,"target_line_start":135,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[135,137],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dadfc7f43f5947bdb6d24fd1b1ef8dda10d49331a8ea51f0e46cb25ebe306f58","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"832d1bfbcfc1d6285afe286c69a71dbaf9d2bd51f2af95dea4bc3af7f87d059d","target_edition_id":"edition.r017.id-id.draft","target_line_end":141,"target_line_start":139,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[139,141],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"30d85e119dceaf4bb87ebe243960a7fb30b1283eef2a55c564900e261e07f6c4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"595191dbebd18f1ff1f2b98a8640bc994325e99d9eceae38b3e55742b6b6208d","target_edition_id":"edition.r017.id-id.draft","target_line_end":144,"target_line_start":143,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[143,144],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e025788fcb1894ff7ab77dbcb86ede0560830918213ac9613fd1aef963afe710","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c70dd600623629f393f618e16feb4724c00f788d178446e7435ece7801041710","target_edition_id":"edition.r017.id-id.draft","target_line_end":155,"target_line_start":146,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[146,155],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2fc60c005de1babc390a1f7dde8bc4f9e9a7fed8cf6823e85bf8fc43a7bb352c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4152b050abdaa89a9c6e4cb4bab78216b6709c32cea635f2f4ecaece967efb34","target_edition_id":"edition.r017.id-id.draft","target_line_end":157,"target_line_start":157,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[157,157],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"41a47b79c407a219c171ec2cbb79b02b69eee94cc6b8df5f860a6125a0c85cad","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"97cb40be49cd430dc861f63a422fc1724cad700c2312ddc382c6b3f095b4bc1a","target_edition_id":"edition.r017.id-id.draft","target_line_end":199,"target_line_start":159,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[159,199],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de498a21efdd6b6b7d74d4f6c3d00fb5b0a480308d834fdb8b8c3d0dfd61d986","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":201,"target_line_start":201,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[201,201],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5f0aec588c7326ecf1a3e6b723fe4f74bc183827bc30d425b933a1bf12b2aa4c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4152b050abdaa89a9c6e4cb4bab78216b6709c32cea635f2f4ecaece967efb34","target_edition_id":"edition.r017.id-id.draft","target_line_end":203,"target_line_start":203,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[203,203],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c02d3e07aad1701362dc0279b4e96b53d3028f28b86c9b4aaddc8cecd1bf85c7","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"02c08dda527cbae2206e25737a50761d087cee3e620c728810dc1d94c9f40285","target_edition_id":"edition.r017.id-id.draft","target_line_end":242,"target_line_start":205,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[205,242],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bf2003a3e39ed06d5020e0a9768622f92ff19616ed3153106068d8b5f385366c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"862e1db72257f4bc2e7ada8dc6e481f5d540942c084d7b89cc6568ff498988ca","target_edition_id":"edition.r017.id-id.draft","target_line_end":245,"target_line_start":244,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[244,245],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"269e8fb25c9ff5129654dc865697fd00f1fc048f96f1ba429058ea54d7502a1a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0db36b682b165f504fb7c544a820ac22ac4410066411becea16f5bed166268d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":248,"target_line_start":247,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[247,248],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e3ba97af04b298ed2f60c6b6caacbd8d0aaa759e242a918999d49edbe46e925","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0957ea1089cb9ab8e3bd7d61d1ef8eab53bb5eb08ff0461e66a56274380a36c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":285,"target_line_start":250,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[250,285],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39a6c35fed7e1bb4d423534040ca72a35656dc9214e05b92300ef11751195509","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-044","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c23b815967af047e1e18b664c8cdc3a62096371561ca5d6da0df7cc63418177e","target_edition_id":"edition.r017.id-id.draft","target_line_end":288,"target_line_start":287,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[287,288],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e40c5da6e1318aad065500bce1f179562d64683d8fb32360617b64b1c137987","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-045","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7dffaa81d1bc8a648e405474d26809c7e9848deb349448debd345f0d3493b70b","target_edition_id":"edition.r017.id-id.draft","target_line_end":291,"target_line_start":290,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[290,291],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"076553191cc0bbb4e0d9f333d0833de1072d466c8da44c9f4e9ecf371699b82c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-046","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"004122b4b6d42ab464812463c7b31b3340433925c6e040f4bd239a97fd49fe1f","target_edition_id":"edition.r017.id-id.draft","target_line_end":318,"target_line_start":293,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[293,318],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88a7a8a61a8ab7bd948a8d17e1539efc682782926ae84c3bf4a9531255edeaaa","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-047","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"27ce69029c4b2c585e4969e0c2d345a4c64e93262e285c0ceea46e25eca005a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":323,"target_line_start":320,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[320,323],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"01952c0cc7fd522825b0c1effe27bd700c0b80d5cc4012226922e8165e903e22","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-048","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4152b050abdaa89a9c6e4cb4bab78216b6709c32cea635f2f4ecaece967efb34","target_edition_id":"edition.r017.id-id.draft","target_line_end":325,"target_line_start":325,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[325,325],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f578b579227f415ad537dee28a6b0cd729931fa04cfcb49cf095434ead03070","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-049","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bbae7e086b7e65e99da2d44633598464694e749a997189013cc06949bb39626d","target_edition_id":"edition.r017.id-id.draft","target_line_end":329,"target_line_start":327,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[327,329],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e2d01f98d6fdb7406bf46de6e78ece6c57f8f37dda7bab019e5ff76cb3dc41a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-050","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"be5fa801bc8ce57ee63d72f0cbaaa1252db4ce680fdc5162aa3045ee83b0ad2c","target_edition_id":"edition.r017.id-id.draft","target_line_end":340,"target_line_start":331,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[331,340],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5548a77eef6245fd42d86e935eff18edf96cedcfe73257a01e38f6e28cc9019f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-051","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"faed170c6c1e1cd4a0a2a54d14e46d295b9bc184c6a68176560c3e8f872e41e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":369,"target_line_start":342,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[342,369],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"361ff7c660c0b802b670256ccac6e4f7a7a69e9a50cc73cae13144df3a770fa3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-052","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f27d50fc1262b93eb9b6817819bbfefe70e3b580d5632fbb66d8a570b376a99","target_edition_id":"edition.r017.id-id.draft","target_line_end":372,"target_line_start":371,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[371,372],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a8c991fe2634b470b01eeb8270b1f9805266cb7e3ce50f37247724112a0a7a47","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-053","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0362757acf16a72f094c67d7d0a5494e627faf6cd06906a005a66f3bffd0a5d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":390,"target_line_start":374,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[374,390],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a00f6ca1246bb12319f1eb1df69ce567c92b410782ddc9164abfe1e7201ea6ee","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-054","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bb3b8df9d3fa57421e2db598809b0a061d45943d691c24058c67d8943001f154","target_edition_id":"edition.r017.id-id.draft","target_line_end":392,"target_line_start":392,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[392,392],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b2c55a8421e8d915de510ababcf4ce4ca14007423807def715ac126bb13870ce","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-055","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3e7eb059c956a1907171929deb8f3d134015b1fa5c1a63bafdd909ac4764aaa8","target_edition_id":"edition.r017.id-id.draft","target_line_end":400,"target_line_start":394,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[394,400],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ef3b1c06cbdd4c336460573689234d12b10e58d30a7f21a0ea30b0d1dea3ba5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-056","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1a0ad8e441d588e3aaa9340994384c45d1917f5c6888be92ea24ecaf078437ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":404,"target_line_start":402,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[402,404],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb4581dfa81a838cf76eaf38e077599ebf823d99f1fa662a2b690bf4678431ab","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-057","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"054fcb69b3103e6bc5583bbe9d7a89e7a709bae0dc38e86b16545855c6b34faa","target_edition_id":"edition.r017.id-id.draft","target_line_end":407,"target_line_start":406,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[406,407],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"42ec71459ec2a3aa2bae88e0a75d9334ca272c87a5124eafc7e8ae3eb8ab1425","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-058","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"63e053be12c0c4e1ec30ff4008afd9793b6dcc57442c8a0923579c1bc4f4de6a","target_edition_id":"edition.r017.id-id.draft","target_line_end":410,"target_line_start":409,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[409,410],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e79d852ad0af374de4761e683a4f90e7f9341184e29f1b6b08d154c50aa80dd1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-059","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bf3163a9be60ec7dd2b553830b5a3dd16aa56b80957cb04c6f58b76f5d14c93a","target_edition_id":"edition.r017.id-id.draft","target_line_end":413,"target_line_start":412,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[412,413],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c11a1da8574e849542e73735876d8af5610937e298db790a409092e34d8a0c72","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-060","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d3fb783623121ac5c68de87f3d749dcc7c48c01ae231c99c9991ebcca9b8b879","target_edition_id":"edition.r017.id-id.draft","target_line_end":416,"target_line_start":415,"target_local_id":"block-060","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[415,416],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a88278b7fdcad7e897b223edde14a00ff62895838b895dce41575ad63e3cc0b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-061","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"91c5478a968c55d9b9114ea3a0e767fac4dbac0bdbb812cdc396a10be20678d0","target_edition_id":"edition.r017.id-id.draft","target_line_end":419,"target_line_start":418,"target_local_id":"block-061","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[418,419],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ab8b82b8c5d80883eca085a8e5182925a17c3771562072f7a41f2119e5d8934","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-062","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"70aac90acd1522c1ec29a35bcb8189e6755aaf821a7ad1fae866ccf50baff17f","target_edition_id":"edition.r017.id-id.draft","target_line_end":422,"target_line_start":421,"target_local_id":"block-062","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[421,422],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3586f0ca5895cb6ee1a0effb3ce7c150099929d91a8c26f17d771e0945481480","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-063","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"097afc74e9112f855987ae5dd8bb0363cd48ad206c62d5a605c320fe63741b86","target_edition_id":"edition.r017.id-id.draft","target_line_end":434,"target_line_start":424,"target_local_id":"block-063","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[424,434],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"efee6e996c6decdc1221e109a1a3ca02bdd633668250a8e03907c1b0db8c06f3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-064","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"225eba79d3c8a2d0222c6d7cd33ee76beb4d7761bba6af35c3b4e29a898f87d2","target_edition_id":"edition.r017.id-id.draft","target_line_end":437,"target_line_start":436,"target_local_id":"block-064","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[436,437],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5c34e8887c8e8a94a6cea8b03cbaa1ae189c03dbdf748d26523e46a7749a561","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-065","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0851733c2ef3098e1a9e03b315f19af5aa073d87d9e37c88b992d8ee3e610b4b","target_edition_id":"edition.r017.id-id.draft","target_line_end":439,"target_line_start":439,"target_local_id":"block-065","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[439,439],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7690b0a4fdf29a423bfec24cd0da92ec7d2aaadb0ea01c29d57cccf6d56943a4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-066","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a4ec248b6e2434cdb31259b539226da9251958bd1fcabc37bc853adcf8e0deb6","target_edition_id":"edition.r017.id-id.draft","target_line_end":443,"target_line_start":441,"target_local_id":"block-066","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[441,443],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a53691fa90332cdb77e3b5a18857dc3b830ee70be0962a7a71a873df110f3ca","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-067","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f31882bf6aa8e2d88c3632a6bf07a21d8ba33c67b031c1f27ab942d22ca367fc","target_edition_id":"edition.r017.id-id.draft","target_line_end":446,"target_line_start":445,"target_local_id":"block-067","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[445,446],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e5084f0a657e2f05a81b81004b775de09ba5aef514d2a8702fb1e504d58b36a7","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-068","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cccec6c77f1d9e5f6f7eab22e13bc0d38ec2814ab57f185bfc8b98c99e600c09","target_edition_id":"edition.r017.id-id.draft","target_line_end":448,"target_line_start":448,"target_local_id":"block-068","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[448,448],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"96b6ea561008880877c7aa7d0a4ed1d3719b73626154073f2eb192aefac08706","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-069","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6638f209359deb7db117dca7b079a804e6027c36b8455b62d50ecc7699e1c725","target_edition_id":"edition.r017.id-id.draft","target_line_end":454,"target_line_start":450,"target_local_id":"block-069","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[450,454],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"85e6fdadcb24fbed065999c8e61eaadcb2895d57208375867b8b91db9d821475","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-070","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"78c36abc0537bdd5a2b4ea58ff80d9d3f1500fabb683148e266b548cd68ff287","target_edition_id":"edition.r017.id-id.draft","target_line_end":458,"target_line_start":456,"target_local_id":"block-070","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[456,458],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b72641ac8139118dc559fb4ff2c5a04945a29cf7810b4409237a2f4812a3bb42","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-071","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7bf80c1171c4abcddad63bb2a0246ab6705c0c00e20a8c5dca8e7badcafffdfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":494,"target_line_start":460,"target_local_id":"block-071","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[460,494],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"603208ecc20b4da3b85b870c9ac17a78905062801a8195a986bedb73cf9877de","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-072","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fcfeb500c7ab9a497e535083227dc262299267a879d216f029da659c45b8f308","target_edition_id":"edition.r017.id-id.draft","target_line_end":528,"target_line_start":497,"target_local_id":"block-072","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[497,528],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c534e9799e971a30d8b9796a6784b922a06a3610c930845f4c9fa803cbd72c5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-073","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c880fb7dbb55b32d00907dd393e639fd379962b54870bcfe67d456411285dbbe","target_edition_id":"edition.r017.id-id.draft","target_line_end":562,"target_line_start":531,"target_local_id":"block-073","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[531,562],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f8a96333c83aa7e9cfdb674568007ce1b2aa12514ff5d426c49ed974623cf75e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-074","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"be4acf2bdb9c2be1601f658ad27bd5dd6d591befd4739f83798bd4b5c518a44a","target_edition_id":"edition.r017.id-id.draft","target_line_end":565,"target_line_start":565,"target_local_id":"block-074","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[565,565],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5069b825576d30dceac896fa38efec3f76b90aede569848e5593814e7db3918b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-075","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4f0ba991e6de2e81fcc33a72f6d9d482e4803bb8051400c536bd0abfade88a60","target_edition_id":"edition.r017.id-id.draft","target_line_end":568,"target_line_start":567,"target_local_id":"block-075","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[567,568],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4dc95ee26a745ee434000900acc43787c7e6a832c9e1079fed2ccd6e70002634","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-076","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"beb1ef0407593e581f9941384c230443c757506fc45a0a52b30053020737fb5f","target_edition_id":"edition.r017.id-id.draft","target_line_end":601,"target_line_start":570,"target_local_id":"block-076","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[570,601],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a50db1c492c24e71e8904d5cc863f4d7580ea64729beb7e2fb4153f9332f0b59","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-077","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f0ae2d8267a6049275b67d53615a401374b01faf0134aa5af5df1efff244421b","target_edition_id":"edition.r017.id-id.draft","target_line_end":604,"target_line_start":604,"target_local_id":"block-077","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[604,604],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1d863ffd8334cb4147e97022bdbdb9b2b248b7c659e062178954dfa610e72932","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-078","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"324c833ecf951cdf8af4686633f1cfb7821a47390f7b2ba37d03df454b8563a3","target_edition_id":"edition.r017.id-id.draft","target_line_end":637,"target_line_start":606,"target_local_id":"block-078","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[606,637],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c73d3c589862973d05a0612ec1da3899b65486130d5a4a231dede83e7ba9b45","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-079","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4f4c635c1c82a5d0f10bc2b2161d86c673d70de05c338fa30d324a5dd604b986","target_edition_id":"edition.r017.id-id.draft","target_line_end":640,"target_line_start":640,"target_local_id":"block-079","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[640,640],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d26bd80fcccd0468fb402f0183555c0b16d68a8f7e6f3afd1c8560f71798af01","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-080","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"25a3879e5b3a5e8241ce1d781fffd570ce2b3d3de8ef0946b2aaa09fded11d75","target_edition_id":"edition.r017.id-id.draft","target_line_end":673,"target_line_start":642,"target_local_id":"block-080","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[642,673],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d8ae3984af80222ed306e65530c9b8d3dc6f9bf578dbb3df967afeb261aeb6b2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-081","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f8c863c3a8e34ec983f7e2a5e96832603b1d77e45c0a710f62b64fd98a9b4ded","target_edition_id":"edition.r017.id-id.draft","target_line_end":676,"target_line_start":676,"target_local_id":"block-081","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[676,676],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a736c590d9dfb264980d196e50aae5df41e2560e728ffb4b51f800866f9fb51a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-082","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b4350511a6e73a66bb87441522403d21a15f35e40522706c8769b26a8f0a7588","target_edition_id":"edition.r017.id-id.draft","target_line_end":709,"target_line_start":678,"target_local_id":"block-082","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[678,709],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"56e7f674c05886becf2347c1bdd13f905ea52b76a7957edf19ea6f712c443857","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-083","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4b0633cbf4ecba0f5ad8c3256f1eb09ee8a7ecd7c7d545e3ebcc905c1497fa0f","target_edition_id":"edition.r017.id-id.draft","target_line_end":712,"target_line_start":712,"target_local_id":"block-083","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[712,712],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee40c619d2bb6a10f971bb95369f18789d706d66e883f64061816a5512d13c1a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-084","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"54b070309ebf95d1aef92fe11be8fe800d82d45a4ab29847519249859c070f5a","target_edition_id":"edition.r017.id-id.draft","target_line_end":714,"target_line_start":714,"target_local_id":"block-084","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[714,714],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e13f1703496e5b0a9b3fe218ffe9cdbb68e55e09667c1ac30944fba2e7e3145a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-085","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7bc09f2e9945c6fd1caf70372973834f8ef6c346d2d5223086db4e4d27cee26f","target_edition_id":"edition.r017.id-id.draft","target_line_end":716,"target_line_start":716,"target_local_id":"block-085","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[716,716],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c7fcefae986b9564c5e12d83b8de53332d42f828329652e65eb1785177c662ea","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-086","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"adef486d6b739ddfdd51640fd507e8f11891f54b1c995d515e591f607d0882b2","target_edition_id":"edition.r017.id-id.draft","target_line_end":719,"target_line_start":718,"target_local_id":"block-086","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[718,719],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0dc485c0b439a2f679d00a14a070813276d0cb6aec211c161761b354890591d8","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-087","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"497d9fb45e9f53b5b65184fbb324c4a6fbc7cbfbe7fd1e682558ee580d854692","target_edition_id":"edition.r017.id-id.draft","target_line_end":721,"target_line_start":721,"target_local_id":"block-087","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[721,721],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a5a0d023626395d80e86348d40b66ab7730f3d8cd0368ab6564d66ef9b831fe","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-088","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b5dd1d9448c66f18ad6650c4cc210a39b2b7016eaec2ceaed324a534f8acd811","target_edition_id":"edition.r017.id-id.draft","target_line_end":723,"target_line_start":723,"target_local_id":"block-088","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[723,723],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0b4a7495099ed7f4e7dae0ea10f7834410c47c2c6217b4ee2c075ea4c275816c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-089","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9e35b0ca5a729c2f59af957f3f1e8ec9354c0795c534542a4a98b4d56abfca4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":729,"target_line_start":725,"target_local_id":"block-089","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[725,729],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc81274e0b57c62fe1cc861451dbe1c1a664c9a02925927138874a959a5f25da","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-090","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31037f6d2c874af0628132fdb28a61f20214e8f741156aa830ebcf39e41de9e5","target_edition_id":"edition.r017.id-id.draft","target_line_end":732,"target_line_start":731,"target_local_id":"block-090","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[731,732],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10e8b87f2eb85cee68f9b6decabb09a3914916618acf5a8dbe0c08b2b4d2850b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-091","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ced805e7575f93fc2dd5abf5cd54ff2138d2246ec9e10667b1bbdaed120a0697","target_edition_id":"edition.r017.id-id.draft","target_line_end":735,"target_line_start":734,"target_local_id":"block-091","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[734,735],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fcc1c0c3f103c5ffe5e7f928fea52e16ab8171af9caa9e0c69aa398a372a1a2a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-092","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ee3e5dcfdb177708845115ce0fa76fa03cae8907b37dc7f3eb5ecaa7902d65a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":746,"target_line_start":737,"target_local_id":"block-092","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[737,746],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"644d4004e99fb69bcb833a31bc67a8c25ced5b96d9afb17242a51af67e662aae","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-093","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3fdafa91343480c010a7422598ff88560bcb67a34cf5cc7f12c64bad3e2bbe80","target_edition_id":"edition.r017.id-id.draft","target_line_end":757,"target_line_start":748,"target_local_id":"block-093","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[748,757],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b14ad47616aae612dae940a032a68cf67f7d83c6b069ae926386962c7246ac7c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-094","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d410b802ee49c935c78b2b85c69e7b9795441ce426e46b1596cbf71e615ed423","target_edition_id":"edition.r017.id-id.draft","target_line_end":768,"target_line_start":759,"target_local_id":"block-094","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[759,768],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61352c2ccec8291b1dcef128271b5badef8b22a59597e7be601790503fa24198","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-095","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"66ac2d9a5cd3dbf5c040c9eed59061a3943d39e98834c83452566ac6cdc379d0","target_edition_id":"edition.r017.id-id.draft","target_line_end":779,"target_line_start":770,"target_local_id":"block-095","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[770,779],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2546d288349a93a44dbf6be7ba23b0ba6a407f844ed447ed85057863ee77a227","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-096","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bfee49ee87fdae0c09f6005ba4744583e706e8a2995dbc2e238a628bd4ec914a","target_edition_id":"edition.r017.id-id.draft","target_line_end":790,"target_line_start":781,"target_local_id":"block-096","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[781,790],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"12ca593b4ce0759f4937050a03fc796ad87ecd6c805bd80fcd7fd3d02dc48433","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-097","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5bd493beaceb96bb04659ebd0769ded35a61fcaa4bb1a514f32ce45e694b9ace","target_edition_id":"edition.r017.id-id.draft","target_line_end":801,"target_line_start":792,"target_local_id":"block-097","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[792,801],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a5dd3b096e4be5122b97961f16ecad7ce70eb704c0287c19f168f1d9699e627","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-098","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"afd44726bc8d533d274ac1f1c7c805b2f69317c2a2b5fbe58aea91593300743a","target_edition_id":"edition.r017.id-id.draft","target_line_end":810,"target_line_start":803,"target_local_id":"block-098","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[803,810],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10c97c1e9c78f64bca6b29fb656532ac418aff66c4b911075506036a63d3ab02","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-099","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"43480c34ab291799f872937670018316019af19fc5307425d481a130e86df088","target_edition_id":"edition.r017.id-id.draft","target_line_end":812,"target_line_start":812,"target_local_id":"block-099","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[812,812],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"41dcb0360013a64a2042d4f6f5bccffa0021e385f37f977fdcdf85d222b9a662","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-100","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7e26e70a911e4251f4c926b6e31d2d83cf38b34b2c7b0eba2c0bcd6a485a798a","target_edition_id":"edition.r017.id-id.draft","target_line_end":815,"target_line_start":814,"target_local_id":"block-100","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[814,815],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c5c711ba578fff41e78711a8cbe1f1deccc509e80ce50cb36595ab2c5cc7956","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-101","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c65a64ba4cb2bc4e83c3dbdf850349b4fcfc9e61bcfa1c0de5e94716a5fd634b","target_edition_id":"edition.r017.id-id.draft","target_line_end":830,"target_line_start":817,"target_local_id":"block-101","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[817,830],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0eb61f0b551976d56cf7aa4be416a5b35d39f8089ad50bc48e1c9feabc7908b3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-102","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"962cfb07d67e51fb795f3bd858c8a9e5162a1b91ec26f63355b08b12314817e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":835,"target_line_start":832,"target_local_id":"block-102","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[832,835],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7129d496de2543c34eebc1fcc73816087118def3f8951bbc85f21a715578590b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-103","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"75ae6b584aa7f40cb6f59412c285755a85946c73bee766842026aafa24985d19","target_edition_id":"edition.r017.id-id.draft","target_line_end":842,"target_line_start":837,"target_local_id":"block-103","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[837,842],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b878cc8ee7a0b6aa709033d3ea5f8f4a6d40e7b4abb8e4e8140a8559d515ce32","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-104","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1d561ff475a4b40619b1b19fc89886aee3f5191fb448bbb3091fb97c07c253f2","target_edition_id":"edition.r017.id-id.draft","target_line_end":845,"target_line_start":844,"target_local_id":"block-104","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[844,845],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"daf83434238102cf03918d60986948f8ab177c8a41e9795009152bc98806680a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-105","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"344595574dac0174fe69d2ba262f36062d4a27c9863a09c4aadd9c8e0cb2f8f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":848,"target_line_start":847,"target_local_id":"block-105","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[847,848],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"31a9262f565a0e67d6066fcd12fe8f7a60df74ba6b2b4f2e2d486a3e6617d297","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-106","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8b4c6063861d07a32d901172d53a58df2f79a09c4b3766f6b16570e553b7e81a","target_edition_id":"edition.r017.id-id.draft","target_line_end":870,"target_line_start":850,"target_local_id":"block-106","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[850,870],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1be6af69d978ebc7916d2d51308b91d60744160232837ff3442d34e3c168de2e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-107","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":872,"target_line_start":872,"target_local_id":"block-107","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[872,872],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b1cdcf4628d74fb57d13d6c0b7a792e42c270728093e266b87769af92f266f11","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-108","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"25f545e0fb0ae961d711bc6a6534404c128e6ed22c5976751c95d3e532c0b7be","target_edition_id":"edition.r017.id-id.draft","target_line_end":874,"target_line_start":874,"target_local_id":"block-108","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[874,874],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f0de9f0f3a420a3f236f2aa4077994b93ef83fd8afaa908220ba4fd40fcd50b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-109","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"08acf8008907a29ecbe8feed8b70cfc25ae1e61da2d60fd30470626d8e8c2957","target_edition_id":"edition.r017.id-id.draft","target_line_end":876,"target_line_start":876,"target_local_id":"block-109","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[876,876],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"204d6c435313421810f222107c1b6c819ab220c5353eb255058902f626bc5329","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-110","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4d104c746c3fe9e3cb5e4194b01f191659cfb933ba737ad9992ca62947a7e66c","target_edition_id":"edition.r017.id-id.draft","target_line_end":878,"target_line_start":878,"target_local_id":"block-110","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[878,878],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"080dce7445c80f119d4d02fdca80022ec81e1969aec78c13765a9a8546d3a9fe","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-111","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9747529e4dccfec00b39d76bd709b33bd3f333c3c7710934ec0281eae3412156","target_edition_id":"edition.r017.id-id.draft","target_line_end":900,"target_line_start":880,"target_local_id":"block-111","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[880,900],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c93ecbcf879c5bb46e9e01ab2ad7537df61c6c33a035d461b29017bef97b7d56","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-112","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d824d4e898191d94947e3eddc87224711272274064fab72a1961c10d3833d5c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":902,"target_line_start":902,"target_local_id":"block-112","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[902,902],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"939970a1500d63ae396cdc1a7146e675e4dc58a226879621449268880b5344f5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-113","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"78e888d1e104c4197bad68e1c2b530ddd9ea2e5a4ec1ae066433e2e548adf282","target_edition_id":"edition.r017.id-id.draft","target_line_end":924,"target_line_start":904,"target_local_id":"block-113","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[904,924],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"28515021764f4a84772a7c8cf3fe8bf0a42b3c8cfc56bb760b51904ebac92a10","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-114","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"01142fd342630b89f1051013ebed1bdf8bbf0ba222d3199b12689d8205e060ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":926,"target_line_start":926,"target_local_id":"block-114","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[926,926],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5aa440a5956e5123044c2cc0ac4f844bf676f15ccf96a81097f3cd39569295a5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-115","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0cb3b87e9a7caf1f7dfc5d2f2e412a66cc6651a2ba115b073f42bdefc221764f","target_edition_id":"edition.r017.id-id.draft","target_line_end":928,"target_line_start":928,"target_local_id":"block-115","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[928,928],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab20f9a9a40406f003354aed58c786cff7c662994144b618da9a1c9b1dfcabf0","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-116","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2e7770121758c65a1c25c774dcf645899026780803e87a16b65dfd7c81a9cb0e","target_edition_id":"edition.r017.id-id.draft","target_line_end":949,"target_line_start":930,"target_local_id":"block-116","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[930,949],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"41ee49781045dc6bb5851e610b835e203e7760731bedec31331d7cc974c03e5f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-117","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9e93d41440b2ce723a3bff316bcd703431e5625de8e47bab9238c03094a14086","target_edition_id":"edition.r017.id-id.draft","target_line_end":951,"target_line_start":951,"target_local_id":"block-117","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[951,951],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e68370232acf558786052daec1a8fb85313c5e1e1d825864f405d98b2f703f63","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-118","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"10aa8c7f72b3c69b27a09daebac23267dd023000317a8094438c113e4a3c029d","target_edition_id":"edition.r017.id-id.draft","target_line_end":953,"target_line_start":953,"target_local_id":"block-118","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[953,953],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed023123f9fba5b5037681d01af5b2e4c97f1d6b4207c930ffe074dbc95a529f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-119","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3e8c7535818598e6670c86e012ba0b73ecbf6a0f5121d622fab2e5e2c5cc763a","target_edition_id":"edition.r017.id-id.draft","target_line_end":974,"target_line_start":955,"target_local_id":"block-119","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[955,974],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"efcabed9c763fe3bf03bc98c90dac7fedfb37d465729a54c6b617e49e2da8709","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-120","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b7e6597b9d904e7d617109e1037dad87ff20cd06f5d941f2446f2229cf2193cb","target_edition_id":"edition.r017.id-id.draft","target_line_end":976,"target_line_start":976,"target_local_id":"block-120","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[976,976],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5007f9a59c5eccc93ca36bceacf7829095b9b52797754ee676878dc9dd09e293","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-121","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9bb11966b59feb241f9532b6311c1b4588d6e25fcc2accff52b4944ff603221c","target_edition_id":"edition.r017.id-id.draft","target_line_end":978,"target_line_start":978,"target_local_id":"block-121","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[978,978],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c6d9a41d00e0c9a26c05c0e0884e7ac947ecf03190ea55512dd349f8dfbe9649","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-122","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5c5283367ebc55556ff345ac19e3e5e6dfa707181854e7416a5d64bf31a68128","target_edition_id":"edition.r017.id-id.draft","target_line_end":981,"target_line_start":980,"target_local_id":"block-122","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[980,981],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8ff4fbddf9d379bf143fed70c991f345296c9654ad1028fcc00da9888ccb4c46","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-123","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ae64048cc4ffbbd0b51361379c1d7638c899490f4d8a90a1cd7c957daeb54d18","target_edition_id":"edition.r017.id-id.draft","target_line_end":983,"target_line_start":983,"target_local_id":"block-123","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[983,983],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1b196eaf886dc9eca9e212fdd46fa5c1f2484d1bfb1acdfc8468b10500d195cc","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-124","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0ec6d0333b9f08e1d243db09bbbea838d0a76eb4ab99af40fcab278f37a7df73","target_edition_id":"edition.r017.id-id.draft","target_line_end":986,"target_line_start":985,"target_local_id":"block-124","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[985,986],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f4a2dabd4c5ba6f1d1cea8f156b2f54ed9f52b087a0c0519a2ebdcf4e4b71cd4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-125","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a346d45e08950b634197b89a39a2f83e10cf00130d8c3ce9ac96ccfe8a3ffa2e","target_edition_id":"edition.r017.id-id.draft","target_line_end":990,"target_line_start":988,"target_local_id":"block-125","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[988,990],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4518b0f4d390f0e14c0de465eebb1b1a474218e16bde7ef2283b3aa3a83e7832","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-126","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d2e7ecb929055a297bcb5cbcbdaefa229d1f8ea1d92cade664152daa397c63df","target_edition_id":"edition.r017.id-id.draft","target_line_end":997,"target_line_start":992,"target_local_id":"block-126","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[992,997],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb2f1157fa8011bbcd70c08454511e75a5dabcaa8190e37964295d62d0e2b51f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-127","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4be041403c98209337dd744f5ad438cead3d930b8ebd041df9b131fc69a0ef4b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1003,"target_line_start":999,"target_local_id":"block-127","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[999,1003],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f468911d18905be7739f8d9cec43b90025c1d73a3a08c67047f8710ee011356f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-128","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1b7b309d1afbdb551f919bd29080e0db36a298511aff75823015dfb37a7ffba9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1005,"target_line_start":1005,"target_local_id":"block-128","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1005,1005],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9fb53bfb2d7edbf7621f3923d77b6eb54df5d5bdfae7263aac15f9fec2beba26","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-129","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ef358b3f332e485b15df2c936b81b3a1b88f5b69cea7e948abaa4e5ceba07035","target_edition_id":"edition.r017.id-id.draft","target_line_end":1034,"target_line_start":1007,"target_local_id":"block-129","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1007,1034],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"617a5d7efc8588829c18b30a98c0c65efbf625bc2632d531b111bf802a71a41f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-130","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1036,"target_line_start":1036,"target_local_id":"block-130","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1036,1036],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9de1ea9ed7bbe2bd55bf9e45f85f0c5585e92e9f39a3579be1dd97926988564e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-131","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"208d70e5be6f89e01e8cf039bed14cd30106f2a7fcc8ec53ca2ef731b0491932","target_edition_id":"edition.r017.id-id.draft","target_line_end":1038,"target_line_start":1038,"target_local_id":"block-131","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1038,1038],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e92fe34bd4f496d48aa1f711721058ccc0dbe97adb461ad0d5799b15baaa3ce","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-132","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f86e12e786072ff753f4398c69da5eb6b5edbb9f57206d503189d7dea577bd4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1043,"target_line_start":1040,"target_local_id":"block-132","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1040,1043],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"015bfd667f4f5d26515989c61fab5b2717f5381ba69653bb56021421c62ce60c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-133","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"93d89217306e7548d8f4ab89aaa4dca0c950094a57a9470abbbf4b1ec8cb5e42","target_edition_id":"edition.r017.id-id.draft","target_line_end":1045,"target_line_start":1045,"target_local_id":"block-133","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1045,1045],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4441bd4a868cea0ef56a2736d416da257bde8fffd85532095043d4f46e594469","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-134","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dc3bfc06c9e08579ce23ddfcd4a086a21376c7d359f7126d8338ed09f5043ad4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1058,"target_line_start":1047,"target_local_id":"block-134","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1047,1058],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e259d20c1339bd77c5442ecbf7c1df39e0409e45465ca3872fa91cca5c4172a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-135","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d5fa2d3d08fd28ed2d96ed3ef1659fe3eafc6f9f73642cd4d374c91f9f13209f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1072,"target_line_start":1060,"target_local_id":"block-135","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1060,1072],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d44d04bf1c96e802361632f62d34d8c0abbc169a3a2faf49fa5e455140f1b60c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-136","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"16e08dc0fbe1d0a8cf13e1fa2a8203fea0d2934b8fc36046e6bcf322fa26a75f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1117,"target_line_start":1074,"target_local_id":"block-136","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1074,1117],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a1e9feb9a9f91a02a8a727ae96a9d08a79004e3873069ff07f59cc667ad5da8","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-137","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"493cac1cfdfe898147369329da44471252e3b632e21fa1db91faf49c173b17a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1119,"target_line_start":1119,"target_local_id":"block-137","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1119,1119],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"38c6fd5574604af8bf099d99004f852382fc056a988d13f03f6e49e325882a83","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-138","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"74d3cbacdbcc7687ecb59cd3ccd24986ab2317e7699ebe093daa8671682a013e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1121,"target_line_start":1121,"target_local_id":"block-138","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1121,1121],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc23ae3b338f193a90ff97fe3d4cb02b6d458901cbd3b788ff77ddfbb0162d0a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-139","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"211dceaaacbeaa294417e2e947f2c57fabdc5814b16b026062b7cdebfe8bc1ef","target_edition_id":"edition.r017.id-id.draft","target_line_end":1125,"target_line_start":1123,"target_local_id":"block-139","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1123,1125],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"42a676025d422cbc1f3efe3ddb7295c26ef075d74ff69a3349eed0f413827609","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-140","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dc6cba7bd34465fc19a1b69cf8fdfb3c21cd0fa3b6e2942aa256981b40729c18","target_edition_id":"edition.r017.id-id.draft","target_line_end":1128,"target_line_start":1127,"target_local_id":"block-140","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1127,1128],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d8067ba1a647bc512d752938f3df523f07751c99311bec9b7cfad814935f8822","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-141","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0c530307c31d31b95d23c9cd3205837fea5d143355750399cf0d50f249f534f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1133,"target_line_start":1130,"target_local_id":"block-141","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1130,1133],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c31e579c7f4bed1efdd8734db27019d055aa83be23fef6fee40d90cdf98d3928","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-142","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ac1ff94b5c9559a3712a278f4ebc0f41df9f58610eea26e77e3cb96f2ba2b53b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1140,"target_line_start":1135,"target_local_id":"block-142","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1135,1140],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f953686569f2163a166d8788dc404e063459416f9700c3d61b584793c581e779","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-143","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"02ec997876199692c7b155b9d243062c3ddab2fc2438c02892f284d859c874d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1149,"target_line_start":1142,"target_local_id":"block-143","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1142,1149],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80bff05a19df194fea1d0050d9020aa93988abb8ee605424e0cab2d26159a4bf","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-144","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"636a403422ed4cfab0b8b6f3e7ed36ab6d9b345e8167b2adf7733974699384a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1160,"target_line_start":1151,"target_local_id":"block-144","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1151,1160],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8bc5780d501bf329034435fb80012622134b82291397eae0a494112af6871cc9","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-145","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d71406eb0bd6df0be558e0e3e9ec15d474cdb1b0ccd230863e1a89cfba712b6d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1163,"target_line_start":1162,"target_local_id":"block-145","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1162,1163],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fcf52ee4e65a6397eab8692df33845a36cd3bdecfcdacfb2f0ca9244eb87c37b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-146","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"98d8aa7a4a62752c9fb7b6a44552804165295fec6d70a3ebbae67595c8c47949","target_edition_id":"edition.r017.id-id.draft","target_line_end":1166,"target_line_start":1165,"target_local_id":"block-146","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1165,1166],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"518b4b408095c75e73c0c686003b86b7e5b051be9192ef9094057d4a26cd542a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-147","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ab741e4628eb7c717ba2176e492b419f80dd0b0a5177df2cd00827aa80a24006","target_edition_id":"edition.r017.id-id.draft","target_line_end":1171,"target_line_start":1168,"target_local_id":"block-147","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1168,1171],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f47b6462d84e82218d01b9b04fd2414437e8c1c4091a3f8ccc122bcdbd7b24ed","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-148","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fddf4683208dedebcf0f623f0739b476ad2c9b337ae8cd6e759bc49b0bdae40f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1174,"target_line_start":1173,"target_local_id":"block-148","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1173,1174],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd2ff35b14b67a2b9321b542bf641d72e80e9fcf90763198b5c48f6988dc8db1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-149","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"719bda48a6151df177b88804d42ba47ae81529dd3a0e1b4d6ec15dd5a5631727","target_edition_id":"edition.r017.id-id.draft","target_line_end":1177,"target_line_start":1176,"target_local_id":"block-149","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1176,1177],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d2533c2315bf658d5cc573791ea0073dacc1b545734fdc1cdd3fb3a4b743c60","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-150","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"afc9a43573c1c182ffa30aa415518e44c5dea9097b56d2dc8dcf93897ea8ff22","target_edition_id":"edition.r017.id-id.draft","target_line_end":1184,"target_line_start":1179,"target_local_id":"block-150","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1179,1184],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ca00b5bf5f52f33247c19d42824d2fd10b0bf433fa94111f224c473477f1a77","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-151","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06c546aadb809a38813ef832966ccaf1e05947fd84687ad49bdf58a89f52ff5f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1187,"target_line_start":1186,"target_local_id":"block-151","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1186,1187],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e006bd81d567be3aee902e67f5b3c8f6fbbc61ad8f302ce0979b037c67b8c3f2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-152","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d50a118d3f19200028c623c3ddab9cb9945add78c84a3cc0fbd31d2503605d50","target_edition_id":"edition.r017.id-id.draft","target_line_end":1189,"target_line_start":1189,"target_local_id":"block-152","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1189,1189],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b5d74765f40df423b61b7b0c6b4825de2d2de09867008794a821a9582a9b0af5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-153","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"97b338d61e1603da703d7cbd21ebd8c6b6a70087455dcedcff28fd81be2a8b54","target_edition_id":"edition.r017.id-id.draft","target_line_end":1191,"target_line_start":1191,"target_local_id":"block-153","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1191,1191],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cbf00ba9b12a4c2f24f71a51dd9d2b98514b2fc1114d29b4940e98f16cc47e46","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-154","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"47920da9743590551ef296b00e6e5570dfdf41518a5bd0078b12f043411aee15","target_edition_id":"edition.r017.id-id.draft","target_line_end":1199,"target_line_start":1193,"target_local_id":"block-154","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1193,1199],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"526e2f40599bf1e640a946396cc12c86215ec3b43cbb7f54fd1c9f78a50c5164","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-155","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"536787968a5302bf7ad42d703defaff9de48aecac2efb783c710e96090031589","target_edition_id":"edition.r017.id-id.draft","target_line_end":1208,"target_line_start":1201,"target_local_id":"block-155","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1201,1208],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c4caec63da7162f0a73f7678278e6afe250c91d56cd1f77d22dbe110968f0fa","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-156","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"97178d32750451f34c37b65ba2bb1eee7dfddbd2088610e950917578f7fa9553","target_edition_id":"edition.r017.id-id.draft","target_line_end":1211,"target_line_start":1210,"target_local_id":"block-156","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1210,1211],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7e68f3bf10366987d04a596af7240e7587517d9148abd84997897c4d25d468ba","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-157","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"622296dfaee6f9ea9374b12088d0bf29e6c49b0c15caf0d7df21eadc4ba9ca9e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1213,"target_line_start":1213,"target_local_id":"block-157","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1213,1213],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"382601d907616ad3969ef576f97b0bcc95ed96a227d8f4f52dc9baa8b2a1d547","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-158","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c4f592e0383dc8bfb1e99c472bfce75b3c17612e897a6821179aa9c15287a7e3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1217,"target_line_start":1215,"target_local_id":"block-158","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1215,1217],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"278deaa558bbef1b92ebc53deda3e6efe42f3458abab4593391df61c53fce9c4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-159","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e23b296f6fcceeaaaf03d8cc080676ca8c0c59e1fe7434f1735521e99bb50891","target_edition_id":"edition.r017.id-id.draft","target_line_end":1221,"target_line_start":1219,"target_local_id":"block-159","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1219,1221],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"edc1356cf4f328902b3ede8a30f0b3225689b2301ee1d6fb4029d767af9ace3a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-160","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a0d97250799bbcd7c658f2ae8f4e6230138ec249778e9c5c42db093070a0e63c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1223,"target_line_start":1223,"target_local_id":"block-160","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1223,1223],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d09b28060850ecb7f42e9dc8bd825eb326b272e28fc103454a3dd19f63e9b988","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-161","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"59742c0ea065e0eb51f96f9ae36264db6ec1305da0e50cea6c4be023cd826c8e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1225,"target_line_start":1225,"target_local_id":"block-161","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1225,1225],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f7f50d07d071aae2cc27df5d37409a50cc1c1f7124013f65b35b0e1089c2039","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-162","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aa7cb8ae7decbca365cd35df495017f764a691de243ef330dc5d6953280f81b0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1227,"target_line_start":1227,"target_local_id":"block-162","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1227,1227],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae235750c1f688e9f8c1a06dbc5f563055b14a859e69580b34af915962b06223","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-163","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fcb00667b1463ce6a27e17b61f26f6fae14a66663e0c59f5720c6771a386b02b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1230,"target_line_start":1229,"target_local_id":"block-163","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1229,1230],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f03ef735f743677847e9fc3b04da2aa2360cc324a2aad8b750f63e7d8a34433","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-164","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7bbd677fdeac9ec81451e242cca3b5370c30014bb4b840c7c08ebf4448a8894f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1234,"target_line_start":1232,"target_local_id":"block-164","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1232,1234],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"28691d95570b9b4833554ef75e75c599f69fb64e44c1acca24ecfd8d822148a3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-165","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bda9cffd612d429c787afaa32304623b9377c1a14090216024e8309f77c4c2dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":1252,"target_line_start":1236,"target_local_id":"block-165","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1236,1252],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c78929b3733ce93bcd845309819bdb682e216864159fd02d534721d11b6185d4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-166","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f0c756e63b0853e6ef7f597b306e59a14a15e344f6fdadeee53528a6ba9eaf93","target_edition_id":"edition.r017.id-id.draft","target_line_end":1314,"target_line_start":1254,"target_local_id":"block-166","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1254,1314],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9efc4148fbe6be83e1fb76bcff6b7946dbeb015a5ee230bf79fa58af89ab5fef","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-167","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"df663527fda86ea9aaaaed8cca0833585168913558e1444da25d8c67cbdf340d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1316,"target_line_start":1316,"target_local_id":"block-167","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1316,1316],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c4982fc947433ef9f587f24fc7ffe95a747b379f5eba5aa611eeb7b17426b32","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-168","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"61cc4a4d72b1a483327eaad1adae07fa04db37cb55c01554cbd2049987d8329a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1319,"target_line_start":1318,"target_local_id":"block-168","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1318,1319],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3e77e67db5a628684e9b165776cac89de354d3bbf3e94ab849d26198c0765a33","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-169","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d7f901975aee3daad3abf708cab6a0da5194c6e3760c5bc163c09a5dfe32eb47","target_edition_id":"edition.r017.id-id.draft","target_line_end":1321,"target_line_start":1321,"target_local_id":"block-169","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1321,1321],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b14a0d6c13dec8857420daa34c5f9aa8d37d7abd3949074f14c9e0bd54cea64a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-170","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"548cbea84527565285c1f10309eb474058f7d0dce5a8a0c4abbdbb8f04d31e79","target_edition_id":"edition.r017.id-id.draft","target_line_end":1324,"target_line_start":1323,"target_local_id":"block-170","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1323,1324],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2cbd6f4eb04bd7f2eb2e216d1ce93edd9d79d07f4459a820694b0fe6658d67a3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-171","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"de36498b3ee53033f3bf7491bf7e88e6f5f518066adba249c686f98eafba2f6e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1354,"target_line_start":1326,"target_local_id":"block-171","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1326,1354],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ff6fe69f3f68bb9e64f23ffb64a61967527aff1a031b09364c1310dc88f8e0c2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-172","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4664c80ed22b1554e28b3de833fa13065383df532d5628ccdefbfd8c6b0b16de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1356,"target_line_start":1356,"target_local_id":"block-172","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1356,1356],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c59db4ac0be3d7922705b0d7bdbf58cee9ae345d26c0d3c6c60780b0800a8c4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-173","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"30da3f4debba6fafd072faa7a3331a9be82db5e735f413c7781e785237f4b7e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1368,"target_line_start":1358,"target_local_id":"block-173","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1358,1368],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b673317024b8d0859931d1684de03952bfad3be84c2107308d9d92a3e2ca127a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-174","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2aa5d97077b8d4d4ac515f5cb6873647b5e7d775932a2ff7b54a55c09bbc96e7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1393,"target_line_start":1370,"target_local_id":"block-174","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1370,1393],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"619bb5ae11bb7756ddd330dac36cb9ce0308e2d83f09d96ebf986bf046bfa7c8","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-175","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"df663527fda86ea9aaaaed8cca0833585168913558e1444da25d8c67cbdf340d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1395,"target_line_start":1395,"target_local_id":"block-175","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1395,1395],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7025a6a083235a4f68fa5cf0d0acff06c1ae47acb412206f08acfcb2747216a1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-176","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2f895321da64056041906ba1c0d33f8be4ebe12c6d4b6b5c795c27482d25b814","target_edition_id":"edition.r017.id-id.draft","target_line_end":1397,"target_line_start":1397,"target_local_id":"block-176","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1397,1397],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fbf23cf08cee6b0763b465ed04c94d9542d7f56a50fede41a2f66f57e943197d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-177","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0ded7a743e7b3f931e5186b3bcdb36fe9a11d32789b6d59bc59445dbd3b398ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":1419,"target_line_start":1399,"target_local_id":"block-177","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1399,1419],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bd1911f4ef97d5c3bc7466cf4fe8f4a4701328dd873b532dfd9b42feea9805f1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-178","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6c570ec06872fea5f87715e80f9370c00e968c68fc1bffa451bc3fa5f7dac059","target_edition_id":"edition.r017.id-id.draft","target_line_end":1448,"target_line_start":1421,"target_local_id":"block-178","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1421,1448],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c403d3bd3fd0318b4646603873c7e4c4ace87020e2d63d94baeaf7264f3aa62f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-179","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"df663527fda86ea9aaaaed8cca0833585168913558e1444da25d8c67cbdf340d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1450,"target_line_start":1450,"target_local_id":"block-179","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1450,1450],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dca04c502df755d19120553bf65186062926c32159c436e8973f8fed9eee09a4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-180","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dcc6e6495f0be6056a856e63d1acec01ad2634206bda52c32dde5e473fc70e99","target_edition_id":"edition.r017.id-id.draft","target_line_end":1452,"target_line_start":1452,"target_local_id":"block-180","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1452,1452],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a789f3612bc27da78693b6954bc9def0c75a77fc6960c68356570d75b39ffb2b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-181","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b4af32ccd01b8fff97ded68fb1abcc3e91f8033ae77913765020a41c4853340a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1461,"target_line_start":1454,"target_local_id":"block-181","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1454,1461],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"32e8ba204ecccfa635315cd1d1c585f4e3dfc02772ef681a69b678fad4426929","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-182","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"366b6bb2fedf65ddb447ead1ad8d80847dbd0e29fbdf349f854bf3235d43de7f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1469,"target_line_start":1463,"target_local_id":"block-182","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1463,1469],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e44ef5c7be68e4bee33f7704025fa4dc61cad5aabe5bf619beae78b9eccb881d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-183","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f70e7ea658852db50534d444e9548bc0d8e3823778266edf347d5f2919fa641b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1476,"target_line_start":1471,"target_local_id":"block-183","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1471,1476],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f0e68cf709b95e4a28d333fbd91ddecac3dd8660cac19c27378d37efbb44152","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-184","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1013d51d423160236e326ab7a66b31a106e2410b5dd96054ae682177da96ef72","target_edition_id":"edition.r017.id-id.draft","target_line_end":1481,"target_line_start":1478,"target_local_id":"block-184","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1478,1481],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76a65f8b8727e5ec3bd8dfe5becb7770ff7676844031e7825d5758d248f0200e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-185","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31fb95e81fb37b8654095d5887dcf9b216678ea7ec13a7ad8d901f3b57b1b2c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1485,"target_line_start":1483,"target_local_id":"block-185","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1483,1485],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"43041c2f5c7eb195f489cee9c8425dd6d05851198cb5a539030c69ebd716321d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-186","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"447a8e50e1c1b2e74811d6eb5cacbf00688babfaf288a823c42772784134158b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1489,"target_line_start":1487,"target_local_id":"block-186","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1487,1489],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9ac2e146275aec9c4490ef5c0ddedbb4267d1f8bd1f4727b08768bf1fcc093e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-187","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6484e7ea804809cb674faae1a0abab4f917e5064e6acc24cc14af3843f67ea9f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1491,"target_line_start":1491,"target_local_id":"block-187","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1491,1491],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b110df2d6a26950de5ba4a9ce534bc831752da92fc6f50838aba73422b0772c1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-188","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"11599c0e8bc5b70109a080b1a653e96ba907a4ea678b734ce17e902139f3ef61","target_edition_id":"edition.r017.id-id.draft","target_line_end":1494,"target_line_start":1493,"target_local_id":"block-188","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1493,1494],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"06b5ce538f1afd147d27144bd36744d349c1c625a7c92b74918a47ff961259da","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-189","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0dc894f86a6254a3dcc32c2abe954a6c7083eb3d57b7589e8c31dbc3d62f7a4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1497,"target_line_start":1496,"target_local_id":"block-189","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1496,1497],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d13b46f5651b82f935c96f632b758fc0cd03e2fe46fb60872181186117664010","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-190","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6511fd5792df9deaa44eade7d8c586828766efc58d7eeaa2f962ce53e6945e1e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1503,"target_line_start":1499,"target_local_id":"block-190","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1499,1503],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a21a992295d5a694f9f422245328b6c5358f0dda37c519d2eb485c61dbfdc53b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-191","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a17800ac04d517d51fdc1bc8094398941aa9861501a0302a35f4764d0ba046a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1506,"target_line_start":1505,"target_local_id":"block-191","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1505,1506],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"93166dc4c7b0d15d5e7061187089af48293cea92b5942acf26782363d84e0ab1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-192","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cfe8c6d4e6a7f5df9259e8baedc5ca9ed6f0d0b2ab44395042dfe9f9214223c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1510,"target_line_start":1508,"target_local_id":"block-192","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1508,1510],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d3bee28ff0b7e943d7a7a263ce5f224a042b8f2e9fa6d1d20c27b800d0d90da0","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-193","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eaf5fb98aab67bc286de16c23a50af251f50ae044637c02b669d23df4d90d4c2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1529,"target_line_start":1512,"target_local_id":"block-193","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1512,1529],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6c3539462a6ac216e65d30c02acbb47d4e29a0d825faf467ffa1cc9b005a20db","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-194","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"230abd0eb4c45797de77c81778c81661180d5b16e23ddb04a8f45f5c3876ad64","target_edition_id":"edition.r017.id-id.draft","target_line_end":1531,"target_line_start":1531,"target_local_id":"block-194","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1531,1531],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b946f2ca22281074054297b068e7affbe54379906caa7f265f3ecfd7b06ba2dd","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-195","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e5f02c349e2ec3b8a31a2972098e2dc5bc862046871e70a2653a848baf4ebac7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1536,"target_line_start":1533,"target_local_id":"block-195","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1533,1536],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da7155c843a8ed5937a9100cae1a39a55793a102ef3473aae0145ffab37f055e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-196","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd962543eb871e32a3f2a40a65954cc326605dccc2b7e5564ee49323c2712cb9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1538,"target_line_start":1538,"target_local_id":"block-196","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1538,1538],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec0ee2bcdf0f404caaf0f00e7075c205b012543e64711cb46e8b25014a07fed7","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-197","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b9584a66437edbf60391593ae81cfe47726d1060d94a7780d3eb3d5a62df9a5c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1548,"target_line_start":1540,"target_local_id":"block-197","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1540,1548],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"77a87de2bccfae88223f17d72c59ab1046bead016eb29d8584586e47f2d81cfe","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-198","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ce00fdcb64e805e2b7a4539e5a90afef1299e0645485468d07373d119e2574bb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1550,"target_line_start":1550,"target_local_id":"block-198","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1550,1550],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de69ddf3437605468ee354f3a10ca8513afb0eec66247b16e2cd71c445f85724","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-199","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a83767124526518d6a9d44e8d81a68712184a8f3408b598ea105326a31e2c581","target_edition_id":"edition.r017.id-id.draft","target_line_end":1559,"target_line_start":1552,"target_local_id":"block-199","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1552,1559],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c0c6a6b29002aa013a345323af38e2588ba48210f7ad1cbdd0f6e019a11453d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-200","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fbeda2776168ed87918aaae846ce833b826a6c30b9e3dc534e445bead5be47a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1587,"target_line_start":1561,"target_local_id":"block-200","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1561,1587],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6db57e07f6d134e5810eefeeaf221d9d04e90418c054aa7e828abbebca827735","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-201","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"57215cbee0aea40989dd2a4c366550c90bdd241aebc6a0da5b8b5d13bc803af5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1590,"target_line_start":1589,"target_local_id":"block-201","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1589,1590],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f22f64c6ff5c795ddfeaf3cce0199dc34c959f976b52ddb9cfe4ecb66ed7a061","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-202","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6c983230289276d50eb20ba67ab23ce9ed72fcb0652dae7e317ba9687c303f69","target_edition_id":"edition.r017.id-id.draft","target_line_end":1592,"target_line_start":1592,"target_local_id":"block-202","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1592,1592],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e708e68f6fca0108fff6f94dbc281977b6d5087a3dade0a8e714cf555ebe0ac","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-203","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"394e74854f635015193acf2186860f5ddb60bdc66b76ee98229ab028c55cff21","target_edition_id":"edition.r017.id-id.draft","target_line_end":1605,"target_line_start":1594,"target_local_id":"block-203","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1594,1605],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"66f632be1e425330f182c85ac380ac905677d3bd11b375a5b24af255fa5817f8","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-204","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0c135b8e06012522f5116b348fa72a06f7517634a6d45673bfadf96a66e20cc5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1607,"target_line_start":1607,"target_local_id":"block-204","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1607,1607],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2851df5818d00f470425658ce3697b463954fa213f961947699f8e144231271c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-205","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8298d7f892162fd73b6b6a84f30948a1e6d983062f75677aea2a851b5b57dc08","target_edition_id":"edition.r017.id-id.draft","target_line_end":1624,"target_line_start":1609,"target_local_id":"block-205","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1609,1624],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8eb5b46c9208e4e81a70ae333eacf75812f9c9f926962b1fdab139d1e23b60df","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-206","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1446e24c956babc921a48f45d1680402ae600d7b4849d569e3f794350fe015dd","target_edition_id":"edition.r017.id-id.draft","target_line_end":1667,"target_line_start":1626,"target_local_id":"block-206","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1626,1667],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d72f353c2af8a7dbe447a606c89ab49dea5985f0473709634cd8ff762f08ee2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-207","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e6328a741b5b3e9566990d7b990d2405dabf8302bd422d806b06ef660bd6c6ea","target_edition_id":"edition.r017.id-id.draft","target_line_end":1670,"target_line_start":1669,"target_local_id":"block-207","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1669,1670],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7983c10886c0ca94ccfd5662c68bba1503c738c8e64f7bff84b0a6d932b45b3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-208","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"751095d9d949cbab240577e23d8be20e4ffcb28460f5af629599d8603c692fc0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1672,"target_line_start":1672,"target_local_id":"block-208","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1672,1672],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e18630d24f1852125c27090bb9001238eb2034584b7b7dac9ebbae92d7694c7","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-209","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a6b768f501efbb3709a6610ebfc5ea7e9eb53e782db6bbb4c89639085cff7371","target_edition_id":"edition.r017.id-id.draft","target_line_end":1676,"target_line_start":1674,"target_local_id":"block-209","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1674,1676],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4604807dc7430a65dc7f06146603dc6b0befd17989f28bf61d48f1b976f75633","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-210","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"82d683d80022ed6d5abe01a679826c97ddb2fcadba979bbd9855bbabf9b65f98","target_edition_id":"edition.r017.id-id.draft","target_line_end":1678,"target_line_start":1678,"target_local_id":"block-210","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1678,1678],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18d8810a7b43acb56b50fa3361bc29d88363f56516581ec16fb732967b72b41d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-211","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"444090bde130ba27f43d219db5d407c127f014bbc1336132a05ec143f570648b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1680,"target_line_start":1680,"target_local_id":"block-211","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1680,1680],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc5e207b1639bba7ffcada1ed0e8a0d505b98ecd87eb419047b5ec36427576f5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-212","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4dde9b1eb925b3525421e7764fb886f8afd0c6457d53511f90a9e33282b685e8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1682,"target_line_start":1682,"target_local_id":"block-212","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1682,1682],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"49ed42a22ad87de4bb14cc5937e4ef600954806d9aff70738e51e41eb6333a04","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-213","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c38272c93ff104277d89be4b1d0f84a7a392a62c7185f5203e1eb745fd88cc57","target_edition_id":"edition.r017.id-id.draft","target_line_end":1684,"target_line_start":1684,"target_local_id":"block-213","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1684,1684],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ddef4f479337a9ec701c336857c1ff9bed8a1b7a82b8ac4f0b9875d83f228f4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-214","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"52e21858ab8aaffebd09eeb9a2275d00b77fe0394bc9a3fd4447a7cef7cc3b3c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1686,"target_line_start":1686,"target_local_id":"block-214","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1686,1686],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cdb8e167440c836bf6ea3c86a8550d37d54fb2775c20041d73f188525aead4c5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-215","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a3a1de4874116158df7ecd94d238a31a22dbc4d412d002d0258364bb94bba200","target_edition_id":"edition.r017.id-id.draft","target_line_end":1690,"target_line_start":1688,"target_local_id":"block-215","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1688,1690],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7676b0894b56301c0eb3c2efd6a347a4299f9a6e19d865fc11baceadf5f50785","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-216","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a970a5788b74cebd5ec7da8efcf4878e796787a58a92b00f98a0de70361a1ee","target_edition_id":"edition.r017.id-id.draft","target_line_end":1697,"target_line_start":1692,"target_local_id":"block-216","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1692,1697],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d3b6ed7abb4e01dd98e737cb04722906df5f3ef662e5329302abc5b172b86fd0","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-217","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"252e273cc5fbc978abc6ccb91a561a69d87ad307444792c891517631cf877351","target_edition_id":"edition.r017.id-id.draft","target_line_end":1699,"target_line_start":1699,"target_local_id":"block-217","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1699,1699],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37dbae65cf6ccd58cce7e471b7dc60ad8aa6b01994aa990ba5a221314e43c23a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-218","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f70877b0a153d2b3f8177e567d38946a9d7dd4d6d1725f20b1ffa214ef7b1824","target_edition_id":"edition.r017.id-id.draft","target_line_end":1702,"target_line_start":1701,"target_local_id":"block-218","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1701,1702],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80b1841a3e6a3ad06896548b2bacf0ba262353e5c7256511a3d019f9633fffb1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-219","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e90e1381aeeb279daaa548fb6529bf48b156f9e817a8475f79276148b9032042","target_edition_id":"edition.r017.id-id.draft","target_line_end":1705,"target_line_start":1704,"target_local_id":"block-219","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1704,1705],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"91e11743495293dfc2a5cf840d42f9fa1cc655e274f831fe883a12b5f4900250","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-220","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d4f50114e1aa3188e5455ad99d21ea037ceebfb6b4ed8bc955562dc8b3a829c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1708,"target_line_start":1707,"target_local_id":"block-220","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1707,1708],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0df753e47611719f849fc89b17515050e694c375c400a3840f77d317932ac802","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-221","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"17ce57e33bfe46006587ecc4cf1808f3d32a774ee1bd0b267be55a2d0923fa32","target_edition_id":"edition.r017.id-id.draft","target_line_end":1710,"target_line_start":1710,"target_local_id":"block-221","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1710,1710],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1cd49db255921320176617a6eecaee779fb82c9de74aad1b70013f39e31bc4d7","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-222","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"da18225ab60974144ef43f9265deeb63868564daaf67bcb25c05e7abd689feeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1713,"target_line_start":1712,"target_local_id":"block-222","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1712,1713],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3d3857cc5eefa87197796943ca2a26a204ac99c7fd06b2c4df9560f301e7d5aa","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-223","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"059b569d32e60ad83cadaae319c443fc8c04ec23f1d63761f65aec4b2bcfbada","target_edition_id":"edition.r017.id-id.draft","target_line_end":1716,"target_line_start":1715,"target_local_id":"block-223","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1715,1716],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c913d4380fd95957ec362937f3be9de4d0a19e34633d6601a1dbe48ae81b6069","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-224","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bf5612c8eaf37f96e70c10c12132717015ead58f95c0d7bfd0da495ff423a6b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1718,"target_line_start":1718,"target_local_id":"block-224","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1718,1718],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd4f501e20429bfcecf21c6ed00a5c13780c81e07e219bc15dc589374c6c2362","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-225","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d8428d60f6f7be0a57036be5597c65b9ee1ddbe4c5c6a63c94ef33ff2552a3f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1721,"target_line_start":1720,"target_local_id":"block-225","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1720,1721],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee0557f83777d6a288eae374895f89a25a4cb3e85c24c9ccba61f538de7fefb6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-226","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"11a42294d5f015fe05252a98ad11db7765a6e222134df14ac534b146155c8004","target_edition_id":"edition.r017.id-id.draft","target_line_end":1724,"target_line_start":1723,"target_local_id":"block-226","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1723,1724],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26d4e150e028bdda138ade82bdd820390c4550f0418a3eb1c3d44ac35c5a6734","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-227","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2459417978b87f05765ba85394147b423dafda71bf603a409dbe5da86393fa92","target_edition_id":"edition.r017.id-id.draft","target_line_end":1727,"target_line_start":1726,"target_local_id":"block-227","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1726,1727],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a83d7f2d99992a396422a7a69a156beb1d0be68e15b4af749884158335120b8e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-228","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b3ab26ceda6ab81c1a18b99a583ebf254acb2be230456a2a940bb3520dbb73c2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1730,"target_line_start":1729,"target_local_id":"block-228","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1729,1730],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5673847a135731a7f35b6eed7ddc3c069f3353b445497eb4a0cec5ce9ac92955","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-229","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"52adfc9929fc0fccc1741bee463caef78a287a05fdda6a899f547cde62367407","target_edition_id":"edition.r017.id-id.draft","target_line_end":1732,"target_line_start":1732,"target_local_id":"block-229","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1732,1732],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b33bb4f2f644735b077d2a59dae9070e6411f8520a2febc8ebece87b8bc3499","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-230","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"969ba20f6a4470bb06b60cc714e71cc0b3ac32bfac6e538693346aa76cd3fd69","target_edition_id":"edition.r017.id-id.draft","target_line_end":1734,"target_line_start":1734,"target_local_id":"block-230","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1734,1734],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bd0a2ce1981e279049cd61cdaf07e721761d39a7f54bc54599756b9d735a16d1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-231","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b3664f89b8604bfc6f668af00cb1e673f09164322cbe527bec3611e00384515a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1736,"target_line_start":1736,"target_local_id":"block-231","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1736,1736],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ac5d1da6a124c0308ee42ded5887eee6c7d0994a24b19e042e9fd8d605de833","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-232","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1738,"target_line_start":1738,"target_local_id":"block-232","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1738,1738],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"686f5958de9c313c6c74e2f223cbb015596ba2ba5d0d4a7970d61176eabb92d5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-233","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c74f78597e8a9d7e92a40cfddecc31ed3d5698d8ba4808764585563a4728b55c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1740,"target_line_start":1740,"target_local_id":"block-233","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1740,1740],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed95979ed906638cd4e41f2d2a94d1c4cbe315aafe72da208fbdfb105e8d5cc7","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-234","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ae78379847e6c8242d6fa4e422ac78e70fc51dbb67851034205747454eccf16f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1744,"target_line_start":1742,"target_local_id":"block-234","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1742,1744],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9150d97a964793b111a29264c96e9295f2c01f4df7bda939320fbc2170082751","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-235","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6210b07d9b6a43866510c43fa3e43bf2272756fe902f6275939c1fe801ab0e0a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1776,"target_line_start":1746,"target_local_id":"block-235","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1746,1776],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b06ecd870af51c05a65342cc34037c77a761275d8120b02d418ac5c07b7ef6d0","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-236","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd962543eb871e32a3f2a40a65954cc326605dccc2b7e5564ee49323c2712cb9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1778,"target_line_start":1778,"target_local_id":"block-236","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1778,1778],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0ec638068f1b040ac6210fe16add2ee93e29a8ead0006613e6c580f7a003c0d2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-237","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cc15adfd8621088f2bf29105f1bf11cbc49e6ef87ef34c5c091c23ad5d46c570","target_edition_id":"edition.r017.id-id.draft","target_line_end":1782,"target_line_start":1780,"target_local_id":"block-237","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1780,1782],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"46d9f24c2d180f6da640761a0911d70e00520fd36fa8580293b2f27f8c504e70","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-238","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f5d286932404ab397c329abc4a7d001c4e2e4da3e08fed39dccd67488d603f3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1784,"target_line_start":1784,"target_local_id":"block-238","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1784,1784],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d539ff93aa10d65cde1de9d081b3abbafb9d010b8e2d3524d9ce10b7a83725cc","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-239","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"096e17c76caedd93d440762e369be675bde0c9923ac41c2ff44b30cdb5e6e7c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1787,"target_line_start":1787,"target_local_id":"block-239","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1787,1787],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8db3cd4dc1481a67d3205c3cffa9d8ae51b780c729778febab9060ee4864b89c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-240","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"be6fb39f7a67aa9c2293de68afe87d307833a5a44f3feadcc730b7ba84fc58c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1789,"target_line_start":1789,"target_local_id":"block-240","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1789,1789],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7e0db38fe5af00d8455412b6458f4ed75fa5767bafe40e9063286c84bc2de49c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-241","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1ebb9afd2cb344c43197b4947de72cdc7201c0b73cd2f747832dca33157ae9e0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1807,"target_line_start":1792,"target_local_id":"block-241","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1792,1807],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"de1f9e9162efe46fbe47e199bfe45b2f5e0fc73e8458adff7a8279a1d4fc99e9","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-242","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1809,"target_line_start":1809,"target_local_id":"block-242","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1809,1809],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a3dfa25973c7bc3b8cc39c0421cd058f3b268e9979b00f7110deb6dfd422b4c4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-243","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"395f2114278f06bc02a45533485590bb8a9ed5ffb0652652b8f92012ac398d27","target_edition_id":"edition.r017.id-id.draft","target_line_end":1826,"target_line_start":1811,"target_local_id":"block-243","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1811,1826],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3475af0710b76fc50c08bf3242059589b8d8b3a14aaebe850adc11d6bcfa598c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-244","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":1828,"target_line_start":1828,"target_local_id":"block-244","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1828,1828],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a059c6b0ab30fc4dd315b3a691bea7473f9f6494d57b6fb3bb133abafd9cc68","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-245","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e15f15d0f3e4b0a1812c2967d64de996837ae2b9ca14b0d8f3e953600d63af2d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1830,"target_line_start":1830,"target_local_id":"block-245","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1830,1830],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8de6354ab72f09030f747f6d32cfc5153511aaae7d164f4ab98c4315396d89bf","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-246","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e718fe57f335fc38318fdba9b13ff30bc8b9a27d8477ad3ab1b97fa7f6fa22e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1844,"target_line_start":1832,"target_local_id":"block-246","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1832,1844],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4771bf3f9a51f7ee71cd9ddff198084f81f7db74319e2b5099eaa645fd347f7e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-247","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e15f15d0f3e4b0a1812c2967d64de996837ae2b9ca14b0d8f3e953600d63af2d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1847,"target_line_start":1847,"target_local_id":"block-247","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1847,1847],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24b8476fd3bac97e4d5e3f16d281167098c4d2886d32197dc5053504d5e36870","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-248","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"099c37350e7391e4ad189ab90a9a75056116a60d03d575e6ed2fe0f46138df98","target_edition_id":"edition.r017.id-id.draft","target_line_end":1860,"target_line_start":1849,"target_local_id":"block-248","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1849,1860],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0fc9a0c6f290ed980880538b88599d45e38e11b24ab8be0abbccd8f480ae8687","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-249","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"22fa7256b5ab6e5a659928853fd2dc469bf10f8905554d47810f65cfa6b02c3a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1863,"target_line_start":1863,"target_local_id":"block-249","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1863,1863],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b42b287adcdcff1ae224a0c510e5e39d232499b240011ce6fe5512a4cf926f91","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-250","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e3472792519d63b2d1667badb3dd3c6c59bef6cb8bcf880cb374da418a362afb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1907,"target_line_start":1865,"target_local_id":"block-250","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1865,1907],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a4c7f7e4cd40f3e43f73b1a9dab3da5b7254100e136e0a3149a8e0f0df97479","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-251","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b6b1919b40e5b809fa255fce336c0a00b088e7c0f8b0ec592602b39adae9c46c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1910,"target_line_start":1910,"target_local_id":"block-251","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1910,1910],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f49c71da71e89dfac44f43e507331fe93e9fe94ae8ac2e03351cb1d3aaef766","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-252","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3ff815c1d76fc0e71e66d0d771abaf6fe828f89b2da064081cbd33397b75d5b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1967,"target_line_start":1912,"target_local_id":"block-252","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1912,1967],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"af20b2ebe74321b6e47841601f1fdea0acaef4c7ba92c5ba029c0f5c2a2a2548","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-253","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a6bebc7464e60e49cad14145655fbd420ca6b6db43042497a92e1d28261c65d5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1970,"target_line_start":1970,"target_local_id":"block-253","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1970,1970],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec9309898b3c06a197189a121db563370ff0ebf70f990d6dc7b570adacec867a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-254","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"65f096c4c5819f85598501556d9cf9b73eb9560688ffaa1cb2b0970aa55f725a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1988,"target_line_start":1972,"target_local_id":"block-254","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1972,1988],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe61912c49ce6615f6da8a533215ac3c1eea205f3951f7e274be04807360bf9f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-255","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e9003ac5b479ab1e7799bbde5abd58751f20f2cd789ddbb166442be9a32b468","target_edition_id":"edition.r017.id-id.draft","target_line_end":1991,"target_line_start":1991,"target_local_id":"block-255","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1991,1991],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a28393e58fb993152bbb86eb1bfbbfef5e9dcdc52bfc93abbf0abb3596c2ef51","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-256","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4af0ba3e8bf940e9954125fc0091c4694ea69feb0e018b9726f6bed2dad85ee2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1993,"target_line_start":1993,"target_local_id":"block-256","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1993,1993],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d5d131e661f584703aea481bff17ff2eb1997e735c93cd9098bfde19ad201aea","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-257","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"39266ca38232502b70511c1d6d18d4b20e72fb819234b9313ac06e1163877149","target_edition_id":"edition.r017.id-id.draft","target_line_end":1995,"target_line_start":1995,"target_local_id":"block-257","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1995,1995],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b07781a67b01795a7bbd4a2e3949ff4461a23df4950fc7862611f9afa7c1d0c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-258","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"20ecc25415a9b22c46914882a1e627ac525127e4ad2a67fff81bab792fa89573","target_edition_id":"edition.r017.id-id.draft","target_line_end":2013,"target_line_start":1997,"target_local_id":"block-258","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1997,2013],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"586f79e6da4c8f9183f8a1945059e8b22978ec92df2f1a73061f0d20a0c91b90","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-259","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"176f07fe1ff15c262c1338ca37166d611f9f17c68dc8af44475baef4b0fe1513","target_edition_id":"edition.r017.id-id.draft","target_line_end":2016,"target_line_start":2016,"target_local_id":"block-259","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2016,2016],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8afee3267d7f5bfd232d986b2564cc591ad8176b219a20336a00747b841af93c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-260","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b20571bf6eeac17f0272b54d8dd1bb014dd263195f126efc2e56e7a84c29047","target_edition_id":"edition.r017.id-id.draft","target_line_end":2032,"target_line_start":2018,"target_local_id":"block-260","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2018,2032],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"46244a7e7492fe9a7472da02f3b7f6503a6191d1fb56b52a9868c030be433db3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-261","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a252e00de80836f514d1dfbd758a87a581de2557a2d001df8cc342950f55f849","target_edition_id":"edition.r017.id-id.draft","target_line_end":2034,"target_line_start":2034,"target_local_id":"block-261","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2034,2034],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a3334daae184f3a6351197a3d4ac03266c8cb0d03de84b2acbab90012fffff08","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-262","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eb8710602fabc655aa6db5257c85d90d27b06cd8835851cb567006ab890cfc32","target_edition_id":"edition.r017.id-id.draft","target_line_end":2038,"target_line_start":2036,"target_local_id":"block-262","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2036,2038],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2bc40be2c5cf27600b073cb0163856531462230d31864f05b22e60e8cc165cdb","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-263","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b21a5b0007053663cb82c5bf3b1a307ca69bcc87e1aa90e52efcef8ea3d6d2d9","target_edition_id":"edition.r017.id-id.draft","target_line_end":2040,"target_line_start":2040,"target_local_id":"block-263","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2040,2040],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ea4b56000c3b5e62da1661100ad3ee19fec07369fbe2f44cb322c0b63ad9867","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-264","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"980b8cc875a6b045417543fa74d9e273d0b95a1234d399fbec525b1af00b9dab","target_edition_id":"edition.r017.id-id.draft","target_line_end":2043,"target_line_start":2042,"target_local_id":"block-264","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2042,2043],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90112e0d77fd798ceb9991176dfec55ea1b8b724df99248edf8fa5516964e742","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-265","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"21085b963b9cc4e50685f3f4d3062e7b399aa7bd4bd929d98d038f6df0363eed","target_edition_id":"edition.r017.id-id.draft","target_line_end":2046,"target_line_start":2045,"target_local_id":"block-265","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2045,2046],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd87e3d1648f3bf1ff01aa0d61a49c7aed9f77b4a3ce078c4c5f83ef1e39d1b6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-266","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"93c8e982fb7dc705372310e976288d67041c1828a013c94f2ddc01000cd43956","target_edition_id":"edition.r017.id-id.draft","target_line_end":2049,"target_line_start":2048,"target_local_id":"block-266","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2048,2049],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"081908937efa9fc6fe34feeb1b4fed09d60b58a8174323c1f2c09ddd2231414d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-267","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4f22427cd9b1c25d4b174b9bd20f1dd5318a0177c9223c31166d45dfd21829a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2051,"target_line_start":2051,"target_local_id":"block-267","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2051,2051],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"32ec5af94d2cf00ce81e8f812d59beec48c0d0b54c3304c1cd1cc7f41511ac81","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-268","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"21f576bbf47a63465c2cbba71c87a1c24d356095ccc9cf346524f3e779a64d84","target_edition_id":"edition.r017.id-id.draft","target_line_end":2053,"target_line_start":2053,"target_local_id":"block-268","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2053,2053],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc9a7a633edf5b3131e2126126808b70859128ce395b53b224c16a43a42d2ccd","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-269","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9e0fe9c9359a30249c27e62a1e31712d3018d0303c68648e76ec86a1f7931f6e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2079,"target_line_start":2055,"target_local_id":"block-269","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2055,2079],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b195742591b1478f0ef9c2797599f9a6da23c33aceb7db6c204eedb1a2fec7bf","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-270","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9fdf21c00971e25f3e6a4ffad4cdb5f3bd4c927e673d73e621b3b3a4571ac68e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2086,"target_line_start":2081,"target_local_id":"block-270","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2081,2086],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c25a40ad3ef58d2ade4d609d43a5b9ad27511ced0d7ac956bb07b4efe5bcc456","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-271","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06f8fc824ec2b3a5983b76b57f99017cdd97cb66de4e4131ab8fdc28fc3b7322","target_edition_id":"edition.r017.id-id.draft","target_line_end":2092,"target_line_start":2088,"target_local_id":"block-271","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2088,2092],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a3c61eb5b8cc58ed881f011446778cbd93c7392fe5b358ae6c64a93afc1a38fd","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-272","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4f22427cd9b1c25d4b174b9bd20f1dd5318a0177c9223c31166d45dfd21829a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2094,"target_line_start":2094,"target_local_id":"block-272","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2094,2094],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"274f0f6e06a29edeed688da18846389db583ec31b747b3c1a9465926f7a12795","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-273","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2096,"target_line_start":2096,"target_local_id":"block-273","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2096,2096],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3e3ee8110e27f1fe74c6a599995b6c3d6289fcc4cb658ca428efbc2ba13043fd","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-274","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e01a5e6edecd30ca6deb5c553aa903bd61c2104e443ebc5df4e4f1b1b5ce0b07","target_edition_id":"edition.r017.id-id.draft","target_line_end":2105,"target_line_start":2098,"target_local_id":"block-274","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2098,2105],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e7a90e5bbcc30b2edb6780dfeaacb7d6c64999c89927c65ca580b6daba2b98d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-275","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"76930302d185124bf5bb592c8a48d12434f4afc0538e3c755b97c3758dfef9de","target_edition_id":"edition.r017.id-id.draft","target_line_end":2109,"target_line_start":2107,"target_local_id":"block-275","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2107,2109],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"56be7cf5425e631b30f1935842eb1f98b69faddc5c84dd86971f644a40f65012","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-276","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"86ef61bb476c55862786c31e52f0b4ebd4607006b00c51613d6be046ae626e02","target_edition_id":"edition.r017.id-id.draft","target_line_end":2118,"target_line_start":2111,"target_local_id":"block-276","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2111,2118],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"15311310cd18fe49b5468f3947af9bf583e7db8fa274e672ba7806faebbcd886","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-277","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6af9437acebaa0b5874b3969c10c5bc6b82ac3e39d558b6b0432d9f78d47c70c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2122,"target_line_start":2120,"target_local_id":"block-277","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2120,2122],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84f109e0fba775942058fe6ab8c695ac6f3e0e67c602b31c547fcbbde5873c1e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-278","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6c8b823709ef0fb55c6820cfa561c256669873649a3d53ada637115b277d59fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":2126,"target_line_start":2124,"target_local_id":"block-278","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2124,2126],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e551a7b7fddf4ddaa84cb49ab707ee31beb557b3a582d34274a7446f285b1caa","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-279","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"099713b23b32048c6fb3b19b95b2998c9e5d50595d09f906049a0afc7b701522","target_edition_id":"edition.r017.id-id.draft","target_line_end":2128,"target_line_start":2128,"target_local_id":"block-279","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2128,2128],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8d6800b583b4d37e8d6224f024dbda96d14049df873cb70c8b9b98f199ba5c40","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-280","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d086f1f947632e5433f2dfbc2b6addda7806b8e8e82e53af63d4b890245da8d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":2131,"target_line_start":2130,"target_local_id":"block-280","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2130,2131],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5bfc54aa219f95c3a3952dee969405d36cf2adfdacefc67177e80a9223cb6554","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-281","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c164726c909476de7fa28224a5aab911a3d27031c8b0256b48fe223b74f0bd22","target_edition_id":"edition.r017.id-id.draft","target_line_end":2135,"target_line_start":2133,"target_local_id":"block-281","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2133,2135],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a7ac4017f8d69d81a491f6043846f2ffda04c8fa94e4a7bccd36a3c5ae059268","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-282","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ff7934c3f95f174637c5195b1dd5c86cbe0dac33546704953e22cf9898624b80","target_edition_id":"edition.r017.id-id.draft","target_line_end":2179,"target_line_start":2137,"target_local_id":"block-282","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2137,2179],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"557acee6c9a3e1953eced288375a26dcfc85215b53144fe9551b2a11718625d1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-283","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aabcda3a4a17abfb63f793e514b33bc1da47d373e02526a995a050c79893aa88","target_edition_id":"edition.r017.id-id.draft","target_line_end":2183,"target_line_start":2181,"target_local_id":"block-283","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2181,2183],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"266690d8f8050addac3b7bbfcef8572a83406631669a969a4afb8894dd2d5ae8","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-284","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bbe9f72ce1ec048201f1496ad2336dc79e71cde3d60b38153397ac7f7219cd1d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2243,"target_line_start":2185,"target_local_id":"block-284","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2185,2243],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2962ac04a3e5042531370c975ea8ef6aafead5139502e0741dce8c14acea6be","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-285","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0f300e9258e836cdc17722e4eb4fe7cbe25236b9b11a08a3b71fa1094837ed3d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2245,"target_line_start":2245,"target_local_id":"block-285","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2245,2245],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3e9e161c6573ae4134f5d4f5eba50ec4c31c000f904ddd2b5084576f208e7e49","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-286","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"63fb15e78d2e1fbb50437d8f01aa32019e2cd3c0781fd52c854beb480de71502","target_edition_id":"edition.r017.id-id.draft","target_line_end":2247,"target_line_start":2247,"target_local_id":"block-286","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2247,2247],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"099eb960a7d43639983e7b3ef7f493083f0eebbc4211ca249fefcdf98e6dd577","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-287","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b2c71b5ac76122fc939822b6f64559e74de8130b2a9608582d20e2fbe64735e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2255,"target_line_start":2249,"target_local_id":"block-287","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2249,2255],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cec14161f2b9084402eb8dfaddf99b5334bc252bb0e211d92b751f583aa79849","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-288","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ed9a8e6432925beb40da62b4e111b4de7b49bec7263c22f3d885b1d881c5b690","target_edition_id":"edition.r017.id-id.draft","target_line_end":2274,"target_line_start":2257,"target_local_id":"block-288","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2257,2274],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a8e85a8bdd37b5c826a33131e7ae52f865130a1d88e1c344e7b31d27dc32d169","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-289","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5d1c5940ac661152957a70d3fff59cacbf80e7bf1ef43fe89f117518d58d62a7","target_edition_id":"edition.r017.id-id.draft","target_line_end":2277,"target_line_start":2276,"target_local_id":"block-289","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2276,2277],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20e3fbaca86cd6d644c9d31222154d7254ad724fb85bd3cbcc8d11a7d371c6d4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-290","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ff642b046de79a78267887c1ac879ed876fa5a53a4d64ab6d61a83abe91c93a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":2282,"target_line_start":2279,"target_local_id":"block-290","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2279,2282],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"564840d6dc5436ea44cb9be3c41c989a4c846262824ab6f580058f4be27e787b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-291","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d30193359f6d45342edd82ba7594ea3d8d63744c7d3f746ef2cc1dcd20b93180","target_edition_id":"edition.r017.id-id.draft","target_line_end":2292,"target_line_start":2284,"target_local_id":"block-291","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2284,2292],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23cb65c46cc0a5ebfb9ea9ff4c3a50aab3fffd590fbea46d24234e462d45cc89","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-292","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1ad91eede144ecb9332f2ee61fe7049bc46fb1ca2384441958e27317f44b569a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2295,"target_line_start":2294,"target_local_id":"block-292","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2294,2295],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0312b95d54255b1f5933321d864f665dc1892b47ccb7a61b8917630581783912","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-293","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"646cb8bf93f5e5b30be7a84a15bf870f5dfb72929573bedcc6e75e290c778bda","target_edition_id":"edition.r017.id-id.draft","target_line_end":2315,"target_line_start":2297,"target_local_id":"block-293","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2297,2315],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a69ec5c82b0c1ed326952fe88b9a5f768500f61ba011de16f6072ff0a781bc6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-294","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c81a70f69c5f5d496dd802ce05f8ab0172fb08351be84a24661775cdb31425da","target_edition_id":"edition.r017.id-id.draft","target_line_end":2318,"target_line_start":2317,"target_local_id":"block-294","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2317,2318],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24baf255f15aa545702729128486a0101028ebdde1bddc3339d85c67c21d4ac4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-295","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9b1b76b80976e741d81f83ca35e644c7263832c1fe7bedddb4b3f4bbac85d2df","target_edition_id":"edition.r017.id-id.draft","target_line_end":2322,"target_line_start":2320,"target_local_id":"block-295","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2320,2322],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a102e148e172d93c524f8c1c9c050d9834e6c234ab1f85e8f7a4bbc780552a8e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-296","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1ad91eede144ecb9332f2ee61fe7049bc46fb1ca2384441958e27317f44b569a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2325,"target_line_start":2324,"target_local_id":"block-296","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2324,2325],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a60062495e482e010180bd0d2fa4b6058900045b68d8b7be7e97e161d81e031","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-297","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bfa48e899dfef74e5e70649a2a254954c449d2add8bb219d747679f09ca06463","target_edition_id":"edition.r017.id-id.draft","target_line_end":2329,"target_line_start":2327,"target_local_id":"block-297","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2327,2329],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2ad9c389b38f23724377868384160c66f81a13a480b8e77bd3785ed0ded419d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-298","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"69e0774452ead0d4722630c824aeecc1a61452adcf1387b93d90371e56b0204c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2332,"target_line_start":2331,"target_local_id":"block-298","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2331,2332],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"17c722137498838176020177ad2b35fa363e941b73167fda5121959c176b2ac2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-299","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5019f43924c2b7af3eab4407433cfdfe363503481110002e0101a0dc96c810f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":2334,"target_line_start":2334,"target_local_id":"block-299","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2334,2334],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd9b2a89cb45384bd9863365d771e434e4e6df8e682c22ae8d7906961d53643f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-300","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5219c1fceac7e2dd414294851a723b410ac149222691d8189dec21fcd01f01f5","target_edition_id":"edition.r017.id-id.draft","target_line_end":2344,"target_line_start":2336,"target_local_id":"block-300","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2336,2344],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"00331563f4d7663c02e5104833211a3a88583eb2bd9dae8a6a0ef55eaf8cf741","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-301","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fff99eace7f7c27e0277d548192f00d7bf246c844f174870356930757baaae9d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2347,"target_line_start":2346,"target_local_id":"block-301","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2346,2347],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ecb73214d48daec55ccc84e8c0e97519abefa875c76a920366eb2bcdf70847a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-302","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e7e3cbfc965359e16e82b2d3931a70f2c5a6619de510f8dadaa1352e0615165f","target_edition_id":"edition.r017.id-id.draft","target_line_end":2396,"target_line_start":2349,"target_local_id":"block-302","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2349,2396],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39087c8a9603986098066ba6e4d15c32b7c125436be5a38cf5cd9455747a480f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-303","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dcc6e6495f0be6056a856e63d1acec01ad2634206bda52c32dde5e473fc70e99","target_edition_id":"edition.r017.id-id.draft","target_line_end":2398,"target_line_start":2398,"target_local_id":"block-303","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2398,2398],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"425ce638d9cda79aecbfbb50e72a9949dc7274c43d485a87ffad5cd8006c1f28","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-304","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"965915d1e6de4e65b755089464198aceca737065a32dc0c5d5c30510f0f55574","target_edition_id":"edition.r017.id-id.draft","target_line_end":2401,"target_line_start":2400,"target_local_id":"block-304","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2400,2401],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57a4e4a82802d2a5e7d8e6854234f45c984eda4721cf13f6c89417055c7b0c43","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-305","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9c31b69c3106d26c5e332c5f88a466e080c750ecc26c15d486c543a995a9f2ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":2423,"target_line_start":2403,"target_local_id":"block-305","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2403,2423],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61dee9aeb8b8b5f32334bb963c0ff19b3dfb10aeba71baa7cfe65503ad7e0741","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-306","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eb7bf47ec20217323edfccff2e2b566bea670926d62a54d9b51c9819fa07d4ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":2426,"target_line_start":2425,"target_local_id":"block-306","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2425,2426],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b7930ddece93a910417b2dc5ca205ee81f9bb2581485b292ca6e7fa00d72922","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-307","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2dabd7b1d87a1b51148ebd7b857afd0be435ed3e308f6b17016a898d9327a810","target_edition_id":"edition.r017.id-id.draft","target_line_end":2430,"target_line_start":2428,"target_local_id":"block-307","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2428,2430],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f75996bdf04913a55d3052fc2086740a9dc22a9cdbfdd6241f3faf5cb59d50f1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-308","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"357413e5f077d29593db80d6f244a81050d2d13a18781a805ce8d44e02f0503c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2432,"target_line_start":2432,"target_local_id":"block-308","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2432,2432],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ebe99f3a54d6a3c2f18ea72fa32cd6bdb97985d12a390d8c118e3f05b1a14d9e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-309","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bb9bfd7ceb53285b534f92cf71109ccb0a6a563ce62a22e1ad80c327db0896fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":2435,"target_line_start":2434,"target_local_id":"block-309","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2434,2435],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ddb07d7df4d249bd14156e0c03c714bf1edc05a7260f4147867c3d85267e8e30","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-310","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bc96661443f4dfda5c4efa648e6ba0f2dc65cd70f22b39924387a9fd872368c7","target_edition_id":"edition.r017.id-id.draft","target_line_end":2585,"target_line_start":2437,"target_local_id":"block-310","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2437,2585],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9a1f5347ff0e93b3da144143634be3b6efabfdde08fd42d4e1c3de52a7a864bd","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-311","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a26aba5f46b2843332648864ea9ac27b20e00db8b3132ef9502568ac540c2d0d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2587,"target_line_start":2587,"target_local_id":"block-311","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2587,2587],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f9f05f9e64c526c346296bd0a3c2d18abc1a080c5e27e297945b04e06faf3ca3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-312","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a4b38dd074d9df6c5d84bb98c2820781326a8bac392af478d588811f2a044a94","target_edition_id":"edition.r017.id-id.draft","target_line_end":2604,"target_line_start":2589,"target_local_id":"block-312","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2589,2604],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"10bda010ab17e7b4a4ea9915bc7773c715ecc4cbbcfbddca9aa4a8f357e7141a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-313","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d2514a5df62811b3659015aa8b67c015b271dd4f367d50e65fa1e76aadf3bbcf","target_edition_id":"edition.r017.id-id.draft","target_line_end":2607,"target_line_start":2606,"target_local_id":"block-313","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2606,2607],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb5a1fdad8659a3bf0442a81cbb8ec6501654f2ee87fe5816dab58aa46c528d2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-314","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a370980c48f5c492907c0e3d74113e1ae0def322be62205d2e03f5f20a8d84b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2610,"target_line_start":2609,"target_local_id":"block-314","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2609,2610],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"daff52b51e44bcb558289f62b103b016c742a930dadaee33247d35cc8ee01186","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-315","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e314cf0eaa0bd60e1dc90760ff58f827471bc614777bda7731d9ae8f6cb669dc","target_edition_id":"edition.r017.id-id.draft","target_line_end":2612,"target_line_start":2612,"target_local_id":"block-315","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2612,2612],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ff9e022288b4985750264610a0954205862f6475adc52ff7ba85179455dc45e2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-316","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e2e0779f48271b783d5204f100af126a42c7d83dbaf06624e19fea2c7d22081e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2614,"target_line_start":2614,"target_local_id":"block-316","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2614,2614],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"402362f00f1207932ba6d0c62a83ccb36bb40f59dd6a602e751fc3903858652b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-317","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"247f1423627ebd5e1f7fb57a3f0018b2336c68e65c05b73f035e71d933fbe890","target_edition_id":"edition.r017.id-id.draft","target_line_end":2617,"target_line_start":2616,"target_local_id":"block-317","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2616,2617],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ad522278a795c03dae4968346481c155b0b7d2086d81c2ee0bef6399cc904b3b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-318","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9ede49898633da383aedcbfddc36a0ce74d334db64f0c3d7478b901060be0937","target_edition_id":"edition.r017.id-id.draft","target_line_end":2621,"target_line_start":2619,"target_local_id":"block-318","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2619,2621],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"20f290ccff7b6d98a57fc961c6a2d45d0de7b392b56b761c9d79a1a4777ef423","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-319","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"abe8c853782896919a7cc8cc8632f9a936e4f6beeccb79df0df7f83436a714ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":2623,"target_line_start":2623,"target_local_id":"block-319","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2623,2623],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3b89ed065a83c52a17c6b7712c80b31d82b7a791dce823036da2edd9d6e8aacd","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-320","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d7a4d9b23eaf27a8212fb0da65bb1946915cf528919f43e5177c064f353d2d36","target_edition_id":"edition.r017.id-id.draft","target_line_end":2626,"target_line_start":2625,"target_local_id":"block-320","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2625,2626],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18820686876121543b0258bf99f0f123eedd6fbda6b529359e54272b37a15250","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-321","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cb74883de4cbb5e1bbb6b9bca1e5e1d63b7b897c5f9ab52fa1533498ad8f2035","target_edition_id":"edition.r017.id-id.draft","target_line_end":2666,"target_line_start":2628,"target_local_id":"block-321","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2628,2666],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"600e25f95fe11b091ba8d288b0c853db8ed8c2cd83097761894e146d033ab032","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-322","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ed445c73d88baad09e1d775a39f939dfe7ce6af80e184c9dce3a22e113ff38d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":2668,"target_line_start":2668,"target_local_id":"block-322","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2668,2668],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76687f2e2f87ac8964cd317b3573a94634064869436e0834697bf9532a094e51","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-323","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"933b5c35ac72350ce8f5aa570327a86ddf5c0d21a5d7cf4f64affe09c50ec6bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":2671,"target_line_start":2670,"target_local_id":"block-323","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2670,2671],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"656f970cec15e7ad5bc4fad88389a7381f56cb04d1ab15a7d673669eddcd3cc7","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-324","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b9f3387a3c97315107a114b368160c6a244c63aefb321d8cad940a80cd188ff9","target_edition_id":"edition.r017.id-id.draft","target_line_end":2687,"target_line_start":2673,"target_local_id":"block-324","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2673,2687],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"129e45df46fd45c74ee1c7bfc696954106050d8ab9f763c4566496b6605a877c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-325","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c0d57866f34f2bcdcc1ef7885688448b25a0e8108c3b46d8543087485c8df9e7","target_edition_id":"edition.r017.id-id.draft","target_line_end":2690,"target_line_start":2689,"target_local_id":"block-325","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2689,2690],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57ee0a97ee37baf680e282dd5c22063170e8543ce992bc688d1b0b14e5707aaa","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-326","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"66bcb463a0d01ccec8690c1eba6cea30eca553ee52c6ec9b63e153e82c773b7d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2715,"target_line_start":2692,"target_local_id":"block-326","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2692,2715],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"040734eb6f83d03f5281d8332fc4a3e05e3c285c9b01b862799e11c14f4fa7b4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-327","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"af101c87441f0d20c7be0c4844d29c80a4302177c936eb1d6c58e21c04fe9644","target_edition_id":"edition.r017.id-id.draft","target_line_end":2717,"target_line_start":2717,"target_local_id":"block-327","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2717,2717],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a8bd91af986b05940c49ee821110eba5c09fa980b08ffc5096c13299524fabf","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-328","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3d77cf86fa94d45d8bfffa2e0497d3c80d1ccbfcd56f9c6ae12bd97960345925","target_edition_id":"edition.r017.id-id.draft","target_line_end":2726,"target_line_start":2719,"target_local_id":"block-328","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2719,2726],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0798e3429713070ceaaccb11e7658973af9a1d4424f555a82e32591f62b229c9","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-329","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"af47edc6ce8e9ea4bcd7714fd568dd280f7731ec6e2b0ae198658f992722e7c9","target_edition_id":"edition.r017.id-id.draft","target_line_end":2729,"target_line_start":2728,"target_local_id":"block-329","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2728,2729],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3169bf50f7bb0b8f609207056e9c1777b19da2623b2f7e1605e5608841689afa","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-330","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"218858f13c5b9b04bb0cdc32504dba143b2d4991c8a49b48c2df9439d9e4912f","target_edition_id":"edition.r017.id-id.draft","target_line_end":2750,"target_line_start":2731,"target_local_id":"block-330","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2731,2750],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a000a14733df31dde6403f95bfd3d3f9fed64e91984e5da83fe1b96b1a1a369","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-331","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31dc73fb66711025bfba6d2a66025211915a1db88a79d9fca40decc772e86ce3","target_edition_id":"edition.r017.id-id.draft","target_line_end":2765,"target_line_start":2752,"target_local_id":"block-331","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2752,2765],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b97f9ef2d6ec4540a503ca536cf694b51662c96cbb927475b0f34cccb36b9786","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-332","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":2767,"target_line_start":2767,"target_local_id":"block-332","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2767,2767],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eecbb2f93e25c515e5e2c8fe0dc54bed6e1fbb7a53827d930cf3e62cbb43f536","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-333","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4cec8c7f543ac7d094ccde60dcc86623b1936a8b9db050e220ec89a8fdc7f39c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2769,"target_line_start":2769,"target_local_id":"block-333","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2769,2769],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7e4434f69cc595fc016d7a660fd02847ba10986666ddcd4d2d88b6264393f536","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-334","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a7292225beafcccf491a77596155c68fa2c5ac02a66b1cf706a06c285f8510e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":2772,"target_line_start":2771,"target_local_id":"block-334","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2771,2772],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a1aefe89c9ad9076fdfc364ebfaa3120fe5edd1931fc66edc8e18d4958792f50","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-335","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4c3ce3dd292801279254cfb9a43964717b8479fd5fe878705e543bd8bf4661a6","target_edition_id":"edition.r017.id-id.draft","target_line_end":2774,"target_line_start":2774,"target_local_id":"block-335","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2774,2774],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5cde3ab9723a7bb48b990b77c47dbb9a143fe3316af869801694966cc3e5d6b8","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-336","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a89f2d8238c5d99b22f9f19e57150cb66b8f3a54e9cf16162f07baba1fcbe4d4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2776,"target_line_start":2776,"target_local_id":"block-336","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2776,2776],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bab5a53e6c28cffe6072b7cfebd40d44bb4bbaaa7cae67a3c387e6ce1f3a0213","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-337","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"33e15fc61d8f9a14602d8f1c6ac170429c4720f362b2e4e666ed072caf695deb","target_edition_id":"edition.r017.id-id.draft","target_line_end":2778,"target_line_start":2778,"target_local_id":"block-337","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2778,2778],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48c8cb0470b6c3ad6051840312eac6d24a36af24460d6e29ec364eb92b0f1068","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-338","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8ff28e032e5ab882e2b397efb1053e418051565f19a99315dd68f81074913e0b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2787,"target_line_start":2780,"target_local_id":"block-338","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2780,2787],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5ab726e737e9bc13670d49243b4849d6c232c9d18619a80e82e5ea7c6625ba02","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-339","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e4b4923059b54f4aadc1a013f2bd4b259af1682b1f6621976bfb945d329340a4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2794,"target_line_start":2789,"target_local_id":"block-339","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2789,2794],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"984253cb6f88c16342d258b04acf2ea4debcb23074d3a5ae3ae72d2b91ab4176","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-340","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f66af4cc0d9357f674fb38007aba02e5064d9c226016bb1dd0aad6825949bfa7","target_edition_id":"edition.r017.id-id.draft","target_line_end":2801,"target_line_start":2796,"target_local_id":"block-340","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2796,2801],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fa8425f6a1bc7e16c236665a446f3477701ac9b141be2abe237aa6dbded0dc63","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-341","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5e5f63690706e1656da5b2e11b637516aff0cbf3cc0b4293703c9a375fec0c7f","target_edition_id":"edition.r017.id-id.draft","target_line_end":2808,"target_line_start":2803,"target_local_id":"block-341","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2803,2808],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64a338e1817f603f2792048420307ab97895dfa97ffaf91b8f656a3a96fdc880","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-342","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"918e8c75f83e920feac35df4d25308a1ce91a523423f5291192b466d1662c7a3","target_edition_id":"edition.r017.id-id.draft","target_line_end":2810,"target_line_start":2810,"target_local_id":"block-342","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2810,2810],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e592c4e1903d9eb2be1a4abff7d10393aa10433086076b921286baa740ec660","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-343","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ea40181b9694dff2c3b15b5b483a741cc7b2862f6b6fa3fd6d575c3722c2dd49","target_edition_id":"edition.r017.id-id.draft","target_line_end":2817,"target_line_start":2812,"target_local_id":"block-343","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2812,2817],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94fd2f39d245d7c69b4da351ba605acb3e7289563063cf2d093537ceedec774a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-344","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"86e66214c264109ff5db2e99b126aabf9121b6597d06e93e365a806f7371d5d6","target_edition_id":"edition.r017.id-id.draft","target_line_end":2824,"target_line_start":2819,"target_local_id":"block-344","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2819,2824],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c946dde5b021fc1bfe61c423e4e30884d79a43b24c044928b61c03fa9edf72c5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-345","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bedbf17b62547d252f3cd2609c366bd6a0fc35c932b93a3470462c04613e3ba8","target_edition_id":"edition.r017.id-id.draft","target_line_end":2831,"target_line_start":2826,"target_local_id":"block-345","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2826,2831],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da66482cfeaed7ae45a2e86905e6321d328562411c2ed4a155dc98179dd51dc1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-346","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e2a9029dd0ac4b95ef4011c269b6d5c2e666699e7df0ad3f495b9b8b849483a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":2838,"target_line_start":2833,"target_local_id":"block-346","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2833,2838],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d96b1882a20304e92b2fdb32ac851a3e447f1835147cec8ce89aafe07ba1996e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-347","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eeb4e984a452ba28ee955415b269d01374aa405ebe00acae33338454bce25898","target_edition_id":"edition.r017.id-id.draft","target_line_end":2840,"target_line_start":2840,"target_local_id":"block-347","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2840,2840],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a84a9264a4d960ff4fb30f80a5785a5fb2170273367c96e8044a94082330a145","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-348","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"227a5e2770cc829146cc3156550e6d620b586a7fb9aa3dfa3b2aee51f3598af4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2847,"target_line_start":2842,"target_local_id":"block-348","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2842,2847],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e805e451a12f35d9fdeaaee338782f97ca4133a5a6c311331aa39ba345bae61","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-349","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3794b30a790c64ede6461fec60d6ab6be57ba38e7a71fc5f66128304824b6fd1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2854,"target_line_start":2849,"target_local_id":"block-349","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2849,2854],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cdb1d7acc5eb9bbb5b48a14a9b547792abade3cb54b03de1db744c03fac1ec1b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-350","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4ac5f295f2729f124f13f1f63f8215a45dff6a8dd0dfa6f88c087313d7ea1116","target_edition_id":"edition.r017.id-id.draft","target_line_end":2861,"target_line_start":2856,"target_local_id":"block-350","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2856,2861],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"68d95f1c2a698e3d5385c75e65e621bae5a571236d6c70a4eb8150fc8263d41a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-351","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ba6bce26deed41b39443da841c81654c47abe67162a0c4af76c22a0d571036f2","target_edition_id":"edition.r017.id-id.draft","target_line_end":2869,"target_line_start":2863,"target_local_id":"block-351","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2863,2869],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f894c4017aa4ac2e96c044ec18bf0aa0d8f2b343f809cb4199793c4d41c52baf","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-352","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e9a307c4b5be299daeff916f2f7f5eba17dff2f965f80ac01f7480efba80fd50","target_edition_id":"edition.r017.id-id.draft","target_line_end":2873,"target_line_start":2871,"target_local_id":"block-352","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2871,2873],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d014b3db3356ec746414de4a3606a92fa3467693f2edcdece8c9dae0fab765d6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-353","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0853100e9f96c13aef22ae898b906e70071cc2aba61982420761e47886435bf2","target_edition_id":"edition.r017.id-id.draft","target_line_end":2877,"target_line_start":2875,"target_local_id":"block-353","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2875,2877],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ea6de1e4ed3f519bb446838942cf87a2c0f24f0f234da326c39cbeab3e62276","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-354","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"564953a84ad547501d7476c40a9ab8226dd659862adf2128b981af41037189e4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2881,"target_line_start":2879,"target_local_id":"block-354","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2879,2881],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7b414a3b7f4a7631d3e10a73d986ad6d06a8d8ed2893f42c9330504d28e40e9","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-355","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f366ddfc7af2e8fe64915454763d7aaf3b131f44233776cc766c5bb38429e6d3","target_edition_id":"edition.r017.id-id.draft","target_line_end":2885,"target_line_start":2883,"target_local_id":"block-355","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2883,2885],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1c5031bedabf8b2d57b4c5c4e4396c7f724c153027d510d308da18c7c721044b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-356","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5cba0077a2c3f59990a8ded1d99c9debba04804703a22a25771c1a02d12bc083","target_edition_id":"edition.r017.id-id.draft","target_line_end":2887,"target_line_start":2887,"target_local_id":"block-356","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2887,2887],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e0848c13dae8b7b28237ed6542e6cce1fdc901ffbe7242fcb0366bfd0ae73559","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-357","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4631798a3331b721bbaa303afe3ebb818f7e23afeb904bddab857ece945e670b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2894,"target_line_start":2889,"target_local_id":"block-357","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2889,2894],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0c7b211f1bba801c4fda9955132631b3117815b2938f9d6a033099c9968d5b56","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-358","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3a37fc653e1c963c790b0c1db20f5a3ff2292bb8b0ea87b5d1ba7fb0c1afcc58","target_edition_id":"edition.r017.id-id.draft","target_line_end":2901,"target_line_start":2896,"target_local_id":"block-358","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2896,2901],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"08b28d8ae239a15a5b0e837589f915d663ec861a7bd2b3c3b17e254a5d830a80","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-359","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5081d952cb0814c3871cfb4a980fd538f20c5bfa355a2c8da2e11265efba5709","target_edition_id":"edition.r017.id-id.draft","target_line_end":2908,"target_line_start":2903,"target_local_id":"block-359","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2903,2908],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"09561904fe8bb40204b29e24c6e4edff456d9d6f5334a2ef88e86e4ad343ff92","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-360","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0c020ce7004bc5afaa0bca884ba9c14ea8c01b90d8928551a7ab35a73558ff9c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2915,"target_line_start":2910,"target_local_id":"block-360","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2910,2915],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"34ca3cda04e9c06b18863b667c684864eca2a372efe797d568de340b6df5a9e1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-361","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"55afcd48f12cf4d88c692d30b0f3e349ab844244c6c8f099b520dc03346a372f","target_edition_id":"edition.r017.id-id.draft","target_line_end":2917,"target_line_start":2917,"target_local_id":"block-361","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2917,2917],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aa4ca6047e5818fc907ffc75ec8c876b99124e9257b243bd98bc39cc00c1f223","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-362","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"10ebc1be16741285a6cfda370909467dc7cd5ecb619af1c1095c86aaf2167a76","target_edition_id":"edition.r017.id-id.draft","target_line_end":2919,"target_line_start":2919,"target_local_id":"block-362","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2919,2919],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"64e4a3a94597c9688a2b2d01ee0445eaeda37645ca00adb6dd1b0afc9da3d34c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-363","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8fdd2146bb851d6fb8f61397fce3d708c528394044a8e395600c375a8254c359","target_edition_id":"edition.r017.id-id.draft","target_line_end":2921,"target_line_start":2921,"target_local_id":"block-363","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2921,2921],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"370a1fee33208cfe1ac2def5d0a24f6e226a2fb120baebd8c9500a722f0fa47e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-364","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ddad8423d58ae3088d0479f565c415cd005399979c1848c476cc8aa42b37325e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2923,"target_line_start":2923,"target_local_id":"block-364","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2923,2923],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"22d32b1db99cd7c77b86434c22f48d7704f842b6d70d129c47d29f521f556b9d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-365","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"310958f21611bb03eb8bfa2526c7a22ba514f78268c208e76693b2bbd83e4b29","target_edition_id":"edition.r017.id-id.draft","target_line_end":2925,"target_line_start":2925,"target_local_id":"block-365","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2925,2925],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7cfb937f9019759ff45fa7e2c600ac9ad2d43b67ac49bd0f16f26f2e1f3f4bfa","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-366","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c52fa928e232b8fa475fe2437be5725b1b242e0705dbe43678afb07f17b72683","target_edition_id":"edition.r017.id-id.draft","target_line_end":2930,"target_line_start":2927,"target_local_id":"block-366","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2927,2930],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"13a5b0cb2412baa649b5a5266c6c2887a599cf7189627d7c5c779931f6e5aa6d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-367","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4d4c44b403f332403311ebac4d4cf126d472bdfcff8f6882c398f565379668b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":2934,"target_line_start":2932,"target_local_id":"block-367","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2932,2934],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"066bcdacc6d2b4519132898fc4ffe343aaa10bbb0e10cfa12f423b376cd36bd3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-368","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f8bebe8946632042b703dd5bfe88c1cfe256d93141d4e16e3eb85c5b6d29a1a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":2938,"target_line_start":2936,"target_local_id":"block-368","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2936,2938],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"40fc8be49859bf1c8febc20435603e74cc1029de4b324566db56532be28edc0e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-369","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d1880faa9609413aa821175d0f3c6de3d7d13e2c7ed5be57b0de63a4e860d995","target_edition_id":"edition.r017.id-id.draft","target_line_end":2942,"target_line_start":2940,"target_local_id":"block-369","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2940,2942],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eeecee322cb7070900fac0ccab7088888cc95d0abdd3ef4168ac4801459c026a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-370","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2e551d517d182c6780976968309e0f23ad9ccdf7bfe880781b332483c6647d8a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2951,"target_line_start":2944,"target_local_id":"block-370","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2944,2951],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e29d17c7757377abe1dfbc7d086ff6a8671bc1ee044abaeef188e55cbbaa959c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-371","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"be5c36a2215cc42ed1366ceced7d9be5f28307b567984244a401f941b4acbdd3","target_edition_id":"edition.r017.id-id.draft","target_line_end":2953,"target_line_start":2953,"target_local_id":"block-371","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2953,2953],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b10168d1e94c3a525ee1c3136302591be9e23ee458386bb25466ed4c37c407bd","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-372","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"af189a1667c9acf602b862d0b68edcc79e8c63c4d1a47f56fd82f53c1013e2ed","target_edition_id":"edition.r017.id-id.draft","target_line_end":2957,"target_line_start":2955,"target_local_id":"block-372","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2955,2957],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"29fe30b978f47de443988f45fa7beab413671d82e66d50294b22ae6ecad3237b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-373","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e8e9e0608479fe5efa8d0f06aab33be7c02d5cc59119c82503c217ec96c6587","target_edition_id":"edition.r017.id-id.draft","target_line_end":2960,"target_line_start":2959,"target_local_id":"block-373","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2959,2960],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df3c0238e3b163b98c1422b69b91e187d1becafaf60ecf03c032576432c94e58","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-374","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"939a04e9d6844f993afc093cd566c565e2bf3b57d4e1d8034ddffe0919c4c512","target_edition_id":"edition.r017.id-id.draft","target_line_end":2963,"target_line_start":2962,"target_local_id":"block-374","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2962,2963],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9e468d11ec1e5036129da29a09d4398800dd4745367a501520a38e26aa61729","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-375","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3b2a7a4ba2e440bc7362ee47818c0c81cc33c48339a5c7e6886970a615079eba","target_edition_id":"edition.r017.id-id.draft","target_line_end":2966,"target_line_start":2965,"target_local_id":"block-375","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2965,2966],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7106728acf45913f54c5681826f33049c331bf3ff7fcb54597dad38a16bc8df0","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-376","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"536b3340ff28b0f50b8c7c565ba18c268332c95f791c57d3b3ea2d417bb982b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":2985,"target_line_start":2968,"target_local_id":"block-376","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2968,2985],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"63358b401844bf939a9e69bb7ab1e4156c83d8fb804d0567af940f3eba102d78","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-377","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":2987,"target_line_start":2987,"target_local_id":"block-377","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2987,2987],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"99ff5fb42d13f42b52072cfe63c22cc2eaa04cf6171d6cf518ab033f9bcf3bca","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-378","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f838e135228179c27f99b2dfa9ecd97779ddcb8332628e5592a67bb91f1fae85","target_edition_id":"edition.r017.id-id.draft","target_line_end":2989,"target_line_start":2989,"target_local_id":"block-378","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2989,2989],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"44081766f4e6f7af35cb78cad66cf9679ac419f118dc421adb599a6a9b893e69","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-379","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2de5fd29b5c4af8627376edc207c9dc29b17e66f40213cefeecf08120ff1344c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2991,"target_line_start":2991,"target_local_id":"block-379","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2991,2991],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e67190c9914da9ef7a721f62d86c8fb5945a2c3957c94ac52366c9a1be4555f7","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-380","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a89ca85056a7dc616bcd4e78c719933807ededbc09bcbe83ace7d32a4d9aea8","target_edition_id":"edition.r017.id-id.draft","target_line_end":3000,"target_line_start":2993,"target_local_id":"block-380","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2993,3000],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0fe8afed90842a07566e48fcd3356b12657d9396ce3a9515105e08461169aca6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-381","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5f64fccaa376966f755809cea7a71936f4815918528813bfaca23cc7041ff0d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":3003,"target_line_start":3002,"target_local_id":"block-381","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3002,3003],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23e538327e07f899da953842be530207a74b9c01389bcea247dde90e3d57f04c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-382","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9fbda4a46193a6bf4d15ef39d8d8ae042c4ceb31bd1cac6397db28bb436b1e3f","target_edition_id":"edition.r017.id-id.draft","target_line_end":3030,"target_line_start":3005,"target_local_id":"block-382","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3005,3030],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed9be2c3605d51b1db2fb75d001c1ff9065d2f874cf8c4387f7ef7f81c095962","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-383","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"418a06974ba2d224701321ddb9a7efe5c76bbf99523b13433327f904e499d116","target_edition_id":"edition.r017.id-id.draft","target_line_end":3033,"target_line_start":3032,"target_local_id":"block-383","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3032,3033],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c4af9f9d8a4307bb6d6907acc615c74e68d07da4014e9037f3e2f5017e17c412","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-384","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"38a77b3c6862e1173ae58fe3f5764394b50ea320049035b6ca0f06f0c5dbf37f","target_edition_id":"edition.r017.id-id.draft","target_line_end":3035,"target_line_start":3035,"target_local_id":"block-384","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3035,3035],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7906e7938f9b41d7ac6c0167152974706ffb126e9a084c86dcf99d756d57dca2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-385","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9ff2e0c3cd5e9a55e542610a7681b44ec8b09cf416fa78e7f358e96627dbb40d","target_edition_id":"edition.r017.id-id.draft","target_line_end":3038,"target_line_start":3037,"target_local_id":"block-385","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3037,3038],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e84b345f632a38df91c373e0d3bb17d74dc9b0074376e82390d38544c6ced923","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-386","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7d1a2f0bfa7d82a3ccd43104979d092c33dec3db30503fc01b161c6ea00752f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":3066,"target_line_start":3040,"target_local_id":"block-386","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3040,3066],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"77ee907ee6a41cc84236241b238cb5c97d63205d3edb3f6d0afd674b2d73fb3f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-387","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a6f56fdd9f06a8dc497736244d8282916d77b3229ce1539e663355416da540fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":3069,"target_line_start":3068,"target_local_id":"block-387","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3068,3069],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0681383b5de744c5da8f2cae6bbe8bad4d294ea4f3271eec5e42e541b0804c2d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-388","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"266de4ee39674ef3d4908881b1927bcf3d2e5e676bc0f8a9ef9ee8bd697759df","target_edition_id":"edition.r017.id-id.draft","target_line_end":3071,"target_line_start":3071,"target_local_id":"block-388","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3071,3071],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48ffd562f437de2ba7853c0cf006194832c1b151377257db234a4392695587ed","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-389","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1ca582f6697984741512ef6387f20d7ee16b2f13d06d5834eb98e157225acd12","target_edition_id":"edition.r017.id-id.draft","target_line_end":3079,"target_line_start":3073,"target_local_id":"block-389","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3073,3079],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"75a5976884f9069cee328fb29cf5abfa745cfa112511934ce326104874099e58","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-390","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b735b9919f372d5a127f87aea93dd5071acdf171b045c3fa3c221028763e1feb","target_edition_id":"edition.r017.id-id.draft","target_line_end":3104,"target_line_start":3081,"target_local_id":"block-390","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3081,3104],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"181d672476445cf27ccbe568e643e74abe11d9eaaa6bb66e978cb1da7e26e8ff","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-391","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c9d072be609146ff10eff598fa05c7934ecaf4605eb1079fb18a1198f47a51ef","target_edition_id":"edition.r017.id-id.draft","target_line_end":3106,"target_line_start":3106,"target_local_id":"block-391","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3106,3106],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4616df328d04d2bcd5d2a62808f40dcb48857aa7e64fe3f6e9851a691da9e38b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-392","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"543db43f99b3d5cdfe2f29395e82e53fd2db573185e4b8e6b2d0473353f05418","target_edition_id":"edition.r017.id-id.draft","target_line_end":3108,"target_line_start":3108,"target_local_id":"block-392","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3108,3108],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8be6b3861f60c894b250e00558d5400b2f27431802a3ffd71b47cb6a8f51680","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-393","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"23d15d065c91bc38623005aa7bfdf003362b490514733067e7aad508429f9048","target_edition_id":"edition.r017.id-id.draft","target_line_end":3110,"target_line_start":3110,"target_local_id":"block-393","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3110,3110],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02eeaa4cf58b7b68163eba647f7607cc3ac300b872e7f644dc900f18328666ad","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-394","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2856cd7d4036b702702af5d1599f0bf06430a080227183d0c397fbe8d7a33f37","target_edition_id":"edition.r017.id-id.draft","target_line_end":3112,"target_line_start":3112,"target_local_id":"block-394","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3112,3112],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"35351d6b3a799c1b2dd540af9da89466db4ffa716ae52110ab50d1018304fc2b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-395","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9730eb2933304d669cace017156c14de98fdda316bf36848fd1bfc569d668cd5","target_edition_id":"edition.r017.id-id.draft","target_line_end":3115,"target_line_start":3114,"target_local_id":"block-395","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3114,3115],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"900981cdbd0f74d761c3296ebd09943902b1d711c3a80f30dec5c6be1ce52ff5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-396","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"70724fc35991f8b856d37d0e1dfc3608efd1b257c23207540c1c4392ac02de03","target_edition_id":"edition.r017.id-id.draft","target_line_end":3137,"target_line_start":3117,"target_local_id":"block-396","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3117,3137],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c933fd566b63422b6ade672add954d0e021d97b64ecc0aa9e12850ca82f1020","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-397","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":3139,"target_line_start":3139,"target_local_id":"block-397","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3139,3139],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"38b4c2a63cbc6d2e89c488931531d86e50581e7dc86e15579389a4a64b840a6c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-398","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"470f19c4a09a4b0bb10d826c59b27c2f558ae38eb3a36f3d682d407bbdfce174","target_edition_id":"edition.r017.id-id.draft","target_line_end":3145,"target_line_start":3141,"target_local_id":"block-398","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3141,3145],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aaed99f1c4f3811a7292c08bb0c4a43a33b84d180e950ad74a43028a0e5154c6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-399","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b9bbbf7fa1e5c196ad7810d4292403efe81f7f467a325acdecb3f6493f8cec0e","target_edition_id":"edition.r017.id-id.draft","target_line_end":3147,"target_line_start":3147,"target_local_id":"block-399","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3147,3147],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a84b2b5bb3579c4a8c07f6eeb14f9bf980f9b3d1c02f8de32101a83de2030b3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-400","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a87a413072b091e92a627081a469a6d22164ae5dab038682f1ab0e9e727a82f3","target_edition_id":"edition.r017.id-id.draft","target_line_end":3160,"target_line_start":3149,"target_local_id":"block-400","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3149,3160],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"95607aad6657d888a463acff829c88cd392793959ce84ad1149e57dd9d43848f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-401","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"76eece648b17bc1b47374588e2ce92e174ef88e33b2f6993fc03dc333fc9c774","target_edition_id":"edition.r017.id-id.draft","target_line_end":3163,"target_line_start":3162,"target_local_id":"block-401","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3162,3163],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ffd1d8b0ad999ac0cf2c519208127be3cef1a2871b92d855d759ae99d7095740","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-402","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fc4075cf5c1a7fad1d786e201ad265a47d60430a15fa734315871a53a70c79c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":3215,"target_line_start":3165,"target_local_id":"block-402","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3165,3215],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c8d1a601747af5fed5b229bec1bf1d8fe2f70b1e59dfd9f23bf9673d521651ac","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-403","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"03becb473137cda7868541e252e80fc46f050255a131105fd7993edc57cab203","target_edition_id":"edition.r017.id-id.draft","target_line_end":3217,"target_line_start":3217,"target_local_id":"block-403","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3217,3217],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"941dcf4bf91f608d88daec1baec2fc01dd1e916f737d08f1c480eddbdb00631d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-404","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8e6fa25ffc068d51370b55c699d1ec05dd628369b8cd3f278f9ef516405ce413","target_edition_id":"edition.r017.id-id.draft","target_line_end":3295,"target_line_start":3219,"target_local_id":"block-404","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3219,3295],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d97329cd1202bef6a0d6a489ceedaa59cb599e561208dca7ed12a6e873bd664c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-405","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"061026002ce068cb5c4994ff1c9020ac6c8400270ec00c65c00979bf2be7ea79","target_edition_id":"edition.r017.id-id.draft","target_line_end":3297,"target_line_start":3297,"target_local_id":"block-405","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3297,3297],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"663d4da5f64042835a77159d5719d345106379b37d5ac1434522a7df2ba94871","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-406","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ce20446d68b9515dd8630754f87291f72810adbdb182bd941e85c71ab90a94ce","target_edition_id":"edition.r017.id-id.draft","target_line_end":3320,"target_line_start":3299,"target_local_id":"block-406","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3299,3320],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2533bf6d53a871723ca393f43ec7637a22e0a9a4a4d56f1f0bdd5e7cdd1f194e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-407","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ad28e5a619e641053753e426ed63a89de31a3572ef27dcace2bc8080e7d61823","target_edition_id":"edition.r017.id-id.draft","target_line_end":3323,"target_line_start":3322,"target_local_id":"block-407","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3322,3323],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1752c8fb4a1aea81867e8c7d729bdc53056b61c43ffad395baed7ba8dcde2433","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-408","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bbba69ff1b7ccb04b0dfd459d0ffa0428647172610f3f0d5a05a5e89246559eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":3325,"target_line_start":3325,"target_local_id":"block-408","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3325,3325],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8250dc60ed40bf50bec5fd7dd019282715ea089e8a5452262c38da3752164fbe","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-409","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d042619647039e4b491cee8aa8769bee823c182fc85905b222a0198dc5b448cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":3356,"target_line_start":3327,"target_local_id":"block-409","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3327,3356],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a927cd3f2ee117595a925a0d65d28e068a52ec1fe789fee72b04d33998c7f9ac","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-410","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cb650c0881b257713c2574c318c7ce03e8de634949bd336e8989f57eb92c9d70","target_edition_id":"edition.r017.id-id.draft","target_line_end":3372,"target_line_start":3358,"target_local_id":"block-410","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3358,3372],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4969d49187aa01bab8be55756a20c2df996b3b1a23abb780698ab0d3e562fb4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-411","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9099070db0371fac906cd1f070d80ab438e265fd3f35d4978b89cd6ebf270083","target_edition_id":"edition.r017.id-id.draft","target_line_end":3393,"target_line_start":3374,"target_local_id":"block-411","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3374,3393],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8affafebb6c188c8ef4331068b7d8b13f662aacabe40aca5b8b7d3d2e006b9da","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-412","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8c7af9a94c752afcae9905e59c790d18b41c465c1093b92335abc3a1a3dfe5c","target_edition_id":"edition.r017.id-id.draft","target_line_end":3402,"target_line_start":3395,"target_local_id":"block-412","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3395,3402],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3427efdd57393703c0fc1697fced267429bcd77f78d2f1c8f6d74f016b8d856c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-413","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"655b85ab069a4d4b4baa9fa4ebedd28c3b18223bcbdce08dc4509e11f10b7f6b","target_edition_id":"edition.r017.id-id.draft","target_line_end":3426,"target_line_start":3404,"target_local_id":"block-413","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3404,3426],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7d365ba4933dffba215079f57c6654c9d4fe32965eea20a870c6d8e0b6a4750d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-414","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7b4b6f63c2350c609facb6d411f38708b5a7968882ef821fae9e8ae74fc95f3e","target_edition_id":"edition.r017.id-id.draft","target_line_end":3435,"target_line_start":3428,"target_local_id":"block-414","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3428,3435],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"465694897c4340ec6143c86673710476fa4ea27cb5373e57620d115be350b81f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-415","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3560e57b64e398c1c7d8a792455752eeb5b3c00820336346d8c0b4cef568e94c","target_edition_id":"edition.r017.id-id.draft","target_line_end":3462,"target_line_start":3437,"target_local_id":"block-415","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3437,3462],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e6588652a24d5c46e857089d199b116edcfeaaf217d83972e981da750904cbd","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-416","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c4131b92b5af95ef8f07495408a745d4e60aea7cb7dca297828337ea88625618","target_edition_id":"edition.r017.id-id.draft","target_line_end":3469,"target_line_start":3464,"target_local_id":"block-416","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3464,3469],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8e72fe7f97f3ea75e55ed64ec7ec63c7d410872a6f8b1f9e537de6e8fc78663c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-417","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"30fcfb4d5b85a4655acb8acf312fca436efcc4f5992065de596270b0ae51d55e","target_edition_id":"edition.r017.id-id.draft","target_line_end":3474,"target_line_start":3471,"target_local_id":"block-417","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3471,3474],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ea4a619f13f4408b9a20424b04d06162c62578ae5f6d4f42ca1924cdc31ec3c1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-418","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d7b0e87bee5fb0e8f04bd06bc69b357747f3a710f201a75d4cb15830e87b7f2c","target_edition_id":"edition.r017.id-id.draft","target_line_end":3505,"target_line_start":3476,"target_local_id":"block-418","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3476,3505],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"03a18cd32072a777d60a9b3106cee9aa041d1146cb4142ce1152a8510a995965","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-419","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72232905f604fbd1e9db3549159a1d3257be8af1ae7bd8bed6f2fcd39ab3374d","target_edition_id":"edition.r017.id-id.draft","target_line_end":3507,"target_line_start":3507,"target_local_id":"block-419","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3507,3507],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e230166cee6f5bfc40818834a4e048ca61b977feaa63d5b1682cb7077734c712","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-420","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"92d675972575b4ab5c56228fc617756468e9379884a67f006375055d269e3a27","target_edition_id":"edition.r017.id-id.draft","target_line_end":3510,"target_line_start":3509,"target_local_id":"block-420","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3509,3510],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"610af8f1b09e7dc0e53f799eb42bdfaba07f0904f3b42e53af68bbf8a642f175","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-421","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cc19f9b3a419615b4dea01d1f83eb5a0383887683cee9b6efdc76c14e008ef8a","target_edition_id":"edition.r017.id-id.draft","target_line_end":3537,"target_line_start":3512,"target_local_id":"block-421","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3512,3537],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d016306b038b343ecae7dfcbdd5a00e395d84fafe52e314046b7aee4381d4bd8","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-422","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c2e661ee8a52467413d4329f625bff32ba6aa968e5d52727f324616cb415f666","target_edition_id":"edition.r017.id-id.draft","target_line_end":3539,"target_line_start":3539,"target_local_id":"block-422","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3539,3539],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a65c3acea442a5bc5610c65bead2ae84e4b0eab09250ecedc2ed512eb5740bad","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-423","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d5a9958534e599ba1fac4378ad0709a420765515c39e2339fa789ea54bad8949","target_edition_id":"edition.r017.id-id.draft","target_line_end":3541,"target_line_start":3541,"target_local_id":"block-423","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3541,3541],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"275d43d496377835c6b6696077699d22818515c4ec3bac671dd0f5803d544627","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-424","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a3989b657d2d73e12d0ddb85cc7686cae130770e7728ca25e64b31b30b91d34d","target_edition_id":"edition.r017.id-id.draft","target_line_end":3543,"target_line_start":3543,"target_local_id":"block-424","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3543,3543],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"58896a02fa107cee051173304c21c42a748e946cb5eae62fc74efa1c73ea010a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-425","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"48b17029506e7306a17c402f03c4b6d9663bfd6c86029590352493eca61db315","target_edition_id":"edition.r017.id-id.draft","target_line_end":3548,"target_line_start":3545,"target_local_id":"block-425","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3545,3548],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c4abd0d32dd7067acb9bffa63e44e42dc8c3d4b9f3a0196bf6e043e8cd2081d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-426","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"69c9706d1c3e43a2f4a57ca8d66f47d1d9d2c54e83f457d2e06943f41950c89d","target_edition_id":"edition.r017.id-id.draft","target_line_end":3550,"target_line_start":3550,"target_local_id":"block-426","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3550,3550],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76def998f527fe758b69b0507dd94ec3744639e60e36b65cc25b648bd8112d92","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-427","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"13349fb50a99f444ab2f68e540c67df1b38f59afc8e1c9b0b072d5392b0a534d","target_edition_id":"edition.r017.id-id.draft","target_line_end":3552,"target_line_start":3552,"target_local_id":"block-427","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3552,3552],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ef990bbf5897f632e688f77ad063d7157b33dfc262f692c3a0b3cb211ae5bfdc","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"id":"segment.r017.book1.ch14.text.block-428","locale":"id-ID","parent_id":"unit.r017.book1.ch14.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1aeaa044a37bc929d0df9b213c8b7b3916273a68f4702faea9fa07b9a56a4cf6","target_edition_id":"edition.r017.id-id.draft","target_line_end":3569,"target_line_start":3554,"target_local_id":"block-428","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch14.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[3554,3569],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02f5a2842904dbef5d0ac7827df345466e1a11d8a9f13c63dca823f9f7c10e22","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5ccc64100fae3a1c208f0e0e66ae4398d0a2fe00188397ac9d0fd8a6125dd87a","target_edition_id":"edition.r017.id-id.draft","target_line_end":8,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,8],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"407dedfb5b835ec503ce1a7174e61e22b16e4f8c0e23a92ae1561f5499940a6b","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2c08bbdc00c19ba1c83af1704f1c125761ae317cd9a4610c0d90041289aadc7c","target_edition_id":"edition.r017.id-id.draft","target_line_end":10,"target_line_start":10,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[10,10],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d83f07685f84539c9fefc1d661af48842d5935b7890c6b4f495b33f7772ac8b5","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b1331cb036b2a74129bc24941d4c3a5a352b71fed9bca2afb4db15d236be0703","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":12,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[12,12],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"75fe43abe897432178bec54204778d7df077d26bb0d1169188a3d361443080bd","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9d96e5a12ae1467e0be3b72094b621286764c4885976213eeb5c7cda73282662","target_edition_id":"edition.r017.id-id.draft","target_line_end":14,"target_line_start":14,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[14,14],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c887c93f34cba9215753212f8498b67e154e885ae7f42ee19e75b80db7ffafe3","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bf6849051a2aed901c6702da2c7620a4c1c25b127b402afc8ced6d2404e3404e","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":16,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[16,24],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"87885661a9a652d7af1d031a26b6c7f30936d6ee7d0f5ce8d5714338ebbcabb4","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"90cbad988dc3d18b87e1e459733f406f7b37597eb054fb4fbe51802748bff3a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":30,"target_line_start":26,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[26,30],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bf84eab6ffb6f235d620cc54a2fee090adad58f32c7bdaf2ab36b2a599eae20e","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b0dae59b1d46a82daffbf4e0fe98ba767103a79ec21487ac32a34d2fa565cbb9","target_edition_id":"edition.r017.id-id.draft","target_line_end":32,"target_line_start":32,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[32,32],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f27aab66b91ad207e029f2e0c02ce9f3ee5cca61d9e44498b5ed53089123c75","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bcf9cc01b3c4c6ea94fef22d49e850371b6380e3995687bac19975a281a931b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":40,"target_line_start":34,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[34,40],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0960301273a5973d6705f4f91f8be2cc4125ffb38ccecaa5a500c66795403451","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e29d4a4c6c67de5a5a075a17833535aba3af0770cdaa81f193a18852b50d369b","target_edition_id":"edition.r017.id-id.draft","target_line_end":42,"target_line_start":42,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[42,42],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"820453e37664ce413878bee2de18eeb4612dbd3f485b243630d2ecec9a64d3ea","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31bd23aecd9d960020b8f9afff9214e672fffa55bae6b18b87b1afa9b348c0bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":54,"target_line_start":44,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[44,54],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"128273e70bfdf182893749832a3b8418a7190022fc45c77901370171de0b34a9","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"13260f773a9c05e4c85ba9d53ac794ff5781c9758acb9cd6d3abfc449fabb037","target_edition_id":"edition.r017.id-id.draft","target_line_end":56,"target_line_start":56,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[56,56],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"34452123dbca5b75ccec416b8be775f4cab2aa5ac8f94d21b89173ba937979de","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"12b45b4bbcc3dd05fe09aa698f5831e864855d7670df2fb6de4d3af9f8d0bc15","target_edition_id":"edition.r017.id-id.draft","target_line_end":62,"target_line_start":58,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[58,62],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dca2089e6dcb8ced06967527b112216b5b7cead9250bb7e687487f4c94996942","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c42661aee392af384a85cc1660f00a0f55dcd0df3f5ac8e7d1aec4e4fd76cef5","target_edition_id":"edition.r017.id-id.draft","target_line_end":68,"target_line_start":64,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[64,68],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"23083d73d2c27b1b6b1f5787c6e5a40db0f34d1beb75326959c7e707bdcdb5d1","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fabf9a5e6ee3dcb12624a7a3d12b0443677451ffba2e70cc67df161361fcd6c2","target_edition_id":"edition.r017.id-id.draft","target_line_end":70,"target_line_start":70,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[70,70],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c7a9019867008c1275c5eee700d45866fe0aed6b9c637b6b27f6b6239017207","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b395a3123e9f6eeb394beb03a479c906e29be0e032f433c68fe6197a05aeded","target_edition_id":"edition.r017.id-id.draft","target_line_end":82,"target_line_start":72,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[72,82],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"01636f8105a2177396da11ea9938cf6a86a9ec2093a7703566e962a242f70182","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5f1320179785c04b3c772c2c37b9214815cff03a10bf0a0ee6698a9793bd5db4","target_edition_id":"edition.r017.id-id.draft","target_line_end":84,"target_line_start":84,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[84,84],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61fd9ee6734c0d3d1d381b4b5e6566dc6193db3395541cdcc8dd73e351fba3a5","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6f71206b12c4936facce27fd2a56ed9072bfcf88fd1b5f18aa09bbd3665597d9","target_edition_id":"edition.r017.id-id.draft","target_line_end":98,"target_line_start":86,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[86,98],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0bd3063381ed52b4e40bdba4ff7da9afd4276c8e8fa3ccaa475eed9f097b80e6","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2ae0332669dced4e576126cac5f71d59fb7d79234bde8928c15001a12d9079a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":100,"target_line_start":100,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[100,100],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2fb695c8f10b876f67595a399a9faa8206d06cd6f53cdc6698557bcb15aa2947","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d372dae31492db4ce4a0c8c352b8fbce32370f060bbe24189da32cc2dcc3c8a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":102,"target_line_start":102,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[102,102],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"970e38dc5b2d7ed5c590445c795bf995e31602330eb79c962c1d26f0b958e34f","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"829e8c7c73594b3cec4498fac56009c1df3be344502d765b27ac6cf217cc2d07","target_edition_id":"edition.r017.id-id.draft","target_line_end":115,"target_line_start":104,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[104,115],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8a8b1cf047102ddfc97067408344eed84b266678883b3a684e1117690f53fc90","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fc9e90168a1e24ac8fd5dd054cf3b49fdb5789bcd26e25127ff72c9f969bc40a","target_edition_id":"edition.r017.id-id.draft","target_line_end":117,"target_line_start":117,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[117,117],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb32888d1c8496cc0176b5d7ab4e726f0b86fa468ae41d6fbb33d04f7aa273b8","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0758b1c49f8444a1450272ae7f925892f156e89d2f94d6df14737a8af5338efc","target_edition_id":"edition.r017.id-id.draft","target_line_end":119,"target_line_start":119,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[119,119],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"aef95d26ba6238226a43bbf07a1f1499b5a034f744c274ba20eb4d0e5c9b4b61","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d3a894a8ea5d0e9498c6be7af5e3cf91233fd95cb597e6dfc8c5cc8e423fd07c","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":121,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[121,131],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"df95d08cd5b31d70d357e3a442fa6ba9fd761e6fd4b4e71e3ec0dd0cb064da27","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e37000232a35fb3af9acfc16323619b9d290c0fa1ddc944f78070349b583c2cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":137,"target_line_start":133,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[133,137],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e97c9ea7bbfb9b02718301ddbf52003c357ef77c8fb933a326b0f1f807a7399","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d4b4e22c0dfd73d5310e5fdae32914d3c1f9aa48b938c8e7312706d9bce35431","target_edition_id":"edition.r017.id-id.draft","target_line_end":139,"target_line_start":139,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[139,139],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19c58f9dd73187b0c99853a4bc4c7b45060eba7cbcc85281113f3e06bbfa8e12","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"edace849b8cb72c0aa5420e6a9d2c569802ceccc248811bb6c0c0bb3e9704cc8","target_edition_id":"edition.r017.id-id.draft","target_line_end":150,"target_line_start":141,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[141,150],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"be020abdf81543732f399eb304e9b0fcb409c4335bf6c6a50ac4f3efa37bff1a","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f032dd01b2634689932314a0a9a8fea5a1048538b0b4537f7ff206a68dbd3c4b","target_edition_id":"edition.r017.id-id.draft","target_line_end":152,"target_line_start":152,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[152,152],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6b2ae92c10d94343324b44ef79ef4865714568e2722f122a03da214309485335","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"11896946fdef30cd697f631b6447750b09796f945f211dca55ec7a66037480dc","target_edition_id":"edition.r017.id-id.draft","target_line_end":154,"target_line_start":154,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[154,154],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c6a4fbc4b76fa11386caca364c581ed4b229c31a8fb781026ac073def46acd2","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"477d9abe9cc314f31f4c5b64e432f8c49b02cb007a195b5fa500274ae759fbf6","target_edition_id":"edition.r017.id-id.draft","target_line_end":165,"target_line_start":156,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[156,165],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"947f05c335ec0bebb5af65d0d3a676f730b6065a05f146720ff1d4510ab27785","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ad4431ff1105e61fe17f98a20d3027f2fcac09ee21798b4f1cd8cd866abbbf9e","target_edition_id":"edition.r017.id-id.draft","target_line_end":169,"target_line_start":167,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[167,169],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4c9aabfd4516d3530857d7c90a38e36d6eca59263f868ccb4ba0b1d09c94873c","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6a66336c463b6aa88d6686bfd9559688012d5a71cb46a96585ec85a2c7178527","target_edition_id":"edition.r017.id-id.draft","target_line_end":171,"target_line_start":171,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[171,171],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cf51a4e9f9dbbe3936f581120b4594b62ed28661d6f3060601b4b822ba52342e","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3131951ed8f0e5cfa3f9ba82d82f94fb5d792ff61b800618f36b999ea934192e","target_edition_id":"edition.r017.id-id.draft","target_line_end":179,"target_line_start":173,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[173,179],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b6fc6c39210a7559a1c8919327e4910098017a2247831fac7fe1b89b741b8501","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"11e28a98040ccb1b2af9eb70b12f1ba65758006c09723cbe05199c57826957f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":181,"target_line_start":181,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[181,181],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d362a25662fe4f93ce3dae44d8ce59fe86a83ba96b97f1b4669c2e4dfdad8ae7","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6173da7c05e61ee5fa398e56a6373a849b8a2869bd5f73bf5eed1c1e75defcc0","target_edition_id":"edition.r017.id-id.draft","target_line_end":183,"target_line_start":183,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[183,183],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2841e895c2512910ac4e26c89e54270df6e514409acc21ccc7b4d2851fe69999","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72d0e07c695eb798107beaa3b1e64dc0bc7f94b3c54a91b3bfea8c70731bcbbc","target_edition_id":"edition.r017.id-id.draft","target_line_end":189,"target_line_start":185,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[185,189],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c987f157bbe2f66ca866070bbf52f358855863b31a1467f455ceee5af5c2ef30","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7dc72d24e08b7530753e6f672b6ee3ddbe450acfc55be02714f2ba05dab9d43e","target_edition_id":"edition.r017.id-id.draft","target_line_end":191,"target_line_start":191,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[191,191],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"31922a36b887633412037921618d0399dfaa59e7dd23d70bda9318eb85d40cc7","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c34c07277229ddc93499ef24b026c12bc24e34f9a84d0f78fccc4e3b1ada9eb8","target_edition_id":"edition.r017.id-id.draft","target_line_end":193,"target_line_start":193,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[193,193],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a52f376c1b84c1dbeebf441a7237294c372e36d0603045bc99ec7f7f5a85392","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9020ec9dcbb50def8f7cbf0a54e3300ee14d25d2c0c31fce9c9839255a026d07","target_edition_id":"edition.r017.id-id.draft","target_line_end":195,"target_line_start":195,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[195,195],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e810a33560a967932824cf8e634bcacd49a50025ca9997125e44819d4085480c","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b1bdba1af0a087602567a872f3bf8232c31c8aa5957b3493123d8a7920f6a881","target_edition_id":"edition.r017.id-id.draft","target_line_end":197,"target_line_start":197,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[197,197],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1f9da4cd9901a83162ea7ded27bb68c04e835836af48c954ff54930de001aa9d","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d7f666980285162ee53224da41ed267639c193ae07d8ba65dbf88af99066be4e","target_edition_id":"edition.r017.id-id.draft","target_line_end":199,"target_line_start":199,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[199,199],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"730e26078decfd4919d5b71ce03d45ed80c5bd2658995c3f192d902a1b97386b","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31f89192b51771d1f48d38ed1536ea16edad7a1156797baa3294cf34ec71148a","target_edition_id":"edition.r017.id-id.draft","target_line_end":201,"target_line_start":201,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[201,201],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39123d5deb6fd75c2862d52b4603146a5b593566ccb7d1c2c5efeb8adebe3f77","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fdbae6a1dbf97eba31ca60acc662b422aad9f79634caa854a6719b26a844a0b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":203,"target_line_start":203,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[203,203],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6d0ff5a810c5a9007b7b1ac4ba028bb17be39432b704b977b59936ef3029abdf","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b1cd120d57246bd3cdd14c12ce902e79ad8cbedea91b4c9d754581b7c4f7f34","target_edition_id":"edition.r017.id-id.draft","target_line_end":205,"target_line_start":205,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[205,205],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"489235a2a09cc1d3bbdf69013d1b1d89299432943f3d58d070e85b648784db08","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-044","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"35137a6284c69debcffb2ae4a040561ac43446ca95c09a987a4b84c721d61a45","target_edition_id":"edition.r017.id-id.draft","target_line_end":207,"target_line_start":207,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[207,207],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39c47fba10e25ec7b8864b6c8fd782a1ea6e6ea2bee489670b9c506ff3d142a4","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-045","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"48a40996eb9a7ec347eb4d2e7aeec64ad394b344017980690ebfa41c5d688652","target_edition_id":"edition.r017.id-id.draft","target_line_end":209,"target_line_start":209,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[209,209],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e03f744365372bc2b3d60699e1654f8190e79cb34d5fa53412c753e442965bb","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-046","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"553b2951b1b664e3bbf13c4e189788a4c86958d6e783db40ff74205c9e4b6c43","target_edition_id":"edition.r017.id-id.draft","target_line_end":217,"target_line_start":211,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[211,217],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"102769048103ea6849c96144cc48d83fb7a3fb1d4325eb874cacce07eb73e312","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-047","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d5583825262828b48d7285650083966213a8fc832e050df362fc592e841d2a5d","target_edition_id":"edition.r017.id-id.draft","target_line_end":219,"target_line_start":219,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[219,219],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"66a15c6b58316268a3cf3f2306aabdcc03ebc5c8cd1ad1c5670c30d2f8d77afa","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-048","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9e357ef0c0504be5a2ac933caac46a0dcbcc188e1c719d6d073244bb185bf227","target_edition_id":"edition.r017.id-id.draft","target_line_end":221,"target_line_start":221,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[221,221],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"80f6a0663b7472a29241ee93807f25313bd9326718ef0d88b4ecf76c3c1151aa","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-049","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"59d88fdbf7694f1d4a177d5ce6b511e606c8b4aeb691365db3a274bcd3b81a57","target_edition_id":"edition.r017.id-id.draft","target_line_end":238,"target_line_start":223,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[223,238],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"664ae3d1b660942263af4140b9e1c3819c2650a7d918b0d7610f5b9dd545068a","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-050","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a856ace2d688f9a44f1c8b928dc3a3ac0cea42629cc0b30e0f487f3531118ab5","target_edition_id":"edition.r017.id-id.draft","target_line_end":240,"target_line_start":240,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[240,240],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"95cf2b5aeea4fe0fe5bc85fed7e10b0e8a4d0eb4bf7f6dc5124e34cc9fcdc1d7","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-051","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"78b712eb396ced713ed4bebe60246ced93ffb2ca96b6678faebe37239de713de","target_edition_id":"edition.r017.id-id.draft","target_line_end":252,"target_line_start":242,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[242,252],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9be5993cf1378e9a53077b84322d805b87b11430b52dc6ab734d5365b6ceee74","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"id":"segment.r017.book1.ch15.solutions-manual.block-052","locale":"id-ID","parent_id":"unit.r017.book1.ch15.solutions-manual","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"939e86ec63112e5f85bdaf50511220f309f22b7fb5c26b56af943bd605152002","target_edition_id":"edition.r017.id-id.draft","target_line_end":264,"target_line_start":254,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.solutions-manual","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[254,264],"member":"source/Intro-Math-Programming/baseText/book/solutions-manual/ch15.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"acf5a34a0ef59fa6c1a6608811bda98f0691fb4e9b9b8666aa4723308718f957","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-001","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"78b4ae10f62783cca501a34b781f9d3ab5ceac892b41404c2ade9a73ceb692bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":1,"target_local_id":"block-001","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1,4],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7861a875afeb20dd1b63641a3f2efc80ff05e13f69d07a4380ba54c181fe9403","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-002","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"36c11a2961b319d53a91bb0a49083578ae5fc4ee3fbe365d1be6d60c764e7dae","target_edition_id":"edition.r017.id-id.draft","target_line_end":10,"target_line_start":8,"target_local_id":"block-002","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[8,10],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f86d2d5eba46695395d6edcdc6aec31d357ebb341cf4261cf1e86643d14a3257","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-003","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8d76e3dcc266a0f8f5b006d4e53b716155ad1629e153a7f5ed730ee3124f5fc8","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":12,"target_local_id":"block-003","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[12,20],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a44902ab61806662fe72b7affd434e958f9bba9ee18d3b6a6fbdbb334d4db9dd","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-004","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f2671da95a616ff08df28327a423497100b1908a76c171c2ab65036aaf33237","target_edition_id":"edition.r017.id-id.draft","target_line_end":24,"target_line_start":22,"target_local_id":"block-004","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[22,24],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"adc404ba31a080d76773be15adf3a9f18cdd0d53da79b8c5c10f474284a04de5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-005","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f4b558ee5af55d9548a418618f0fa7078bf119cdc64b395907a36bfe2b9ebb3c","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":26,"target_local_id":"block-005","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[26,28],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed993091beb6d763e8d7d971fec654b75c39f47b46e3480e67eba83a252e5163","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-006","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f93867bf3121664c9ec2261dc04b6e9e0373b37d3016bd29cdf4587e6ac2370b","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":33,"target_local_id":"block-006","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[33,33],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"326b2836a47225d154adc1711584527554213644781649837b15c8de1c90c205","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-007","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f814ea1eb81091d355a832ae4f7ee9446c688612852f0a1eb70ff8e4f7c7e3f6","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":35,"target_local_id":"block-007","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[35,36],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0cf66536f63999829abe8817ae68e8cc99a0473e5e56e959cbd1690ce87a622f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-008","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dc5848a41ffdc7f61a0c4c411d973e45e6d44b336e1f688822d05cc93d306b7c","target_edition_id":"edition.r017.id-id.draft","target_line_end":40,"target_line_start":40,"target_local_id":"block-008","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[40,40],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d7f5787f702370582810a20338b29bdd872bc01eaaf7dba9fb210fb61f0e5286","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-009","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4618d265eb3067f86eae7f1bbb2b58ba864b315f338e8cc1310483fd025713a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":42,"target_local_id":"block-009","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[42,51],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bfc5029181d7b4800c458e33a1632888982fd96f77ec72bb664c86d00d315564","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-010","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1cf0f75b4d6641fd0c6e059a7ab385c97c44462c9afea0cd4c9a414ba4d4c318","target_edition_id":"edition.r017.id-id.draft","target_line_end":63,"target_line_start":55,"target_local_id":"block-010","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[55,63],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7053a16536c8ac07040b953cc14061f968735313045b3849b13eb258ff1dc3d0","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-011","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6a0105e4ef4cb522be642f2eacdc7ad551188197f7d6c46621ecead171a3373c","target_edition_id":"edition.r017.id-id.draft","target_line_end":71,"target_line_start":65,"target_local_id":"block-011","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[65,71],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4af55b170ffc64e3a5ad234bbfec2a2e837412b8b432d28ada06ba1a6b785380","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-012","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e23837c08c6cbb327b06043e526c789a4394cab988dc2224eae3940668875f74","target_edition_id":"edition.r017.id-id.draft","target_line_end":104,"target_line_start":73,"target_local_id":"block-012","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[73,104],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f1889965e59637c7f233f51fb22c5b9c49ec0de56b2d93fe24c665888c549c30","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-013","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c8b024186f9c889ec597aefda3110e8202d3dd59efa47b43a12a0d1fede68e60","target_edition_id":"edition.r017.id-id.draft","target_line_end":113,"target_line_start":108,"target_local_id":"block-013","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[108,113],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f1fae787ee82ee9a186c81a8579948cb446c5e0705dea6208d0c0780d2763e5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-014","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e26611d7a70665600ead0dc32a674e7313a82da5daeede46b3215ca2afeab6b1","target_edition_id":"edition.r017.id-id.draft","target_line_end":128,"target_line_start":115,"target_local_id":"block-014","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[115,128],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a6d785e154b22add050e722a7efc46034682b515cb2fc9cd7909aac56af70b4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-015","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"269ba6e38e5216ae9a804afba7cfb16857a89d15bf1626b75caf35039a7969d0","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":130,"target_local_id":"block-015","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[130,131],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d382799d45ca44cb98a488564e4ffaeebfcf2e287626711561514130a88c6b53","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-016","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"31c715dfc19b72d0c01d2cd8eb3a4fe07d8ef42bedc45128da91f72168f8e4e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":133,"target_line_start":133,"target_local_id":"block-016","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[133,133],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6c723584959c80d69ce53fdfdb1c3dd2ca53fb36df36180d77ad9e7e6e5e434b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-017","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9e534bf4f024bf81698d03780b053656bf7c551b58290ceb0eb6e3ea8c60c42d","target_edition_id":"edition.r017.id-id.draft","target_line_end":135,"target_line_start":135,"target_local_id":"block-017","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[135,135],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f6074d35b06d5af3da4468711601aa79b79fdb41ef74c8e5a53dcbeccc337c2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-018","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9fe6b00ce5d7a942e6831b8a701c048a836b3863cd3be66caff02796e06f7262","target_edition_id":"edition.r017.id-id.draft","target_line_end":137,"target_line_start":137,"target_local_id":"block-018","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[137,137],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"53c3c7080b9d6aa0b6ccc85e0f309221d6994f07e7324807865bb44fe593836a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-019","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2419f95eecf004fc30244c485e495e90f407e49ef24888712b3198904ee41bcf","target_edition_id":"edition.r017.id-id.draft","target_line_end":146,"target_line_start":139,"target_local_id":"block-019","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[139,146],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dbfdbe8045f6373eeab9922a4855cca7f47f3466c7818cc9a9aed247b41a32ed","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-020","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"df63754185f23e84311b3a74055dc02765180e925370ab478d422b1d0da46f18","target_edition_id":"edition.r017.id-id.draft","target_line_end":153,"target_line_start":148,"target_local_id":"block-020","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[148,153],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2ae6ea050114243a95f10a3e4f167c182a65bb3d86e7eedb2096294b48532467","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-021","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4ce82f3d27f43b3279d127a37b1f3c689588905759ad9f8f8fb57769abe86930","target_edition_id":"edition.r017.id-id.draft","target_line_end":162,"target_line_start":155,"target_local_id":"block-021","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[155,162],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2db3eb7159a69bccb8a336ef5759e6065c32071b4d75e2cbb633cadd135f763a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-022","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d4bf159c56c1fdee38ddb01b3c302ee9b7a4cd7b9828dd08bef33a56d96fb169","target_edition_id":"edition.r017.id-id.draft","target_line_end":164,"target_line_start":164,"target_local_id":"block-022","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[164,164],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"99b244f899d2f54d2ab3a8edc080df2f9a1a722ecf220e2d3f051d1d55cf1e35","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-023","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c3304159b288e7f35381da91b1925846f7f87f406b478ea65cce6c8fe0dce51e","target_edition_id":"edition.r017.id-id.draft","target_line_end":166,"target_line_start":166,"target_local_id":"block-023","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[166,166],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"65798b61e53a461e7a1de098b065f515c0147dba1eefb914446d9cb0718a1963","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-024","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cb15702eea74c9b0af7af6a48a1b1f8efe4b418f26cf55db7be86909399de955","target_edition_id":"edition.r017.id-id.draft","target_line_end":170,"target_line_start":168,"target_local_id":"block-024","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[168,170],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"58a63d6b88b9d8f72a7996ee940578049a858b1a0646e7c08137fef8452e4593","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-025","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"095dc8242e3fd4e7c0c77eed8b52d09416f30c5b8ed3332ee4969073d60783df","target_edition_id":"edition.r017.id-id.draft","target_line_end":172,"target_line_start":172,"target_local_id":"block-025","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[172,172],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c9b1fd4ab9ca72cec1da2527dcfedd3ab8849396b2d4581f9a8990afd5c94c5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-026","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fcd5b1a81c93e2f1e2634357e8deddb61af45381aee13a69977c41d934b59866","target_edition_id":"edition.r017.id-id.draft","target_line_end":176,"target_line_start":176,"target_local_id":"block-026","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[176,176],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab0f8b5b3f1edb0e622e23cc3fb7b60890395e762be47fa9578526f5c617e53d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-027","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b99a0bb2bfb4f6df12a6b91c81a8192c49ac0f40e2f39c29c4aabe1d4a4b60a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":179,"target_line_start":178,"target_local_id":"block-027","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[178,179],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a8611226afa02f6208a40ac0c5693aca0a1dd621a42a129f8e609c039be342c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-028","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e58667d6b932403b4e2e7086c9108868a9dc103681f961b605ce277096694142","target_edition_id":"edition.r017.id-id.draft","target_line_end":185,"target_line_start":181,"target_local_id":"block-028","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[181,185],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc5449e71f0b941cd087f1ded963cd149643c0aa2373af9c421dbd4b7d066a9f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-029","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b6fe3a1ac170c8826d6e5c4301d186db9f45fd7582eb992c83eb93b588bb354","target_edition_id":"edition.r017.id-id.draft","target_line_end":193,"target_line_start":187,"target_local_id":"block-029","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[187,193],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a4a1f9aa2e1138d6fde4a9ea7a7759d687c9b7ff5947fe8f8346e7f96989ae72","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-030","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0732eb999fcd0107ab29889a91f4eaa34fa62ab45d65c2e88a9fd0126226a785","target_edition_id":"edition.r017.id-id.draft","target_line_end":199,"target_line_start":195,"target_local_id":"block-030","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[195,199],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b1cfbf9a765a2aa17163136f17afbc4bc006d69d71dec22ea924511abca160ec","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-031","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eca4498ef3a587addbb8acd9a859c9e3f138dd5faf941cbbfbb21c2a53a073d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":208,"target_line_start":201,"target_local_id":"block-031","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[201,208],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"69a0a80bc14695b4db5cc1e2749f66884565414fc28f00f55af48dee59d4bb8c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-032","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b6d9e12d132cf1ecde27bbc205bac8fd8640d6454efadc2ce106784a8d48ba1f","target_edition_id":"edition.r017.id-id.draft","target_line_end":210,"target_line_start":210,"target_local_id":"block-032","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[210,210],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e3fe3cc7a502bf6ca059f6c22ac777802df1f952da24026354c8aa4231a0c769","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-033","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"67c5b21d0ed9ce67d1d19bc63b91f2e433b86621aa366449a4e422d1b9d790b6","target_edition_id":"edition.r017.id-id.draft","target_line_end":221,"target_line_start":212,"target_local_id":"block-033","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[212,221],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"428c12fdee03b48c8e9d7052f702a6c4f8f0577174e432d63b09cfb6eaa6827e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-034","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d92e14738813922555b235b21a79d884e36e413de4a19423addf3ebd9d66dd5a","target_edition_id":"edition.r017.id-id.draft","target_line_end":227,"target_line_start":223,"target_local_id":"block-034","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[223,227],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"77bb3637872c96d292b2a27f67c2c1ff09722a03976703a0c589ed79bcd1ad44","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-035","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"12da6a04f1b9217af3f0bf829cb68a0a121421beb7f25799621e4b8659471c2c","target_edition_id":"edition.r017.id-id.draft","target_line_end":238,"target_line_start":229,"target_local_id":"block-035","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[229,238],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"84bfef921e5a571e2cb7862294f13f5f81d53924da8e83e13043531ee8be4724","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-036","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"54dd1a7afb9a34d543ce7bafafac0d0c519049d039604448a0f187e0b850f8af","target_edition_id":"edition.r017.id-id.draft","target_line_end":251,"target_line_start":240,"target_local_id":"block-036","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[240,251],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"871122f85d35b1b0575a29368999d6d3b91467a9ab85eb3dddbe56b43f8f2f8d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-037","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e389fc5f43cde548e220c84dcb0127832f3d0600ca900c506945e04d64ff557a","target_edition_id":"edition.r017.id-id.draft","target_line_end":260,"target_line_start":253,"target_local_id":"block-037","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[253,260],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4690b8ece13ef1a9cb37cff2df0142286c4115daff85af0ddc53f2bf4eee20fe","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-038","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b6d9e12d132cf1ecde27bbc205bac8fd8640d6454efadc2ce106784a8d48ba1f","target_edition_id":"edition.r017.id-id.draft","target_line_end":262,"target_line_start":262,"target_local_id":"block-038","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[262,262],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d7e44926499b93bde4dafa546c33d80c6105660c4d7a9619f7bf37cf195a702a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-039","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b998df13334b2c0b0b42a7179db28dd57294fed4b9a7449f9c362460183d1b57","target_edition_id":"edition.r017.id-id.draft","target_line_end":264,"target_line_start":264,"target_local_id":"block-039","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[264,264],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0ce1497c7ef8dddfe380025ea22aec17f773131c1548accfe2423b8285b811f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-040","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3b2d923cd9bbba27685f39a6ca510def7c41d53e0e52d9184dc062a5eea339c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":274,"target_line_start":266,"target_local_id":"block-040","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[266,274],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b30b5ed1ac8cab435a0b643b75476176c81ce532fe1aa0f871e7e9b0a46fef69","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-041","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2ce1251f3ce4d9d890d5445426be4e5f85eb36d15526e44f752bfc8cf189e233","target_edition_id":"edition.r017.id-id.draft","target_line_end":276,"target_line_start":276,"target_local_id":"block-041","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[276,276],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"325afd0e22dfe3863407dcb512d38256f1066eda65ca9139f7756485db564917","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-042","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"22bb79948c97635f0cfb4bf1e6dcc8bb1422e7ae3bc213a2c0f48b56e4bbff68","target_edition_id":"edition.r017.id-id.draft","target_line_end":278,"target_line_start":278,"target_local_id":"block-042","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[278,278],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"311ba7a8931a9fbaab89cb98e8a857716f2ef26fe5d38d599c6777da8f735aec","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-043","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"30a1286dc6bde896c4f71ca197d27818f3f56d357c54c41bf459aafab9b4ecad","target_edition_id":"edition.r017.id-id.draft","target_line_end":280,"target_line_start":280,"target_local_id":"block-043","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[280,280],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b90dfdc3fc0c92cfc0602df724e2cf793dedb9e08dcf0a2b163b711e027c021b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-044","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0bdaad83df3865a2bbebb3909a538347a3b5d17cd11e60399eb1e3cc64236d60","target_edition_id":"edition.r017.id-id.draft","target_line_end":285,"target_line_start":282,"target_local_id":"block-044","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[282,285],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dbb991b7a4b6bff8cc453276ec4f557a4370eddba6bef6cd5928cab6f19163d9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-045","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e382ba52a6b3a61c37d4735ceb873e84f53a2d9de6e1d3127e85faf32970ef70","target_edition_id":"edition.r017.id-id.draft","target_line_end":304,"target_line_start":288,"target_local_id":"block-045","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[288,304],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4516ae8acbf8d39a47b10dcb0b2f7303a86ba5eb2d93c760202f7f6aba4e0dd3","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-046","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"95d630c81d5954ba64224d07f86822cc3608a5d855a356b7c4ad96d5695740ef","target_edition_id":"edition.r017.id-id.draft","target_line_end":309,"target_line_start":306,"target_local_id":"block-046","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[306,309],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ca5b64512c6261ecd50e0f41e87cfb9024061bd359dba3fc9b6ad53ce3cf254e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-047","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"af47eabcdaf233bcf3085c7da8676e27848582c1cbaa4b82f80d584424a2ccc3","target_edition_id":"edition.r017.id-id.draft","target_line_end":312,"target_line_start":311,"target_local_id":"block-047","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[311,312],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24ffe65373fa9128f5e797c87dcc12a58b1b777812b0a20045e95db58e9e3da6","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-048","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5096e2a265f9da0632dff61febc249e7827abcfee62a8986ea520c9011673e92","target_edition_id":"edition.r017.id-id.draft","target_line_end":314,"target_line_start":314,"target_local_id":"block-048","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[314,314],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0d65571306829c536ffb9ca60ee52c72ac74d69a384fe8347e10e7d2f6f4350f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-049","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"def90de1ad35caf18a6541cd45f279db4415574fd5fa9254ab827183ed2ede52","target_edition_id":"edition.r017.id-id.draft","target_line_end":333,"target_line_start":316,"target_local_id":"block-049","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[316,333],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"545b13f6a00e3d03b23e3a7e7a52ee79437cde0e6020a98bfcddbbece9eb797c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-050","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5ffb65dd40cdc580daf96642780e799340f04e0686415dfc72b15d9daa64daa3","target_edition_id":"edition.r017.id-id.draft","target_line_end":335,"target_line_start":335,"target_local_id":"block-050","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[335,335],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a5de3c4d559fd12951e3280938d5b2e1ad15b9811127cf05c33f612d1918793","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-051","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c8e75057e9ab8afe7db50784b654b2d6c0443781d9ecb1903afd95105058cf77","target_edition_id":"edition.r017.id-id.draft","target_line_end":347,"target_line_start":337,"target_local_id":"block-051","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[337,347],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"56e0b40b4809c6973564c4103269b11be75d6208ee53fd150d9dad0b42aa1eab","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-052","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9e29e3533075f6458375d8a605d8bbbff610476b9935e7d288bd9e909722f870","target_edition_id":"edition.r017.id-id.draft","target_line_end":351,"target_line_start":350,"target_local_id":"block-052","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[350,351],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7531cc3785d9a41a41c41231ef1ffab288fb5da3dd2bd31552371936eb7c8aac","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-053","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"282b3892c898a87645d313661ee80156ba86f11d22e814733bc477da93405595","target_edition_id":"edition.r017.id-id.draft","target_line_end":353,"target_line_start":353,"target_local_id":"block-053","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[353,353],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7eab4491ee235b2f83563489dc2d5410d5bce4355ad9127a0e62c2d0b6a59f97","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-054","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f251f5248888de8db48ebfd756a3517c74a4493350c84113cb12d6ff3ae1b902","target_edition_id":"edition.r017.id-id.draft","target_line_end":356,"target_line_start":355,"target_local_id":"block-054","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[355,356],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c97a8a3fcc9b4133772e11208540a8e86535eea3428f5d30ea14afb6835348b1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-055","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2e892caf6b987f44839a3a1a55fe7e27a5a9c955cf7d52d226b992de2eb844d2","target_edition_id":"edition.r017.id-id.draft","target_line_end":359,"target_line_start":358,"target_local_id":"block-055","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[358,359],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"844eaf723c77e5dbae7feed70814a100ae42ef20d552b38f9116e7e8cf8cedcc","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-056","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"da8e69b481e7f7c7adb65cd7bd17ac99ecc0c269f9bf13529b0cb7045f26063d","target_edition_id":"edition.r017.id-id.draft","target_line_end":367,"target_line_start":361,"target_local_id":"block-056","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[361,367],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b42816bec5877a9139bfc166eeae498d62fa2b4fd82dab540987eeaf80e6523b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-057","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cac8f73d96106268bece949206a9664a8c0392164bb994ce45f9ce2f038abaaf","target_edition_id":"edition.r017.id-id.draft","target_line_end":373,"target_line_start":369,"target_local_id":"block-057","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[369,373],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a60ed281df9540e9016f0912a1e59a7a6d4cf340bcd34505c363e756e2c9a2bc","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-058","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"50976cb319c4ee6019ac663ea1eb45de7c6551fc4ed926bf3e4a1f69dace58a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":381,"target_line_start":375,"target_local_id":"block-058","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[375,381],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"afd22476cf12b6b71ded4db6bddd40dc766574a25450456774d329d0b0083c0f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-059","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a509eb1c0ab39b4997f539936d95e1431406e6491d1bbcf7f562db117601263a","target_edition_id":"edition.r017.id-id.draft","target_line_end":388,"target_line_start":383,"target_local_id":"block-059","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[383,388],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d8243c349c3d9e67e24472a759e1c02d26757fd09a6516a3afb72d4dce8bef48","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-060","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aa64238ead9a6d150bf9bab42ef1380b434949184a623da43495271dcffda5e2","target_edition_id":"edition.r017.id-id.draft","target_line_end":391,"target_line_start":390,"target_local_id":"block-060","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[390,391],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ba65d44a3c7dbb892d9044473432d70aa59714eb952f56eecb3244ad538c1577","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-061","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"963db71819bbeeacb56d78031da6fb7e96324259999d655d3cb44e30b2de1890","target_edition_id":"edition.r017.id-id.draft","target_line_end":399,"target_line_start":393,"target_local_id":"block-061","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[393,399],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ee82c828ead3c488b98ddf9bc7982f45c57764c7bf602e274066598b39a9bb7a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-062","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cd98cc32b4f9f691251a067f1877fef5477ca4ea61d30695b7f483ca6f9a94da","target_edition_id":"edition.r017.id-id.draft","target_line_end":401,"target_line_start":401,"target_local_id":"block-062","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[401,401],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"97e99aa25b3c40facc3a73d9e83ec515be97691d50c44b47fea0d171b7954861","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-063","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b4331e0e29a35af68ac1aeb892d01ccb25ece7fb16c0d121c8c55a827b7b5664","target_edition_id":"edition.r017.id-id.draft","target_line_end":403,"target_line_start":403,"target_local_id":"block-063","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[403,403],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2a08e4c8314118e8e4e26b21d43cc6238fc6150fa9b73438f38826fefb9ff762","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-064","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"abc30faba102b66d0d15ab648f482d2f439136eb918f0cd27f2a9e3e509e1948","target_edition_id":"edition.r017.id-id.draft","target_line_end":408,"target_line_start":405,"target_local_id":"block-064","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[405,408],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d57e90ade608c31207712674f37a2d7cb5479b6677c1bb0d4030dd7d0e87bb1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-065","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"434b6db5e699f19d21af0b319c552160711f53fd077a19fa61c837a9f9a96b44","target_edition_id":"edition.r017.id-id.draft","target_line_end":419,"target_line_start":410,"target_local_id":"block-065","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[410,419],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dfa01c56c8a0843d3254d7bf35d132757fe2046d42837563d5976b492a6016f0","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-066","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4532163c6b01e1ea39724b0b99c8f4a634bc8a38788499c0e7b13b86d0253976","target_edition_id":"edition.r017.id-id.draft","target_line_end":453,"target_line_start":421,"target_local_id":"block-066","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[421,453],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f111808563a44b252c78cdf32b7e5b8aad70f0797f3d1d9d1af48960efe040f6","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-067","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1cbd33ed2961307246b6084585fbaf6ff24db14dda2937bd8ddccc9f6dad3758","target_edition_id":"edition.r017.id-id.draft","target_line_end":460,"target_line_start":457,"target_local_id":"block-067","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[457,460],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c0a5e79f11985b5cd65df41dceda01d46e1db574454d611d3add5c8018b58f8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-068","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"97fca2165bd32d5f17b0394c26e4f92a769a511cbdddec77377646b0f9fa4d4c","target_edition_id":"edition.r017.id-id.draft","target_line_end":470,"target_line_start":462,"target_local_id":"block-068","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[462,470],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9e035ffd1e7798292f5b90fd60afdb15e590c34cd1d375a14f5a1f2152d11ee","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-069","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"45a3d0ecd26fbc38f8e78adfc60442f80cb00c64aafd063cc1bc6765ccd7972d","target_edition_id":"edition.r017.id-id.draft","target_line_end":476,"target_line_start":475,"target_local_id":"block-069","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[475,476],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e6e57ce29852f87c913100c5692d54df1a5b3c6ecd9aa5a3242b445f9f589e9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-070","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ea81380df1d64099649456f3c66bdb148977a56ded95797db3e48c0cf707995c","target_edition_id":"edition.r017.id-id.draft","target_line_end":478,"target_line_start":478,"target_local_id":"block-070","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[478,478],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"448d1ed6927f7fb6a411d385eaebbc654e94066857bd128b4ed0f12ad3ed2be5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-071","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a08449c653dd70eedc6bd59f161c667bd9abcf337c681c28417359449fa0037b","target_edition_id":"edition.r017.id-id.draft","target_line_end":485,"target_line_start":481,"target_local_id":"block-071","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[481,485],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"af48b0ca04939b43a14472a9065fdfb41519f7a90b4f0a3426bf22037bb0e92b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-072","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7484098745fa0558fb739623189da6ca09b7f089863c40b6a83cd05b67e6e614","target_edition_id":"edition.r017.id-id.draft","target_line_end":498,"target_line_start":487,"target_local_id":"block-072","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[487,498],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"92259033e6182dcbcfd5f1f3142e1ca99705042404f90d5b034c1391609d26a8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-073","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f33ac0d5e5a416b55a3aac033d84673944de8d0790f03618a87517b4c2c2a7b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":502,"target_line_start":500,"target_local_id":"block-073","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[500,502],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e13b27189e662b72ee9b2309ef42ddf52e99a27b4136dbf5fcf864d9886bb123","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-074","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2df707d9590b3d6cb7f5d080992277b52d48e322e93a61dc60ffddaa7c5eb99c","target_edition_id":"edition.r017.id-id.draft","target_line_end":504,"target_line_start":504,"target_local_id":"block-074","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[504,504],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8621c9d34e6c2094e6a02989a43224627ad3b68bdf4dcacf56f07dfa5352e6bb","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-075","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f782c797290bbbd8df1a766e411b2a9c2efb9ed6cd89cf33888348a898ef48a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":507,"target_line_start":507,"target_local_id":"block-075","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[507,507],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b508305e373b5faa6f12a799956440d03e9bb822f8c816cb61cbc182aaf92dfe","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-076","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6d53fe30561095bc8eb7393f2ad46045e35e1957b50caa2c8903b95fdb559b2f","target_edition_id":"edition.r017.id-id.draft","target_line_end":524,"target_line_start":512,"target_local_id":"block-076","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[512,524],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e69fe32a5630e4a81b1ee94dc7256b99d0ed93e3f764b871a89bba138a10d388","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-077","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f64a5657a06cc1cd7cd980d212dc35466908e5e99a32c8e9e8d7efce9d61b6c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":532,"target_line_start":531,"target_local_id":"block-077","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[531,532],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3bc9519b05cac06f77b40fb0ebdf2a7a9d3ee7786c4415b7e9e01f2f71a9f359","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-078","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b7758d9bff51ef23f9d5abd9d91cce500cbd2bcd5ea8141bf7171bbc7c1e1b42","target_edition_id":"edition.r017.id-id.draft","target_line_end":534,"target_line_start":534,"target_local_id":"block-078","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[534,534],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5274ea782ceab05a3dcb27c4c6c963bce7ada6e1511557785d32830c568ea4a4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-079","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cabdb0ad27b6af96bb2b8f69098b28f0b306bbbcfbbdd61fd1a512aef7fd15eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":537,"target_line_start":536,"target_local_id":"block-079","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[536,537],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0ab972bb86235337340c82a2a201bf613d0abf697c6e4d98d057f6ed1c065b7c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-080","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dee212dfdc27d5d76ade26fbf366ef10f90b48e37326b3f2f80cd685a2a968e8","target_edition_id":"edition.r017.id-id.draft","target_line_end":540,"target_line_start":539,"target_local_id":"block-080","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[539,540],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e5fb3ac81a21bbd34c9d274703f7f0384a59c4288867df94b6a990c1ba7b8c67","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-081","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e3f485f7077a0005e220502175eb097e37a2e82b66964b627a9ce044997b510f","target_edition_id":"edition.r017.id-id.draft","target_line_end":546,"target_line_start":542,"target_local_id":"block-081","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[542,546],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"192614ecc454aaf4ea8d51c31c1da201dec23fc0d739e3caaafd01325b04b004","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-082","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ef7b23ddcf64a2408e584b5d74bbf0425c2e0ae439b2875b946359caa06b3095","target_edition_id":"edition.r017.id-id.draft","target_line_end":551,"target_line_start":548,"target_local_id":"block-082","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[548,551],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"158004df8727d1168b001102c2fcd0afa301183d8817d875bbeee03784cdfa9b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-083","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2bc61b6b76eea4486190d299164fe2012379a2f1e97397ece1bb5996df689616","target_edition_id":"edition.r017.id-id.draft","target_line_end":558,"target_line_start":553,"target_local_id":"block-083","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[553,558],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d8b35ba5fc5604fc73961f1e19aa96b4b8c26a8bdc29c8b0688c858cffd9738a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-084","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"02193647d98fb91af4d199831d3922bc6963518f18b94d3d051d4d9455d376a8","target_edition_id":"edition.r017.id-id.draft","target_line_end":560,"target_line_start":560,"target_local_id":"block-084","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[560,560],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"939af5677538cefce8ef9cd4b1bda664b918062632d86b00bef294221f9b143e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-085","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6eb1f8885f3e2dc0b33e516febd4722a486dea378a43f0a2d31100db1a1640c1","target_edition_id":"edition.r017.id-id.draft","target_line_end":567,"target_line_start":562,"target_local_id":"block-085","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[562,567],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd51393126a333ad75b19cf5c4e7547e8f66b762480964ccbfc2294e2bdb1ee3","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-086","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"97ff3e9c9af63dc620e20beedba3ca064c0151c43789afcc43b545f3fb62a2cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":570,"target_line_start":569,"target_local_id":"block-086","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[569,570],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2e03391db18ae5d566f6876fbb811f7ec0ffa43879cbf5407d1935856048f2ff","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-087","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e84e7c128641ca1cfe3706f5088f56fc8efce3d7b4848502d84d399c47a0466b","target_edition_id":"edition.r017.id-id.draft","target_line_end":578,"target_line_start":572,"target_local_id":"block-087","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[572,578],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ea22cef4dce92ee32c6868774430c65a241b52296d781d001ca1d8b46d74a578","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-088","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0b43ca7522a10987705e7084ccf9d31a2b059343da4b79e9f8997dc644fbccaf","target_edition_id":"edition.r017.id-id.draft","target_line_end":581,"target_line_start":580,"target_local_id":"block-088","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[580,581],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb0f0044d61cc3a70cc925ed690995551e4a65a60df4638ed5367c52e55423a5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-089","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7486801cc5cbf8b8c184f1ff85d57c1ccdb3159cf39af41662fedf124c57b8fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":585,"target_line_start":583,"target_local_id":"block-089","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[583,585],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d588f43ae6ab97947136500b479d8835b061eb2f6d534fa68f8050b1e2e1457c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-090","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9c9db3ba3b8d928976e38c32a49252383118721d04b1429d4b5e566c15aa5144","target_edition_id":"edition.r017.id-id.draft","target_line_end":599,"target_line_start":587,"target_local_id":"block-090","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[587,599],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"231e271594136d5017f8f514abf74d6166b6d86c3c6c74ccf9a289dce8b8e1d4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-091","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e042287ccd643050a09fdaa8b450ab2ea3fdc33fa701ca24112cd4b042d5cf43","target_edition_id":"edition.r017.id-id.draft","target_line_end":602,"target_line_start":602,"target_local_id":"block-091","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[602,602],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"910e9c5bd3a07987178c07d1443a29edff6346e8a3403541c3851930e2a70d8f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-092","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4e30b20869ff760053d5e2917567ae046790e100c9db2f7a3d83a80c7963c4e6","target_edition_id":"edition.r017.id-id.draft","target_line_end":612,"target_line_start":604,"target_local_id":"block-092","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[604,612],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc1bedc26b11c53128aa7fd6ca251d94b94fc7fffda7abf3f0ef66917f953c37","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-093","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fa1aa4bb19ae8f3543858f062c964c598a09727be271c23d43b2b8de5f9e1460","target_edition_id":"edition.r017.id-id.draft","target_line_end":622,"target_line_start":614,"target_local_id":"block-093","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[614,622],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ab81c09df0bda7cbb7fbde2e76de05333629dd8fd623506b3529589e3902472","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-094","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"073de82b205de056dbeef01caa681325424a63e1a44f5efab113a72452467c94","target_edition_id":"edition.r017.id-id.draft","target_line_end":624,"target_line_start":624,"target_local_id":"block-094","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[624,624],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c257ebcff1e570815c3219c461537f338a61d3b663a58fa8c77dd950e6996d02","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-095","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f7aeddc7c66c3fc2b35d92fc78182511cbe6d8743b7464452c6ed6986ebb84ed","target_edition_id":"edition.r017.id-id.draft","target_line_end":629,"target_line_start":626,"target_local_id":"block-095","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[626,629],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5fb0394161302730e667d4e594141974d6d68752d794e579ff41c3353e5c8b52","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-096","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5c32d911aea15217b464c8baa6861aee910f6247cca0faa64e6cd054f42fa74b","target_edition_id":"edition.r017.id-id.draft","target_line_end":631,"target_line_start":631,"target_local_id":"block-096","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[631,631],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2df4eada68e68320f9911b84a6492feaf89b5702f3222091b551430c4d3ca89b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-097","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c1a256e2a43b9bf534abfbc91dfea171289871cad28a8f2009a8f459a8b5badd","target_edition_id":"edition.r017.id-id.draft","target_line_end":669,"target_line_start":633,"target_local_id":"block-097","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[633,669],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6b5bafe06b56934ce1ec188cfb3a59c37a9fbcde409dfbc8f4aecc31c5c1874f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-098","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd2412740e657f66b3a58e823807d47a9d797a793a4cddd8ce5e9ea09ed54195","target_edition_id":"edition.r017.id-id.draft","target_line_end":683,"target_line_start":671,"target_local_id":"block-098","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[671,683],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"abf21502442f623daf9521ff77de824fd17933c0c938fca400562ba0d25e309a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-099","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aa66b0b99da044b1395de9f6572673e2b051aabe5f4dbd43ac39f3b8c92e51a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":685,"target_line_start":685,"target_local_id":"block-099","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[685,685],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c8231717772426cbcbc8da5c54747be6ef7fc402bb4aed18854b4fbc25a2bd9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-100","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"282b8ea9b42c3ba24362e29712a2611e93dc55e3c52b2cfc2ea40683411d19df","target_edition_id":"edition.r017.id-id.draft","target_line_end":700,"target_line_start":687,"target_local_id":"block-100","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[687,700],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"233782bbe5a72432c243eee7102ea489fa12f2edc31f9dd56c3ca337c8ce8c9f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-101","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cd78045544c47f3219eb806fb89475649c0d35262c88723346435c2406cfc38e","target_edition_id":"edition.r017.id-id.draft","target_line_end":711,"target_line_start":703,"target_local_id":"block-101","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[703,711],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f671cf69dc47d86286f8200451476fa75c0661c7c67d6e8512b4288125daee1c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-102","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ebee1b2f81f9497eab6c160a2fe0fddd9f080c4f8aad00d45decb31e99282ef9","target_edition_id":"edition.r017.id-id.draft","target_line_end":716,"target_line_start":714,"target_local_id":"block-102","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[714,716],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb2ec0364ba78b6be979cf9e37ec82a734647bceb3cf97f9744971d7a9ef65f0","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-103","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2b4b35b1fb82bc0e118bbfe4d8cc1dc32ed18c82d94deebaa1b987ee9752cf6c","target_edition_id":"edition.r017.id-id.draft","target_line_end":722,"target_line_start":718,"target_local_id":"block-103","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[718,722],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"94d67a49740637689b721d1c2e4ad7897336bce7829140ab3eef9ffa8b39ee33","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-104","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ab7136fdb5dc8e18895ca9dc7f4d183f73b22639e6fa09eb3d83914c56de5f2e","target_edition_id":"edition.r017.id-id.draft","target_line_end":724,"target_line_start":724,"target_local_id":"block-104","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[724,724],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"504ff25743bd9011ee9f394a20552644166d409d82a15b473eb1549c631b3255","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-105","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"49fde110c6a458535682e2a415466277b543df19fd61da82c7e305466d0191e1","target_edition_id":"edition.r017.id-id.draft","target_line_end":726,"target_line_start":726,"target_local_id":"block-105","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[726,726],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9cb9b3f9b3b1e5947f065d5a953898d9c9e12066ebecdd4714aec991152502b5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-106","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1ce51e614db426f49def31ae14faa1c671bfb55bba60b4fba5bcfbcef5a27c62","target_edition_id":"edition.r017.id-id.draft","target_line_end":734,"target_line_start":728,"target_local_id":"block-106","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[728,734],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"029fc8fc01d4a6f4d85e9a8a2ab861416f8c5cd3d811433215fab3f88f940e3f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-107","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d46f9d23ec81bf9b0c7afdcef6c1367a8eef565929f0287c838fa6d65d02214b","target_edition_id":"edition.r017.id-id.draft","target_line_end":736,"target_line_start":736,"target_local_id":"block-107","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[736,736],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f9d2f37ede770060c59b2d71f8a7c4bb1b9a4d5584a7d70a9c823c142ae4560c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-108","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f395d391b0d0938450595996833b9a41ba189375dfa6b494fe1a291d5cff1c6f","target_edition_id":"edition.r017.id-id.draft","target_line_end":740,"target_line_start":738,"target_local_id":"block-108","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[738,740],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0ba7e21acc9c17ced460f5ccd6190a91b58dc2157b6b6673b35cc59c8e61f363","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-109","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"13c041a53365e666741847306b3833cb002ff934a02f85b06b000fc01691d96c","target_edition_id":"edition.r017.id-id.draft","target_line_end":749,"target_line_start":742,"target_local_id":"block-109","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[742,749],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"28149c3e8444b3051a815cc66647700aed2d9b9ea51265cbca72d81f832dc3a4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-110","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c3222efb77e863e02a497260f87b6eb6f8d9e654b7e96b2553a63e3faae9a266","target_edition_id":"edition.r017.id-id.draft","target_line_end":764,"target_line_start":751,"target_local_id":"block-110","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[751,764],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"44fc8a94a2ca28ff1aefdc59d37029d42ecc1503939431da1307fa47829203d1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-111","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fd2e92b1ddcf8dc52a3d66a16c14fc8b3f557f09030555c7b2b91b10f6f7db67","target_edition_id":"edition.r017.id-id.draft","target_line_end":766,"target_line_start":766,"target_local_id":"block-111","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[766,766],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d0c8a4e18fd7d00447f972e10ea4bcabb7c134591f888d015ee6a5810119e81a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-112","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7d836c5d8850e688477b2e03d03193988d25c10f9a3eb9d8dd8debfeedb3b8c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":774,"target_line_start":768,"target_local_id":"block-112","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[768,774],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"26f856fe640fb5fcbee086e4c6d8add72cc989572a29922708301c31cc77930d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-113","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b7281976210615af5e0bf35569b9f70fa58b23fc4c6784dd7b8598f5a68fe4be","target_edition_id":"edition.r017.id-id.draft","target_line_end":780,"target_line_start":776,"target_local_id":"block-113","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[776,780],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d1a8994630e113df30c0ee37ef00c1955522c3cdfd7e73afe599cedbbe389e18","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-114","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"047a31d1c51f02fc49908808d6d69fee2488bfdf1df526d00a215c1e5d71d781","target_edition_id":"edition.r017.id-id.draft","target_line_end":786,"target_line_start":782,"target_local_id":"block-114","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[782,786],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f2f3dea104e387a1c022b712564f26228d7fff51ce1de249d8339899359b23cd","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-115","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d4ebecea7d7a7a0b99e09bc2d8044689b4b469cf77338509643246100b11063d","target_edition_id":"edition.r017.id-id.draft","target_line_end":792,"target_line_start":788,"target_local_id":"block-115","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[788,792],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7dcedb0e63afd03e916ff3c9f621c952e39c8520bbe3948e0f0c678503e367d2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-116","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b36e143a0fa3f503709f0b4f2651ae4d73a38610af619b6008ec48d27274a8fa","target_edition_id":"edition.r017.id-id.draft","target_line_end":799,"target_line_start":794,"target_local_id":"block-116","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[794,799],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e7b212bd6b719f38d909c922ff0095af19af38143e31bb345fc11c25396f65d7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-117","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b6dc780cacf7bcfb0f43c00c5aefd039652a6ef6d22a1f27201e34dbeb882b8","target_edition_id":"edition.r017.id-id.draft","target_line_end":817,"target_line_start":801,"target_local_id":"block-117","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[801,817],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb4a2cc4dc94d41051706a0428c22b21f788dade51f84d6f10ecca13f4723dbe","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-118","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7029540be2bdbef177429ad13f3b9c9f6e65ff74df1374ed4c88e80b1434fdca","target_edition_id":"edition.r017.id-id.draft","target_line_end":822,"target_line_start":819,"target_local_id":"block-118","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[819,822],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"667b3d86c679f97ee4bbf740fe4074ea6943349b1052a4fa55e6b27107be252c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-119","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ee9dc97db3c4cbe755455808c44603b841a542e0a73e99e126d2db7ff663bc5a","target_edition_id":"edition.r017.id-id.draft","target_line_end":834,"target_line_start":824,"target_local_id":"block-119","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[824,834],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"255c7dc7f8e839ecef9a616617dee150bffbeeb1f48a56eb9055332ad27b928b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-120","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dcc6e6495f0be6056a856e63d1acec01ad2634206bda52c32dde5e473fc70e99","target_edition_id":"edition.r017.id-id.draft","target_line_end":836,"target_line_start":836,"target_local_id":"block-120","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[836,836],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"55959c21f3b577cb44acc3b188adde808c4de487b8d1c5ae18591f0ff933f0aa","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-121","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2e6359b8dac3737fb5da48731bad466eccc271da4c60d7e48cbda7a9c3a4f8c5","target_edition_id":"edition.r017.id-id.draft","target_line_end":838,"target_line_start":838,"target_local_id":"block-121","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[838,838],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"016b9798c6bfe9af2ab657aa9f7a8b5edb77964ab9ba6d73bbeda909705bef5b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-122","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"360ba0ab1c4548e16b94493572042cfe39dc1ec824953e70f486321cc4fe3bf5","target_edition_id":"edition.r017.id-id.draft","target_line_end":840,"target_line_start":840,"target_local_id":"block-122","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[840,840],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3b5c56b06158eb6e28ce6314ae109d7096d4cf5fc6829a625a0bc2ec8651e641","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-123","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"616e1bc75eb6e8d741dc27602a6fac36e7e15c6babe549f9a258dcab10344d23","target_edition_id":"edition.r017.id-id.draft","target_line_end":850,"target_line_start":842,"target_local_id":"block-123","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[842,850],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"751ce9ae2fce37c5a449b46ea227adea85b9cc6b537c995aa01ee24d99d5186f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-124","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cf875e133d3d15979cac0aeb9617ceee725eafbc5f0b62b5d97d55b045cefda7","target_edition_id":"edition.r017.id-id.draft","target_line_end":853,"target_line_start":852,"target_local_id":"block-124","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[852,853],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"384a7a54cac793e776cb0f47e2313684afe894600831ee48a92ae4793bbc72d0","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-125","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c0553a225ee3ccdf2d9cbe4238ffd599f242ddb5bf41b1d4d49bf6fa4cf1ea64","target_edition_id":"edition.r017.id-id.draft","target_line_end":869,"target_line_start":855,"target_local_id":"block-125","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[855,869],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1eec0093ba01d90afddfe5c046b69dc5d6ddde9a047d73aa1ea83b104ed11c69","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-126","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":871,"target_line_start":871,"target_local_id":"block-126","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[871,871],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"07ea3832e0679113e1447f5ac24a18302a6e7f45c3508b52b42b4769c66b9938","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-127","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bbe4cf2dbe6e7b3c871a1543cbaea1f2ece4d6c463864c681c460a24754d5219","target_edition_id":"edition.r017.id-id.draft","target_line_end":878,"target_line_start":873,"target_local_id":"block-127","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[873,878],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"446b45d5f2ae064fab89126f674e6fda7e88cfd65fec1febbd54459fae35ef13","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-128","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d8f1739497413bb71fd06fabcdb07772f5448cae00ccf33b0a6dca1b9af5fea8","target_edition_id":"edition.r017.id-id.draft","target_line_end":881,"target_line_start":880,"target_local_id":"block-128","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[880,881],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"67bbd3bd0070d3048fd785fccd76c470b77c909b0dd0e4db44a69060ee91ba6c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-129","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"89d88588d540ed5487a19b397530792bd860ca924bf96887066591ce85553a37","target_edition_id":"edition.r017.id-id.draft","target_line_end":901,"target_line_start":883,"target_local_id":"block-129","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[883,901],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b911538c7b0ce0696272c39b408b797bf93f374e338a5558631d8a457b139cb2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-130","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0d1be3b70c7b408831b48abe764fde2da3bca48c16f6d9b33c6bfc017e94ea91","target_edition_id":"edition.r017.id-id.draft","target_line_end":907,"target_line_start":906,"target_local_id":"block-130","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[906,907],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"293df8c6217cc9a7146f567dad6c062a4dfe69aab64270c8bbd7fd18929daff8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-131","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6bb455401aaaa592030842c2c4a0d9cbaa2c545c3a0d1859dcce490bf5549ab6","target_edition_id":"edition.r017.id-id.draft","target_line_end":909,"target_line_start":909,"target_local_id":"block-131","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[909,909],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9ea85cc86a42b13d36eb20b9e43f94cf64f9296bdddee23e409f2e57465e123e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-132","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5255b2bb14b1c0b13650816e3255260d775501eb0e11cc9bf586e23971f19bdc","target_edition_id":"edition.r017.id-id.draft","target_line_end":912,"target_line_start":911,"target_local_id":"block-132","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[911,912],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"053d03e6cbeb63b6c33eb17677a2b56a5ad3dc6d295ff001838bf7a508463b11","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-133","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b71dc4d0484befc18c93f28baf12f71bc9e7eb57db4fa1311aab2a704855e357","target_edition_id":"edition.r017.id-id.draft","target_line_end":915,"target_line_start":914,"target_local_id":"block-133","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[914,915],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec052180a59267df66e9fa002b8cc3b2e871d03e7e160559b29f629adf48fedf","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-134","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8a10d0041878b32002f459d63a48bdcbb87c9cf6bcc2d492c076302c4e0546f0","target_edition_id":"edition.r017.id-id.draft","target_line_end":917,"target_line_start":917,"target_local_id":"block-134","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[917,917],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e053b489fbfd5e1847990863305be09694f2de15afc3bd8cc70a90bd124b33bd","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-135","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"26ff7a050c122de057168a36280491e448738fde856b7767420cbeef7af5903a","target_edition_id":"edition.r017.id-id.draft","target_line_end":924,"target_line_start":919,"target_local_id":"block-135","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[919,924],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"12726c9de38c925266059c96e923f081398c56a70628431084fbb5a52cdfad9b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-136","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f215e507cfb2b497eeac366525606024103aec6a629a4b3c70b4d6fa93243231","target_edition_id":"edition.r017.id-id.draft","target_line_end":930,"target_line_start":926,"target_local_id":"block-136","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[926,930],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab4d9f03d8b30960c36c3acc8eca283fa5ab575158f26c69b460abfe1d6dd6f1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-137","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"37b720cee508a1d586ea41a06306576f001d2783e54c5f32605ea7e4eb21f4d0","target_edition_id":"edition.r017.id-id.draft","target_line_end":938,"target_line_start":932,"target_local_id":"block-137","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[932,938],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f3e7af3e7b3413255149d68c8b7ee85a94ca6adce4d4be0c6ff093579e28173e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-138","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3e5a9631855d23f481d38fecffd43e4a7a44bc52b551d77fdfdc27cc06db647b","target_edition_id":"edition.r017.id-id.draft","target_line_end":940,"target_line_start":940,"target_local_id":"block-138","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[940,940],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"da01ba85172ca5e2cf2ddf45eaab7315f3d5dda4caa6b1b8541af8c2b9bb7c4b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-139","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"346eb06c60e0c21ddecd2815762f5fd6e640b2be814851ac825e9b173f0c3cae","target_edition_id":"edition.r017.id-id.draft","target_line_end":947,"target_line_start":942,"target_local_id":"block-139","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[942,947],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"09601aac9826bfa828a22733144151466376af4c4469d46055e7f8e4025fe0dd","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-140","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6b058b91e526c92310b74aa3e1e3f3fadd9396590b054d5b4974f73f15728dd5","target_edition_id":"edition.r017.id-id.draft","target_line_end":950,"target_line_start":949,"target_local_id":"block-140","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[949,950],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02174444dc08026d156c1bec924d0b5805ed414b78c8d6587483e8b2a6271461","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-141","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c0ba0d013f8b0336b452c5ca59acbe04416d3c54491938f86001b99047e4ecf2","target_edition_id":"edition.r017.id-id.draft","target_line_end":956,"target_line_start":952,"target_local_id":"block-141","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[952,956],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18f0d08ea9d1daf223015e0002eb7647a389ab4397f55def9330739266ebfbfc","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-142","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"171da2754be0cb88be40a0e570188f1d6433ff4a1f9ee1877a7e6173da62eb6d","target_edition_id":"edition.r017.id-id.draft","target_line_end":961,"target_line_start":958,"target_local_id":"block-142","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[958,961],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d802364250625b04df4bde793e965b27041e26b591479784b49c88899cfa65a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-143","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3cef0a92b8f087ebb6fd44f8cb31f7dbb44c74de06830766b92a88991ebf31a0","target_edition_id":"edition.r017.id-id.draft","target_line_end":975,"target_line_start":963,"target_local_id":"block-143","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[963,975],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"afecbbc1eac7d645413ff1cfddad217fa541dddb51dc0d163e79798d5cb0199c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-144","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d48fde77d822d577531039ea2d3abeaadaf3742a37503184ee3a9f2e695171ed","target_edition_id":"edition.r017.id-id.draft","target_line_end":982,"target_line_start":977,"target_local_id":"block-144","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[977,982],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76373ab16e9763d3293ddd09344de7dca0c4da4f6bb26b5bc90f761a5c71d016","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-145","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1b6e127bd845aec44ff684e14e1987c27d8f8f8c3fd025fd80ad09e99cd9c1a1","target_edition_id":"edition.r017.id-id.draft","target_line_end":984,"target_line_start":984,"target_local_id":"block-145","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[984,984],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"37c6ba41763a34c097571b4df7466cac3ae39baeeecef1b5763a8c8032fbe65e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-146","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"498767fcc55c3ff45f3249c884851e4021c47e5ddbb54bb6cd27aa654d027ef6","target_edition_id":"edition.r017.id-id.draft","target_line_end":1001,"target_line_start":986,"target_local_id":"block-146","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[986,1001],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"08aa392576542cc30290f9f412cc012a3ba517d10c2e16424d24491b9bf4bcf3","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-147","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"00ad5d93b18ac78786d245e0ffab7838501f712cb2d3dfebbfae0b0ddd93b5bf","target_edition_id":"edition.r017.id-id.draft","target_line_end":1005,"target_line_start":1003,"target_local_id":"block-147","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1003,1005],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"02eb459fa540df637430bd1b315e43b283d63a324d619a454a7b94685d563535","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-148","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"67754acc5a88a672fb92d23b6506a1dfa82f86bdfa391d071d4dbb7256bb0092","target_edition_id":"edition.r017.id-id.draft","target_line_end":1016,"target_line_start":1007,"target_local_id":"block-148","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1007,1016],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3c8e34e343dbac7f41b0e0bc11b604a556a1f0e6cc85a78de78d7f91ec778804","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-149","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fb6caf73eb14014a4132ac5280cc407adebf740115202c6dda678bc0a5552c27","target_edition_id":"edition.r017.id-id.draft","target_line_end":1018,"target_line_start":1018,"target_local_id":"block-149","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1018,1018],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4baf5770a1f6736f70d85e4cf7181bd4b4f4aab262a57f243c7100acc451887f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-150","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"44985b5745d084b002ae1d116f83ba4e86ef9d8b16712dcb5237a1765fad275a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1029,"target_line_start":1020,"target_local_id":"block-150","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1020,1029],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9681a0493709b7b575c8c545f5a4a9c1edfb64579f2a39bc6c15fddc631f48b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-151","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8012e0cfbaee890c11d42314ba0a0c24d982fc770c63da232d1abdd40e52e16f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1035,"target_line_start":1031,"target_local_id":"block-151","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1031,1035],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c3d5a130c647035ce78fefcc5b5ac271685494a2fda855f373ca93e7d21bb6e1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-152","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0329efb00366b5aec903ca575856e9cf90b27555db9c75ec89b33eb067371e28","target_edition_id":"edition.r017.id-id.draft","target_line_end":1039,"target_line_start":1038,"target_local_id":"block-152","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1038,1039],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"41e5debfdb6801f992cc4158463d09126bd10fa25f2e8c7661a3192d71ca58ab","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-153","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fb8f246f9b923eeae5a7b59bf0ae5869c77ffd56574d5e9519a8d8e3b3666526","target_edition_id":"edition.r017.id-id.draft","target_line_end":1049,"target_line_start":1041,"target_local_id":"block-153","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1041,1049],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"48f834905e5417704d223beb38d12c8976a3f9a48633b498af579922605abcfc","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-154","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a6b8b04b479148811a149a02b8443eb33a5179910f313278b20a653b4c4fe2b4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1053,"target_line_start":1053,"target_local_id":"block-154","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1053,1053],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5d0a0d6d8389839e6f56dc9e189976777dfdf645b316f5ed8edc7ec7f3151478","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-155","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f1e760be0e3439dc0f719b4e6ed353a2215d808fb2be9083107e4b40801ff8d0","target_edition_id":"edition.r017.id-id.draft","target_line_end":1063,"target_line_start":1055,"target_local_id":"block-155","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1055,1063],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39fda908d9d1dc3599d159f229829fa984c0e4baea872ba19e040b965f42d5fc","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-156","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d2234bbdc34f8e0b266be96c65abdfec44714e44d724cf7209229d21f0d26194","target_edition_id":"edition.r017.id-id.draft","target_line_end":1065,"target_line_start":1065,"target_local_id":"block-156","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1065,1065],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f439cc80379701eb05637e99e2e83add6d4529a0c7420261c416f17ea5b58dc","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-157","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6a49432e4c2f8215bb88269b407b9c4d6fef1625d1df49e6f4e25c8538b2960e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1079,"target_line_start":1067,"target_local_id":"block-157","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1067,1079],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"098d76df910da1ae5a8bd03213d477804a0c0dfc293714237be67c2145438e37","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-158","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a11fdaa02a7bef94851e380610692c1b9c1debaaf3ced54c8d82f41f6244c43","target_edition_id":"edition.r017.id-id.draft","target_line_end":1083,"target_line_start":1082,"target_local_id":"block-158","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1082,1083],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4335dbc040ed794beaea1927e7bb67e43c300c9efe3045644e26beccb352f936","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-159","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cd820d11391c88ae864bed957cee6c9028ff78edd6aecb92fd859b8147a5a805","target_edition_id":"edition.r017.id-id.draft","target_line_end":1099,"target_line_start":1085,"target_local_id":"block-159","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1085,1099],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f898c1853940b1d3de9d9883663e00c77cac667674c8807947272cc0234a3974","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-160","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f040d7b542c639ea3e32215e73c8ad927749c7351d730c3c15bde8f324fe00d1","target_edition_id":"edition.r017.id-id.draft","target_line_end":1120,"target_line_start":1101,"target_local_id":"block-160","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1101,1120],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a073f107458b5d226cced75fd9adb23b694a73413f6f5eca5316021f266f3ef","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-161","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7435bca090aeb089699f0a0b7bab7ea77cfe549e450b80a740af6e3138f7cf39","target_edition_id":"edition.r017.id-id.draft","target_line_end":1129,"target_line_start":1122,"target_local_id":"block-161","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1122,1129],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dffbeb2f942e8ebb7058720019953d1996d08034ea073dcd94fb69d9ed55786b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-162","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e52d031dc95f03671cf5dc93a5c0a18112774a6682cccb78c6d7b9950cf3fda3","target_edition_id":"edition.r017.id-id.draft","target_line_end":1132,"target_line_start":1131,"target_local_id":"block-162","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1131,1132],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"117b15e3f005f4741f14f8a1860dc107b448dd0dcb159743cd1cd8057d737ba8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-163","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5a66b1489a30da82a3719182a303b58a87172d44e99f5f0d804b8f5c484e76ff","target_edition_id":"edition.r017.id-id.draft","target_line_end":1147,"target_line_start":1134,"target_local_id":"block-163","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1134,1147],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3b78fea7fa362af0fe9fca9eba956684b8a9bbf4ac6726642da979892f201d9b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-164","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6af882c3b5dd880736b32c28dbfc14a759b3c3f003f677e76cc8db07dc6c1860","target_edition_id":"edition.r017.id-id.draft","target_line_end":1168,"target_line_start":1149,"target_local_id":"block-164","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1149,1168],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c0601a85648b40cc4ee6c5f6a1ca1944406a773cdba1bf93adc14f34f7561da2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-165","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c7e5dd6c1b7965d0acfcce58dd15a5056d001b2dde9117f0c7f49022d12923cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":1170,"target_line_start":1170,"target_local_id":"block-165","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1170,1170],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1e8ede400e25de408cc915824aa404a28c8b5275fa61da204df2be3f67bd3892","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-166","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e9aa8a9676ff9c481c7706444a2096bda62e1e28cbafe8b64022d4e5fa42767b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1204,"target_line_start":1172,"target_local_id":"block-166","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1172,1204],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5903fd0a1d997017dc8c26d51ee4422e1535e68aa9fe0617dcb792100df5d48c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-167","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e51ec2838a8a95ea6442b25b778c6e1c9e2ce34bbf1fad70f88f4ad764e13f66","target_edition_id":"edition.r017.id-id.draft","target_line_end":1206,"target_line_start":1206,"target_local_id":"block-167","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1206,1206],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e38325ee017fb2603f2faa73f68ed41318a1daf7a77606d57925eb6247cfd7d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-168","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"36e7f0feac4cbb2cc5ee25cdd5b3525045923545765a0dd92f052974f7029e66","target_edition_id":"edition.r017.id-id.draft","target_line_end":1218,"target_line_start":1213,"target_local_id":"block-168","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1213,1218],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"433e51d5795eef2a8b16ddeb514371f223385641712b54d3c07b7f86b30f0e13","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-169","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b8af2343f1fc5b5638f295ed57998605eeb3b0c9978317f102f97996284d771b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1220,"target_line_start":1220,"target_local_id":"block-169","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1220,1220],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c0e40226729ae33cebfe6d00bcca3feb887cc0ec1cfc7d0026654b45e553007f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-170","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d61e4ef5dc2a887ce2e555b676efc735dce4c4744c9b84af8f0b9811439892b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1235,"target_line_start":1222,"target_local_id":"block-170","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1222,1235],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fe96a44756fcb901da9fabbac083ea6c6508f4303eb53596faa9b0ddc013bdba","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-171","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b96916a50bb74e20678fa76705954e60d3c834f15597f684e4004725a78c3835","target_edition_id":"edition.r017.id-id.draft","target_line_end":1237,"target_line_start":1237,"target_local_id":"block-171","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1237,1237],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6306213b87005d9e305f87497a23b7d84631de625576e9b5ae2ddef43759baef","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-172","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f08c6e2b229ddd7f610feeb2039a7379db9c10a0d91540bb335934fd54e8ea37","target_edition_id":"edition.r017.id-id.draft","target_line_end":1248,"target_line_start":1239,"target_local_id":"block-172","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1239,1248],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e951d94f6ddcae0f8d2c377ec70149a8eb0be08faa256cc56b8e130b4ed2f00c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-173","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cdf347b0d343572d7a3fc02fcbaacfeab6d2f255235a1f5039a2d563e3e8c02b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1298,"target_line_start":1250,"target_local_id":"block-173","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1250,1298],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a7fdbc5bda88477f6e7908dcc04e320283c5dca1469b9e065569937d615f40c9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-174","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"95e3ee957c6f127c3d629b75042601cf77e38a7c35bdf43cb4944bd2e54d2f2f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1301,"target_line_start":1300,"target_local_id":"block-174","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1300,1301],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2e698e3f6ccd5c7d9b71566ac58f5706844974e8b02aece62735c7ee28bcf7e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-175","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"97c5b5925fbfccc1895775030d26ca3dd2c304bce90aa1be308b8c3d9172e361","target_edition_id":"edition.r017.id-id.draft","target_line_end":1312,"target_line_start":1303,"target_local_id":"block-175","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1303,1312],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ddea73d804de7b95c946318d6ef5dc8a43dc9e063ab8e1bd802c0ff94af2561d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-176","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c73feb990fff31eaff5b470422e25548b21a493d9b61ac9d111d49b97461976f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1314,"target_line_start":1314,"target_local_id":"block-176","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1314,1314],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5c6b1eae4703043da0c76d60b1ebb498be57cc1e6674e130b366b9014d2fc911","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-177","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"61d47f47686f6fa9c977aad9865f695d8eb0f8636af6a2019495d84d5b8c8d06","target_edition_id":"edition.r017.id-id.draft","target_line_end":1327,"target_line_start":1316,"target_local_id":"block-177","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1316,1327],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39756910610ffa97778a3dd88de5240126ba4a0abe033be7ee0e0b7b28b69234","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-178","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"091b2b126dcf4c62cc4abf2764bf94e2509140c5445fc8cc676e7ebb749acb50","target_edition_id":"edition.r017.id-id.draft","target_line_end":1329,"target_line_start":1329,"target_local_id":"block-178","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1329,1329],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb573a460c2c8ccc4b1956279d31a5c24a2713d9e37d9b0337b37c64162e7220","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-179","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2ca48d7d9e2a1df4faf9909807cce602fd4a8e1c50ecee74355e98979b1a699a","target_edition_id":"edition.r017.id-id.draft","target_line_end":1348,"target_line_start":1331,"target_local_id":"block-179","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1331,1348],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"45d1fe97bbacb45d70675540c653bc519efc04e37a3ff5550502b5c12f07cde8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-180","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a98c86fd5c3569030f4896bd2d295ccf0cdba8022d2d8d7ec75fcadf7f9b7ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":1351,"target_line_start":1351,"target_local_id":"block-180","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1351,1351],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d16827df012a249124e8d4003b6ae4fe9416ba31f8f723512eab3611baa4377d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-181","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"79882d2b6bb6354e694eea6c18f184686b264029f5d92e9c1f0b85d151871196","target_edition_id":"edition.r017.id-id.draft","target_line_end":1358,"target_line_start":1353,"target_local_id":"block-181","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1353,1358],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"52455c1d2b15f49eed909d4f7eca39efeb4341a900c92d2e8b1c48be6beb6056","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-182","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"66cee2ed8c144550e6823664a555e23f72e607f0fc1b8e7e0da4cd22ecbe1349","target_edition_id":"edition.r017.id-id.draft","target_line_end":1360,"target_line_start":1360,"target_local_id":"block-182","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1360,1360],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"57a6a64a186894603ba043229b66f1c0a38d930dc06d35dd7ac3dec682a1cb5f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-183","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1b40cfe9bd8dd42b8ab2c229aaea828d2789574f3043aa5781a2a00013971112","target_edition_id":"edition.r017.id-id.draft","target_line_end":1371,"target_line_start":1362,"target_local_id":"block-183","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1362,1371],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"79a5a67e625e3f78a870bcea2333d00a1035b6417ccd82de4f7e5ef68b7deba5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-184","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"30a2ab8a26451f8a63f7429723c7f251d5513b11a8e73467121f37d8e6c1b58e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1373,"target_line_start":1373,"target_local_id":"block-184","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1373,1373],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"db1ba29aac47770ecbbb16177c6d40886666997866f0e01ad2324dcf25ab24a5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-185","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8bb8edda1f19ff627a96c7909074fc4bc7448fd9c78bf95229155315fae8c5b8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1376,"target_line_start":1375,"target_local_id":"block-185","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1375,1376],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7919c59f174fbebb55bf6a10aa8aa85d7aa977b88216e9cb776a93959ffdc5e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-186","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"379bd118a518e30914392c46991b839f37e4f823c49aa1a50eac2f3ba107eaa2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1379,"target_line_start":1379,"target_local_id":"block-186","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1379,1379],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2fe23e9cf1b923ae5193f382c3c63915bf52a132ddd27e0782c6fe9c1ef0c52e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-187","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d4b17198d4b2dc919fcd7e9f89f91dc7e90c7c78cf575e8ac335d6c24d91292b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1385,"target_line_start":1381,"target_local_id":"block-187","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1381,1385],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8c0e806f24272a9cbdb3ef0a1fdfb560adb9f01cb97860a16c84b9e7460a6476","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-188","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"41ce7ca313ecf8d8a62100624c8ccb8081444691ebe984d492cbbff234254372","target_edition_id":"edition.r017.id-id.draft","target_line_end":1391,"target_line_start":1387,"target_local_id":"block-188","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1387,1391],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a64142c28b34651e7598e167f8dad6e3b0579018d912e20c0de393bcb019288a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-189","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2ca3cb44b46646d80ef8eed081a09024e24f19fac34ca75c1449805c6110b402","target_edition_id":"edition.r017.id-id.draft","target_line_end":1394,"target_line_start":1394,"target_local_id":"block-189","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1394,1394],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c29df911926fd55e48794c5c74f6085d0817eeadf82544dd6381509506f34968","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-190","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bbb5c6f6247121a004e0f244987d8348765b9c9589ee66e24eeb44de73669f08","target_edition_id":"edition.r017.id-id.draft","target_line_end":1406,"target_line_start":1396,"target_local_id":"block-190","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1396,1406],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ba08c65ba442e7a7bf9d2ec019d3d24d1e65cec887298d4bfc557db35693d75","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-191","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e68fb9dabc419cc1899dcbdb2ff07bee3807d2f1e9680b5fe28ad4e7e70b3e93","target_edition_id":"edition.r017.id-id.draft","target_line_end":1434,"target_line_start":1413,"target_local_id":"block-191","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1413,1434],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6a059563a05f7cc1b385386ccea0d2c2522831f5ebd8185c79c5128e35de8f46","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-192","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d39b995ff655083ebbfd68b0aab4a0611b0e466483ff948c81fd1d191303eaf1","target_edition_id":"edition.r017.id-id.draft","target_line_end":1439,"target_line_start":1436,"target_local_id":"block-192","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1436,1439],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7f1cfd0ba3145658ccb94e1118f8ea3b49714ac865828e465ec1b1d06ba96e59","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-193","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"26c313c774f97895bfface7e5b841bb29915c319224f15b16f5953c5a9112929","target_edition_id":"edition.r017.id-id.draft","target_line_end":1453,"target_line_start":1441,"target_local_id":"block-193","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1441,1453],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2c783bd1576c320ec373e9680f88471618ebce8a8a3a7dc98ba93bd552f37a1f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-194","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"32d07499dd5fc3b5d60782a79e24a51f1105b1c2b4c99b2d7380f810d53c7f28","target_edition_id":"edition.r017.id-id.draft","target_line_end":1459,"target_line_start":1455,"target_local_id":"block-194","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1455,1459],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"add81e058d4a023ec46c0b964be31a95ea86e2d2d7733f28470414fd2b7404e4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-195","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"03761de927c5e7c9939a92f4ad2e733d8d8e5b4cf3f3b0ee1396142e6432acc9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1469,"target_line_start":1461,"target_local_id":"block-195","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1461,1469],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"76776e9783d8186b46ee43c02e49d27d0eb8fedc36e9de5616a25b756618328c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-196","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6e01a61c644fc76a82a9dc86336ef60d38bbdc54497d7ea908c09e205c5d8a53","target_edition_id":"edition.r017.id-id.draft","target_line_end":1474,"target_line_start":1471,"target_local_id":"block-196","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1471,1474],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"51f3828398586ac9017b94eb9fc100f874a321f5956f62a6b6a2ca949e768867","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-197","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ce94b378c4e9b586ce2d585d8d1f1cf13b6e46b60bb88bf764e95372971c1fb2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1486,"target_line_start":1476,"target_local_id":"block-197","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1476,1486],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b63204dbd90e15afe0037e2317f8a476632e130305bcd7417d389cbc84757de1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-198","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"94f4686f566188d767448955bddafefa7e745781d7afdfafcfed07fd7232deeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1488,"target_line_start":1488,"target_local_id":"block-198","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1488,1488],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e6021cf8bc21f74b9482a8f351f889f90834dab3de6fe78b6e72b2fdb2c605e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-199","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"122277996002161160f5091fcfd3bda8eafdd4d01a798c781835b1c083f229ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":1495,"target_line_start":1494,"target_local_id":"block-199","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1494,1495],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5664bae0f7e040004d1234111789602e1a9b9c983dd78c37951da94c24b32541","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-200","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"719ca8d9851621f8c391d0d8c36ee19aca2af94f65901bda1b83253cfc41be2f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1499,"target_line_start":1497,"target_local_id":"block-200","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1497,1499],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"69ba2dc7f5b6b3648724b71fab09b184ad0afa19a93ff239a600144d3f282b40","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-201","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"88b605f873c9d092e5333975e29e30643a9ca136e4fd9ce135cdcf4370602ccd","target_edition_id":"edition.r017.id-id.draft","target_line_end":1505,"target_line_start":1502,"target_local_id":"block-201","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1502,1505],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eae4ea14ca5e7768d330a42641ca20d251d80aa14ec6f7153c38fea41116cc2b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-202","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ebf57e94694bf8cad9fbc585b1e540a58867eb9784141d5e5278bf84baa5db41","target_edition_id":"edition.r017.id-id.draft","target_line_end":1508,"target_line_start":1507,"target_local_id":"block-202","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1507,1508],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c4728ac1311223ac59ad69c76879bab512cb34fb416bfc9302f989d982d5f386","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-203","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f7fc9a29ac3e2ed574247527c250ed6ade7c354e71e9b750db6db227ad062563","target_edition_id":"edition.r017.id-id.draft","target_line_end":1515,"target_line_start":1510,"target_local_id":"block-203","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1510,1515],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d64f18bac9f3401837741b6981ec48e42a14927b9763feb76900d69ce881a90c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-204","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"20bb48ebdce19a55e3e306aff14bf9520d1ef7249649b7b2741be95965b6dde4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1518,"target_line_start":1517,"target_local_id":"block-204","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1517,1518],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"beb2e3d156ac3930588e455fe1b92dad527f3f9a32d697834fcb63384e7c0bc0","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-205","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6c825d872dda7f0a5191228ff2f08c1523f903c7947ee4e478836c2b9f3f6d87","target_edition_id":"edition.r017.id-id.draft","target_line_end":1523,"target_line_start":1520,"target_local_id":"block-205","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1520,1523],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3933be003b08efc76394a4ba113d18159dae249f49339a2ba97ee6d6b486f176","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-206","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"813e3bbe5b89109d82bf27e1c7baa25242be647989877302a49271cb57118f48","target_edition_id":"edition.r017.id-id.draft","target_line_end":1527,"target_line_start":1525,"target_local_id":"block-206","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1525,1527],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"edb266e528ac5ad37867a90bd543b36bf2a75439ad52203e7b46fa2945cc81e9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-207","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"59fc61ac069b8a2d3fa86d5f0b2264a3ce6eac2f221b66a9f2eca3f97117acee","target_edition_id":"edition.r017.id-id.draft","target_line_end":1531,"target_line_start":1531,"target_local_id":"block-207","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1531,1531],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b6d1388b326f78db99f7d9584357ca336062166a87669e599aed6129f1918ec7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-208","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cd06b87ae34eb49b9596fd059e734cce4beff2940f0af49c9cfed685408b6daa","target_edition_id":"edition.r017.id-id.draft","target_line_end":1534,"target_line_start":1533,"target_local_id":"block-208","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1533,1534],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"104e2eaaf0e154f6fc55dc3760283f69e784c3004d5176a189f4792251c6cf29","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-209","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3fb77cdf22af4954d7f206fa690286e289af4f31f20ee6914caa8fb55294995f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1537,"target_line_start":1536,"target_local_id":"block-209","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1536,1537],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"22ea120fc56f09dc3d9a52bc0d9aaf585c7b2bf7f64e6d131de72866e90ba1ed","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-210","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"29062a07d6390933c6323249b655609f8eeb7a728313f02c1a1a312aece68f92","target_edition_id":"edition.r017.id-id.draft","target_line_end":1547,"target_line_start":1539,"target_local_id":"block-210","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1539,1547],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7de190e92ac44f39069af0e61a3ebb6c2eba0e3374cea5f0bf9bf1ab0023e894","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-211","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7505056680c4f2b56899fdab711de66d7786ea80f64380481686b64011bba9f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1549,"target_line_start":1549,"target_local_id":"block-211","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1549,1549],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cc999cd227aeb2712c042f59220cec36d9b2a0c789dc31148b2eaa0fc4128fd7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-212","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"dc155b079cf2b41ce2563afeecec1e0963243b0331af31c881fbe42901d6c28e","target_edition_id":"edition.r017.id-id.draft","target_line_end":1552,"target_line_start":1551,"target_local_id":"block-212","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1551,1552],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a6aca96045803ceea80479f71c2c0d8d22cb1384f0a77b0c908e95a3ecf0d815","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-213","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"db22985386767aa6a862b858daca1dd972834777449519ff3dd6d68f8d287373","target_edition_id":"edition.r017.id-id.draft","target_line_end":1562,"target_line_start":1554,"target_local_id":"block-213","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1554,1562],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4846668c96f8b9dd5bc512c042971fb9d3c2236f363ab35bf4135e7f7974e308","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-214","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9963c055fc20e1991551c2cb133622ded1522bc7f500778fce5bda9e629eb170","target_edition_id":"edition.r017.id-id.draft","target_line_end":1566,"target_line_start":1564,"target_local_id":"block-214","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1564,1566],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a73002fe0e0b9427bfa452ca8ec37c3e15ec258204c9cfe873f5633b7044eee6","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-215","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"214873b63446073fa3fcd50ed70882a2ee9a7482784005c94abfe8b229602b84","target_edition_id":"edition.r017.id-id.draft","target_line_end":1574,"target_line_start":1568,"target_local_id":"block-215","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1568,1574],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cce0414f71c06f799771ebbce043039088dd23fa3fecc3d570d59c326e373721","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-216","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"389a769a5858718ff2288ee10d3b648d727f690aa1c8e7754c7f29cf9b726cb8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1584,"target_line_start":1576,"target_local_id":"block-216","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1576,1584],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"382ad0322b87731c8de0507c776ce50fba99f895d39e974024e1b1f7d454edc8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-217","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2002f8ffec8c6e1498bd7e3e93c7442e9be823ab5c77d62056710584d9df1203","target_edition_id":"edition.r017.id-id.draft","target_line_end":1595,"target_line_start":1586,"target_local_id":"block-217","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1586,1595],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5c4461dd825e7456e4fabf36825baf62322f31970b911ac0336c72b50c4bcb6","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-218","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"154a56dd0f24ade1b8d596218c5e2b6bdc292b6a3c0c253175216ead93510c29","target_edition_id":"edition.r017.id-id.draft","target_line_end":1614,"target_line_start":1597,"target_local_id":"block-218","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1597,1614],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e77f5e5686208e1a224114392f1e3651edb5503a66cbd18638f9dadc05f6f5c4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-219","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e08a137a76683e0f7e40dbb17aacf6c1e67da349041c1629ad309ae4ab2358a2","target_edition_id":"edition.r017.id-id.draft","target_line_end":1631,"target_line_start":1616,"target_local_id":"block-219","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1616,1631],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c4add82d4aeb1a16cb3f9546624021e3826955622db03cf415f32af10d1018e5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-220","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1dc3172e365c669f53eabd11b32db67a50f16b1f23fb801aae63544b080b816d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1642,"target_line_start":1635,"target_local_id":"block-220","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1635,1642],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7143e5d20e85785091a3081bdcfb2c3bdff23476f145c7cffb3c6a46f0c8e510","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-221","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0200bd631fe134baf7d5a90c8211de1b495f9f2d222946f80adb2d1f030efbb4","target_edition_id":"edition.r017.id-id.draft","target_line_end":1645,"target_line_start":1645,"target_local_id":"block-221","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1645,1645],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fde52d38b947c5dffaaca5eb93b5460f1a997ac5626a394d54932500c456731e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-222","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2821622ccb3c969b5756dfdca144a899159bf2916ed1b2453b1022ef210721da","target_edition_id":"edition.r017.id-id.draft","target_line_end":1648,"target_line_start":1647,"target_local_id":"block-222","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1647,1648],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dccc67ab449cc497227c53e5282376d435abd7001fb624ef902709320b0c1213","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-223","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ca6b702405544902c1010549b96f92d4345f2770f5994adff3e642837f52d9b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":1671,"target_line_start":1650,"target_local_id":"block-223","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1650,1671],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7a02e7df002f57314f04742675bd1f04bf5409416f646ff0a2bae7043d050c0b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-224","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"46a859f6085f7ef37e217443bdea0889b4e434cb4c689555888fc1c75b34b187","target_edition_id":"edition.r017.id-id.draft","target_line_end":1678,"target_line_start":1673,"target_local_id":"block-224","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1673,1678],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9cd4fc61696820da2c1813f86c45399f1c0659490a991daec9360affe45c6bc8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-225","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72697de67ece6db61236631ec6f1bf4f7a708eb458be8a7df9921ae6451c12b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1690,"target_line_start":1680,"target_local_id":"block-225","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1680,1690],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"28dcf51d6104d6535b04b1abee5bdd7e42e1b1d87266dbd23d5a55bd2adbc9a7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-226","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"efeb9fe263ea85f954ed3d89ae2e938b26e300eb0b6b77bb381a51c31af63467","target_edition_id":"edition.r017.id-id.draft","target_line_end":1696,"target_line_start":1692,"target_local_id":"block-226","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1692,1696],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8bfdbcbb697bb7bd13194549a880dce197582e7c3a184486aace109b0e5f9e3d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-227","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7d1118d756836bd5bad8cea77dfb44fa3e36790566989139fc6d24d3fd1d3c0b","target_edition_id":"edition.r017.id-id.draft","target_line_end":1717,"target_line_start":1698,"target_local_id":"block-227","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1698,1717],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e1c3d4513f989d8e067add899c4541e0012bf93f7874b348e789e351f0ef63c7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-228","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"036d840c3abcc73b1eebd0944afcb4c08fd6bc453f027676616d93816c30f426","target_edition_id":"edition.r017.id-id.draft","target_line_end":1719,"target_line_start":1719,"target_local_id":"block-228","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1719,1719],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"28b857961937cb5c9ca87217ad1692037d43ccbd450b97aa6b3bd91799dfbede","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-229","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ce7b474d8270c51adea09dddff16740f65e9f464a22c4a520d2327ced32336d7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1721,"target_line_start":1721,"target_local_id":"block-229","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1721,1721],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e70fb10738d0b42a1c1f0d154324dd9f1359753f584e9b611c631690b63230bb","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-230","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ef8472f102356b736d8f6f3ef9448be82c83ecfa8c140fd21dab1701f830512f","target_edition_id":"edition.r017.id-id.draft","target_line_end":1729,"target_line_start":1723,"target_local_id":"block-230","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1723,1729],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1cfa3fffb2f8794f2de4960e15a202021be3a7117683951753b4e1085f4fcb9b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-231","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1b8f79095cf8a6c1ded9ce112627d029c221d8d11b2c1bfd9577f1ee3a3d02c8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1741,"target_line_start":1731,"target_local_id":"block-231","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1731,1741],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"90a3c520cbb1f1ec735f4dcf6584e28e538d9d9f64f227e5d24243dd39c77e24","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-232","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"37b51197da24d7a5c6b4e3da7f0a9906721192f6605248787ab44b786e804f96","target_edition_id":"edition.r017.id-id.draft","target_line_end":1757,"target_line_start":1743,"target_local_id":"block-232","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1743,1757],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1122cb4a014f46fd3c71c6cdc45ace99baaace49ffa0de3c508bf131fb7240c9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-233","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7aea9c62ffef6ac87efb17a8c17adccace92d6edb4e896607945c94e8cece228","target_edition_id":"edition.r017.id-id.draft","target_line_end":1770,"target_line_start":1759,"target_local_id":"block-233","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1759,1770],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3dac9eb35df105cf62b3b94b4759cbb99ecb118ef8305c4e1dae3d7d5551a711","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-234","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"915fe877fa4bca4cd0ec57e9e2ea9b17f40420a14f5501c3fe6422eb74a3a0b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1772,"target_line_start":1772,"target_local_id":"block-234","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1772,1772],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ec453891c773a006f5bf96aa26a814d27d722fb92847599e97de7595f7d2b699","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-235","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eb7e6a1344608a031dcd863afd7305dd3db2c3f5fada4415d3b95f0cf34e352d","target_edition_id":"edition.r017.id-id.draft","target_line_end":1774,"target_line_start":1774,"target_local_id":"block-235","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1774,1774],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4ea24b17ff0fa2a0cdacf6046d19b48184f6496c30e716a357b05efb30b9527a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-236","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ba3f8a56270a635776db95c08dd55a65d525f46d53f62185a092fc9c7407611c","target_edition_id":"edition.r017.id-id.draft","target_line_end":1777,"target_line_start":1776,"target_local_id":"block-236","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1776,1777],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d43cb544f6dd9167cae4a0fd367ef05c359146bea385cc2226802cd7eaaa1ff","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-237","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6d5a11738948d90b52b56667948649465056caac0117bea19561af08130a9841","target_edition_id":"edition.r017.id-id.draft","target_line_end":1779,"target_line_start":1779,"target_local_id":"block-237","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1779,1779],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b97be9b0883df09e336a616f2ae90b03a6c38a060041a6f409f5ee01c1deaaa4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-238","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"88dc28ff00837db70b878818f01d813007c7689ff0820c30d99b0178fc6ac322","target_edition_id":"edition.r017.id-id.draft","target_line_end":1781,"target_line_start":1781,"target_local_id":"block-238","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1781,1781],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"45d8f84d02996691f08dca342e706bfc7b4ae92dd119bf3778bc17b4923cc51d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-239","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c6160a8015f7570ca90d6595cf769910c468d7522636cff0f89aa3fdcc7dc4af","target_edition_id":"edition.r017.id-id.draft","target_line_end":1783,"target_line_start":1783,"target_local_id":"block-239","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1783,1783],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f00e69eea12f4a8a39211f35fe168b131d62bcbc9042ccfdfd7f79ba3fc3e203","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-240","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"eaa4300a0104b349509c849aee9e8e42f79888185e03ee3ca27b0c3e14a748bc","target_edition_id":"edition.r017.id-id.draft","target_line_end":1785,"target_line_start":1785,"target_local_id":"block-240","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1785,1785],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ad48fbd857849d77bd3f2e769325aca68173f4083c9035237f1026b23824ba2c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-241","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ce58df61eb2c5b5423f7df7d3b164f494412df510426ad51760d787deb747127","target_edition_id":"edition.r017.id-id.draft","target_line_end":1787,"target_line_start":1787,"target_local_id":"block-241","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1787,1787],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2b1844c78988c1a6cfb0f4634a5ab4c7182244a22224044f3d125147db22554d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-242","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b9ba8f5001b9466f54cea87a76f93f037024f749549441ea147b95e24ccd6645","target_edition_id":"edition.r017.id-id.draft","target_line_end":1850,"target_line_start":1790,"target_local_id":"block-242","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1790,1850],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d15a4b2504f79e55b83e2c4d2dff1055cb757fe49dc0c056e5e927afc07054a7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-243","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5be9fab9c0492e6232f420ddb102074103f5beac584fb6f1ccf5aaac951f8abb","target_edition_id":"edition.r017.id-id.draft","target_line_end":1884,"target_line_start":1852,"target_local_id":"block-243","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1852,1884],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f3421c50e6db3fe079d9e04f1d88d29ca3db0eaca8dc429e020c34ed3b8d7de9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-244","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b037a09abb33fb1bd5ad162be1c2d1dae7dd033597d0f3916a7db753e0367141","target_edition_id":"edition.r017.id-id.draft","target_line_end":1893,"target_line_start":1886,"target_local_id":"block-244","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1886,1893],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b9ceb4b8257f18584df8934188283a77e648b920f245fdc5601e9807f0b15bca","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-245","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2899de7b07af5c9330e193c8855dcd66397f4f51d831dc21960ea77ee6ae4e51","target_edition_id":"edition.r017.id-id.draft","target_line_end":1912,"target_line_start":1895,"target_local_id":"block-245","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1895,1912],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0adb8604d8f65f4d5301223fd289d77ef23955be5177aba113bfebf540824c4a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-246","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0a0c0916dc8c566bb5299a3ccd6f6eb28d3b55a40d5bf51b7a3a43924842f0ba","target_edition_id":"edition.r017.id-id.draft","target_line_end":1914,"target_line_start":1914,"target_local_id":"block-246","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1914,1914],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c7e61f4ea2f102eee16f22f1bdfacfbc0b564699f38abd33f60032ad5c93c25b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-247","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"38af744ff73859c1916dee5cc80c8cc495e23a3fb206da17512576b119687453","target_edition_id":"edition.r017.id-id.draft","target_line_end":1952,"target_line_start":1916,"target_local_id":"block-247","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1916,1952],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bb73f955e18e690b2b09cb7fa6dd8ed6b786118ec730658a2e6e84fe2039daaa","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-248","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"79ed4adba0676ba325c0896cb79f2598cd3fc260423fdfc9f752e8930dc2b2e7","target_edition_id":"edition.r017.id-id.draft","target_line_end":1954,"target_line_start":1954,"target_local_id":"block-248","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1954,1954],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d9e367d9b4af71e072ddeb2a5066e8c5f4fa6d86e0d7ec1b2d1b5219b1d906ac","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-249","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8881cdea012cc3b94d558d4da0a1ea5c1c2ebcae6c3346aeef9acd6ba8038160","target_edition_id":"edition.r017.id-id.draft","target_line_end":1959,"target_line_start":1956,"target_local_id":"block-249","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1956,1959],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"159a0707282d627ae8148b1010e29e08c8efb7b3562ec3386fa643e5f5d101f2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-250","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"724d622a04c85c6a1b94d6a0d0266e700345c5956982b83cb9d1a8d00caa96c5","target_edition_id":"edition.r017.id-id.draft","target_line_end":1972,"target_line_start":1961,"target_local_id":"block-250","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1961,1972],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"18fff849c80e4e64cf0e2ee392f890074548d67c668184a7b6688ab8e920df75","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-251","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2d2f491ff842f3bd9f90e831392271f63ed5fa9f862e86c1d91f975aab67df17","target_edition_id":"edition.r017.id-id.draft","target_line_end":1976,"target_line_start":1975,"target_local_id":"block-251","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1975,1976],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a3a0b228a9e8dbdc58d6d7e2eac02d1abcd59495877a423bfd44be885e4aa054","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-252","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9668eb7bfeb85be9ae5ee93c4c8f891cfdc34a36384758edf3cbade9741fecaf","target_edition_id":"edition.r017.id-id.draft","target_line_end":1979,"target_line_start":1978,"target_local_id":"block-252","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1978,1979],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"def9a1e55d9492c015016c85f614cf03df8a4a24e2219c92133c98df3877ed2f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-253","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"4b131d70ad574838f4d68b46d8b99e707dc9c4252feb73f7a2f09ba6d8c92245","target_edition_id":"edition.r017.id-id.draft","target_line_end":1987,"target_line_start":1986,"target_local_id":"block-253","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1986,1987],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b5e826aee1ade92b17de6a9a59f9006e50584c19c9c8525bdd9dfe9586978984","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-254","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06bf77750fabfbe53b835c53cf404b67920557856fea73358a15894f1f2860b8","target_edition_id":"edition.r017.id-id.draft","target_line_end":1993,"target_line_start":1989,"target_local_id":"block-254","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1989,1993],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"14d52aa99405d06a54b2de0136b4299ce98d4b77f8f1f78eed89523c1934ba3b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-255","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"84f5ba677f6b3743ef6e38da7cfe99fce8f27a551bd48d4ef45a5b69ea32ecfd","target_edition_id":"edition.r017.id-id.draft","target_line_end":2000,"target_line_start":1995,"target_local_id":"block-255","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[1995,2000],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a08ece8135d7aa691cca26e55976506b2299c5c09cb65d9be81be22236f2e101","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-256","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"06b5ccac3ad254bb665f753dc2bf8bb870e7931342813e43d7f0a40bd82c365b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2011,"target_line_start":2002,"target_local_id":"block-256","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2002,2011],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d4e774ddeac55d766ce4dd601ccde85ff9b3379df3e8b09c7edf604fde1eb219","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-257","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e1cc98e787264f2ab8d7f974afaf25b33d33909abd1eec343cfd42b7bdffb6dc","target_edition_id":"edition.r017.id-id.draft","target_line_end":2020,"target_line_start":2013,"target_local_id":"block-257","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2013,2020],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"723d8031a501a8300cfb6b1fb0bab002497dc9d8c94b4723b9653401d02eb2d5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-258","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"860cf562e94a96f659210ca457fc9ebbc671643d2cca6faceae6330ded6315ad","target_edition_id":"edition.r017.id-id.draft","target_line_end":2030,"target_line_start":2022,"target_local_id":"block-258","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2022,2030],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dc62bafe94c2d422d4cb44a41ea4b88738234e79a7e5b3a54ca6d4b9a64a2f35","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-259","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"87050575122b6dc526836e3ae29eeb4b7cfab6e98d4e73d68a8ab9d6077550ea","target_edition_id":"edition.r017.id-id.draft","target_line_end":2038,"target_line_start":2032,"target_local_id":"block-259","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2032,2038],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24457d336b21bc55db70090f5d8587eaf6c61fdc2fdb59c6b7231e37e728ffc6","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-260","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6a9b5b8824ef489ac2831dd59b5c3bdbb85b122fa3e4ded5d127f98fb5fb0e05","target_edition_id":"edition.r017.id-id.draft","target_line_end":2041,"target_line_start":2040,"target_local_id":"block-260","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2040,2041],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"372ce6fc8529f1f066c80025557a24156113ad0887aabcb1487e18536bcd739f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-261","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5b9aec817d04d4ac9f5a5764dc1b2b55ccd61221472de59eff1e3de67dc38d60","target_edition_id":"edition.r017.id-id.draft","target_line_end":2049,"target_line_start":2043,"target_local_id":"block-261","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2043,2049],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"295d1225285eba9dca28b93520b20b619bfe7bce30764ba18a35c0d54081f642","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-262","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2a59fb8e9e784b74caaff26ee666b6aca316bfc49292c7bd88fec3dadea7ac7f","target_edition_id":"edition.r017.id-id.draft","target_line_end":2052,"target_line_start":2051,"target_local_id":"block-262","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2051,2052],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c138f17a25241a3d99bd45f474cdb9132e58a91c59e703832c506413db285b7f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-263","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"baee3f722ae8bc72c1a50a5f2117fb8c892929b3ea76905d6db0cce8497784a3","target_edition_id":"edition.r017.id-id.draft","target_line_end":2062,"target_line_start":2054,"target_local_id":"block-263","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2054,2062],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b90fa6d9a6761a48cae5f9c196ab684af1204968b39eb967a8941439800812a2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-264","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b268efcbf95384b110a1686a07782d23ec42cdc013cbd7ce4b59d3893ae231c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":2076,"target_line_start":2064,"target_local_id":"block-264","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2064,2076],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"39cb1a50464d0958e00f4a05a404c44ad04d0dff4541172c6df970c1e5b7b2aa","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-265","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8a6e18b092ba1751f55dd7ef2709073f6f625804c616ea50f77909617ddd6401","target_edition_id":"edition.r017.id-id.draft","target_line_end":2078,"target_line_start":2078,"target_local_id":"block-265","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2078,2078],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e78e337d66a455ee6d8be424683f2af991325733548bd2942ea58b06d652b116","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-266","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3b940f9517425ac09488bb1d92776ab42aa4d56cff56f6938bbc81be295a0061","target_edition_id":"edition.r017.id-id.draft","target_line_end":2081,"target_line_start":2080,"target_local_id":"block-266","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2080,2081],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6ec65df1ebd6f1017aae4df47c0a177f1a97aa47fb480bad23dfbef035dae990","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-267","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"63b0e6dcb10d41d2bccc5dc47ddb7017f9736a3500380228c3932079d481aa62","target_edition_id":"edition.r017.id-id.draft","target_line_end":2098,"target_line_start":2083,"target_local_id":"block-267","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2083,2098],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dab2d641976908acd3ac2a900a4ce6099b0151aa80aca280ea842455eb6b50a8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-268","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"12b745c8c11334fc7234c9582f3191e419d2c4087822f93571ddc1ccc45c45c3","target_edition_id":"edition.r017.id-id.draft","target_line_end":2115,"target_line_start":2100,"target_local_id":"block-268","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2100,2115],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2b652eca40ec472bbf3d8e4c8de467e049cc4716a91e353bdbb1dd5e2b3ec49","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-269","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a1bb209727b5a69d4a435af27d693b0c1da6dd215c84f60cba8fe61f1696d1de","target_edition_id":"edition.r017.id-id.draft","target_line_end":2117,"target_line_start":2117,"target_local_id":"block-269","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2117,2117],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f095177e3ba570532d107e513dc1c2f452e41dea79c9bfce71086800e857b7f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-270","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7bbee10c4a85482df5f1d273f005d6af8ce2bccc77696bc33a7690616a8d72b7","target_edition_id":"edition.r017.id-id.draft","target_line_end":2119,"target_line_start":2119,"target_local_id":"block-270","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2119,2119],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3d58b978e332a3d24d1a58174cb708c1b239ca796ceb8024ab007702c07ef17b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-271","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"70903920f25f1bef3064cdea5518f39dd234d506ee1343e64ae10fdb3f2c5a1a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2123,"target_line_start":2121,"target_local_id":"block-271","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2121,2123],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5e94518341ff25b039592eb7e9280f5d0b72cf3aeddaf049cce3d6cbab311911","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-272","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f61830c4f7cc369ef676560b610d41a9bca0259e2b4680bdfda843d604b474b9","target_edition_id":"edition.r017.id-id.draft","target_line_end":2135,"target_line_start":2125,"target_local_id":"block-272","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2125,2135],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fd9d809114617060966df4db9ba6bb4bc422158fbc6fd0fcae2b2ad77adf4e95","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-273","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":2137,"target_line_start":2137,"target_local_id":"block-273","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2137,2137],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"19843beda93a6a0389ea61e4aaf78f316b6200f7df701c2b57d6754258539565","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-274","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2af89a5e79c6ebc4bea2142ab3f70f224e0cf26bcd9c27b2f14ffefc4a13029e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2144,"target_line_start":2139,"target_local_id":"block-274","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2139,2144],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"07a9efc661a593c6865b4c5b7fca8ef435af5912d4790c0661c552705a34cb05","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-275","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5270ce593c449e1b94462191d9dd8d528bb023f7f57740477c66099e7ecfbd2c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2148,"target_line_start":2146,"target_local_id":"block-275","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2146,2148],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2ae5ce63c9187564159663c9d5fd5a8b25d6da05b68364a302d35351801cd077","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-276","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"109591bfd0f2193a900647580976c5363895c613d10f0eae4e955378c990789e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2157,"target_line_start":2150,"target_local_id":"block-276","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2150,2157],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b9fbe4fdd089f21adccb1828bf82f9838bacf04a72c4640d8257d28ae4a7a37","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-277","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":2159,"target_line_start":2159,"target_local_id":"block-277","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2159,2159],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bae975397678bdfe3b816442e5d93992100646096647a136958a07d4e5e363c2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-278","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"2d54d7ab3a738f96ea7e10e5ff664133284c6b365408b6e70ed88ea9e3ba9ead","target_edition_id":"edition.r017.id-id.draft","target_line_end":2166,"target_line_start":2161,"target_local_id":"block-278","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2161,2166],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"87f1fe160bb88b99392682c784686b86b1ca99f8e94a15925ac69d923017dd28","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-279","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f15dc98e6fad01453ecd3bbe55db67c1cb96205b13b4a4288a7c60ac1a09a8e3","target_edition_id":"edition.r017.id-id.draft","target_line_end":2187,"target_line_start":2168,"target_local_id":"block-279","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2168,2187],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f6f1fcc7c81d7d103e3db42c7dfa7826ec7c63e50ed01842d0060bdab9b117e1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-280","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f0ee9a92127c76117ee0e2a9e99fdacd506f6f83cb11577d4ecfd2cbb1e9e15","target_edition_id":"edition.r017.id-id.draft","target_line_end":2197,"target_line_start":2189,"target_local_id":"block-280","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2189,2197],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"265288599da83a3e44076a637e1ed3da71d37d5a554331271d89a84ace9e92f2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-281","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"f438edaf4a0806f3995a450a1127b02b51c0eb792dab8d6cf29a3f0ccd77bf60","target_edition_id":"edition.r017.id-id.draft","target_line_end":2199,"target_line_start":2199,"target_local_id":"block-281","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2199,2199],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9dee51d828f0eb417a55ac9c51f947f820c8d9e5e36a476ca222d1c55fcc451c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-282","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"5321fb2e58bba2feb69262102732b61deafb70d735a42f47ba8a21cdb0fb6749","target_edition_id":"edition.r017.id-id.draft","target_line_end":2204,"target_line_start":2201,"target_local_id":"block-282","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2201,2204],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"013dcd445314275947620ae85e1446ee519354e668b060746c96619b5460f6f3","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-283","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8f551875a19771ffe061f4555aa4bc52918bae15c96b6143e4bcd864632458e5","target_edition_id":"edition.r017.id-id.draft","target_line_end":2211,"target_line_start":2206,"target_local_id":"block-283","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2206,2211],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"933a0bfb7975563b9bdcd70cf29a1efd88fd0e60521d806a05a3895bca334073","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-284","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a1911e2f619aae6f0574dec6d83cbc82fa04b464b6fa4a6c9c7d87bcb2923c83","target_edition_id":"edition.r017.id-id.draft","target_line_end":2214,"target_line_start":2213,"target_local_id":"block-284","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2213,2214],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"121145c2a052d7df33041c61b231d3d494ce95d07f5f74aa7cc50a565983d8f1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-285","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e440412c585d107d9fcb4f77c1dd5588bedef3249a373f38473f678d24cdaca5","target_edition_id":"edition.r017.id-id.draft","target_line_end":2218,"target_line_start":2216,"target_local_id":"block-285","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2216,2218],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a03bb2108fddd6a9ede542d7ee244859d039dcc2157af515b5ecf09d7a76a57e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-286","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"52c23a51593a4a111ba069bb8bee6039638ee91e7899aacdcb9157a8fa592184","target_edition_id":"edition.r017.id-id.draft","target_line_end":2222,"target_line_start":2220,"target_local_id":"block-286","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2220,2222],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2b77b889f54a8e6fc397c5886bc16b93208884c84eca5b4be1993c05b6fd03c9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-287","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"790ec234cdd6b21da5765e603431b821fea2b738d17ab0d55d0ce21ba468e70c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2233,"target_line_start":2224,"target_local_id":"block-287","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2224,2233],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e4a8272bdbcc135990390fbfac66117eab9c3da48dd15b6386f3a517e41e09b0","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-288","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":2235,"target_line_start":2235,"target_local_id":"block-288","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2235,2235],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f5290280df7dbfe5309728360e04c00611d2d3d685c0aecf71c8326ad12c2d4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-289","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d1f5816f3521197ba99cf89dd835fb39d4cc502d440bdf8591e3fa066e217fe3","target_edition_id":"edition.r017.id-id.draft","target_line_end":2237,"target_line_start":2237,"target_local_id":"block-289","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2237,2237],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bfa09902b4db43d2589e2d24726caf201f9e550366df0759f88e3c4c90b29e3c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-290","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d404fa69e22d080af83cf880237ecffbf6d2a024b2dba2befd922cdac92f7dc9","target_edition_id":"edition.r017.id-id.draft","target_line_end":2244,"target_line_start":2239,"target_local_id":"block-290","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2239,2244],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6d0a6403efc7a3002670bca7b787e9dd7dc35c934c6b88234766cd4ece4d5b46","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-291","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"493ed9a8cc65ffd1c35467fcecf7ad232566acb87cac0a1046b542c369990fb0","target_edition_id":"edition.r017.id-id.draft","target_line_end":2248,"target_line_start":2246,"target_local_id":"block-291","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2246,2248],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b6621a8cbcc93b35dd2d0106f4c66339c30a38a6d9e48fc79a2a91980315ec8b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-292","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"8a2d6ba690cb79c364febc3ec8326b1d55097df56cadeb2d74422353552823c4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2258,"target_line_start":2250,"target_local_id":"block-292","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2250,2258],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e9fcbd071e9fcbb8b83195d3e5984606cd11a69086215479bfabddafc6fbb433","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-293","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":2260,"target_line_start":2260,"target_local_id":"block-293","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2260,2260],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"694183842f6adc3ed834dc31bd5fb01e1dd1bf2d32143ddf06dcde6db883863f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-294","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"29c870d1dd08eeeee11d73a927cf1215e98f4ba65e7e01a6b5e9b26258713621","target_edition_id":"edition.r017.id-id.draft","target_line_end":2268,"target_line_start":2262,"target_local_id":"block-294","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2262,2268],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"206030823e42049b0586f988436b1913eff82761d63a6ac0fdafeb474900dd9f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-295","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a819978fbe1e7f9f3d49a86b16da3f7bcd07b86fa7829995ba66ff6dfa0c7b61","target_edition_id":"edition.r017.id-id.draft","target_line_end":2272,"target_line_start":2270,"target_local_id":"block-295","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2270,2272],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b45737dc2966185b902f34b63338247cadf15fcb6cd101b56182efa49320f9d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-296","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1182ab80d3a47dea224c4fd5e23f2f1445a959b7c62343c849832d342d86b9c6","target_edition_id":"edition.r017.id-id.draft","target_line_end":2285,"target_line_start":2274,"target_local_id":"block-296","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2274,2285],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c94c6c9db3ca345914f8f3a05af8b588c9b06d7dc9e1489094b1ee0d929745c6","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-297","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":2287,"target_line_start":2287,"target_local_id":"block-297","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2287,2287],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"387a1c88dee37ecda78a1b0b362179fc086feff0284712c27046ff615ff373bc","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-298","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"117d94937f28d0f1057020b52e8a2266a20c88b7df0dc2bf618dd90e43c61740","target_edition_id":"edition.r017.id-id.draft","target_line_end":2295,"target_line_start":2289,"target_local_id":"block-298","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2289,2295],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"914f65c66441cc5e57b3855a5461fc38b1897c1f1b5e3c5a89c140b929cc9606","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-299","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"50b90f463d94818757677764aa5a286f622a3c0284b783fa58918d02c5818083","target_edition_id":"edition.r017.id-id.draft","target_line_end":2310,"target_line_start":2297,"target_local_id":"block-299","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2297,2310],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4a27d264850235cb12e818bd8eb46f7f59105e629c53e3c69cfaec413e8ff05c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-300","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"de3adff1c8ffa2fd1195b8ebe11362cc7c90a82e0fd027987180081cdb124d4d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2319,"target_line_start":2312,"target_local_id":"block-300","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2312,2319],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8b9be965b1fc3ae1d4effb45e2ea5ea43000fc85e7446630d757beb2955ff598","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-301","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"779b4a4d7f7f81c081c288d99c29ddfe8eacca6472036802dfc0321a71a2c675","target_edition_id":"edition.r017.id-id.draft","target_line_end":2323,"target_line_start":2321,"target_local_id":"block-301","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2321,2323],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e603e4d736635afd95c04831ec2ef555667a65e4f94217ad7bff800444a133a7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-302","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"beb45cdcc78bbc9f699bfa9add1327cb188fb013fb75397b02369e853a382b2c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2327,"target_line_start":2325,"target_local_id":"block-302","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2325,2327],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ca17bc487fca1bb140988121f68cc89e65a93e577e1552ffdab268ad9c1bd45c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-303","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a48c2a4196154661b38f8b124102e60019cb2fb6e6494f84ac0329e806c6850e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2334,"target_line_start":2329,"target_local_id":"block-303","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2329,2334],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8add7a3d752dd004d502e30ac66b2264d9a34bf5888a16f2e652599ddf1d1bac","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-304","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bd66b1733696f9d49c5f570c378b89cf90bb05482a4bbfcbe60db58be60d9de8","target_edition_id":"edition.r017.id-id.draft","target_line_end":2336,"target_line_start":2336,"target_local_id":"block-304","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2336,2336],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb888ae8472fd438288b7de4f85eb58ffbdc04e372c61854206b37157cc48775","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-305","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0ac7e756c4e38cd46c2ce51914ef682fbf7960b41b4caf329031b75d707e5424","target_edition_id":"edition.r017.id-id.draft","target_line_end":2347,"target_line_start":2338,"target_local_id":"block-305","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2338,2347],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b241b2efb7a051f6715b469d0df3fb4d1ea7418938fd4adf07a85c2c5e2c5af2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-306","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ec0fd2fc011f853048e354475501abf9c407378fdab3ae09b6c77b49c0009a3e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2358,"target_line_start":2349,"target_local_id":"block-306","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2349,2358],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd9d3beac19859863270883cd233de4c7254ec478f4617e9b950d85e1031da1b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-307","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"bdc0a7e4de7f9d726d0d957957e8158108a13729445b9e06a3856d4d337a636e","target_edition_id":"edition.r017.id-id.draft","target_line_end":2370,"target_line_start":2360,"target_local_id":"block-307","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2360,2370],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"22e6abbefe08c782c4440667ee73d2b38a7b4663addb3e4a089a6e27c0633bd8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-308","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"879699933aeb86c9479988525530877cb93afdea1461ea87ad5168188ecbd520","target_edition_id":"edition.r017.id-id.draft","target_line_end":2372,"target_line_start":2372,"target_local_id":"block-308","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2372,2372],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cd97918ce27c43d871c2c91bd93a7b372ecbd9de7edaa1a3b11c80991e13aaee","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-309","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d5859372d9487bd9ff999ae0f1f9396965f23b4195cd65853ef89e459d23d217","target_edition_id":"edition.r017.id-id.draft","target_line_end":2383,"target_line_start":2374,"target_local_id":"block-309","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2374,2383],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"591cdd55ce2f5ef5815ec99b5cf6b4d8afaa76477a65d5511e2fec923bc34cea","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-310","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b89b664ab398fc8907a77d2b2de26b65ea1db78c927d3223c676fa6069880b5b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2387,"target_line_start":2385,"target_local_id":"block-310","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2385,2387],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b37dc2c0b2a03db6fbd8196d2c31c92fe5c1e30b1b475e154be4d5c940e25234","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-311","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"cea0bb746c9aca246d78efac98a04fe6e592c904d90f84f5cf7a423627d2b82f","target_edition_id":"edition.r017.id-id.draft","target_line_end":2396,"target_line_start":2389,"target_local_id":"block-311","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2389,2396],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"543f02f32d6857b9eb720311f1d1e550a50ad079878967c2da3edf19c13929a0","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-312","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e8e439917c4d1392a1c3cbafc8a2f745273d92ee7a5916667a725722d12035de","target_edition_id":"edition.r017.id-id.draft","target_line_end":2398,"target_line_start":2398,"target_local_id":"block-312","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2398,2398],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bbe2ba8cfe441c21c31e6e88ab95661608c208d5100abfbd4a2dedca6d83c8bc","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-313","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"b3007a6d40725e550d3808dd4e8ce7fcc9db519fbc903a79a3188bc8ac37844b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2407,"target_line_start":2400,"target_local_id":"block-313","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2400,2407],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"294f5974803724384b001533f50fd2aa4ee1c46801a33b358eacc6782fa7b684","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-314","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"076ba5b1d702734c0df6e57728cd329353c078b9901fac548fade98c5abcc05a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2409,"target_line_start":2409,"target_local_id":"block-314","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2409,2409],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f7835150e91e8850923217abff8f9cd3ca97b7f8bcd70253ccea6d240f02acb3","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-315","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"aee7769679a93ab6573c810d197b429769b1b8bee0ef557f3ced2e5e94f2a675","target_edition_id":"edition.r017.id-id.draft","target_line_end":2419,"target_line_start":2411,"target_local_id":"block-315","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2411,2419],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a6484437804fec70707c1e6d67b0b951c6fd33ac50fd0d32471c8dfea514c36","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-316","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"ff6bbce7f47823c5e49df139a0d70937bbe6a7599568f4afd60ddfe0aaa37618","target_edition_id":"edition.r017.id-id.draft","target_line_end":2423,"target_line_start":2421,"target_local_id":"block-316","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2421,2423],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3872dc0feb09dccb1b267c92bbbb749ef0cd591c59df8df06ef5ef663c868366","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-317","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c8fcb6d98552868ac73b87aa3d96e4598cd53832cd145396fa6dfd5bcd791980","target_edition_id":"edition.r017.id-id.draft","target_line_end":2427,"target_line_start":2425,"target_local_id":"block-317","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2425,2427],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0f1e16f05af5ad112ddb294ceb556f48b8b640a2fe52e719d344e31bb7793aa8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-318","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3de4600ab5e22067912d3a8a034f82944d4ed86b9968845309e602a63b6a20e4","target_edition_id":"edition.r017.id-id.draft","target_line_end":2431,"target_line_start":2429,"target_local_id":"block-318","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2429,2431],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9d9a835c86061993ca729f8cd353f604eab3f9756c3d3a32603398544a4001e9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-319","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"819f97aaae6b0ac08d33a23785817b65da634023f27ebac68edfbe5b6292dfdd","target_edition_id":"edition.r017.id-id.draft","target_line_end":2444,"target_line_start":2433,"target_local_id":"block-319","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2433,2444],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cf813df11c61b61c2aeb583a73213180950b7a30add51340a28432916a729f24","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-320","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"c67fe1359d745ccc92d8ff55c6838713eff1f637a403a45769c90dafdeffab25","target_edition_id":"edition.r017.id-id.draft","target_line_end":2456,"target_line_start":2446,"target_local_id":"block-320","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2446,2456],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"09807b4e882aed1160054693887b21224e5229015050cc106c1647f00bf5140e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-321","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"fedb0cb8c30a88294ab6fcfc7861c866fb89aad61a39fd38628627968e45e4d5","target_edition_id":"edition.r017.id-id.draft","target_line_end":2459,"target_line_start":2458,"target_local_id":"block-321","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2458,2459],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4d8129026a69b000468604f2f94558e977bbe9d649f183ba57e6fe6aa1b7aef7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-322","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7dbf82702b55d049feca9ef59c78bd2aad34eb31f7a3a860273a10ef6ebd2b59","target_edition_id":"edition.r017.id-id.draft","target_line_end":2462,"target_line_start":2461,"target_local_id":"block-322","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2461,2462],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c7b728d6ddd3eefcb9c141c255ba2e7f557b66685a9a25f49b4b7ae086774b76","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-323","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"49615c51c0d6d115f1b25115b80ffce685ecf52ff6cd3f2beb803e41482a5713","target_edition_id":"edition.r017.id-id.draft","target_line_end":2464,"target_line_start":2464,"target_local_id":"block-323","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2464,2464],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"474f8b7891e45ce84ae7abd7adc506c723cffc83c9f86d318b918bc81b3361b9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-324","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"10e64c2b302a56dd9a5937942ea17ad8f97be751d9d2147e73e2947267409ff2","target_edition_id":"edition.r017.id-id.draft","target_line_end":2466,"target_line_start":2466,"target_local_id":"block-324","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2466,2466],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ab26c96512a507f3bb65a29b7fb9b8854cb573c0ad2cf88abc61d6d98653a47a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-325","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"6df53799b252cb584e7cdc4502331093467d794f14fdf112bba04bd95525cdab","target_edition_id":"edition.r017.id-id.draft","target_line_end":2479,"target_line_start":2470,"target_local_id":"block-325","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2470,2479],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c32237cd9db561256934db4aa0c3de182ca762ba69fe3d15ba5f269cac48608b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-326","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0e25fd81d13849b866c5138e26307313375eee3e13c4ab1a79f90a8bf1754782","target_edition_id":"edition.r017.id-id.draft","target_line_end":2484,"target_line_start":2481,"target_local_id":"block-326","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2481,2484],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c9dd3e839e7feee0138c29b8def8d35ae331b950a110c750cea417a36301c142","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-327","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"9f01723395f781fc4e94c0f75a462e20bf209d4dbda14bcbd07b7a3bbef4595f","target_edition_id":"edition.r017.id-id.draft","target_line_end":2490,"target_line_start":2486,"target_local_id":"block-327","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2486,2490],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2aa11a421e719db81e27636fd47eb56927d366eb8188daa935a5da3137e97006","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-328","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"7923ead7e5af5f67cf73b21f0b6a0a07692f1c1c2f1451a0b60a94b5e505d856","target_edition_id":"edition.r017.id-id.draft","target_line_end":2496,"target_line_start":2492,"target_local_id":"block-328","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2492,2496],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b61f7568c72839c0420ddeec7eda2b81ed90199bad55a913277145f7ee119922","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-329","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"554da14cfc491931245de3f0b309a049c3c0e9f20e6332c79e9818522576b7eb","target_edition_id":"edition.r017.id-id.draft","target_line_end":2502,"target_line_start":2499,"target_local_id":"block-329","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2499,2502],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c808956e8fb5c7279a8da950867c16bf0d7cd751b12898a22a0d8073168e37c7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-330","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"0647578bb701705f1859a621993307cb758bc9db28309b652d206611cb15d55d","target_edition_id":"edition.r017.id-id.draft","target_line_end":2504,"target_line_start":2504,"target_local_id":"block-330","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2504,2504],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"709a4e087b769473bcb52129bf345cb59b46fa4eeaa34243925469148a9b3a72","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-331","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"980b49ab535e084ddd77671660be5de229039bba1d1efcc905e8832d7af2c19a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2506,"target_line_start":2506,"target_local_id":"block-331","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2506,2506],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a72505cdb5241f542da53e486cb39cd88a66143cf70ceb2cad69132674714acf","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-332","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"d31391c3443be323a08f3033843cb8eb10c0a2ea327dcff0f3f19cbb4925718a","target_edition_id":"edition.r017.id-id.draft","target_line_end":2508,"target_line_start":2508,"target_local_id":"block-332","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2508,2508],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"055d1754c5fce24afd9a11059db8d34eb2d52e1464c22b51906ff91441eb2256","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-333","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"e76ae29df07299fc9a2a5ef0bb897c94f347d3b15e0752a3ba8ca54c8e390a54","target_edition_id":"edition.r017.id-id.draft","target_line_end":2510,"target_line_start":2510,"target_local_id":"block-333","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2510,2510],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f0a93e1d5d69e6649cb88e960c6db07c3c1b08b26cd56981b88cdb3fada32559","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-334","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"17657ce4c854964d187882d60b597d73aca7833a9c3e959d81efb969d3028699","target_edition_id":"edition.r017.id-id.draft","target_line_end":2514,"target_line_start":2512,"target_local_id":"block-334","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2512,2514],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f5024f09fb17c05f984b47ce8e3dfda1c76f6ec11df1202dca0c456f79d267d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-335","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"3f760244aa08200cb15c809533d141e3f7dda3ea31c2a6a5cb4b81387c0e8c54","target_edition_id":"edition.r017.id-id.draft","target_line_end":2517,"target_line_start":2516,"target_local_id":"block-335","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2516,2517],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"09327646647a8079b6c1eac971bb13858814528856a13d614ac44c5cab2b1369","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-336","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"1567f72674c8f219576f0fb8565f6a059e8dcb34cda334b280ab5867d7835d0b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2519,"target_line_start":2519,"target_local_id":"block-336","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2519,2519],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"03042fff2542be6228b7461fde95b0a83ddb6aedb269fabb3c6fb8df50fa5de2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-337","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"abc700e35f39c6b4276772e3b92f709a15541dea7f2f454ed7f773c9085a48ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":2521,"target_line_start":2521,"target_local_id":"block-337","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2521,2521],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ed384699f9ce52cf82a465d8c9401d9c74299957e61346d7618b49b37a629bc1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-338","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"69618e7a41f7fec84c12784fd5cabca91539819b7b69567249da38b9dd0ff909","target_edition_id":"edition.r017.id-id.draft","target_line_end":2524,"target_line_start":2524,"target_local_id":"block-338","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2524,2524],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e5217f29d65ff0f816eceeebfe34d80ed7780e8b5ee63e7967191dbc3640cc10","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-339","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"a2cac25464cf3a842e15cba78cc43528eb17b901e2a4b3433cbc311bacf4ffe2","target_edition_id":"edition.r017.id-id.draft","target_line_end":2528,"target_line_start":2527,"target_local_id":"block-339","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2527,2528],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c542b4ddf6ecefc922ab94a1fb1bcd1ce0c7deff7c9b23828757b721652619a7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-340","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"335396cef6e18cef69a156814fcea945c3d6fa5b28792d8603a95108a3ac7cbd","target_edition_id":"edition.r017.id-id.draft","target_line_end":2534,"target_line_start":2530,"target_local_id":"block-340","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2530,2534],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d0d39c0ce1ad700408ce0b9dfb09595257b66f188664be9f4567b3d8916b6ab1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-341","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"72e4bb3c167a6f3d6da335a9d4dd9e9b8edbc2ad0282b72ca157dcdaba0b0d8c","target_edition_id":"edition.r017.id-id.draft","target_line_end":2541,"target_line_start":2537,"target_local_id":"block-341","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2537,2541],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6e2cce598501135c606ffd5310c5029b63df47199b45b6f7d19a0f03df2ed672","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"id":"segment.r017.book1.ch15.text.block-342","locale":"id-ID","parent_id":"unit.r017.book1.ch15.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_content_sha256":null,"source_edition_id":"edition.r017.upstream.1745df89","source_local_id":null,"source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","source_target_relationship":"translation_target_projection","status":"verified","supersedes_id":null,"target_content_sha256":"39e315c9ed42c6d84f57985d6ca207a3685f20a70a80d7aace2487f8d7c2fb4b","target_edition_id":"edition.r017.id-id.draft","target_line_end":2544,"target_line_start":2543,"target_local_id":"block-342","target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.ch15.text","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[2543,2544],"member":"source/Intro-Math-Programming/baseText/book/part3-integer-programming/ch11-ip-formulations/integerProgrammingFormulations-book1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a3002c04c332dc586efc59b36915191381f2c4c58aeb37c09920e98736fb311","concept_ids":[],"id":"segment.r017.book1.cover.block-001","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"09077751cc8eac141e371b69ff8147963ba3515ea6add8b133fd1a57fd445d60","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":6,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"cb87ef17b9fd809000bc0665943b9b495728852206da436c704fd09f009c3bfe","target_edition_id":"edition.r017.id-id.draft","target_line_end":6,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,6],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a0f003bd75fdb268ac2e81a72da868f5647a2016795d5531f9f098f98605c0c3","concept_ids":[],"id":"segment.r017.book1.cover.block-002","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"918f102ef2b738b46af1f68a082698c433d5ab98e8533bb753c1c7f8a1ba2023","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":12,"source_line_start":8,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"918f102ef2b738b46af1f68a082698c433d5ab98e8533bb753c1c7f8a1ba2023","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":8,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[8,12],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6791c30fb04ed073337caebd875065eb247a34629bff9e32d1a21a1c7b9fbcee","concept_ids":[],"id":"segment.r017.book1.cover.block-003","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"8d4e85ee8e506d4f0ed01a3c8cd2b9d8ac17c78e82be229bf1200819592edd74","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":14,"source_line_start":14,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"8d4e85ee8e506d4f0ed01a3c8cd2b9d8ac17c78e82be229bf1200819592edd74","target_edition_id":"edition.r017.id-id.draft","target_line_end":14,"target_line_start":14,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[14,14],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a694988f18ee3bcfec820b29915d2fb76ce5f9f6cff5c43f074cd47958e042e9","concept_ids":[],"id":"segment.r017.book1.cover.block-004","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"a70c0a8aa87fffc28548a399a23989709f59f8586b1c9393f0eb50516b226c4b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":21,"source_line_start":16,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"f0fb434ac1331919cf12dc815732f1ad580fd0209384cac56124a95ae6bafa79","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":16,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[16,21],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1595430ad4c57fb80dafaae13bfacc193a3daadd1070cf71ea93f08c4457ab9a","concept_ids":[],"id":"segment.r017.book1.cover.block-005","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"f10b58d3a1f71782d1bf5f9bf7895624647e9646c1b50cf270741bbe24668ef6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":23,"source_line_start":23,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"f10b58d3a1f71782d1bf5f9bf7895624647e9646c1b50cf270741bbe24668ef6","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":23,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[23,23],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5b25c94105c4315120793d8ee61ed8afcfe12a965ea46266b25193f59b3fab0a","concept_ids":[],"id":"segment.r017.book1.cover.block-006","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"e0a862dfde5965e8348f385bbbddb4cd7799fdec95c928b9f7aa90fcb4148eff","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":27,"source_line_start":25,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"a534144611e350e1d72c28fa35435f379cdda8063239cf9931a49db9d3c64843","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":25,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[25,27],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e900d34c61fd63b7113c7e2f1cd93bf9eeb92c1a696e5c07d7746d06b5daa15","concept_ids":[],"id":"segment.r017.book1.cover.block-007","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"6f86e0b2332e4bdb740e328f0889b1ac40af28353d3e092d0fdbae6840658648","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":29,"source_line_start":29,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"6f86e0b2332e4bdb740e328f0889b1ac40af28353d3e092d0fdbae6840658648","target_edition_id":"edition.r017.id-id.draft","target_line_end":29,"target_line_start":29,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[29,29],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5199b0138d477879501f4962f63c5c72cd98359efd92f2ad3c2bf3f5b3a9a6eb","concept_ids":[],"id":"segment.r017.book1.cover.block-008","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"44611c0cc3a6f2610ac113ce5caa243b809934f8eb022790ffa32e6c2aa5de1f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":32,"source_line_start":31,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"a8e33e2a6f141c140003a7acd51107fc068d9a8711544a55df13569948cf017e","target_edition_id":"edition.r017.id-id.draft","target_line_end":32,"target_line_start":31,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[31,32],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f07da634a6899a88ac714cc9561ce3765cb5f3e4754d11431cc190da08443af4","concept_ids":[],"id":"segment.r017.book1.cover.block-009","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"102d29baf7169fbeacc3bb883577a4953199258a3a727a3a3d49c6d4259770d8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":34,"source_line_start":34,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"102d29baf7169fbeacc3bb883577a4953199258a3a727a3a3d49c6d4259770d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":34,"target_line_start":34,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[34,34],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6d47ddfcb92f728a313232f4deff2dfd293f314bbd759fcea89707dc8fcbff96","concept_ids":[],"id":"segment.r017.book1.cover.block-010","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"6af98b6d0e3b2f2d55d745e062ed42bcee450a9cb88421643ebc8c26e3c059c3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":42,"source_line_start":36,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"33c742ca49e2b10820a1fc0f756f852db220696155a9ec51a24c6f8014168d79","target_edition_id":"edition.r017.id-id.draft","target_line_end":42,"target_line_start":36,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[36,42],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a53c6e5ea0fae93fbc0ea6fefae0dbe4da9eac9e3260e682e1ae356677236165","concept_ids":[],"id":"segment.r017.book1.cover.block-011","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"1ecf8a344e2d007d0da0b8afda0d6b4e5cd5248db9e8aeef036b716bc4069fe7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":45,"source_line_start":44,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"b2fed4f8b7c4aee8cad17a5d74c0c7dd25a64f40518358eee673d270835dfd9f","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":44,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[44,45],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"189b058197146545d6795dd0c95f279f366dc36530502bc8602244b9c3845a48","concept_ids":[],"id":"segment.r017.book1.cover.block-012","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"c509448e8240e5b98bb4bed442ec456179440d656496a6aa18157b0d8867292a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":67,"source_line_start":47,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"0ca7bb6742067cc815ba6a29b1c6e2c26fb2f9ea6db0f49c920da6d7ff297e48","target_edition_id":"edition.r017.id-id.draft","target_line_end":67,"target_line_start":47,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[47,67],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5966744cf701a2b81f2174dd63e370210e08562aa9bfee67739c471b409e81f5","concept_ids":[],"id":"segment.r017.book1.cover.block-013","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"5be6988b2f0835e3ff29c4ebe126b05947a6a301ffa0d92d079891e0ee61608c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":94,"source_line_start":69,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"d93f1627a4348ab81a9e45b3311025837548a0b03bb73ab6b10db1e74bb33641","target_edition_id":"edition.r017.id-id.draft","target_line_end":94,"target_line_start":69,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[69,94],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b22ecc6dc38f2936de97da64a8ba6f4f015b3576088ac29ecc105791eee27733","concept_ids":[],"id":"segment.r017.book1.cover.block-014","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"6b2bf16a10e7f4754a66fd6ccb94cac00866f2801b1654109b23fe30a6f73d92","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":113,"source_line_start":96,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"9e8527d992ec8e2735d4b3f98f83edb2f5f803bb1ceaa7ae2616aa60a8210470","target_edition_id":"edition.r017.id-id.draft","target_line_end":113,"target_line_start":96,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[96,113],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a97606d3638b5ecba3e4cb6237b1240b935319443575bf901214ffec71fc0ae","concept_ids":[],"id":"segment.r017.book1.cover.block-015","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"52adfc9929fc0fccc1741bee463caef78a287a05fdda6a899f547cde62367407","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":115,"source_line_start":115,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"52adfc9929fc0fccc1741bee463caef78a287a05fdda6a899f547cde62367407","target_edition_id":"edition.r017.id-id.draft","target_line_end":115,"target_line_start":115,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[115,115],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1805272cf3c4b7e346585589bdcbd83c0c602616abdda41c1672191ae0bdbab4","concept_ids":[],"id":"segment.r017.book1.cover.block-016","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"102d29baf7169fbeacc3bb883577a4953199258a3a727a3a3d49c6d4259770d8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":117,"source_line_start":117,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"102d29baf7169fbeacc3bb883577a4953199258a3a727a3a3d49c6d4259770d8","target_edition_id":"edition.r017.id-id.draft","target_line_end":117,"target_line_start":117,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[117,117],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"88956566d122995c104a6676b3f82b2308b3c557db2534a6efe096761715b8b3","concept_ids":[],"id":"segment.r017.book1.cover.block-017","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"b0c927a874b87ff2984f2f7c6a26322164a7e4b3ef8decbd92074dd56b98194b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":120,"source_line_start":119,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"a8c909e4ed10ab284951f7f0fdbc790771dfa37e3a73b0ee72b016bb6c6fadf0","target_edition_id":"edition.r017.id-id.draft","target_line_end":120,"target_line_start":119,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[119,120],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"24f928d6dc4a8cbb4dafcf31877d2d60a2dcaeb20454336536066537d1281eba","concept_ids":[],"id":"segment.r017.book1.cover.block-018","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"0fef838539965a6b1c23f3a7cc11d86ac2cb2f7b96f3434d76685f3e05380d8c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":122,"source_line_start":122,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"0fef838539965a6b1c23f3a7cc11d86ac2cb2f7b96f3434d76685f3e05380d8c","target_edition_id":"edition.r017.id-id.draft","target_line_end":122,"target_line_start":122,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[122,122],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3136ca7e06457c51663bb441f90855723e0bf1b0fafd63317cfe1684a1968975","concept_ids":[],"id":"segment.r017.book1.cover.block-019","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"612566233d0e9ceb8eb4e935db63d7ccf5035c14f7a2a85ea6602c71f48228be","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":126,"source_line_start":124,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"998636a4f89ab100e759b30297284a85568fe73352e917e71e5490de75684fae","target_edition_id":"edition.r017.id-id.draft","target_line_end":126,"target_line_start":124,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[124,126],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9bafff3d4cb7d9e2995bb01c3dde0b3ee23d7f903b51aafcc57b3eed2cb2d965","concept_ids":[],"id":"segment.r017.book1.cover.block-020","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"c5446e6d87c91a4cf4c897a1b46d4bdf0963731c75bab9f98715bd7d0c427c07","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":130,"source_line_start":128,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"c5446e6d87c91a4cf4c897a1b46d4bdf0963731c75bab9f98715bd7d0c427c07","target_edition_id":"edition.r017.id-id.draft","target_line_end":130,"target_line_start":128,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[128,130],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a2909bae2557bc43ebd4e7ca14f755c5b3893556bbb3bbc2bb5c8f281036ecf2","concept_ids":[],"id":"segment.r017.book1.cover.block-021","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":21,"source_content_sha256":"1758c3e39a8c261729e37e1414f31a6ba3de4267bb3bb2318225a43c7e340325","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":132,"source_line_start":132,"source_local_id":"block-021","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":21,"target_content_sha256":"1758c3e39a8c261729e37e1414f31a6ba3de4267bb3bb2318225a43c7e340325","target_edition_id":"edition.r017.id-id.draft","target_line_end":132,"target_line_start":132,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[132,132],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e2ff6526077d4c5fa4509e7f407f6c54ba04ef4097f7c9d24e0689542c572354","concept_ids":[],"id":"segment.r017.book1.cover.block-022","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":22,"source_content_sha256":"27f9fa6cd74cba3e18a14346c77cceec70e190733d247d7eb1abe0415858236b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":137,"source_line_start":134,"source_local_id":"block-022","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":22,"target_content_sha256":"e345b6c45b6e49525a01933140f48ebeff792f76168e9bc3b18c1eecde02101f","target_edition_id":"edition.r017.id-id.draft","target_line_end":137,"target_line_start":134,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[134,137],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5bab7799c1641b66f37a14ef02496a548d2951dd0dffba4ae305b95b4601ebdf","concept_ids":[],"id":"segment.r017.book1.cover.block-023","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":23,"source_content_sha256":"f10b58d3a1f71782d1bf5f9bf7895624647e9646c1b50cf270741bbe24668ef6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":139,"source_line_start":139,"source_local_id":"block-023","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":23,"target_content_sha256":"f10b58d3a1f71782d1bf5f9bf7895624647e9646c1b50cf270741bbe24668ef6","target_edition_id":"edition.r017.id-id.draft","target_line_end":139,"target_line_start":139,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[139,139],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c6328ae34a2ea14fdb0a01a1d41043b749b966e62f569a733ea0c01226d03f80","concept_ids":[],"id":"segment.r017.book1.cover.block-024","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":24,"source_content_sha256":"75ac475f7c310518476fed673a80361d96f4483f1f290fbf357780eed974b94c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":145,"source_line_start":141,"source_local_id":"block-024","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":24,"target_content_sha256":"81ca08f6e3c8f9d78e13d7b007ab7b9dda55eb75baf69af75e4bbe39be296dc2","target_edition_id":"edition.r017.id-id.draft","target_line_end":145,"target_line_start":141,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[141,145],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd91cb7653461c8981b1ff3806af3b2bafd06eeb40862877a814f9dae33fd197","concept_ids":[],"id":"segment.r017.book1.cover.block-025","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":25,"source_content_sha256":"f10b58d3a1f71782d1bf5f9bf7895624647e9646c1b50cf270741bbe24668ef6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":147,"source_line_start":147,"source_local_id":"block-025","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":25,"target_content_sha256":"f10b58d3a1f71782d1bf5f9bf7895624647e9646c1b50cf270741bbe24668ef6","target_edition_id":"edition.r017.id-id.draft","target_line_end":147,"target_line_start":147,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[147,147],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0a893453858c5c2315900d387b389e687fc0ef25063869a0195822749895e510","concept_ids":[],"id":"segment.r017.book1.cover.block-026","locale":"mul","parent_id":"unit.r017.book1.cover","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":26,"source_content_sha256":"f5dcbbd894ac6582c13c67f6bb7f881f2122b92ddc1dd9b45e5d96c766f7168c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":152,"source_line_start":149,"source_local_id":"block-026","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":26,"target_content_sha256":"f5dcbbd894ac6582c13c67f6bb7f881f2122b92ddc1dd9b45e5d96c766f7168c","target_edition_id":"edition.r017.id-id.draft","target_line_end":152,"target_line_start":149,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/cover.tex","translation_state":"translated","unit_id":"unit.r017.book1.cover","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[149,152],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/cover.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6388ca821213601af0b5a6747dd07d5492798a87d6080ac44c0440fe5954e325","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-001","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"c8981522a0536b7cbc4baa701f4ff862cb0c37fdeb536481c8e3a3b40d6ffdce","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":5,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"af0011619fb1435d138e715cd3b94da85646cb2844146dd3d57348e82dccaef5","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,5],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"dd09166539fb157cf7fd80bf0f106e40379fd9ac413862e67198e5f61ad347cc","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-002","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"71a47e4127d8a16bd7d032d27615bea9af6ddc9a244a8a2c1778597a610ca389","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":9,"source_line_start":7,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"e4c038f30466112cb50c6b118c96c1325353f0ac3c17915676edb0db3f38393a","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":7,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[7,9],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc53f085ce0b6534ce451d43672b14cb76b594797e9e92d6e50fb27ce0e72a20","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-003","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"7ae27c6094d332b10faa6b2edf4f129131ab7f189434aeb534db35153a00eca8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":28,"source_line_start":11,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"5b1248fbfe2c2cde88297b1b668507bdb48780c7873267620eb9a11fc94ac6af","target_edition_id":"edition.r017.id-id.draft","target_line_end":28,"target_line_start":11,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[11,28],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"66fcf619b44cbc336ae4a8e168abbadff06faeae9c53038cfbc44d53c22274ed","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-004","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"d6478104a470845b9d9aa7dce84f0324616faba802471f4b3439ae1f584d0b79","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":31,"source_line_start":30,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"f28d5928f41dec4a00217cc14c8400bf67f05265a544e00b7d23c786114d3247","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":30,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[30,31],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"688cc56bd02ada4a15b41eb5e7974513ce46e08497a2a1bf3c7ccce55cf23a70","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-005","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"7e2a1765a1bf23c2ad53ca01a9a0b6578e46239d2c24c0ffa6926ecb086901cd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":33,"source_line_start":33,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"7e2a1765a1bf23c2ad53ca01a9a0b6578e46239d2c24c0ffa6926ecb086901cd","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":33,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[33,33],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3e1800df6d8d6a1f8c1609f712d88a8a90dc9eb4df67795ccc256a343a4a92e3","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-006","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"c0e22e3ce9ed9a9b663fbadcec1e84d42e5b41efad806038bf741e43bcd657ba","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":37,"source_line_start":35,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"3b9bd92ddddb0491c6fffc59b71f18e604df08be298ff19a9b208d77319b4df7","target_edition_id":"edition.r017.id-id.draft","target_line_end":37,"target_line_start":35,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[35,37],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6576d7976f536980afa7edade92e5758d5809492dcb65221cf33b4d87d9f511d","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-007","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":39,"source_line_start":39,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":39,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[39,39],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a0279d81a9f8f60909dcf9aeea62549618f74ce8ae1a9215e5d548151bd62aab","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-008","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"03b1c63330002bcce98635173eb11f0d3a4c6ef93465b16654a5b0ec10f04683","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":41,"source_line_start":41,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"614c548f89c85a5ca287036e3ed0a3dbe1b1aac4cf237e6283fc895d1911417d","target_edition_id":"edition.r017.id-id.draft","target_line_end":43,"target_line_start":41,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[41,43],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"59b253e42d13d6085ef143c111067aa06113b026311b71b3ce7b161435a648c8","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-009","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":43,"source_line_start":43,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"f1a8978c0731893c66c4357f2ea9cb1d6b1e23d46d95e2d65e4386e6c8cd817f","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":45,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[45,45],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"467439a07c05fce44d8d81112bd84a324e41d5e148d9de05585afe972fab5b63","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-010","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"67220a966464a7bf24a0e286dfb3e3996d518c7a7696a24e4fac3ca561b12f9e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":47,"source_line_start":45,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"67220a966464a7bf24a0e286dfb3e3996d518c7a7696a24e4fac3ca561b12f9e","target_edition_id":"edition.r017.id-id.draft","target_line_end":49,"target_line_start":47,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[47,49],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f8361cb07e383a21062f15b6d9d3995e7feaa2c9fd7fa61cfc5b92bdb797672b","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-011","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"0fef838539965a6b1c23f3a7cc11d86ac2cb2f7b96f3434d76685f3e05380d8c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":49,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"0fef838539965a6b1c23f3a7cc11d86ac2cb2f7b96f3434d76685f3e05380d8c","target_edition_id":"edition.r017.id-id.draft","target_line_end":51,"target_line_start":51,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[51,51],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9da5630e4d5845dcc755628dc911c7cc94e9d9fbb263120ac6f8ead882bb607a","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-012","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"7e2ff4802250887e9a1cadee3b7f24bd1643a9a46a4ba36afd8f83862a82be6e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":53,"source_line_start":51,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"a1ebccf8523620c8f734a18118713a1d0c7ad82bf59ab03cfa960009bd85abd7","target_edition_id":"edition.r017.id-id.draft","target_line_end":55,"target_line_start":53,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[53,55],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1afa821b40968b1c505c615d4e5dbe39bea5a277590ee71b093c474df10fd941","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-013","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"0c7d07d78dc0ee7f0e7c62c499309b5b43c8148359f8b641a4b367dc8ed07e70","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":55,"source_line_start":55,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"0c7d07d78dc0ee7f0e7c62c499309b5b43c8148359f8b641a4b367dc8ed07e70","target_edition_id":"edition.r017.id-id.draft","target_line_end":57,"target_line_start":57,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[57,57],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82569c76c708097a4bb716132fa929aacb6447d5568e2ea0b27399de1d4ec37f","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-014","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"94f4686f566188d767448955bddafefa7e745781d7afdfafcfed07fd7232deeb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":57,"source_line_start":57,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"94f4686f566188d767448955bddafefa7e745781d7afdfafcfed07fd7232deeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":59,"target_line_start":59,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[59,59],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"71124b7beefe2eacc822c11a56d91d574ceb7a8abc3dd68ffd6cc42e5de52085","concept_ids":[],"id":"segment.r017.book1.frontispiece.block-015","locale":"mul","parent_id":"unit.r017.book1.frontispiece","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"7210bbd4170b7057429ce5a1da7ff3add3fe8b5e76b87bc039acdc78209163b4","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":65,"source_line_start":59,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"7ee7fea0cb3694a999c734f66df0f788f9ce990ff7a7a93d26a2ec15906f8a3e","target_edition_id":"edition.r017.id-id.draft","target_line_end":67,"target_line_start":61,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","translation_state":"translated","unit_id":"unit.r017.book1.frontispiece","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[61,67],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/LP-front-matter.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5977e8353ff4dc945c4a4b5a7bf05acfcfe08a09e76dfed3f917478408fa2e91","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-001","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"752582a96c00d7ce56a03506d133d60a560866fae25dc7c3dac07bf276000889","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"fb1ba4077e039499ab9db35de3db3ea5d7cdf49104802735591a72f0a70645fe","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,3],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1a80c9fdb1df6cdcd5489e77c7810cc18a717aa9119a4cbd7c14163ee28edbe3","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-002","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"5511284a8864fd1f2a3faef7117145fe5efc36af976ac82b79a721cef2fb2b4b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":5,"source_line_start":5,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"dff3991aebedc824f996418b9574c73d7d4c50069dd6e0026f308a841c24eaaa","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":5,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[5,5],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5988ba86acadcd849b00c73e4d2180d4fab2af08c5df1c5f9b934a821fb5b01","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-003","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"91d22ae874ef25c35ba2d03822bb0db6817329a9de62900be69a2c1fc6b31fbe","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":7,"source_line_start":7,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"51d2aa02f6eaa9df4b8ca275bd781c27388b6d23a974c1eef31ee657b86e9954","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":7,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[7,7],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2312b0875045ea831939210053467d4837680ef5802659844f809e54b1213346","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-004","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"85457d339313209cc34d3989b73df04b9bb4baf5e5a4bfae4d48a7aa2d9be01a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":9,"source_line_start":9,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"665d277ce54e7778e226df3a00d4af3131364e4abf7576fc51acb94ffe54fef6","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":9,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[9,9],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1ae588b8903738e6d2a6d18941fba4a6407a50c41ab53adb56a3965de7860a92","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-005","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"c3bffe3294676fac9defcc418c23f687928b7d01291d5b2f1bfc405c40c723d3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":12,"source_line_start":11,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"3677bf7d476bf95e0b59ee02549be8492136f3dcd79df588e2b9c227e1dce647","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":11,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[11,12],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"82c8336ba39fc9b938002c79d3af5cbf9ecf2660df1f7413485d06effbb5e2a4","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-006","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"5b26be2de21c1c4ffe060878a723317f951315b26c9e0153b4758d357aa95ed7","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":15,"source_line_start":14,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"d88ab37b28be66b157a978531ba0081102e90f6bef3a247236b925467f0299f8","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":14,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[14,15],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e60f513e6e12034e9463645ca40e372d42acf88c321c2eaade4f16aa2be91881","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-007","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"8e5f1c345f57939584eca93c5171a84fdcb1b2011ff237bfd63139395de4c51a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":17,"source_line_start":17,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"eafaf95b9029784757c41f26c55440626641a332e2e1864076dd492d4c38cd94","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":17,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[17,17],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"e18f1e82e1eb0e060dbf2384c88df7b5a0c3acc53b7ea72c264e865781a2506a","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-008","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"5a84c07c469f33c9913f9853561dadb349548c0e2da3b5f2a37930dc6974c4fb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":19,"source_line_start":19,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"e2eefb6d83744aa59f69270514849a7c155a74972b84da6fb04674753887adfe","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":19,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[19,19],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f9b31327d84285cc13f0b5227257176c45bb5d42c3d4f3747864d93cfaeb2527","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-009","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"4b0b701815710155d06b16fa37e310ff2e5f1fd1dd4ee9d4c43de6baeeaaf429","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":21,"source_line_start":21,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"3388bed523f83b6c16b474337a7b7d80a8db2ab038c161ff46746716d33aa4c7","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":21,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[21,21],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"3a3fe03eeb5342b6a9b678ddbf5459549f576987f305783bb328b2640b2dad59","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-010","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"fd7cde23e584cfa20768e602facf201c7d879b9bf993f9bb1228a8c804782901","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":23,"source_line_start":23,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"f6dc11db875d0780b1568bb8899b151be0392744bbd691d0df238458564d5851","target_edition_id":"edition.r017.id-id.draft","target_line_end":23,"target_line_start":23,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[23,23],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6dae0850a5847ecf6b7e1edf7c3bebc8c950901f18910283ceddc53cf2a8b82c","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-011","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"b84df0c17b5156a6b8e155a2a59528b86c30b886dbf95458fb8e60d88ae34655","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":25,"source_line_start":25,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"ccdc5348c8b1c0b468ba18412deb7b7fd9ead105303fe3d7b2551bfefcecc2ac","target_edition_id":"edition.r017.id-id.draft","target_line_end":25,"target_line_start":25,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[25,25],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"78a49b3da15354b87c10575aa50236dd973cdeaca786c1617273c191a5fbb918","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-012","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"cd475f727a7f47dbafecaa20f2c81e88e8d8d8a6147e3030cecc698c3dee849c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":27,"source_line_start":27,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"1a4d24ee7b84c4c86b225d2d859d45ab423a8a681eb5a39b4199f1af4a9dd158","target_edition_id":"edition.r017.id-id.draft","target_line_end":27,"target_line_start":27,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[27,27],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9f85934c6448841d96ca1f966e24c2d007d7d9a0d4ca2617b571dcfa027ab743","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-013","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"1626bfeebaa5af3c0f48aa914fc93b2cb521efe8c8bd114bddb51783fa25e900","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":29,"source_line_start":29,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"11478f56ae5b67d88f26ee4103da24ea896732a910cb936cf5ed5358489ec58b","target_edition_id":"edition.r017.id-id.draft","target_line_end":29,"target_line_start":29,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[29,29],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2fe6071c3c73299eea4ca8c167e0408554ea0e41f626ae16b067287f4ff9bd16","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-014","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"29d22c19e776bea807a565dec73da5dc6f5d452060365d8e501ab66ac5ce15eb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":31,"source_line_start":31,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"5e7e6a29f7b3dbdee7a836371578450c1a40c0e26e53ca26a5276e2c78c0b87f","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":31,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[31,31],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"bd15ad249db7a55f6a130f60130826e5dec1a70ad887a68d4754876fe25c44d3","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-015","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"d081e1e072787821309a87b6d7f142908689de846b9908f7dc347bc832e0df52","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":33,"source_line_start":33,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"fe33e9e7ff6ce75fdba6f5940140a4c54682d97ed5e845a8f7f09cb196dee0bd","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":33,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[33,33],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"b3f95407fb0a20dacf0aa235a626a6c3321785f63d52dee755475d2c244e968d","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-016","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"b8687a8ad62d614c74dd06588cff026be40eb49e3bceb10932faf66359a56318","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":35,"source_line_start":35,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"60da73266b14a0f0bad32918e0be1f891f6d1bf3875fbf12969f80b32418c83b","target_edition_id":"edition.r017.id-id.draft","target_line_end":35,"target_line_start":35,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[35,35],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a1cdf301e639f909436d5cddf5736c34e2206c1727f4325f884b20a688a66e6b","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-017","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"4f67cf386e88e6305793767ab1d53b11bc4299bd5fb950c753de49fa41ee5932","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":37,"source_line_start":37,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"d119805c06c78b6eb2e95676029157f7ee6c1ca6b4d06742b5ea88a24d37819a","target_edition_id":"edition.r017.id-id.draft","target_line_end":37,"target_line_start":37,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[37,37],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a24fff76397b5590f261d49b30df8d28f132f64ebbae088a71caca789aa11011","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-018","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"5d4a6fb1cdcbaec33b82de384200074f00fec26c90f7d956d5aea4196d84659c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":39,"source_line_start":39,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"43987da16f72724f96a0252f2b290e1fda5d457316d9f8d1900151fe46638e8e","target_edition_id":"edition.r017.id-id.draft","target_line_end":39,"target_line_start":39,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[39,39],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cb78479d2aa7b8b63a727b95c5d4d0231d61c68e743d89c975f4f3c56145f73e","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-019","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":19,"source_content_sha256":"a9b09578e0c37bcb3611f79f77fd0c6d00ddf193407e58ffdd13a4f71a680e65","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":42,"source_line_start":41,"source_local_id":"block-019","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":19,"target_content_sha256":"5046f3f48212cc249141c316fd629826b92d9b44c302f9950dc88543606a3db3","target_edition_id":"edition.r017.id-id.draft","target_line_end":42,"target_line_start":41,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[41,42],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eb2339af4e6951add3aec2dca5e28ad158052ebd97b38e156bfff8461d2d3179","concept_ids":[],"id":"segment.r017.book1.introduction.text.block-020","locale":"mul","parent_id":"unit.r017.book1.introduction.text","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":20,"source_content_sha256":"efd4bef6269a966e4e8613898a530837bcc48830a333653dd134a311cf30ca79","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":49,"source_line_start":44,"source_local_id":"block-020","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":20,"target_content_sha256":"4c2bf0f6fc18527bb4b2e840b44e09fcacc5651211bf87f04d2bcd362aff1405","target_edition_id":"edition.r017.id-id.draft","target_line_end":50,"target_line_start":44,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","translation_state":"translated","unit_id":"unit.r017.book1.introduction.text","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[44,50],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch01-introduction/introduction-book.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2b21ad921ea0a479c25baeb6a9808a25b67f3ed99dba3d8b9359236e1c52b5cd","concept_ids":[],"id":"segment.r017.book1.notation.block-001","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"79d438cc1362d39093f274b8393e9f91060bc639d0afd722a68aa385709a9cd5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":2,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"254acbc6cf12ca0c57b6158a772e90c85bbb3f23e8c9a9b9ef9786830a62f7ef","target_edition_id":"edition.r017.id-id.draft","target_line_end":2,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,2],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"13ec8c3c9c866497246699cd57d5db03bd0f496388b8bedea8e7aad41f7c3c91","concept_ids":[],"id":"segment.r017.book1.notation.block-002","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"391beac0e7f60ebf40a68e9d126f890b7618b3031eb5a03cd00fdcb7270894a0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":5,"source_line_start":4,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"2052606ec913410907116c5dfc3c2d2005a5a653a335c05d9d83f6c08327c28a","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":4,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[4,5],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"826c1186d55385408f88d464916c9106d22688c1cbe94d66e2b4fdf84e9e89fa","concept_ids":[],"id":"segment.r017.book1.notation.block-003","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"da6ce200ce34caf1eb0fedb865c3c858460f25ad9e5adbb30d839c0d542c8d71","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":7,"source_line_start":7,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"3652b5987e170c18dd170fcbbad3217e81cb8131c311a3c09675e451255df6f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":7,"target_line_start":7,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[7,7],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"720732b25ea6be6ffcf5439b32ff324e4b7119ebbd328a8c7a1567c904773818","concept_ids":[],"id":"segment.r017.book1.notation.block-004","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"594a3bc5ef66ecf2f537ed9ce7230942b8696b290cd96af76d2d30360538ec27","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":9,"source_line_start":9,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"e48ca79059d335b322086b0b0adbd204c98a7641796604dcd5feee08d320abc6","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":9,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[9,9],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"c2278f1a5b729e0eae45b45a0cb553edf4b573cdd7db11ea444bf21579963123","concept_ids":[],"id":"segment.r017.book1.notation.block-005","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"9025e5733d6403fda98be801f461bebbbe4d19b62c6b892f30c2435d9901760b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":19,"source_line_start":11,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"945e400b40ffeb57c5cb184bc6ad0f3813e4f6d7664cc6d73fbf9c87ae1b9cb6","target_edition_id":"edition.r017.id-id.draft","target_line_end":19,"target_line_start":11,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[11,19],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f5b82983bb8647f01709020a82706ff3b4d53c6f163b5337cc1aea3e39d77923","concept_ids":[],"id":"segment.r017.book1.notation.block-006","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"881b3a6372ed844198586f920c78b2e7269c41f6a7333e11ec2c6d28fa62b85e","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":21,"source_line_start":21,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"a1efbaf3a0c4c2df66e6912cbbe1bc53963e18498b5bd79ef73ed4b11b47cdbe","target_edition_id":"edition.r017.id-id.draft","target_line_end":21,"target_line_start":21,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[21,21],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"04540bcc6929d048b222efa0c4af4337265de769dfc60bd9eeaa5a5e628d5968","concept_ids":[],"id":"segment.r017.book1.notation.block-007","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"b1d4c761fabea2da1ca62bc72a273a827785a63bf15d8a1be408c580264758b2","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":34,"source_line_start":23,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"533dc891d40a43bdc83c1a1aca32c03f4a80dabbb309ffbe213c618993efea30","target_edition_id":"edition.r017.id-id.draft","target_line_end":34,"target_line_start":23,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[23,34],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0dae4fc7caa45e2d87e45cf4a35790fd65b2d18e71f771f7384f2e7977337c38","concept_ids":[],"id":"segment.r017.book1.notation.block-008","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"75e0fdcbb24d41ccac3943d234e38f2ac3a2d2cfb56e0bec5d83963a30a3dd7d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":36,"source_line_start":36,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"8faa1fa20e324425d6ae46d0280255b718e18b13f026101e92377193c77222c7","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":36,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[36,36],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"49019980f55d1b7d31c8067bf74d0d180dec55f1f914b5f8c790990c34c478a9","concept_ids":[],"id":"segment.r017.book1.notation.block-009","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"be818a73e5b69de0a9dcabda140f252f89d2e15e7ed334e2a1ccd70aefcaeb57","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":45,"source_line_start":38,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"24a3f79de21e441f630d303ab384d8db9d02df6580ee0c56f57bfad1ead2ae01","target_edition_id":"edition.r017.id-id.draft","target_line_end":45,"target_line_start":38,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[38,45],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c0196a847ae94a8903ae40a434c2ac8dec1bd82f11a3290b267eed8d2a3b143","concept_ids":[],"id":"segment.r017.book1.notation.block-010","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"0efe4e1bba7e64360ecdb5c486c58b601690068912a0f0cc6e23f4078678592b","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":53,"source_line_start":47,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"9eeb061c9bb978bbfad60d3ec76ee3f878e91e48ceaf035567464950e3272fed","target_edition_id":"edition.r017.id-id.draft","target_line_end":53,"target_line_start":47,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[47,53],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7c2043ee11e33bff4fdc3d3e884140d22b9daf7e8f9f46dc9e925d91e0ec9d61","concept_ids":[],"id":"segment.r017.book1.notation.block-011","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"cdd5c5141ba39f370442590d44d9261754f4bb9a741361706725e8015cd1d1eb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":55,"source_line_start":55,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"e7a8dd72ce809211759e8a0d6d79e468e08a06a66f35c6ae9961038095107f9d","target_edition_id":"edition.r017.id-id.draft","target_line_end":55,"target_line_start":55,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[55,55],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"81940c3d306998ea2a2c4b6b9e634d5e33b0fbc9911d913eb73037bb1056fedf","concept_ids":[],"id":"segment.r017.book1.notation.block-012","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"4917b6b380f621cbb43b42494c86c8345f155b509e45c25b82eeb4a718d070b6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":63,"source_line_start":57,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"f01c380a01386452053d9e9985f76569f7bbd29486e304b4336586263167c14d","target_edition_id":"edition.r017.id-id.draft","target_line_end":63,"target_line_start":57,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[57,63],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"134580f50d4eb3354894cc91fe9c22ce7f17683117954040db6da1a72dd96dda","concept_ids":[],"id":"segment.r017.book1.notation.block-013","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"fe0a50ea195be5fb7024879a10839000a0282db21bdb195e11f325f99319e918","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":65,"source_line_start":65,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"fcb20a92b912c5379366e1e44a3d4781779335c2de1217cb3ca1bc99cf335c3a","target_edition_id":"edition.r017.id-id.draft","target_line_end":65,"target_line_start":65,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[65,65],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"58f1c2c4d1b523f79570c11ca6ee532ba6e0230845423049867e011cc4043752","concept_ids":[],"id":"segment.r017.book1.notation.block-014","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"67e4762f413d52b5fa8bfc3bbdfa43f46cdeaf81fdc4dc407f26e37b91ba6b48","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":74,"source_line_start":67,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"848ccb8f0130daf3b8444753a51e6913b9e4d6c581dc144042b0f7dc51c47ab7","target_edition_id":"edition.r017.id-id.draft","target_line_end":74,"target_line_start":67,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[67,74],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9dd1b30484b3496fda1b5b37e835420d6e2190cf98a585cad254ae97daa9e07b","concept_ids":[],"id":"segment.r017.book1.notation.block-015","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"0d9d7f9de621b3e7f27533a00f688e48cf83423fe25543657909dad61ef1eaa0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":76,"source_line_start":76,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"05f9404bef20301f45c47b9f191d67ccccf447145cd7649089ed83c0f76e8235","target_edition_id":"edition.r017.id-id.draft","target_line_end":76,"target_line_start":76,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[76,76],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"42bfe9118b911fa346787139f2618511e279b32ea4a5d9a1ec1c0c5a56b3bf56","concept_ids":[],"id":"segment.r017.book1.notation.block-016","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"add4d9bbdb047a9cfea1a24042931bb8d4d4a075e9c1486e8cbe5f78cf1654ea","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":82,"source_line_start":78,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"b5c526924884665343f0c33a1cbdcc9129147ca7f63424f8584795a7c8e4b68e","target_edition_id":"edition.r017.id-id.draft","target_line_end":82,"target_line_start":78,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[78,82],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ae37885ae634c52e6202aeadca17244354a18f0ffa04d5409e0b9b8dea5cf532","concept_ids":[],"id":"segment.r017.book1.notation.block-017","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"63439b0a7a4e74ee8ecf6bc6629447d69dbad2b0f7ffcc0363c82183e316b73f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":84,"source_line_start":84,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"07fdb40084d5658310db569e7649ba7ce2cd0f66dbbbeaa14a33f78ce6405ed6","target_edition_id":"edition.r017.id-id.draft","target_line_end":84,"target_line_start":84,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[84,84],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"71fcab8c5332bac1babf6126567b6c512355e0122e0bb87fc61b9b4882e2b1ce","concept_ids":[],"id":"segment.r017.book1.notation.block-018","locale":"mul","parent_id":"unit.r017.book1.notation","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"3d2de0c03a8437b540ce634056a1a4857a5198b0f32312d066f07939371c46b0","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":95,"source_line_start":86,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"885b5c528b4f01bd0e28d035606244e35624c95b4f8c43a61ec104a5b5fc1a65","target_edition_id":"edition.r017.id-id.draft","target_line_end":95,"target_line_start":86,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/notation.tex","translation_state":"translated","unit_id":"unit.r017.book1.notation","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[86,95],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/notation.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f867f2a08b669a6a7e70656af4c135d7d9f865301ffafd54f2b8ae1028572d57","concept_ids":[],"id":"segment.r017.book1.preface.block-001","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"34e6ade92133f0693023c0160525e20a5fac090d9ea571efc50ac802bd7b4b3f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":1,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"ed81e12415f3d81e288574f44e2a307504560b85b6319c1025dcc5c9c55aee88","target_edition_id":"edition.r017.id-id.draft","target_line_end":1,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,1],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2f313f90f82f92e1da4c5df7b05a4374b4d2d84cb03e68dcee068b51a341c155","concept_ids":[],"id":"segment.r017.book1.preface.block-002","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"6d21c46e9f32aa0f979e155462d943ea1ed601c8a8fc424e03ffa1e76f28dd4a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3,"source_line_start":3,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"20813ef91ee23d4d612b28e6a969373a76d2b93ffe26ccbf28a1d2cc08a92434","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":3,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[3,3],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"eab9d1f28890c2b26bd0a32e564c1144561c69c64f58fc6641b12db7074e67cc","concept_ids":[],"id":"segment.r017.book1.preface.block-003","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"3bb5dfb9bff33b75545260529c8ba5b9ab5266d869c3bc2b5e901082e3a8a91a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":5,"source_line_start":5,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"299f331363085a5eadadfb5a2da21a4869e8f0fc0444818525f1be61920c120b","target_edition_id":"edition.r017.id-id.draft","target_line_end":5,"target_line_start":5,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[5,5],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a5e7fe551379363ed2d661d2e057b9143c73f1ec83035167b551b215797ae02c","concept_ids":[],"id":"segment.r017.book1.preface.block-004","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"222a1d73153ec2cb725603a68930b5c1f8e24e07202d4b86a819a778e93f67c3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":9,"source_line_start":7,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"e5cd90c46be96348b80bbaf7e89a62c7c03fe310d1dfb5ee41b3a46c6af0fd99","target_edition_id":"edition.r017.id-id.draft","target_line_end":9,"target_line_start":7,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[7,9],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d3da8abf87585052209ee98b5be2a12f0964ceb938b03f60e760caa25b566aaf","concept_ids":[],"id":"segment.r017.book1.preface.block-005","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"15509f1e10c740f7e5c396a046f4002e557901581aa1a2c8f683d0b1fef814c5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":12,"source_line_start":11,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"8728b1b0b5af59b8ee9e17722a9db933fc4c9a16e0f459d4c92528ebb1f2d8a5","target_edition_id":"edition.r017.id-id.draft","target_line_end":12,"target_line_start":11,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[11,12],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"5a4597bb8ef523b13335d8fe049d49ecaccc5ad4c7dfaa303e9ecc75383e65f0","concept_ids":[],"id":"segment.r017.book1.preface.block-006","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"b9e37e12261e484d96711a2c4f2c9b972b96258e1410f3d5473f62f312ebb852","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":15,"source_line_start":14,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"1c7357a18a552f03c62a28c8b561936986a83a6f0eaef1c2ae7e507617099fd9","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":14,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[14,15],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4b584e8922e1d73ef238dcf358241501d96c9ea4c3472fbacdb450fb82cf41fd","concept_ids":[],"id":"segment.r017.book1.preface.block-007","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"f24d353ec472d16ab3ef64317eb4f961f58649315bc6ff3f41339b642b04516d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":17,"source_line_start":17,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"bb0fc473f760a1a70d625d937698dada49a50d1c75588c8050e15c15e88e8de2","target_edition_id":"edition.r017.id-id.draft","target_line_end":17,"target_line_start":17,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[17,17],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d69b4b059291b59c5fc166e9fdbbf21c5d46130cb777924faef9ca8c42876ea1","concept_ids":[],"id":"segment.r017.book1.preface.block-008","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"b3c928d6c0e650572288c9f5893bdc44f5806cade890128bfafac0fe7d697d4c","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":20,"source_line_start":19,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"361e2a7f1a1716ac2c1a882e3bed6d70e8e6fde2070b63b7df3732c685457f7b","target_edition_id":"edition.r017.id-id.draft","target_line_end":20,"target_line_start":19,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[19,20],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"0e2e1534bfd8c5635db1041679a1cdf608102fd167d7777ded7dbde363ade9f4","concept_ids":[],"id":"segment.r017.book1.preface.block-009","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"cf1898a325e898b2fa4cc103710de339038cc2516a3fa52c18018b2ab2ab22e1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":22,"source_line_start":22,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"0e4ff3a8f2523810dc78fb0692a897606ff559e6d09a90a63d52f6dc41ae7467","target_edition_id":"edition.r017.id-id.draft","target_line_end":22,"target_line_start":22,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[22,22],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ccbef394b631dadb9190606baa09cf2f3436c7e2f214c8df84c557ee912b4ed4","concept_ids":[],"id":"segment.r017.book1.preface.block-010","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"3a66e3e6c6a4ac93761247097a6bb2fd6c9f07cb3ac372315bf6368cc2faa664","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":25,"source_line_start":24,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"4e89ac3968e8ab886d83fc53fa4a24f950a1347402bec5cc81660c3b70affd5b","target_edition_id":"edition.r017.id-id.draft","target_line_end":25,"target_line_start":24,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[24,25],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"9e8cc18f0b475e2461945b4e046e8b7b49772b702f7ff4c47c38618ebdd9348e","concept_ids":[],"id":"segment.r017.book1.preface.block-011","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"c23c16db8546ac18d011c4934a7029a987047cb9c003f81be2894ce2e7bfceda","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":29,"source_line_start":27,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"0f77bd79d315fff8de95daa3d5a9bfa619be01beb90e0f0b0f7ef70affd2ecac","target_edition_id":"edition.r017.id-id.draft","target_line_end":29,"target_line_start":27,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[27,29],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2a7445258eb6ed2c276c1ff00d414a1cc770233f670c7d48679349f806d92121","concept_ids":[],"id":"segment.r017.book1.preface.block-012","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"74c7e8d529c8ad153908492caef8653ab75952588a187cc187987b87d0330bea","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":31,"source_line_start":31,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"50b098f30961536faa8b3f2611b11ee5149eef97e3a71b8bf726d3900b546085","target_edition_id":"edition.r017.id-id.draft","target_line_end":31,"target_line_start":31,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[31,31],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"2443a311c9591e85e1d2e886327755db1ccec6cef7382cad26ec62992fbbe200","concept_ids":[],"id":"segment.r017.book1.preface.block-013","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"f469813edfc13c9b9359e7bfb40c6e4b0afeb63b6634d538b3234d6bd2b54389","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":33,"source_line_start":33,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"267d0ec5222e053919c03ed18eb623821e04f5900baf7cf89d99c89da26bb8f9","target_edition_id":"edition.r017.id-id.draft","target_line_end":33,"target_line_start":33,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[33,33],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fc87b1a992a572de1ff3446152228598928f27faace27e256d5e00912823cf76","concept_ids":[],"id":"segment.r017.book1.preface.block-014","locale":"mul","parent_id":"unit.r017.book1.preface","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"94f4686f566188d767448955bddafefa7e745781d7afdfafcfed07fd7232deeb","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":35,"source_line_start":35,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"94f4686f566188d767448955bddafefa7e745781d7afdfafcfed07fd7232deeb","target_edition_id":"edition.r017.id-id.draft","target_line_end":36,"target_line_start":35,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/preface.tex","translation_state":"translated","unit_id":"unit.r017.book1.preface","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[35,36],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/preface.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a17309b985161d5e643dde0972b2a1d28f9c490b5b78a38c236d37da635bedba","concept_ids":[],"id":"segment.r017.book1.sources.block-001","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"83c213b1bc552b389aac07639ab9264cf6fa059d31fe2be491c2e15f0d7da191","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":3,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"ffbf5e3d21ed918b3cf8b33f12da847946b66b4301e61a70f5eef180df11f1f4","target_edition_id":"edition.r017.id-id.draft","target_line_end":3,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,3],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fb3a073465d7f360ebeda52ea9658463c0849d941a3bd0169507c7bcc2cacaa5","concept_ids":[],"id":"segment.r017.book1.sources.block-002","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"02f2036fa0e60cdf1543bafaf3e4c307d5d99a8e3bb08322081b6bccce99a9da","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":11,"source_line_start":5,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"685c8707c4a8615a610c876eb2d32cea14daab38b4a2f6687b40e17b3d99744d","target_edition_id":"edition.r017.id-id.draft","target_line_end":11,"target_line_start":5,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[5,11],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"f8cc1bd568d1b840081b0127a15ba5d6cd9689f76a8fc49217aefae91d80a658","concept_ids":[],"id":"segment.r017.book1.sources.block-003","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":3,"source_content_sha256":"05c5d023d3c38d4887179b9643c17088651c43472d8b7ac4f9b58fd1efb5d335","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":15,"source_line_start":13,"source_local_id":"block-003","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":3,"target_content_sha256":"7e108909bf8fc17737800f08ac0671d6547a67595fa6b0b1aeff1a9429eb981a","target_edition_id":"edition.r017.id-id.draft","target_line_end":15,"target_line_start":13,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[13,15],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d2f53c43af6c8627527f3a4ed4479e386eceb22ec27c07e61a3b888a0f5de2c3","concept_ids":[],"id":"segment.r017.book1.sources.block-004","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":4,"source_content_sha256":"8c33e13fe50c4db47789cfdd7f9d0b9c77c52b7472f3078c88045502c3d07b1f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":30,"source_line_start":17,"source_local_id":"block-004","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":4,"target_content_sha256":"525ae0a88b47c666d60b3dd5a91d3ff3200f35da14e16f77568acbe0ed0c4995","target_edition_id":"edition.r017.id-id.draft","target_line_end":30,"target_line_start":17,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[17,30],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"7980b7ebbc09aa90a3ac875d08f5a85ae795b199c2a575b56447334c8e221f7d","concept_ids":[],"id":"segment.r017.book1.sources.block-005","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":5,"source_content_sha256":"6c39412d16424cf45566f4aed5ce906fca2c8792392c77c1c5f81d8849f6eca8","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":47,"source_line_start":32,"source_local_id":"block-005","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":5,"target_content_sha256":"ff05027232fcf8fc233e77fd324e1b67a52eed6249ee5a0a9d8c9dcfd04d54c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":47,"target_line_start":32,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[32,47],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d958c28606420906766144d5ae1767239a6de5ef98e78031af219c44372fa54e","concept_ids":[],"id":"segment.r017.book1.sources.block-006","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":6,"source_content_sha256":"b917f8c0e17b1dfae15699ddc5e05298d5c2d2fa647da8ac111a6d90488185a5","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":63,"source_line_start":49,"source_local_id":"block-006","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":6,"target_content_sha256":"2994848ab88336e05539850b236d076aeda227cb34d9c2d12fe2ee2c190fb4c0","target_edition_id":"edition.r017.id-id.draft","target_line_end":63,"target_line_start":49,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[49,63],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"d44eb5b2370e44c7575eab3bce1f4845f0f94b7381480ccb7e3f692b55c64ae3","concept_ids":[],"id":"segment.r017.book1.sources.block-007","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":7,"source_content_sha256":"c146e7d2c7e421d21afc806e7ac15229e6a04bc707ac302bad29bccab0c0df6d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":77,"source_line_start":65,"source_local_id":"block-007","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":7,"target_content_sha256":"0a5c8efcd5a285c8ea6e6073b6ccf00359210e60d8f57b2475233642c1fe7360","target_edition_id":"edition.r017.id-id.draft","target_line_end":77,"target_line_start":65,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[65,77],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4337c42a3653fd218772b6974dceb5c0030ece6cfcba90a3bed629922f42da96","concept_ids":[],"id":"segment.r017.book1.sources.block-008","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":8,"source_content_sha256":"42487b78542f7caf72b4d47e159706d6598fe9f0d5050f1f2184c8c8cc6d734a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":94,"source_line_start":79,"source_local_id":"block-008","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":8,"target_content_sha256":"d9ba77aa635c983c1002cdc727afb3fa7ba20213427b452f1792845695202ca4","target_edition_id":"edition.r017.id-id.draft","target_line_end":98,"target_line_start":79,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[79,98],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"56260152eaf8e70bba2065da9e90037a4da5e9907127d260514c59bbcbe45793","concept_ids":[],"id":"segment.r017.book1.sources.block-009","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":9,"source_content_sha256":"b8d14763715a8f187b532efcedc21fb77bc6a15ef77f2e52f99dc51e5c6c076f","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":109,"source_line_start":96,"source_local_id":"block-009","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":9,"target_content_sha256":"19c1ef8c5cfd8f156b06997a77939612f78bd9ea8de2dd3bec536c694ea72ae1","target_edition_id":"edition.r017.id-id.draft","target_line_end":113,"target_line_start":100,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[100,113],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"a89da25b4a7e5ecc0aadbc4bbc02831956ba7b3049fee6ac7358db1fdb6fbacf","concept_ids":[],"id":"segment.r017.book1.sources.block-010","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":10,"source_content_sha256":"35c2996ca7e46e2f59f5ee6e7cdc9aae95ffd44ae07706f820a5d7a15b012b4d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":113,"source_line_start":111,"source_local_id":"block-010","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":10,"target_content_sha256":"35bd92f10684de1bf85b3fcda325421ef0f3b85bb0bda9953f5e561baf876109","target_edition_id":"edition.r017.id-id.draft","target_line_end":117,"target_line_start":115,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[115,117],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"50c52cb594f1872f0b1c52cd5bcbd960f89429df6e436131ccef19d96880220c","concept_ids":[],"id":"segment.r017.book1.sources.block-011","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":11,"source_content_sha256":"f8bf023320e5a586c8e0aa26d844f34f27b99703340f154c97fb7d23b5905ab6","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":120,"source_line_start":115,"source_local_id":"block-011","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":11,"target_content_sha256":"57f5c8deb66656e4d8646335c4a9e5616ae3d62bee2ce310058540ed36ae5304","target_edition_id":"edition.r017.id-id.draft","target_line_end":124,"target_line_start":119,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[119,124],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"1184d9297e0044dd68dad91fedd63baaad16a0131e82cf3e406dc744537633fd","concept_ids":[],"id":"segment.r017.book1.sources.block-012","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":12,"source_content_sha256":"38f9b23dedb3b4bf75512c9fb5a1c74ccef542327578e812b693a0312cf4770d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":129,"source_line_start":122,"source_local_id":"block-012","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":12,"target_content_sha256":"8b02d3af5898ed9342319e66fe374cc27c3f709e3e4d05ccf68a06f31a35a452","target_edition_id":"edition.r017.id-id.draft","target_line_end":131,"target_line_start":126,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[126,131],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"8410e3b18c4cd51d131bdade3c6930227d194964b8931866ee75fa4825a3b543","concept_ids":[],"id":"segment.r017.book1.sources.block-013","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":13,"source_content_sha256":"48d34175ad93a1dca5de7992248f923d3f6471e7b469fe5bc1709a95136cb8fd","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":133,"source_line_start":131,"source_local_id":"block-013","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":13,"target_content_sha256":"f0309109ea6db57a3c7fe74449eb21014fc9b8004169054e7930d0c033626e37","target_edition_id":"edition.r017.id-id.draft","target_line_end":141,"target_line_start":133,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[133,141],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"17ef15ed8721b1b5e79028843debf605b0edb50cd53d37a7d3f40b582a6d9f1b","concept_ids":[],"id":"segment.r017.book1.sources.block-014","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":14,"source_content_sha256":"99fbdcfca303b8aac041377e0388235461d8dabc391e18251b0d275280dc355d","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":143,"source_line_start":135,"source_local_id":"block-014","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":14,"target_content_sha256":"f303baee1617d1733c1fb5ed238bdbc74247876be8d81f9e39baa33893935e12","target_edition_id":"edition.r017.id-id.draft","target_line_end":145,"target_line_start":143,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[143,145],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"61f46ee651db6fe282e2884757a8417e37d0922afe25190b14bfb67d6bd34e35","concept_ids":[],"id":"segment.r017.book1.sources.block-015","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":15,"source_content_sha256":"1d3037cbd2de8b6f84e069dbaf840eabd4419d5bbfa49a1cd04f615530635dd1","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":147,"source_line_start":145,"source_local_id":"block-015","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":15,"target_content_sha256":"0d512da3c03175a8d9aa0d25917cac2e335bc4505191db91b5eb601a15ce4843","target_edition_id":"edition.r017.id-id.draft","target_line_end":154,"target_line_start":147,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[147,154],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"ce7b03e1ce324a65333eabbc126aa61463356e157fd756b464d7e6f3b7ab81ed","concept_ids":[],"id":"segment.r017.book1.sources.block-016","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":16,"source_content_sha256":"6750727c57f1dc508124763b01d90c24edc0592e62dc9446e323eeb0834e18ca","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":161,"source_line_start":149,"source_local_id":"block-016","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":16,"target_content_sha256":"ff3c5ef1beb81b32536d748332be3b150e395278983683ca615280be17a6c1ab","target_edition_id":"edition.r017.id-id.draft","target_line_end":158,"target_line_start":156,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[156,158],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"cbb0efe27db5a4e3dfd179f59f627ba8a3bbd1091b6b50eb00ce67d6a7c4a48f","concept_ids":[],"id":"segment.r017.book1.sources.block-017","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":17,"source_content_sha256":"80e2f774a54c15afaca2b2f6c48b879aed5a4d8e8c5bf2a46c9064633f96dd26","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":167,"source_line_start":163,"source_local_id":"block-017","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":17,"target_content_sha256":"bab731e6498a1decfbdfb0cd5d357413a9d98b6457d86a231fcd90674c703cbb","target_edition_id":"edition.r017.id-id.draft","target_line_end":175,"target_line_start":160,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[160,175],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"849127f10a9f96695f2c61b00986c20227ba4a68a3f94e1d57605fc5d53fdb74","concept_ids":[],"id":"segment.r017.book1.sources.block-018","locale":"mul","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":18,"source_content_sha256":"282b49e950e477e7bfed4532fb2ddd58322e35eb3322dfe3d023af63f75bfc84","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":170,"source_line_start":169,"source_local_id":"block-018","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":18,"target_content_sha256":"2f88f9129c96f49b81423bc93eeae18f7a24e264578489acd56e8346b5c0fb04","target_edition_id":"edition.r017.id-id.draft","target_line_end":181,"target_line_start":177,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"translated","unit_id":"unit.r017.book1.sources","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[177,181],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"fab6c8e13f59f37989186978e57485a6694159eca06c350b8910b30c667dedd0","concept_ids":[],"id":"segment.r017.book1.sources.target-only-cleardoublepage","locale":"id-ID","parent_id":"unit.r017.book1.sources","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_edition_id":null,"source_local_id":null,"source_locale":null,"source_path":null,"source_target_relationship":"target_native_correction","status":"verified","supersedes_id":null,"target_block_index":19,"target_content_sha256":"282b49e950e477e7bfed4532fb2ddd58322e35eb3322dfe3d023af63f75bfc84","target_edition_id":"edition.r017.id-id.draft","target_line_end":184,"target_line_start":183,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","translation_state":"structurally_verified","unit_id":"unit.r017.book1.sources","verification":{"source":{"state":"no_native_text"},"target":{"archive":"source","line_range":[183,184],"member":"source/Intro-Math-Programming/baseText/book/frontmatter/sources-attribution.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"6594e9fdcf6e1c431dbd88825520b194fc01b6c93876d86803e0a59e6a025fcf","concept_ids":[],"id":"segment.r017.book1.title.block-001","locale":"mul","parent_id":"unit.r017.book1.title","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":1,"source_content_sha256":"cac8faa3bdb28e73475d74b42105f6b85a76a241a9644b1d522ce4f86164fad3","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":4,"source_line_start":1,"source_local_id":"block-001","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/preamble/title.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":1,"target_content_sha256":"9196df7c0893bbba11b4b6d795926f87cf47dc71abb333b42a5b2f0235355d84","target_edition_id":"edition.r017.id-id.draft","target_line_end":4,"target_line_start":1,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/preamble/title.tex","translation_state":"translated","unit_id":"unit.r017.book1.title","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[1,4],"member":"source/Intro-Math-Programming/baseText/book/preamble/title.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}},{"canonical_native_record_sha256":"4e1836d5233243a1f733d18efbd540f1063a9b8145aaf920ee67cda51d6472e5","concept_ids":[],"id":"segment.r017.book1.title.block-002","locale":"mul","parent_id":"unit.r017.book1.title","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","source_block_index":2,"source_content_sha256":"4a9a4da607a7c1b5ae6f08fbd27da9f0cdf93b1e1f123bb1f848bcb98fe82c9a","source_edition_id":"edition.r017.upstream.1745df89","source_line_end":10,"source_line_start":6,"source_local_id":"block-002","source_locale":"en","source_path":"Intro-Math-Programming/baseText/book/preamble/title.tex","source_target_relationship":"translation","status":"translated","supersedes_id":null,"target_block_index":2,"target_content_sha256":"4a9a4da607a7c1b5ae6f08fbd27da9f0cdf93b1e1f123bb1f848bcb98fe82c9a","target_edition_id":"edition.r017.id-id.draft","target_line_end":10,"target_line_start":6,"target_locale":"id-ID","target_path":"Intro-Math-Programming/baseText/book/preamble/title.tex","translation_state":"translated","unit_id":"unit.r017.book1.title","verification":{"source":{"native_text_digest_matches":true,"state":"english_source_not_rechecked_in_target_archives"},"target":{"archive":"source","line_range":[6,10],"member":"source/Intro-Math-Programming/baseText/book/preamble/title.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"}}}],"terms":[{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.absolute-value-linearization","evidence":"Final id-ID corpus terminology audit","id":"term.absolute-value-linearization.id","preferred":"linearisasi nilai mutlak","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"absolute-value linearization","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch02.text.block-031"],"native":{"concept_id":"concept.lp-modeling-assumptions","evidence":"Chapter 2 Assumptions section","id":"term.additivity.id","preferred":"aditivitas","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear-programming modeling assumption","source_locale":"en","source_term":"additivity","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch05.readme.block-001","segment.o018.lab.ch05.readme.block-002","segment.o018.lab.ch05.readme.block-003","segment.o018.lab.ch05.readme.block-004","segment.o018.lab.ch05.readme.block-005","segment.o018.lab.ch05.readme.block-006","segment.o018.lab.ch05.readme.block-007","segment.o018.lab.ch05.readme.block-008","segment.o018.lab.ch05.readme.block-009","segment.o018.lab.ch05.readme.block-010","segment.o018.lab.ch05.readme.block-011","segment.o018.lab.ch05.readme.block-012","segment.o018.lab.ch05.readme.block-013","segment.o018.lab.ch05.readme.block-014","segment.r017.book1.ch05.text.block-164"],"native":{"concept_id":"concept.alternate-optima","evidence":"Chapter 5 terminology decision","id":"term.alternate-optima.id","preferred":"solusi optimal alternatif","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear programming","source_locale":"en","source_term":"alternate optimal solutions","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["beberapa optimum"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch14.attribution.block-001","segment.o018.lab.ch14.attribution.block-002","segment.o018.lab.ch14.attribution.block-003","segment.o018.lab.ch14.attribution.block-004","segment.o018.lab.ch14.attribution.block-005","segment.o018.lab.ch14.attribution.block-006","segment.o018.lab.ch14.attribution.block-007","segment.o018.lab.ch14.attribution.block-008","segment.o018.lab.ch14.attribution.block-009","segment.o018.lab.ch14.attribution.block-010","segment.o018.lab.ch14.attribution.block-011","segment.o018.lab.ch14.attribution.block-012","segment.o018.lab.ch14.attribution.block-013","segment.o018.lab.ch14.attribution.block-014","segment.o018.lab.ch14.attribution.block-015","segment.o018.lab.ch14.attribution.block-016","segment.o018.lab.ch14.readme.block-001","segment.o018.lab.ch14.readme.block-002","segment.o018.lab.ch14.readme.block-003","segment.o018.lab.ch14.readme.block-004","segment.o018.lab.ch14.readme.block-005","segment.o018.lab.ch14.readme.block-006","segment.o018.lab.ch14.readme.block-007","segment.o018.lab.ch14.readme.block-008","segment.o018.lab.ch14.readme.block-009","segment.o018.lab.ch14.readme.block-010","segment.r017.book1.ch04.text-b.block-001","segment.r017.book1.ch04.text-b.block-183","segment.r017.book1.ch14.solutions-manual.block-001","segment.r017.book1.ch14.solutions-manual.block-002","segment.r017.book1.ch14.solutions-manual.block-003","segment.r017.book1.ch14.solutions-manual.block-004","segment.r017.book1.ch14.solutions-manual.block-005","segment.r017.book1.ch14.solutions-manual.block-006","segment.r017.book1.ch14.solutions-manual.block-007","segment.r017.book1.ch14.solutions-manual.block-008","segment.r017.book1.ch14.solutions-manual.block-009","segment.r017.book1.ch14.solutions-manual.block-010","segment.r017.book1.ch14.solutions-manual.block-011","segment.r017.book1.ch14.solutions-manual.block-012","segment.r017.book1.ch14.solutions-manual.block-013","segment.r017.book1.ch14.solutions-manual.block-014","segment.r017.book1.ch14.solutions-manual.block-015","segment.r017.book1.ch14.solutions-manual.block-016","segment.r017.book1.ch14.solutions-manual.block-017","segment.r017.book1.ch14.solutions-manual.block-018","segment.r017.book1.ch14.solutions-manual.block-019","segment.r017.book1.ch14.solutions-manual.block-020","segment.r017.book1.ch14.solutions-manual.block-021","segment.r017.book1.ch14.solutions-manual.block-022","segment.r017.book1.ch14.solutions-manual.block-023","segment.r017.book1.ch14.solutions-manual.block-024","segment.r017.book1.ch14.solutions-manual.block-025","segment.r017.book1.ch14.solutions-manual.block-026","segment.r017.book1.ch14.solutions-manual.block-027","segment.r017.book1.ch14.solutions-manual.block-028","segment.r017.book1.ch14.solutions-manual.block-029","segment.r017.book1.ch14.solutions-manual.block-030","segment.r017.book1.ch14.solutions-manual.block-031","segment.r017.book1.ch14.solutions-manual.block-032","segment.r017.book1.ch14.solutions-manual.block-033","segment.r017.book1.ch14.solutions-manual.block-034","segment.r017.book1.ch14.solutions-manual.block-035","segment.r017.book1.ch14.solutions-manual.block-036","segment.r017.book1.ch14.solutions-manual.block-037","segment.r017.book1.ch14.solutions-manual.block-038","segment.r017.book1.ch14.solutions-manual.block-039","segment.r017.book1.ch14.solutions-manual.block-040","segment.r017.book1.ch14.solutions-manual.block-041","segment.r017.book1.ch14.solutions-manual.block-042","segment.r017.book1.ch14.solutions-manual.block-043","segment.r017.book1.ch14.solutions-manual.block-044","segment.r017.book1.ch14.solutions-manual.block-045","segment.r017.book1.ch14.solutions-manual.block-046","segment.r017.book1.ch14.solutions-manual.block-047","segment.r017.book1.ch14.solutions-manual.block-048","segment.r017.book1.ch14.solutions-manual.block-049","segment.r017.book1.ch14.solutions-manual.block-050","segment.r017.book1.ch14.solutions-manual.block-051","segment.r017.book1.ch14.solutions-manual.block-052","segment.r017.book1.ch14.solutions-manual.block-053","segment.r017.book1.ch14.solutions-manual.block-054","segment.r017.book1.ch14.solutions-manual.block-055","segment.r017.book1.ch14.solutions-manual.block-056","segment.r017.book1.ch14.solutions-manual.block-057","segment.r017.book1.ch14.solutions-manual.block-058","segment.r017.book1.ch14.solutions-manual.block-059","segment.r017.book1.ch14.text.block-001","segment.r017.book1.ch14.text.block-002","segment.r017.book1.ch14.text.block-003","segment.r017.book1.ch14.text.block-004","segment.r017.book1.ch14.text.block-005","segment.r017.book1.ch14.text.block-006","segment.r017.book1.ch14.text.block-007","segment.r017.book1.ch14.text.block-008","segment.r017.book1.ch14.text.block-009","segment.r017.book1.ch14.text.block-010","segment.r017.book1.ch14.text.block-011","segment.r017.book1.ch14.text.block-012","segment.r017.book1.ch14.text.block-013","segment.r017.book1.ch14.text.block-014","segment.r017.book1.ch14.text.block-015","segment.r017.book1.ch14.text.block-016","segment.r017.book1.ch14.text.block-017","segment.r017.book1.ch14.text.block-018","segment.r017.book1.ch14.text.block-019","segment.r017.book1.ch14.text.block-020","segment.r017.book1.ch14.text.block-021","segment.r017.book1.ch14.text.block-022","segment.r017.book1.ch14.text.block-023","segment.r017.book1.ch14.text.block-024","segment.r017.book1.ch14.text.block-025","segment.r017.book1.ch14.text.block-026","segment.r017.book1.ch14.text.block-027","segment.r017.book1.ch14.text.block-028","segment.r017.book1.ch14.text.block-029","segment.r017.book1.ch14.text.block-030","segment.r017.book1.ch14.text.block-031","segment.r017.book1.ch14.text.block-032","segment.r017.book1.ch14.text.block-033","segment.r017.book1.ch14.text.block-034","segment.r017.book1.ch14.text.block-035","segment.r017.book1.ch14.text.block-036","segment.r017.book1.ch14.text.block-037","segment.r017.book1.ch14.text.block-038","segment.r017.book1.ch14.text.block-039","segment.r017.book1.ch14.text.block-040","segment.r017.book1.ch14.text.block-041","segment.r017.book1.ch14.text.block-042","segment.r017.book1.ch14.text.block-043","segment.r017.book1.ch14.text.block-044","segment.r017.book1.ch14.text.block-045","segment.r017.book1.ch14.text.block-046","segment.r017.book1.ch14.text.block-047","segment.r017.book1.ch14.text.block-048","segment.r017.book1.ch14.text.block-049","segment.r017.book1.ch14.text.block-050","segment.r017.book1.ch14.text.block-051","segment.r017.book1.ch14.text.block-052","segment.r017.book1.ch14.text.block-053","segment.r017.book1.ch14.text.block-054","segment.r017.book1.ch14.text.block-055","segment.r017.book1.ch14.text.block-056","segment.r017.book1.ch14.text.block-057","segment.r017.book1.ch14.text.block-058","segment.r017.book1.ch14.text.block-059","segment.r017.book1.ch14.text.block-060","segment.r017.book1.ch14.text.block-061","segment.r017.book1.ch14.text.block-062","segment.r017.book1.ch14.text.block-063","segment.r017.book1.ch14.text.block-064","segment.r017.book1.ch14.text.block-065","segment.r017.book1.ch14.text.block-066","segment.r017.book1.ch14.text.block-067","segment.r017.book1.ch14.text.block-068","segment.r017.book1.ch14.text.block-069","segment.r017.book1.ch14.text.block-070","segment.r017.book1.ch14.text.block-071","segment.r017.book1.ch14.text.block-072","segment.r017.book1.ch14.text.block-073","segment.r017.book1.ch14.text.block-074","segment.r017.book1.ch14.text.block-075","segment.r017.book1.ch14.text.block-076","segment.r017.book1.ch14.text.block-077","segment.r017.book1.ch14.text.block-078","segment.r017.book1.ch14.text.block-079","segment.r017.book1.ch14.text.block-080","segment.r017.book1.ch14.text.block-081","segment.r017.book1.ch14.text.block-082","segment.r017.book1.ch14.text.block-083","segment.r017.book1.ch14.text.block-084","segment.r017.book1.ch14.text.block-085","segment.r017.book1.ch14.text.block-086","segment.r017.book1.ch14.text.block-087","segment.r017.book1.ch14.text.block-088","segment.r017.book1.ch14.text.block-089","segment.r017.book1.ch14.text.block-090","segment.r017.book1.ch14.text.block-091","segment.r017.book1.ch14.text.block-092","segment.r017.book1.ch14.text.block-093","segment.r017.book1.ch14.text.block-094","segment.r017.book1.ch14.text.block-095","segment.r017.book1.ch14.text.block-096","segment.r017.book1.ch14.text.block-097","segment.r017.book1.ch14.text.block-098","segment.r017.book1.ch14.text.block-099","segment.r017.book1.ch14.text.block-100","segment.r017.book1.ch14.text.block-101","segment.r017.book1.ch14.text.block-102","segment.r017.book1.ch14.text.block-103","segment.r017.book1.ch14.text.block-104","segment.r017.book1.ch14.text.block-105","segment.r017.book1.ch14.text.block-106","segment.r017.book1.ch14.text.block-107","segment.r017.book1.ch14.text.block-108","segment.r017.book1.ch14.text.block-109","segment.r017.book1.ch14.text.block-110","segment.r017.book1.ch14.text.block-111","segment.r017.book1.ch14.text.block-112","segment.r017.book1.ch14.text.block-113","segment.r017.book1.ch14.text.block-114","segment.r017.book1.ch14.text.block-115","segment.r017.book1.ch14.text.block-116","segment.r017.book1.ch14.text.block-117","segment.r017.book1.ch14.text.block-118","segment.r017.book1.ch14.text.block-119","segment.r017.book1.ch14.text.block-120","segment.r017.book1.ch14.text.block-121","segment.r017.book1.ch14.text.block-122","segment.r017.book1.ch14.text.block-123","segment.r017.book1.ch14.text.block-124","segment.r017.book1.ch14.text.block-125","segment.r017.book1.ch14.text.block-126","segment.r017.book1.ch14.text.block-127","segment.r017.book1.ch14.text.block-128","segment.r017.book1.ch14.text.block-129","segment.r017.book1.ch14.text.block-130","segment.r017.book1.ch14.text.block-131","segment.r017.book1.ch14.text.block-132","segment.r017.book1.ch14.text.block-133","segment.r017.book1.ch14.text.block-134","segment.r017.book1.ch14.text.block-135","segment.r017.book1.ch14.text.block-136","segment.r017.book1.ch14.text.block-137","segment.r017.book1.ch14.text.block-138","segment.r017.book1.ch14.text.block-139","segment.r017.book1.ch14.text.block-140","segment.r017.book1.ch14.text.block-141","segment.r017.book1.ch14.text.block-142","segment.r017.book1.ch14.text.block-143","segment.r017.book1.ch14.text.block-144","segment.r017.book1.ch14.text.block-145","segment.r017.book1.ch14.text.block-146","segment.r017.book1.ch14.text.block-147","segment.r017.book1.ch14.text.block-148","segment.r017.book1.ch14.text.block-149","segment.r017.book1.ch14.text.block-150","segment.r017.book1.ch14.text.block-151","segment.r017.book1.ch14.text.block-152","segment.r017.book1.ch14.text.block-153","segment.r017.book1.ch14.text.block-154","segment.r017.book1.ch14.text.block-155","segment.r017.book1.ch14.text.block-156","segment.r017.book1.ch14.text.block-157","segment.r017.book1.ch14.text.block-158","segment.r017.book1.ch14.text.block-159","segment.r017.book1.ch14.text.block-160","segment.r017.book1.ch14.text.block-161","segment.r017.book1.ch14.text.block-162","segment.r017.book1.ch14.text.block-163","segment.r017.book1.ch14.text.block-164","segment.r017.book1.ch14.text.block-165","segment.r017.book1.ch14.text.block-166","segment.r017.book1.ch14.text.block-167","segment.r017.book1.ch14.text.block-168","segment.r017.book1.ch14.text.block-169","segment.r017.book1.ch14.text.block-170","segment.r017.book1.ch14.text.block-171","segment.r017.book1.ch14.text.block-172","segment.r017.book1.ch14.text.block-173","segment.r017.book1.ch14.text.block-174","segment.r017.book1.ch14.text.block-175","segment.r017.book1.ch14.text.block-176","segment.r017.book1.ch14.text.block-177","segment.r017.book1.ch14.text.block-178","segment.r017.book1.ch14.text.block-179","segment.r017.book1.ch14.text.block-180","segment.r017.book1.ch14.text.block-181","segment.r017.book1.ch14.text.block-182","segment.r017.book1.ch14.text.block-183","segment.r017.book1.ch14.text.block-184","segment.r017.book1.ch14.text.block-185","segment.r017.book1.ch14.text.block-186","segment.r017.book1.ch14.text.block-187","segment.r017.book1.ch14.text.block-188","segment.r017.book1.ch14.text.block-189","segment.r017.book1.ch14.text.block-190","segment.r017.book1.ch14.text.block-191","segment.r017.book1.ch14.text.block-192","segment.r017.book1.ch14.text.block-193","segment.r017.book1.ch14.text.block-194","segment.r017.book1.ch14.text.block-195","segment.r017.book1.ch14.text.block-196","segment.r017.book1.ch14.text.block-197","segment.r017.book1.ch14.text.block-198","segment.r017.book1.ch14.text.block-199","segment.r017.book1.ch14.text.block-200","segment.r017.book1.ch14.text.block-201","segment.r017.book1.ch14.text.block-202","segment.r017.book1.ch14.text.block-203","segment.r017.book1.ch14.text.block-204","segment.r017.book1.ch14.text.block-205","segment.r017.book1.ch14.text.block-206","segment.r017.book1.ch14.text.block-207","segment.r017.book1.ch14.text.block-208","segment.r017.book1.ch14.text.block-209","segment.r017.book1.ch14.text.block-210","segment.r017.book1.ch14.text.block-211","segment.r017.book1.ch14.text.block-212","segment.r017.book1.ch14.text.block-213","segment.r017.book1.ch14.text.block-214","segment.r017.book1.ch14.text.block-215","segment.r017.book1.ch14.text.block-216","segment.r017.book1.ch14.text.block-217","segment.r017.book1.ch14.text.block-218","segment.r017.book1.ch14.text.block-219","segment.r017.book1.ch14.text.block-220","segment.r017.book1.ch14.text.block-221","segment.r017.book1.ch14.text.block-222","segment.r017.book1.ch14.text.block-223","segment.r017.book1.ch14.text.block-224","segment.r017.book1.ch14.text.block-225","segment.r017.book1.ch14.text.block-226","segment.r017.book1.ch14.text.block-227","segment.r017.book1.ch14.text.block-228","segment.r017.book1.ch14.text.block-229","segment.r017.book1.ch14.text.block-230","segment.r017.book1.ch14.text.block-231","segment.r017.book1.ch14.text.block-232","segment.r017.book1.ch14.text.block-233","segment.r017.book1.ch14.text.block-234","segment.r017.book1.ch14.text.block-235","segment.r017.book1.ch14.text.block-236","segment.r017.book1.ch14.text.block-237","segment.r017.book1.ch14.text.block-238","segment.r017.book1.ch14.text.block-239","segment.r017.book1.ch14.text.block-240","segment.r017.book1.ch14.text.block-241","segment.r017.book1.ch14.text.block-242","segment.r017.book1.ch14.text.block-243","segment.r017.book1.ch14.text.block-244","segment.r017.book1.ch14.text.block-245","segment.r017.book1.ch14.text.block-246","segment.r017.book1.ch14.text.block-247","segment.r017.book1.ch14.text.block-248","segment.r017.book1.ch14.text.block-249","segment.r017.book1.ch14.text.block-250","segment.r017.book1.ch14.text.block-251","segment.r017.book1.ch14.text.block-252","segment.r017.book1.ch14.text.block-253","segment.r017.book1.ch14.text.block-254","segment.r017.book1.ch14.text.block-255","segment.r017.book1.ch14.text.block-256","segment.r017.book1.ch14.text.block-257","segment.r017.book1.ch14.text.block-258","segment.r017.book1.ch14.text.block-259","segment.r017.book1.ch14.text.block-260","segment.r017.book1.ch14.text.block-261","segment.r017.book1.ch14.text.block-262","segment.r017.book1.ch14.text.block-263","segment.r017.book1.ch14.text.block-264","segment.r017.book1.ch14.text.block-265","segment.r017.book1.ch14.text.block-266","segment.r017.book1.ch14.text.block-267","segment.r017.book1.ch14.text.block-268","segment.r017.book1.ch14.text.block-269","segment.r017.book1.ch14.text.block-270","segment.r017.book1.ch14.text.block-271","segment.r017.book1.ch14.text.block-272","segment.r017.book1.ch14.text.block-273","segment.r017.book1.ch14.text.block-274","segment.r017.book1.ch14.text.block-275","segment.r017.book1.ch14.text.block-276","segment.r017.book1.ch14.text.block-277","segment.r017.book1.ch14.text.block-278","segment.r017.book1.ch14.text.block-279","segment.r017.book1.ch14.text.block-280","segment.r017.book1.ch14.text.block-281","segment.r017.book1.ch14.text.block-282","segment.r017.book1.ch14.text.block-283","segment.r017.book1.ch14.text.block-284","segment.r017.book1.ch14.text.block-285","segment.r017.book1.ch14.text.block-286","segment.r017.book1.ch14.text.block-287","segment.r017.book1.ch14.text.block-288","segment.r017.book1.ch14.text.block-289","segment.r017.book1.ch14.text.block-290","segment.r017.book1.ch14.text.block-291","segment.r017.book1.ch14.text.block-292","segment.r017.book1.ch14.text.block-293","segment.r017.book1.ch14.text.block-294","segment.r017.book1.ch14.text.block-295","segment.r017.book1.ch14.text.block-296","segment.r017.book1.ch14.text.block-297","segment.r017.book1.ch14.text.block-298","segment.r017.book1.ch14.text.block-299","segment.r017.book1.ch14.text.block-300","segment.r017.book1.ch14.text.block-301","segment.r017.book1.ch14.text.block-302","segment.r017.book1.ch14.text.block-303","segment.r017.book1.ch14.text.block-304","segment.r017.book1.ch14.text.block-305","segment.r017.book1.ch14.text.block-306","segment.r017.book1.ch14.text.block-307","segment.r017.book1.ch14.text.block-308","segment.r017.book1.ch14.text.block-309","segment.r017.book1.ch14.text.block-310","segment.r017.book1.ch14.text.block-311","segment.r017.book1.ch14.text.block-312","segment.r017.book1.ch14.text.block-313","segment.r017.book1.ch14.text.block-314","segment.r017.book1.ch14.text.block-315","segment.r017.book1.ch14.text.block-316","segment.r017.book1.ch14.text.block-317","segment.r017.book1.ch14.text.block-318","segment.r017.book1.ch14.text.block-319","segment.r017.book1.ch14.text.block-320","segment.r017.book1.ch14.text.block-321","segment.r017.book1.ch14.text.block-322","segment.r017.book1.ch14.text.block-323","segment.r017.book1.ch14.text.block-324","segment.r017.book1.ch14.text.block-325","segment.r017.book1.ch14.text.block-326","segment.r017.book1.ch14.text.block-327","segment.r017.book1.ch14.text.block-328","segment.r017.book1.ch14.text.block-329","segment.r017.book1.ch14.text.block-330","segment.r017.book1.ch14.text.block-331","segment.r017.book1.ch14.text.block-332","segment.r017.book1.ch14.text.block-333","segment.r017.book1.ch14.text.block-334","segment.r017.book1.ch14.text.block-335","segment.r017.book1.ch14.text.block-336","segment.r017.book1.ch14.text.block-337","segment.r017.book1.ch14.text.block-338","segment.r017.book1.ch14.text.block-339","segment.r017.book1.ch14.text.block-340","segment.r017.book1.ch14.text.block-341","segment.r017.book1.ch14.text.block-342","segment.r017.book1.ch14.text.block-343","segment.r017.book1.ch14.text.block-344","segment.r017.book1.ch14.text.block-345","segment.r017.book1.ch14.text.block-346","segment.r017.book1.ch14.text.block-347","segment.r017.book1.ch14.text.block-348","segment.r017.book1.ch14.text.block-349","segment.r017.book1.ch14.text.block-350","segment.r017.book1.ch14.text.block-351","segment.r017.book1.ch14.text.block-352","segment.r017.book1.ch14.text.block-353","segment.r017.book1.ch14.text.block-354","segment.r017.book1.ch14.text.block-355","segment.r017.book1.ch14.text.block-356","segment.r017.book1.ch14.text.block-357","segment.r017.book1.ch14.text.block-358","segment.r017.book1.ch14.text.block-359","segment.r017.book1.ch14.text.block-360","segment.r017.book1.ch14.text.block-361","segment.r017.book1.ch14.text.block-362","segment.r017.book1.ch14.text.block-363","segment.r017.book1.ch14.text.block-364","segment.r017.book1.ch14.text.block-365","segment.r017.book1.ch14.text.block-366","segment.r017.book1.ch14.text.block-367","segment.r017.book1.ch14.text.block-368","segment.r017.book1.ch14.text.block-369","segment.r017.book1.ch14.text.block-370","segment.r017.book1.ch14.text.block-371","segment.r017.book1.ch14.text.block-372","segment.r017.book1.ch14.text.block-373","segment.r017.book1.ch14.text.block-374","segment.r017.book1.ch14.text.block-375","segment.r017.book1.ch14.text.block-376","segment.r017.book1.ch14.text.block-377","segment.r017.book1.ch14.text.block-378","segment.r017.book1.ch14.text.block-379","segment.r017.book1.ch14.text.block-380","segment.r017.book1.ch14.text.block-381","segment.r017.book1.ch14.text.block-382","segment.r017.book1.ch14.text.block-383","segment.r017.book1.ch14.text.block-384","segment.r017.book1.ch14.text.block-385","segment.r017.book1.ch14.text.block-386","segment.r017.book1.ch14.text.block-387","segment.r017.book1.ch14.text.block-388","segment.r017.book1.ch14.text.block-389","segment.r017.book1.ch14.text.block-390","segment.r017.book1.ch14.text.block-391","segment.r017.book1.ch14.text.block-392","segment.r017.book1.ch14.text.block-393","segment.r017.book1.ch14.text.block-394","segment.r017.book1.ch14.text.block-395","segment.r017.book1.ch14.text.block-396","segment.r017.book1.ch14.text.block-397","segment.r017.book1.ch14.text.block-398","segment.r017.book1.ch14.text.block-399","segment.r017.book1.ch14.text.block-400","segment.r017.book1.ch14.text.block-401","segment.r017.book1.ch14.text.block-402","segment.r017.book1.ch14.text.block-403","segment.r017.book1.ch14.text.block-404","segment.r017.book1.ch14.text.block-405","segment.r017.book1.ch14.text.block-406","segment.r017.book1.ch14.text.block-407","segment.r017.book1.ch14.text.block-408","segment.r017.book1.ch14.text.block-409","segment.r017.book1.ch14.text.block-410","segment.r017.book1.ch14.text.block-411","segment.r017.book1.ch14.text.block-412","segment.r017.book1.ch14.text.block-413","segment.r017.book1.ch14.text.block-414","segment.r017.book1.ch14.text.block-415","segment.r017.book1.ch14.text.block-416","segment.r017.book1.ch14.text.block-417","segment.r017.book1.ch14.text.block-418","segment.r017.book1.ch14.text.block-419","segment.r017.book1.ch14.text.block-420","segment.r017.book1.ch14.text.block-421","segment.r017.book1.ch14.text.block-422","segment.r017.book1.ch14.text.block-423","segment.r017.book1.ch14.text.block-424","segment.r017.book1.ch14.text.block-425","segment.r017.book1.ch14.text.block-426","segment.r017.book1.ch14.text.block-427","segment.r017.book1.ch14.text.block-428"],"native":{"concept_id":"concept.graph-theory","evidence":"Chapter 4 terminology decision","id":"term.arc.id","preferred":"busur","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":["sisi berarah"],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"directed networks","source_locale":"en","source_term":"arc","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.artificial-variable","evidence":"Chapters 7 and 9 terminology decision","id":"term.artificial-variable.id","preferred":"variabel artifisial","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"simplex initialization","source_locale":"en","source_term":"artificial variable","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch04.readme.block-001","segment.o018.lab.ch04.readme.block-002","segment.o018.lab.ch04.readme.block-003","segment.o018.lab.ch04.readme.block-004","segment.o018.lab.ch04.readme.block-005","segment.o018.lab.ch04.readme.block-006","segment.o018.lab.ch04.readme.block-007","segment.o018.lab.ch04.readme.block-008","segment.o018.lab.ch04.readme.block-009","segment.o018.lab.ch04.readme.block-010","segment.o018.lab.ch04.readme.block-011","segment.o018.lab.ch04.readme.block-012","segment.o018.lab.ch04.readme.block-013","segment.o018.lab.ch04.readme.block-014","segment.o018.lab.ch04.readme.block-015","segment.o018.lab.ch04.readme.block-016","segment.o018.lab.ch04.readme.block-017","segment.o018.lab.ch04.readme.block-018","segment.o018.lab.ch04.readme.block-019","segment.o018.lab.ch04.readme.block-020","segment.o018.lab.ch04.readme.block-021","segment.o018.lab.ch04.readme.block-022","segment.o018.lab.ch04.readme.block-023","segment.o018.lab.ch04.readme.block-024","segment.o018.lab.ch04.readme.block-025","segment.o018.lab.ch04.readme.block-026","segment.r017.book1.ch02.text.block-139","segment.r017.book1.ch04.text-a.block-055","segment.r017.book1.ch04.text-a.block-074","segment.r017.book1.ch04.text-b.block-182","segment.r017.book1.ch04.text-b.block-185","segment.r017.book1.ch04.text-b.block-208","segment.r017.book1.ch04.text-b.block-212","segment.r017.book1.ch04.text-b.block-215"],"native":{"concept_id":"concept.assignment-model","evidence":"Chapter 2 Assignment Problem subsection","id":"term.assignment.id","preferred":"masalah penugasan","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"binary integer-programming model class","source_locale":"en","source_term":"assignment problem","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["model penugasan"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.basic-feasible-solution","evidence":"Chapters 7--9 terminology decision; 2026-08-22 Indonesian field-usage QA retained the preferred form, recorded a historical retrieval variant, and corrected one malformed local word order","id":"term.basic-feasible-solution.id","preferred":"solusi basis layak","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":["solusi layak dasar"],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"simplex method","source_locale":"en","source_term":"basic feasible solution","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["SBL","pemecahan dasar yang layak"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.simplex.readme.block-001","segment.o018.lab.simplex.readme.block-002","segment.o018.lab.simplex.readme.block-003","segment.o018.lab.simplex.readme.block-004","segment.o018.lab.simplex.readme.block-005","segment.o018.lab.simplex.readme.block-006","segment.o018.lab.simplex.readme.block-007","segment.o018.lab.simplex.readme.block-008","segment.o018.lab.simplex.readme.block-009","segment.o018.lab.simplex.readme.block-010"],"native":{"concept_id":"concept.basis-matrix","evidence":"Chapter 8 terminology decision","id":"term.basis-matrix.id","preferred":"matriks basis","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"matrix simplex","source_locale":"en","source_term":"basis matrix","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch15.attribution.block-001","segment.o018.lab.ch15.attribution.block-002","segment.o018.lab.ch15.attribution.block-003","segment.o018.lab.ch15.attribution.block-004","segment.o018.lab.ch15.attribution.block-005","segment.o018.lab.ch15.attribution.block-006","segment.o018.lab.ch15.attribution.block-007","segment.o018.lab.ch15.attribution.block-008","segment.o018.lab.ch15.attribution.block-009","segment.o018.lab.ch15.attribution.block-010","segment.o018.lab.ch15.attribution.block-011","segment.o018.lab.ch15.attribution.block-012","segment.o018.lab.ch15.attribution.block-013","segment.o018.lab.ch15.attribution.block-014","segment.o018.lab.ch15.attribution.block-015","segment.o018.lab.ch15.readme.block-001","segment.o018.lab.ch15.readme.block-002","segment.o018.lab.ch15.readme.block-003","segment.o018.lab.ch15.readme.block-004","segment.o018.lab.ch15.readme.block-005","segment.o018.lab.ch15.readme.block-006","segment.o018.lab.ch15.readme.block-007","segment.o018.lab.ch15.readme.block-008","segment.o018.lab.ch15.readme.block-009","segment.r017.book1.ch15.text.block-001","segment.r017.book1.ch15.text.block-002","segment.r017.book1.ch15.text.block-003","segment.r017.book1.ch15.text.block-004","segment.r017.book1.ch15.text.block-005","segment.r017.book1.ch15.text.block-006","segment.r017.book1.ch15.text.block-007","segment.r017.book1.ch15.text.block-008","segment.r017.book1.ch15.text.block-009","segment.r017.book1.ch15.text.block-010","segment.r017.book1.ch15.text.block-011","segment.r017.book1.ch15.text.block-012","segment.r017.book1.ch15.text.block-013","segment.r017.book1.ch15.text.block-014","segment.r017.book1.ch15.text.block-015","segment.r017.book1.ch15.text.block-016","segment.r017.book1.ch15.text.block-017","segment.r017.book1.ch15.text.block-018","segment.r017.book1.ch15.text.block-019","segment.r017.book1.ch15.text.block-020","segment.r017.book1.ch15.text.block-021","segment.r017.book1.ch15.text.block-022","segment.r017.book1.ch15.text.block-023","segment.r017.book1.ch15.text.block-024","segment.r017.book1.ch15.text.block-025","segment.r017.book1.ch15.text.block-026","segment.r017.book1.ch15.text.block-027","segment.r017.book1.ch15.text.block-028","segment.r017.book1.ch15.text.block-029","segment.r017.book1.ch15.text.block-030","segment.r017.book1.ch15.text.block-031","segment.r017.book1.ch15.text.block-032","segment.r017.book1.ch15.text.block-033","segment.r017.book1.ch15.text.block-034","segment.r017.book1.ch15.text.block-035","segment.r017.book1.ch15.text.block-036","segment.r017.book1.ch15.text.block-037","segment.r017.book1.ch15.text.block-038","segment.r017.book1.ch15.text.block-039","segment.r017.book1.ch15.text.block-040","segment.r017.book1.ch15.text.block-041","segment.r017.book1.ch15.text.block-042","segment.r017.book1.ch15.text.block-043","segment.r017.book1.ch15.text.block-044","segment.r017.book1.ch15.text.block-045","segment.r017.book1.ch15.text.block-046","segment.r017.book1.ch15.text.block-047","segment.r017.book1.ch15.text.block-048","segment.r017.book1.ch15.text.block-049","segment.r017.book1.ch15.text.block-050","segment.r017.book1.ch15.text.block-051","segment.r017.book1.ch15.text.block-052","segment.r017.book1.ch15.text.block-053","segment.r017.book1.ch15.text.block-054","segment.r017.book1.ch15.text.block-055","segment.r017.book1.ch15.text.block-056","segment.r017.book1.ch15.text.block-057","segment.r017.book1.ch15.text.block-058","segment.r017.book1.ch15.text.block-059","segment.r017.book1.ch15.text.block-060","segment.r017.book1.ch15.text.block-061","segment.r017.book1.ch15.text.block-062","segment.r017.book1.ch15.text.block-063","segment.r017.book1.ch15.text.block-064","segment.r017.book1.ch15.text.block-065","segment.r017.book1.ch15.text.block-066","segment.r017.book1.ch15.text.block-067","segment.r017.book1.ch15.text.block-068","segment.r017.book1.ch15.text.block-069","segment.r017.book1.ch15.text.block-070","segment.r017.book1.ch15.text.block-071","segment.r017.book1.ch15.text.block-072","segment.r017.book1.ch15.text.block-073","segment.r017.book1.ch15.text.block-074","segment.r017.book1.ch15.text.block-075","segment.r017.book1.ch15.text.block-076","segment.r017.book1.ch15.text.block-077","segment.r017.book1.ch15.text.block-078","segment.r017.book1.ch15.text.block-079","segment.r017.book1.ch15.text.block-080","segment.r017.book1.ch15.text.block-081","segment.r017.book1.ch15.text.block-082","segment.r017.book1.ch15.text.block-083","segment.r017.book1.ch15.text.block-084","segment.r017.book1.ch15.text.block-085","segment.r017.book1.ch15.text.block-086","segment.r017.book1.ch15.text.block-087","segment.r017.book1.ch15.text.block-088","segment.r017.book1.ch15.text.block-089","segment.r017.book1.ch15.text.block-090","segment.r017.book1.ch15.text.block-091","segment.r017.book1.ch15.text.block-092","segment.r017.book1.ch15.text.block-093","segment.r017.book1.ch15.text.block-094","segment.r017.book1.ch15.text.block-095","segment.r017.book1.ch15.text.block-096","segment.r017.book1.ch15.text.block-097","segment.r017.book1.ch15.text.block-098","segment.r017.book1.ch15.text.block-099","segment.r017.book1.ch15.text.block-100","segment.r017.book1.ch15.text.block-101","segment.r017.book1.ch15.text.block-102","segment.r017.book1.ch15.text.block-103","segment.r017.book1.ch15.text.block-104","segment.r017.book1.ch15.text.block-105","segment.r017.book1.ch15.text.block-106","segment.r017.book1.ch15.text.block-107","segment.r017.book1.ch15.text.block-108","segment.r017.book1.ch15.text.block-109","segment.r017.book1.ch15.text.block-110","segment.r017.book1.ch15.text.block-111","segment.r017.book1.ch15.text.block-112","segment.r017.book1.ch15.text.block-113","segment.r017.book1.ch15.text.block-114","segment.r017.book1.ch15.text.block-115","segment.r017.book1.ch15.text.block-116","segment.r017.book1.ch15.text.block-117","segment.r017.book1.ch15.text.block-118","segment.r017.book1.ch15.text.block-119","segment.r017.book1.ch15.text.block-120","segment.r017.book1.ch15.text.block-121","segment.r017.book1.ch15.text.block-122","segment.r017.book1.ch15.text.block-123","segment.r017.book1.ch15.text.block-124","segment.r017.book1.ch15.text.block-125","segment.r017.book1.ch15.text.block-126","segment.r017.book1.ch15.text.block-127","segment.r017.book1.ch15.text.block-128","segment.r017.book1.ch15.text.block-129","segment.r017.book1.ch15.text.block-130","segment.r017.book1.ch15.text.block-131","segment.r017.book1.ch15.text.block-132","segment.r017.book1.ch15.text.block-133","segment.r017.book1.ch15.text.block-134","segment.r017.book1.ch15.text.block-135","segment.r017.book1.ch15.text.block-136","segment.r017.book1.ch15.text.block-137","segment.r017.book1.ch15.text.block-138","segment.r017.book1.ch15.text.block-139","segment.r017.book1.ch15.text.block-140","segment.r017.book1.ch15.text.block-141","segment.r017.book1.ch15.text.block-142","segment.r017.book1.ch15.text.block-143","segment.r017.book1.ch15.text.block-144","segment.r017.book1.ch15.text.block-145","segment.r017.book1.ch15.text.block-146","segment.r017.book1.ch15.text.block-147","segment.r017.book1.ch15.text.block-148","segment.r017.book1.ch15.text.block-149","segment.r017.book1.ch15.text.block-150","segment.r017.book1.ch15.text.block-151","segment.r017.book1.ch15.text.block-152","segment.r017.book1.ch15.text.block-153","segment.r017.book1.ch15.text.block-154","segment.r017.book1.ch15.text.block-155","segment.r017.book1.ch15.text.block-156","segment.r017.book1.ch15.text.block-157","segment.r017.book1.ch15.text.block-158","segment.r017.book1.ch15.text.block-159","segment.r017.book1.ch15.text.block-160","segment.r017.book1.ch15.text.block-161","segment.r017.book1.ch15.text.block-162","segment.r017.book1.ch15.text.block-163","segment.r017.book1.ch15.text.block-164","segment.r017.book1.ch15.text.block-165","segment.r017.book1.ch15.text.block-166","segment.r017.book1.ch15.text.block-167","segment.r017.book1.ch15.text.block-168","segment.r017.book1.ch15.text.block-169","segment.r017.book1.ch15.text.block-170","segment.r017.book1.ch15.text.block-171","segment.r017.book1.ch15.text.block-172","segment.r017.book1.ch15.text.block-173","segment.r017.book1.ch15.text.block-174","segment.r017.book1.ch15.text.block-175","segment.r017.book1.ch15.text.block-176","segment.r017.book1.ch15.text.block-177","segment.r017.book1.ch15.text.block-178","segment.r017.book1.ch15.text.block-179","segment.r017.book1.ch15.text.block-180","segment.r017.book1.ch15.text.block-181","segment.r017.book1.ch15.text.block-182","segment.r017.book1.ch15.text.block-183","segment.r017.book1.ch15.text.block-184","segment.r017.book1.ch15.text.block-185","segment.r017.book1.ch15.text.block-186","segment.r017.book1.ch15.text.block-187","segment.r017.book1.ch15.text.block-188","segment.r017.book1.ch15.text.block-189","segment.r017.book1.ch15.text.block-190","segment.r017.book1.ch15.text.block-191","segment.r017.book1.ch15.text.block-192","segment.r017.book1.ch15.text.block-193","segment.r017.book1.ch15.text.block-194","segment.r017.book1.ch15.text.block-195","segment.r017.book1.ch15.text.block-196","segment.r017.book1.ch15.text.block-197","segment.r017.book1.ch15.text.block-198","segment.r017.book1.ch15.text.block-199","segment.r017.book1.ch15.text.block-200","segment.r017.book1.ch15.text.block-201","segment.r017.book1.ch15.text.block-202","segment.r017.book1.ch15.text.block-203","segment.r017.book1.ch15.text.block-204","segment.r017.book1.ch15.text.block-205","segment.r017.book1.ch15.text.block-206","segment.r017.book1.ch15.text.block-207","segment.r017.book1.ch15.text.block-208","segment.r017.book1.ch15.text.block-209","segment.r017.book1.ch15.text.block-210","segment.r017.book1.ch15.text.block-211","segment.r017.book1.ch15.text.block-212","segment.r017.book1.ch15.text.block-213","segment.r017.book1.ch15.text.block-214","segment.r017.book1.ch15.text.block-215","segment.r017.book1.ch15.text.block-216","segment.r017.book1.ch15.text.block-217","segment.r017.book1.ch15.text.block-218","segment.r017.book1.ch15.text.block-219","segment.r017.book1.ch15.text.block-220","segment.r017.book1.ch15.text.block-221","segment.r017.book1.ch15.text.block-222","segment.r017.book1.ch15.text.block-223","segment.r017.book1.ch15.text.block-224","segment.r017.book1.ch15.text.block-225","segment.r017.book1.ch15.text.block-226","segment.r017.book1.ch15.text.block-227","segment.r017.book1.ch15.text.block-228","segment.r017.book1.ch15.text.block-229","segment.r017.book1.ch15.text.block-230","segment.r017.book1.ch15.text.block-231","segment.r017.book1.ch15.text.block-232","segment.r017.book1.ch15.text.block-233","segment.r017.book1.ch15.text.block-234","segment.r017.book1.ch15.text.block-235","segment.r017.book1.ch15.text.block-236","segment.r017.book1.ch15.text.block-237","segment.r017.book1.ch15.text.block-238","segment.r017.book1.ch15.text.block-239","segment.r017.book1.ch15.text.block-240","segment.r017.book1.ch15.text.block-241","segment.r017.book1.ch15.text.block-242","segment.r017.book1.ch15.text.block-243","segment.r017.book1.ch15.text.block-244","segment.r017.book1.ch15.text.block-245","segment.r017.book1.ch15.text.block-246","segment.r017.book1.ch15.text.block-247","segment.r017.book1.ch15.text.block-248","segment.r017.book1.ch15.text.block-249","segment.r017.book1.ch15.text.block-250","segment.r017.book1.ch15.text.block-251","segment.r017.book1.ch15.text.block-252","segment.r017.book1.ch15.text.block-253","segment.r017.book1.ch15.text.block-254","segment.r017.book1.ch15.text.block-255","segment.r017.book1.ch15.text.block-256","segment.r017.book1.ch15.text.block-257","segment.r017.book1.ch15.text.block-258","segment.r017.book1.ch15.text.block-259","segment.r017.book1.ch15.text.block-260","segment.r017.book1.ch15.text.block-261","segment.r017.book1.ch15.text.block-262","segment.r017.book1.ch15.text.block-263","segment.r017.book1.ch15.text.block-264","segment.r017.book1.ch15.text.block-265","segment.r017.book1.ch15.text.block-266","segment.r017.book1.ch15.text.block-267","segment.r017.book1.ch15.text.block-268","segment.r017.book1.ch15.text.block-269","segment.r017.book1.ch15.text.block-270","segment.r017.book1.ch15.text.block-271","segment.r017.book1.ch15.text.block-272","segment.r017.book1.ch15.text.block-273","segment.r017.book1.ch15.text.block-274","segment.r017.book1.ch15.text.block-275","segment.r017.book1.ch15.text.block-276","segment.r017.book1.ch15.text.block-277","segment.r017.book1.ch15.text.block-278","segment.r017.book1.ch15.text.block-279","segment.r017.book1.ch15.text.block-280","segment.r017.book1.ch15.text.block-281","segment.r017.book1.ch15.text.block-282","segment.r017.book1.ch15.text.block-283","segment.r017.book1.ch15.text.block-284","segment.r017.book1.ch15.text.block-285","segment.r017.book1.ch15.text.block-286","segment.r017.book1.ch15.text.block-287","segment.r017.book1.ch15.text.block-288","segment.r017.book1.ch15.text.block-289","segment.r017.book1.ch15.text.block-290","segment.r017.book1.ch15.text.block-291","segment.r017.book1.ch15.text.block-292","segment.r017.book1.ch15.text.block-293","segment.r017.book1.ch15.text.block-294","segment.r017.book1.ch15.text.block-295","segment.r017.book1.ch15.text.block-296","segment.r017.book1.ch15.text.block-297","segment.r017.book1.ch15.text.block-298","segment.r017.book1.ch15.text.block-299","segment.r017.book1.ch15.text.block-300","segment.r017.book1.ch15.text.block-301","segment.r017.book1.ch15.text.block-302","segment.r017.book1.ch15.text.block-303","segment.r017.book1.ch15.text.block-304","segment.r017.book1.ch15.text.block-305","segment.r017.book1.ch15.text.block-306","segment.r017.book1.ch15.text.block-307","segment.r017.book1.ch15.text.block-308","segment.r017.book1.ch15.text.block-309","segment.r017.book1.ch15.text.block-310","segment.r017.book1.ch15.text.block-311","segment.r017.book1.ch15.text.block-312","segment.r017.book1.ch15.text.block-313","segment.r017.book1.ch15.text.block-314","segment.r017.book1.ch15.text.block-315","segment.r017.book1.ch15.text.block-316","segment.r017.book1.ch15.text.block-317","segment.r017.book1.ch15.text.block-318","segment.r017.book1.ch15.text.block-319","segment.r017.book1.ch15.text.block-320","segment.r017.book1.ch15.text.block-321","segment.r017.book1.ch15.text.block-322","segment.r017.book1.ch15.text.block-323","segment.r017.book1.ch15.text.block-324","segment.r017.book1.ch15.text.block-325","segment.r017.book1.ch15.text.block-326","segment.r017.book1.ch15.text.block-327","segment.r017.book1.ch15.text.block-328","segment.r017.book1.ch15.text.block-329","segment.r017.book1.ch15.text.block-330","segment.r017.book1.ch15.text.block-331","segment.r017.book1.ch15.text.block-332","segment.r017.book1.ch15.text.block-333","segment.r017.book1.ch15.text.block-334","segment.r017.book1.ch15.text.block-335","segment.r017.book1.ch15.text.block-336","segment.r017.book1.ch15.text.block-337","segment.r017.book1.ch15.text.block-338","segment.r017.book1.ch15.text.block-339","segment.r017.book1.ch15.text.block-340","segment.r017.book1.ch15.text.block-341","segment.r017.book1.ch15.text.block-342"],"native":{"concept_id":"concept.big-m-modeling","evidence":"Full-corpus id-ID terminology audit","id":"term.big-m-modeling.id","preferred":"pemodelan Big-M","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"Big-M modeling","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.big-m-method","evidence":"Chapters 7 and 9 terminology decision","id":"term.big-m.id","preferred":"metode Big-M","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"simplex initialization","source_locale":"en","source_term":"Big-M method","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch15.attribution.block-001","segment.o018.lab.ch15.attribution.block-002","segment.o018.lab.ch15.attribution.block-003","segment.o018.lab.ch15.attribution.block-004","segment.o018.lab.ch15.attribution.block-005","segment.o018.lab.ch15.attribution.block-006","segment.o018.lab.ch15.attribution.block-007","segment.o018.lab.ch15.attribution.block-008","segment.o018.lab.ch15.attribution.block-009","segment.o018.lab.ch15.attribution.block-010","segment.o018.lab.ch15.attribution.block-011","segment.o018.lab.ch15.attribution.block-012","segment.o018.lab.ch15.attribution.block-013","segment.o018.lab.ch15.attribution.block-014","segment.o018.lab.ch15.attribution.block-015","segment.o018.lab.ch15.readme.block-001","segment.o018.lab.ch15.readme.block-002","segment.o018.lab.ch15.readme.block-003","segment.o018.lab.ch15.readme.block-004","segment.o018.lab.ch15.readme.block-005","segment.o018.lab.ch15.readme.block-006","segment.o018.lab.ch15.readme.block-007","segment.o018.lab.ch15.readme.block-008","segment.o018.lab.ch15.readme.block-009","segment.r017.book1.ch01.text.block-052","segment.r017.book1.ch01.text.block-053","segment.r017.book1.ch02.text.block-116","segment.r017.book1.ch02.text.block-139","segment.r017.book1.ch15.solutions-manual.block-001","segment.r017.book1.ch15.solutions-manual.block-002","segment.r017.book1.ch15.solutions-manual.block-003","segment.r017.book1.ch15.solutions-manual.block-004","segment.r017.book1.ch15.solutions-manual.block-005","segment.r017.book1.ch15.solutions-manual.block-006","segment.r017.book1.ch15.solutions-manual.block-007","segment.r017.book1.ch15.solutions-manual.block-008","segment.r017.book1.ch15.solutions-manual.block-009","segment.r017.book1.ch15.solutions-manual.block-010","segment.r017.book1.ch15.solutions-manual.block-011","segment.r017.book1.ch15.solutions-manual.block-012","segment.r017.book1.ch15.solutions-manual.block-013","segment.r017.book1.ch15.solutions-manual.block-014","segment.r017.book1.ch15.solutions-manual.block-015","segment.r017.book1.ch15.solutions-manual.block-016","segment.r017.book1.ch15.solutions-manual.block-017","segment.r017.book1.ch15.solutions-manual.block-018","segment.r017.book1.ch15.solutions-manual.block-019","segment.r017.book1.ch15.solutions-manual.block-020","segment.r017.book1.ch15.solutions-manual.block-021","segment.r017.book1.ch15.solutions-manual.block-022","segment.r017.book1.ch15.solutions-manual.block-023","segment.r017.book1.ch15.solutions-manual.block-024","segment.r017.book1.ch15.solutions-manual.block-025","segment.r017.book1.ch15.solutions-manual.block-026","segment.r017.book1.ch15.solutions-manual.block-027","segment.r017.book1.ch15.solutions-manual.block-028","segment.r017.book1.ch15.solutions-manual.block-029","segment.r017.book1.ch15.solutions-manual.block-030","segment.r017.book1.ch15.solutions-manual.block-031","segment.r017.book1.ch15.solutions-manual.block-032","segment.r017.book1.ch15.solutions-manual.block-033","segment.r017.book1.ch15.solutions-manual.block-034","segment.r017.book1.ch15.solutions-manual.block-035","segment.r017.book1.ch15.solutions-manual.block-036","segment.r017.book1.ch15.solutions-manual.block-037","segment.r017.book1.ch15.solutions-manual.block-038","segment.r017.book1.ch15.solutions-manual.block-039","segment.r017.book1.ch15.solutions-manual.block-040","segment.r017.book1.ch15.solutions-manual.block-041","segment.r017.book1.ch15.solutions-manual.block-042","segment.r017.book1.ch15.solutions-manual.block-043","segment.r017.book1.ch15.solutions-manual.block-044","segment.r017.book1.ch15.solutions-manual.block-045","segment.r017.book1.ch15.solutions-manual.block-046","segment.r017.book1.ch15.solutions-manual.block-047","segment.r017.book1.ch15.solutions-manual.block-048","segment.r017.book1.ch15.solutions-manual.block-049","segment.r017.book1.ch15.solutions-manual.block-050","segment.r017.book1.ch15.solutions-manual.block-051","segment.r017.book1.ch15.solutions-manual.block-052","segment.r017.book1.ch15.text.block-001","segment.r017.book1.ch15.text.block-002","segment.r017.book1.ch15.text.block-003","segment.r017.book1.ch15.text.block-004","segment.r017.book1.ch15.text.block-005","segment.r017.book1.ch15.text.block-006","segment.r017.book1.ch15.text.block-007","segment.r017.book1.ch15.text.block-008","segment.r017.book1.ch15.text.block-009","segment.r017.book1.ch15.text.block-010","segment.r017.book1.ch15.text.block-011","segment.r017.book1.ch15.text.block-012","segment.r017.book1.ch15.text.block-013","segment.r017.book1.ch15.text.block-014","segment.r017.book1.ch15.text.block-015","segment.r017.book1.ch15.text.block-016","segment.r017.book1.ch15.text.block-017","segment.r017.book1.ch15.text.block-018","segment.r017.book1.ch15.text.block-019","segment.r017.book1.ch15.text.block-020","segment.r017.book1.ch15.text.block-021","segment.r017.book1.ch15.text.block-022","segment.r017.book1.ch15.text.block-023","segment.r017.book1.ch15.text.block-024","segment.r017.book1.ch15.text.block-025","segment.r017.book1.ch15.text.block-026","segment.r017.book1.ch15.text.block-027","segment.r017.book1.ch15.text.block-028","segment.r017.book1.ch15.text.block-029","segment.r017.book1.ch15.text.block-030","segment.r017.book1.ch15.text.block-031","segment.r017.book1.ch15.text.block-032","segment.r017.book1.ch15.text.block-033","segment.r017.book1.ch15.text.block-034","segment.r017.book1.ch15.text.block-035","segment.r017.book1.ch15.text.block-036","segment.r017.book1.ch15.text.block-037","segment.r017.book1.ch15.text.block-038","segment.r017.book1.ch15.text.block-039","segment.r017.book1.ch15.text.block-040","segment.r017.book1.ch15.text.block-041","segment.r017.book1.ch15.text.block-042","segment.r017.book1.ch15.text.block-043","segment.r017.book1.ch15.text.block-044","segment.r017.book1.ch15.text.block-045","segment.r017.book1.ch15.text.block-046","segment.r017.book1.ch15.text.block-047","segment.r017.book1.ch15.text.block-048","segment.r017.book1.ch15.text.block-049","segment.r017.book1.ch15.text.block-050","segment.r017.book1.ch15.text.block-051","segment.r017.book1.ch15.text.block-052","segment.r017.book1.ch15.text.block-053","segment.r017.book1.ch15.text.block-054","segment.r017.book1.ch15.text.block-055","segment.r017.book1.ch15.text.block-056","segment.r017.book1.ch15.text.block-057","segment.r017.book1.ch15.text.block-058","segment.r017.book1.ch15.text.block-059","segment.r017.book1.ch15.text.block-060","segment.r017.book1.ch15.text.block-061","segment.r017.book1.ch15.text.block-062","segment.r017.book1.ch15.text.block-063","segment.r017.book1.ch15.text.block-064","segment.r017.book1.ch15.text.block-065","segment.r017.book1.ch15.text.block-066","segment.r017.book1.ch15.text.block-067","segment.r017.book1.ch15.text.block-068","segment.r017.book1.ch15.text.block-069","segment.r017.book1.ch15.text.block-070","segment.r017.book1.ch15.text.block-071","segment.r017.book1.ch15.text.block-072","segment.r017.book1.ch15.text.block-073","segment.r017.book1.ch15.text.block-074","segment.r017.book1.ch15.text.block-075","segment.r017.book1.ch15.text.block-076","segment.r017.book1.ch15.text.block-077","segment.r017.book1.ch15.text.block-078","segment.r017.book1.ch15.text.block-079","segment.r017.book1.ch15.text.block-080","segment.r017.book1.ch15.text.block-081","segment.r017.book1.ch15.text.block-082","segment.r017.book1.ch15.text.block-083","segment.r017.book1.ch15.text.block-084","segment.r017.book1.ch15.text.block-085","segment.r017.book1.ch15.text.block-086","segment.r017.book1.ch15.text.block-087","segment.r017.book1.ch15.text.block-088","segment.r017.book1.ch15.text.block-089","segment.r017.book1.ch15.text.block-090","segment.r017.book1.ch15.text.block-091","segment.r017.book1.ch15.text.block-092","segment.r017.book1.ch15.text.block-093","segment.r017.book1.ch15.text.block-094","segment.r017.book1.ch15.text.block-095","segment.r017.book1.ch15.text.block-096","segment.r017.book1.ch15.text.block-097","segment.r017.book1.ch15.text.block-098","segment.r017.book1.ch15.text.block-099","segment.r017.book1.ch15.text.block-100","segment.r017.book1.ch15.text.block-101","segment.r017.book1.ch15.text.block-102","segment.r017.book1.ch15.text.block-103","segment.r017.book1.ch15.text.block-104","segment.r017.book1.ch15.text.block-105","segment.r017.book1.ch15.text.block-106","segment.r017.book1.ch15.text.block-107","segment.r017.book1.ch15.text.block-108","segment.r017.book1.ch15.text.block-109","segment.r017.book1.ch15.text.block-110","segment.r017.book1.ch15.text.block-111","segment.r017.book1.ch15.text.block-112","segment.r017.book1.ch15.text.block-113","segment.r017.book1.ch15.text.block-114","segment.r017.book1.ch15.text.block-115","segment.r017.book1.ch15.text.block-116","segment.r017.book1.ch15.text.block-117","segment.r017.book1.ch15.text.block-118","segment.r017.book1.ch15.text.block-119","segment.r017.book1.ch15.text.block-120","segment.r017.book1.ch15.text.block-121","segment.r017.book1.ch15.text.block-122","segment.r017.book1.ch15.text.block-123","segment.r017.book1.ch15.text.block-124","segment.r017.book1.ch15.text.block-125","segment.r017.book1.ch15.text.block-126","segment.r017.book1.ch15.text.block-127","segment.r017.book1.ch15.text.block-128","segment.r017.book1.ch15.text.block-129","segment.r017.book1.ch15.text.block-130","segment.r017.book1.ch15.text.block-131","segment.r017.book1.ch15.text.block-132","segment.r017.book1.ch15.text.block-133","segment.r017.book1.ch15.text.block-134","segment.r017.book1.ch15.text.block-135","segment.r017.book1.ch15.text.block-136","segment.r017.book1.ch15.text.block-137","segment.r017.book1.ch15.text.block-138","segment.r017.book1.ch15.text.block-139","segment.r017.book1.ch15.text.block-140","segment.r017.book1.ch15.text.block-141","segment.r017.book1.ch15.text.block-142","segment.r017.book1.ch15.text.block-143","segment.r017.book1.ch15.text.block-144","segment.r017.book1.ch15.text.block-145","segment.r017.book1.ch15.text.block-146","segment.r017.book1.ch15.text.block-147","segment.r017.book1.ch15.text.block-148","segment.r017.book1.ch15.text.block-149","segment.r017.book1.ch15.text.block-150","segment.r017.book1.ch15.text.block-151","segment.r017.book1.ch15.text.block-152","segment.r017.book1.ch15.text.block-153","segment.r017.book1.ch15.text.block-154","segment.r017.book1.ch15.text.block-155","segment.r017.book1.ch15.text.block-156","segment.r017.book1.ch15.text.block-157","segment.r017.book1.ch15.text.block-158","segment.r017.book1.ch15.text.block-159","segment.r017.book1.ch15.text.block-160","segment.r017.book1.ch15.text.block-161","segment.r017.book1.ch15.text.block-162","segment.r017.book1.ch15.text.block-163","segment.r017.book1.ch15.text.block-164","segment.r017.book1.ch15.text.block-165","segment.r017.book1.ch15.text.block-166","segment.r017.book1.ch15.text.block-167","segment.r017.book1.ch15.text.block-168","segment.r017.book1.ch15.text.block-169","segment.r017.book1.ch15.text.block-170","segment.r017.book1.ch15.text.block-171","segment.r017.book1.ch15.text.block-172","segment.r017.book1.ch15.text.block-173","segment.r017.book1.ch15.text.block-174","segment.r017.book1.ch15.text.block-175","segment.r017.book1.ch15.text.block-176","segment.r017.book1.ch15.text.block-177","segment.r017.book1.ch15.text.block-178","segment.r017.book1.ch15.text.block-179","segment.r017.book1.ch15.text.block-180","segment.r017.book1.ch15.text.block-181","segment.r017.book1.ch15.text.block-182","segment.r017.book1.ch15.text.block-183","segment.r017.book1.ch15.text.block-184","segment.r017.book1.ch15.text.block-185","segment.r017.book1.ch15.text.block-186","segment.r017.book1.ch15.text.block-187","segment.r017.book1.ch15.text.block-188","segment.r017.book1.ch15.text.block-189","segment.r017.book1.ch15.text.block-190","segment.r017.book1.ch15.text.block-191","segment.r017.book1.ch15.text.block-192","segment.r017.book1.ch15.text.block-193","segment.r017.book1.ch15.text.block-194","segment.r017.book1.ch15.text.block-195","segment.r017.book1.ch15.text.block-196","segment.r017.book1.ch15.text.block-197","segment.r017.book1.ch15.text.block-198","segment.r017.book1.ch15.text.block-199","segment.r017.book1.ch15.text.block-200","segment.r017.book1.ch15.text.block-201","segment.r017.book1.ch15.text.block-202","segment.r017.book1.ch15.text.block-203","segment.r017.book1.ch15.text.block-204","segment.r017.book1.ch15.text.block-205","segment.r017.book1.ch15.text.block-206","segment.r017.book1.ch15.text.block-207","segment.r017.book1.ch15.text.block-208","segment.r017.book1.ch15.text.block-209","segment.r017.book1.ch15.text.block-210","segment.r017.book1.ch15.text.block-211","segment.r017.book1.ch15.text.block-212","segment.r017.book1.ch15.text.block-213","segment.r017.book1.ch15.text.block-214","segment.r017.book1.ch15.text.block-215","segment.r017.book1.ch15.text.block-216","segment.r017.book1.ch15.text.block-217","segment.r017.book1.ch15.text.block-218","segment.r017.book1.ch15.text.block-219","segment.r017.book1.ch15.text.block-220","segment.r017.book1.ch15.text.block-221","segment.r017.book1.ch15.text.block-222","segment.r017.book1.ch15.text.block-223","segment.r017.book1.ch15.text.block-224","segment.r017.book1.ch15.text.block-225","segment.r017.book1.ch15.text.block-226","segment.r017.book1.ch15.text.block-227","segment.r017.book1.ch15.text.block-228","segment.r017.book1.ch15.text.block-229","segment.r017.book1.ch15.text.block-230","segment.r017.book1.ch15.text.block-231","segment.r017.book1.ch15.text.block-232","segment.r017.book1.ch15.text.block-233","segment.r017.book1.ch15.text.block-234","segment.r017.book1.ch15.text.block-235","segment.r017.book1.ch15.text.block-236","segment.r017.book1.ch15.text.block-237","segment.r017.book1.ch15.text.block-238","segment.r017.book1.ch15.text.block-239","segment.r017.book1.ch15.text.block-240","segment.r017.book1.ch15.text.block-241","segment.r017.book1.ch15.text.block-242","segment.r017.book1.ch15.text.block-243","segment.r017.book1.ch15.text.block-244","segment.r017.book1.ch15.text.block-245","segment.r017.book1.ch15.text.block-246","segment.r017.book1.ch15.text.block-247","segment.r017.book1.ch15.text.block-248","segment.r017.book1.ch15.text.block-249","segment.r017.book1.ch15.text.block-250","segment.r017.book1.ch15.text.block-251","segment.r017.book1.ch15.text.block-252","segment.r017.book1.ch15.text.block-253","segment.r017.book1.ch15.text.block-254","segment.r017.book1.ch15.text.block-255","segment.r017.book1.ch15.text.block-256","segment.r017.book1.ch15.text.block-257","segment.r017.book1.ch15.text.block-258","segment.r017.book1.ch15.text.block-259","segment.r017.book1.ch15.text.block-260","segment.r017.book1.ch15.text.block-261","segment.r017.book1.ch15.text.block-262","segment.r017.book1.ch15.text.block-263","segment.r017.book1.ch15.text.block-264","segment.r017.book1.ch15.text.block-265","segment.r017.book1.ch15.text.block-266","segment.r017.book1.ch15.text.block-267","segment.r017.book1.ch15.text.block-268","segment.r017.book1.ch15.text.block-269","segment.r017.book1.ch15.text.block-270","segment.r017.book1.ch15.text.block-271","segment.r017.book1.ch15.text.block-272","segment.r017.book1.ch15.text.block-273","segment.r017.book1.ch15.text.block-274","segment.r017.book1.ch15.text.block-275","segment.r017.book1.ch15.text.block-276","segment.r017.book1.ch15.text.block-277","segment.r017.book1.ch15.text.block-278","segment.r017.book1.ch15.text.block-279","segment.r017.book1.ch15.text.block-280","segment.r017.book1.ch15.text.block-281","segment.r017.book1.ch15.text.block-282","segment.r017.book1.ch15.text.block-283","segment.r017.book1.ch15.text.block-284","segment.r017.book1.ch15.text.block-285","segment.r017.book1.ch15.text.block-286","segment.r017.book1.ch15.text.block-287","segment.r017.book1.ch15.text.block-288","segment.r017.book1.ch15.text.block-289","segment.r017.book1.ch15.text.block-290","segment.r017.book1.ch15.text.block-291","segment.r017.book1.ch15.text.block-292","segment.r017.book1.ch15.text.block-293","segment.r017.book1.ch15.text.block-294","segment.r017.book1.ch15.text.block-295","segment.r017.book1.ch15.text.block-296","segment.r017.book1.ch15.text.block-297","segment.r017.book1.ch15.text.block-298","segment.r017.book1.ch15.text.block-299","segment.r017.book1.ch15.text.block-300","segment.r017.book1.ch15.text.block-301","segment.r017.book1.ch15.text.block-302","segment.r017.book1.ch15.text.block-303","segment.r017.book1.ch15.text.block-304","segment.r017.book1.ch15.text.block-305","segment.r017.book1.ch15.text.block-306","segment.r017.book1.ch15.text.block-307","segment.r017.book1.ch15.text.block-308","segment.r017.book1.ch15.text.block-309","segment.r017.book1.ch15.text.block-310","segment.r017.book1.ch15.text.block-311","segment.r017.book1.ch15.text.block-312","segment.r017.book1.ch15.text.block-313","segment.r017.book1.ch15.text.block-314","segment.r017.book1.ch15.text.block-315","segment.r017.book1.ch15.text.block-316","segment.r017.book1.ch15.text.block-317","segment.r017.book1.ch15.text.block-318","segment.r017.book1.ch15.text.block-319","segment.r017.book1.ch15.text.block-320","segment.r017.book1.ch15.text.block-321","segment.r017.book1.ch15.text.block-322","segment.r017.book1.ch15.text.block-323","segment.r017.book1.ch15.text.block-324","segment.r017.book1.ch15.text.block-325","segment.r017.book1.ch15.text.block-326","segment.r017.book1.ch15.text.block-327","segment.r017.book1.ch15.text.block-328","segment.r017.book1.ch15.text.block-329","segment.r017.book1.ch15.text.block-330","segment.r017.book1.ch15.text.block-331","segment.r017.book1.ch15.text.block-332","segment.r017.book1.ch15.text.block-333","segment.r017.book1.ch15.text.block-334","segment.r017.book1.ch15.text.block-335","segment.r017.book1.ch15.text.block-336","segment.r017.book1.ch15.text.block-337","segment.r017.book1.ch15.text.block-338","segment.r017.book1.ch15.text.block-339","segment.r017.book1.ch15.text.block-340","segment.r017.book1.ch15.text.block-341","segment.r017.book1.ch15.text.block-342"],"native":{"concept_id":"concept.binary-integer-programming","evidence":"first-boundary editorial terminology decision","id":"term.binary-integer-programming.id","preferred":"pemrograman bilangan bulat biner","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"model class; abbreviation BIP retained","source_locale":"en","source_term":"binary integer programming","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch03.readme.block-001","segment.o018.lab.ch03.readme.block-002","segment.o018.lab.ch03.readme.block-003","segment.o018.lab.ch03.readme.block-004","segment.o018.lab.ch03.readme.block-005","segment.o018.lab.ch03.readme.block-006","segment.o018.lab.ch03.readme.block-007","segment.o018.lab.ch03.readme.block-008","segment.o018.lab.ch03.readme.block-009","segment.o018.lab.ch03.readme.block-010","segment.o018.lab.ch03.readme.block-011","segment.o018.lab.ch03.readme.block-012","segment.o018.lab.ch03.readme.block-013","segment.o018.lab.ch03.readme.block-014","segment.o018.lab.ch03.readme.block-015","segment.o018.lab.ch03.readme.block-016","segment.o018.lab.ch03.readme.block-017","segment.o018.lab.ch03.readme.block-018","segment.o018.lab.ch10.attribution.block-001","segment.o018.lab.ch10.attribution.block-002","segment.o018.lab.ch10.attribution.block-003","segment.o018.lab.ch10.attribution.block-004","segment.o018.lab.ch10.attribution.block-005","segment.o018.lab.ch10.attribution.block-006","segment.o018.lab.ch10.attribution.block-007","segment.o018.lab.ch10.attribution.block-008","segment.o018.lab.ch10.attribution.block-009","segment.o018.lab.ch10.attribution.block-010","segment.o018.lab.ch10.attribution.block-011","segment.o018.lab.ch10.attribution.block-012","segment.o018.lab.ch10.attribution.block-013","segment.o018.lab.ch10.attribution.block-014","segment.o018.lab.ch10.attribution.block-015","segment.o018.lab.ch10.attribution.block-016","segment.o018.lab.ch10.attribution.block-017","segment.o018.lab.ch10.readme.block-001","segment.o018.lab.ch10.readme.block-002","segment.o018.lab.ch10.readme.block-003","segment.o018.lab.ch10.readme.block-004","segment.o018.lab.ch10.readme.block-005","segment.o018.lab.ch10.readme.block-006","segment.o018.lab.ch10.readme.block-007","segment.o018.lab.ch10.readme.block-008","segment.o018.lab.ch10.readme.block-009","segment.o018.lab.ch10.readme.block-010","segment.r017.book1.ch03.text.block-059","segment.r017.book1.ch03.text.block-063","segment.r017.book1.ch10.solutions-manual.block-001","segment.r017.book1.ch10.solutions-manual.block-002","segment.r017.book1.ch10.solutions-manual.block-003","segment.r017.book1.ch10.solutions-manual.block-004","segment.r017.book1.ch10.solutions-manual.block-005","segment.r017.book1.ch10.solutions-manual.block-006","segment.r017.book1.ch10.solutions-manual.block-007","segment.r017.book1.ch10.solutions-manual.block-008","segment.r017.book1.ch10.solutions-manual.block-009","segment.r017.book1.ch10.solutions-manual.block-010","segment.r017.book1.ch10.solutions-manual.block-011","segment.r017.book1.ch10.solutions-manual.block-012","segment.r017.book1.ch10.solutions-manual.block-013","segment.r017.book1.ch10.solutions-manual.block-014","segment.r017.book1.ch10.solutions-manual.block-015","segment.r017.book1.ch10.solutions-manual.block-016","segment.r017.book1.ch10.solutions-manual.block-017","segment.r017.book1.ch10.solutions-manual.block-018","segment.r017.book1.ch10.solutions-manual.block-019","segment.r017.book1.ch10.solutions-manual.block-020","segment.r017.book1.ch10.solutions-manual.block-021","segment.r017.book1.ch10.solutions-manual.block-022","segment.r017.book1.ch10.solutions-manual.block-023","segment.r017.book1.ch10.solutions-manual.block-024","segment.r017.book1.ch10.solutions-manual.block-025","segment.r017.book1.ch10.solutions-manual.block-026","segment.r017.book1.ch10.solutions-manual.block-027","segment.r017.book1.ch10.solutions-manual.block-028","segment.r017.book1.ch10.solutions-manual.block-029","segment.r017.book1.ch10.solutions-manual.block-030","segment.r017.book1.ch10.solutions-manual.block-031","segment.r017.book1.ch10.solutions-manual.block-032","segment.r017.book1.ch10.solutions-manual.block-033","segment.r017.book1.ch10.solutions-manual.block-034","segment.r017.book1.ch10.solutions-manual.block-035","segment.r017.book1.ch10.solutions-manual.block-036","segment.r017.book1.ch10.solutions-manual.block-037","segment.r017.book1.ch10.solutions-manual.block-038","segment.r017.book1.ch10.solutions-manual.block-039","segment.r017.book1.ch10.solutions-manual.block-040","segment.r017.book1.ch10.solutions-manual.block-041","segment.r017.book1.ch10.solutions-manual.block-042","segment.r017.book1.ch10.solutions-manual.block-043","segment.r017.book1.ch10.text.block-001","segment.r017.book1.ch10.text.block-002","segment.r017.book1.ch10.text.block-003","segment.r017.book1.ch10.text.block-004","segment.r017.book1.ch10.text.block-005","segment.r017.book1.ch10.text.block-006","segment.r017.book1.ch10.text.block-007","segment.r017.book1.ch10.text.block-008","segment.r017.book1.ch10.text.block-009","segment.r017.book1.ch10.text.block-010","segment.r017.book1.ch10.text.block-011","segment.r017.book1.ch10.text.block-012","segment.r017.book1.ch10.text.block-013","segment.r017.book1.ch10.text.block-014","segment.r017.book1.ch10.text.block-015","segment.r017.book1.ch10.text.block-016","segment.r017.book1.ch10.text.block-017","segment.r017.book1.ch10.text.block-018","segment.r017.book1.ch10.text.block-019","segment.r017.book1.ch10.text.block-020","segment.r017.book1.ch10.text.block-021","segment.r017.book1.ch10.text.block-022","segment.r017.book1.ch10.text.block-023","segment.r017.book1.ch10.text.block-024","segment.r017.book1.ch10.text.block-025","segment.r017.book1.ch10.text.block-026","segment.r017.book1.ch10.text.block-027","segment.r017.book1.ch10.text.block-028","segment.r017.book1.ch10.text.block-029","segment.r017.book1.ch10.text.block-030","segment.r017.book1.ch10.text.block-031","segment.r017.book1.ch10.text.block-032","segment.r017.book1.ch10.text.block-033","segment.r017.book1.ch10.text.block-034","segment.r017.book1.ch10.text.block-035","segment.r017.book1.ch10.text.block-036","segment.r017.book1.ch10.text.block-037","segment.r017.book1.ch10.text.block-038","segment.r017.book1.ch10.text.block-039","segment.r017.book1.ch10.text.block-040","segment.r017.book1.ch10.text.block-041","segment.r017.book1.ch10.text.block-042","segment.r017.book1.ch10.text.block-043","segment.r017.book1.ch10.text.block-044","segment.r017.book1.ch10.text.block-045","segment.r017.book1.ch10.text.block-046","segment.r017.book1.ch10.text.block-047","segment.r017.book1.ch10.text.block-048","segment.r017.book1.ch10.text.block-049","segment.r017.book1.ch10.text.block-050","segment.r017.book1.ch10.text.block-051","segment.r017.book1.ch10.text.block-052","segment.r017.book1.ch10.text.block-053","segment.r017.book1.ch10.text.block-054","segment.r017.book1.ch10.text.block-055","segment.r017.book1.ch10.text.block-056","segment.r017.book1.ch10.text.block-057","segment.r017.book1.ch10.text.block-058","segment.r017.book1.ch10.text.block-059","segment.r017.book1.ch10.text.block-060","segment.r017.book1.ch10.text.block-061","segment.r017.book1.ch10.text.block-062","segment.r017.book1.ch10.text.block-063","segment.r017.book1.ch10.text.block-064","segment.r017.book1.ch10.text.block-065","segment.r017.book1.ch10.text.block-066","segment.r017.book1.ch10.text.block-067","segment.r017.book1.ch10.text.block-068","segment.r017.book1.ch10.text.block-069","segment.r017.book1.ch10.text.block-070","segment.r017.book1.ch10.text.block-071","segment.r017.book1.ch10.text.block-072","segment.r017.book1.ch10.text.block-073","segment.r017.book1.ch10.text.block-074","segment.r017.book1.ch10.text.block-075","segment.r017.book1.ch10.text.block-076","segment.r017.book1.ch10.text.block-077","segment.r017.book1.ch10.text.block-078","segment.r017.book1.ch10.text.block-079","segment.r017.book1.ch10.text.block-080","segment.r017.book1.ch10.text.block-081","segment.r017.book1.ch10.text.block-082","segment.r017.book1.ch10.text.block-083","segment.r017.book1.ch10.text.block-084","segment.r017.book1.ch10.text.block-085","segment.r017.book1.ch10.text.block-086","segment.r017.book1.ch10.text.block-087","segment.r017.book1.ch10.text.block-088","segment.r017.book1.ch10.text.block-089","segment.r017.book1.ch10.text.block-090","segment.r017.book1.ch10.text.block-091","segment.r017.book1.ch10.text.block-092","segment.r017.book1.ch10.text.block-093","segment.r017.book1.ch10.text.block-094","segment.r017.book1.ch10.text.block-095","segment.r017.book1.ch10.text.block-096","segment.r017.book1.ch10.text.block-097","segment.r017.book1.ch10.text.block-098","segment.r017.book1.ch10.text.block-099","segment.r017.book1.ch10.text.block-100","segment.r017.book1.ch10.text.block-101","segment.r017.book1.ch10.text.block-102","segment.r017.book1.ch10.text.block-103","segment.r017.book1.ch10.text.block-104","segment.r017.book1.ch10.text.block-105","segment.r017.book1.ch10.text.block-106","segment.r017.book1.ch10.text.block-107","segment.r017.book1.ch10.text.block-108","segment.r017.book1.ch10.text.block-109","segment.r017.book1.ch10.text.block-110","segment.r017.book1.ch10.text.block-111","segment.r017.book1.ch10.text.block-112","segment.r017.book1.ch10.text.block-113","segment.r017.book1.ch10.text.block-114","segment.r017.book1.ch10.text.block-115","segment.r017.book1.ch10.text.block-116","segment.r017.book1.ch10.text.block-117","segment.r017.book1.ch10.text.block-118","segment.r017.book1.ch10.text.block-119","segment.r017.book1.ch10.text.block-120","segment.r017.book1.ch10.text.block-121","segment.r017.book1.ch10.text.block-122","segment.r017.book1.ch10.text.block-123","segment.r017.book1.ch10.text.block-124","segment.r017.book1.ch10.text.block-125","segment.r017.book1.ch10.text.block-126","segment.r017.book1.ch10.text.block-127","segment.r017.book1.ch10.text.block-128","segment.r017.book1.ch10.text.block-129","segment.r017.book1.ch10.text.block-130","segment.r017.book1.ch10.text.block-131","segment.r017.book1.ch10.text.block-132","segment.r017.book1.ch10.text.block-133","segment.r017.book1.ch10.text.block-134"],"native":{"concept_id":"concept.sensitivity-analysis","evidence":"Chapter 3 terminology decision","id":"term.binding-constraint.id","preferred":"kendala aktif","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"Solver reports and sensitivity analysis","source_locale":"en","source_term":"binding constraint","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["kendala binding"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.bland-rule","evidence":"Chapter 7 terminology decision","id":"term.bland-rule.id","preferred":"aturan Bland","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"simplex anti-cycling","source_locale":"en","source_term":"Bland's rule","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.canonical-form","evidence":"Chapter 7 terminology decision","id":"term.canonical-form.id","preferred":"bentuk kanonik","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"simplex dictionaries","source_locale":"en","source_term":"canonical form","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch02.text.block-116","segment.r017.book1.ch04.text-b.block-154","segment.r017.book1.ch04.text-b.block-155"],"native":{"concept_id":"concept.capital-allocation","evidence":"Final id-ID corpus terminology audit","id":"term.capital-allocation.id","preferred":"model alokasi modal","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"capital-allocation model","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch03.readme.block-001","segment.o018.lab.ch03.readme.block-002","segment.o018.lab.ch03.readme.block-003","segment.o018.lab.ch03.readme.block-004","segment.o018.lab.ch03.readme.block-005","segment.o018.lab.ch03.readme.block-006","segment.o018.lab.ch03.readme.block-007","segment.o018.lab.ch03.readme.block-008","segment.o018.lab.ch03.readme.block-009","segment.o018.lab.ch03.readme.block-010","segment.o018.lab.ch03.readme.block-011","segment.o018.lab.ch03.readme.block-012","segment.o018.lab.ch03.readme.block-013","segment.o018.lab.ch03.readme.block-014","segment.o018.lab.ch03.readme.block-015","segment.o018.lab.ch03.readme.block-016","segment.o018.lab.ch03.readme.block-017","segment.o018.lab.ch03.readme.block-018","segment.r017.book1.ch03.text.block-003","segment.r017.book1.ch04.text-a.block-030","segment.r017.book1.ch04.text-a.block-074"],"native":{"concept_id":"concept.spreadsheet-modeling","evidence":"Chapter 3 terminology decision","id":"term.cell.id","preferred":"sel","recorded_at":"2026-08-23T00:00:00+02:00","register":"technical","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"spreadsheet interface","source_locale":"en","source_term":"cell","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch02.text.block-031"],"native":{"concept_id":"concept.lp-modeling-assumptions","evidence":"Chapter 2 Assumptions section","id":"term.certainty.id","preferred":"kepastian","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear-programming modeling assumption","source_locale":"en","source_term":"certainty","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch04.readme.block-001","segment.o018.lab.ch04.readme.block-002","segment.o018.lab.ch04.readme.block-003","segment.o018.lab.ch04.readme.block-004","segment.o018.lab.ch04.readme.block-005","segment.o018.lab.ch04.readme.block-006","segment.o018.lab.ch04.readme.block-007","segment.o018.lab.ch04.readme.block-008","segment.o018.lab.ch04.readme.block-009","segment.o018.lab.ch04.readme.block-010","segment.o018.lab.ch04.readme.block-011","segment.o018.lab.ch04.readme.block-012","segment.o018.lab.ch04.readme.block-013","segment.o018.lab.ch04.readme.block-014","segment.o018.lab.ch04.readme.block-015","segment.o018.lab.ch04.readme.block-016","segment.o018.lab.ch04.readme.block-017","segment.o018.lab.ch04.readme.block-018","segment.o018.lab.ch04.readme.block-019","segment.o018.lab.ch04.readme.block-020","segment.o018.lab.ch04.readme.block-021","segment.o018.lab.ch04.readme.block-022","segment.o018.lab.ch04.readme.block-023","segment.o018.lab.ch04.readme.block-024","segment.o018.lab.ch04.readme.block-025","segment.o018.lab.ch04.readme.block-026","segment.r017.book1.ch04.text-a.block-017","segment.r017.book1.ch04.text-b.block-181"],"native":{"concept_id":"concept.compact-indexed-modeling","evidence":"Chapter 4 terminology decision","id":"term.compact-notation.id","preferred":"notasi ringkas","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"indexed optimization models","source_locale":"en","source_term":"compact notation","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch11.attribution.block-001","segment.o018.lab.ch11.attribution.block-002","segment.o018.lab.ch11.attribution.block-003","segment.o018.lab.ch11.attribution.block-004","segment.o018.lab.ch11.attribution.block-005","segment.o018.lab.ch11.attribution.block-006","segment.o018.lab.ch11.attribution.block-007","segment.o018.lab.ch11.attribution.block-008","segment.o018.lab.ch11.attribution.block-009","segment.o018.lab.ch11.attribution.block-010","segment.o018.lab.ch11.attribution.block-011","segment.o018.lab.ch11.attribution.block-012","segment.o018.lab.ch11.attribution.block-013","segment.o018.lab.ch11.attribution.block-014","segment.o018.lab.ch11.attribution.block-015","segment.o018.lab.ch11.attribution.block-016","segment.o018.lab.ch11.attribution.block-017","segment.o018.lab.ch11.attribution.block-018","segment.o018.lab.ch11.readme.block-001","segment.o018.lab.ch11.readme.block-002","segment.o018.lab.ch11.readme.block-003","segment.o018.lab.ch11.readme.block-004","segment.o018.lab.ch11.readme.block-005","segment.o018.lab.ch11.readme.block-006","segment.o018.lab.ch11.readme.block-007","segment.o018.lab.ch11.readme.block-008","segment.o018.lab.ch11.readme.block-009","segment.o018.lab.ch11.readme.block-010","segment.r017.book1.ch11.solutions-manual.block-001","segment.r017.book1.ch11.solutions-manual.block-002","segment.r017.book1.ch11.solutions-manual.block-003","segment.r017.book1.ch11.solutions-manual.block-004","segment.r017.book1.ch11.solutions-manual.block-005","segment.r017.book1.ch11.solutions-manual.block-006","segment.r017.book1.ch11.solutions-manual.block-007","segment.r017.book1.ch11.solutions-manual.block-008","segment.r017.book1.ch11.solutions-manual.block-009","segment.r017.book1.ch11.solutions-manual.block-010","segment.r017.book1.ch11.solutions-manual.block-011","segment.r017.book1.ch11.solutions-manual.block-012","segment.r017.book1.ch11.solutions-manual.block-013","segment.r017.book1.ch11.solutions-manual.block-014","segment.r017.book1.ch11.solutions-manual.block-015","segment.r017.book1.ch11.solutions-manual.block-016","segment.r017.book1.ch11.solutions-manual.block-017","segment.r017.book1.ch11.solutions-manual.block-018","segment.r017.book1.ch11.solutions-manual.block-019","segment.r017.book1.ch11.solutions-manual.block-020","segment.r017.book1.ch11.solutions-manual.block-021","segment.r017.book1.ch11.solutions-manual.block-022","segment.r017.book1.ch11.solutions-manual.block-023","segment.r017.book1.ch11.solutions-manual.block-024","segment.r017.book1.ch11.solutions-manual.block-025","segment.r017.book1.ch11.solutions-manual.block-026","segment.r017.book1.ch11.solutions-manual.block-027","segment.r017.book1.ch11.solutions-manual.block-028","segment.r017.book1.ch11.solutions-manual.block-029","segment.r017.book1.ch11.solutions-manual.block-030","segment.r017.book1.ch11.solutions-manual.block-031","segment.r017.book1.ch11.solutions-manual.block-032","segment.r017.book1.ch11.solutions-manual.block-033","segment.r017.book1.ch11.solutions-manual.block-034","segment.r017.book1.ch11.solutions-manual.block-035","segment.r017.book1.ch11.solutions-manual.block-036","segment.r017.book1.ch11.solutions-manual.block-037","segment.r017.book1.ch11.solutions-manual.block-038","segment.r017.book1.ch11.solutions-manual.block-039","segment.r017.book1.ch11.solutions-manual.block-040","segment.r017.book1.ch11.solutions-manual.block-041","segment.r017.book1.ch11.solutions-manual.block-042","segment.r017.book1.ch11.solutions-manual.block-043","segment.r017.book1.ch11.solutions-manual.block-044","segment.r017.book1.ch11.solutions-manual.block-045","segment.r017.book1.ch11.solutions-manual.block-046","segment.r017.book1.ch11.solutions-manual.block-047","segment.r017.book1.ch11.solutions-manual.block-048","segment.r017.book1.ch11.solutions-manual.block-049","segment.r017.book1.ch11.solutions-manual.block-050","segment.r017.book1.ch11.solutions-manual.block-051","segment.r017.book1.ch11.solutions-manual.block-052","segment.r017.book1.ch11.solutions-manual.block-053","segment.r017.book1.ch11.solutions-manual.block-054","segment.r017.book1.ch11.solutions-manual.block-055","segment.r017.book1.ch11.solutions-manual.block-056","segment.r017.book1.ch11.solutions-manual.block-057","segment.r017.book1.ch11.solutions-manual.block-058","segment.r017.book1.ch11.solutions-manual.block-059","segment.r017.book1.ch11.solutions-manual.block-060","segment.r017.book1.ch11.solutions-manual.block-061","segment.r017.book1.ch11.solutions-manual.block-062","segment.r017.book1.ch11.text-b.block-001","segment.r017.book1.ch11.text-b.block-002","segment.r017.book1.ch11.text-b.block-003","segment.r017.book1.ch11.text-b.block-004","segment.r017.book1.ch11.text-b.block-005","segment.r017.book1.ch11.text-b.block-006","segment.r017.book1.ch11.text-b.block-007","segment.r017.book1.ch11.text-b.block-008","segment.r017.book1.ch11.text-b.block-009","segment.r017.book1.ch11.text-b.block-010","segment.r017.book1.ch11.text-b.block-011","segment.r017.book1.ch11.text-b.block-012","segment.r017.book1.ch11.text-b.block-013","segment.r017.book1.ch11.text-b.block-014","segment.r017.book1.ch11.text-b.block-015","segment.r017.book1.ch11.text-b.block-016","segment.r017.book1.ch11.text-b.block-017","segment.r017.book1.ch11.text-b.block-018","segment.r017.book1.ch11.text-b.block-019","segment.r017.book1.ch11.text-b.block-020","segment.r017.book1.ch11.text-b.block-021","segment.r017.book1.ch11.text-b.block-022","segment.r017.book1.ch11.text-b.block-023","segment.r017.book1.ch11.text-b.block-024","segment.r017.book1.ch11.text-b.block-025","segment.r017.book1.ch11.text-b.block-026","segment.r017.book1.ch11.text-b.block-027","segment.r017.book1.ch11.text-b.block-028","segment.r017.book1.ch11.text-b.block-029","segment.r017.book1.ch11.text-b.block-030","segment.r017.book1.ch11.text-b.block-031","segment.r017.book1.ch11.text-b.block-032","segment.r017.book1.ch11.text-b.block-033","segment.r017.book1.ch11.text-b.block-034","segment.r017.book1.ch11.text-b.block-035","segment.r017.book1.ch11.text-b.block-036","segment.r017.book1.ch11.text-b.block-037","segment.r017.book1.ch11.text-b.block-038","segment.r017.book1.ch11.text-b.block-039","segment.r017.book1.ch11.text-b.block-040","segment.r017.book1.ch11.text-b.block-041","segment.r017.book1.ch11.text-b.block-042","segment.r017.book1.ch11.text-b.block-043","segment.r017.book1.ch11.text-b.block-044","segment.r017.book1.ch11.text-b.block-045","segment.r017.book1.ch11.text-b.block-046","segment.r017.book1.ch11.text-b.block-047","segment.r017.book1.ch11.text-b.block-048","segment.r017.book1.ch11.text-b.block-049","segment.r017.book1.ch11.text-b.block-050","segment.r017.book1.ch11.text-b.block-051","segment.r017.book1.ch11.text-b.block-052","segment.r017.book1.ch11.text-b.block-053","segment.r017.book1.ch11.text-b.block-054","segment.r017.book1.ch11.text-b.block-055","segment.r017.book1.ch11.text-b.block-056","segment.r017.book1.ch11.text-b.block-057","segment.r017.book1.ch11.text-b.block-058","segment.r017.book1.ch11.text-b.block-059","segment.r017.book1.ch11.text-b.block-060","segment.r017.book1.ch11.text-b.block-061","segment.r017.book1.ch11.text-b.block-062","segment.r017.book1.ch11.text-b.block-063","segment.r017.book1.ch11.text-b.block-064","segment.r017.book1.ch11.text-b.block-065","segment.r017.book1.ch11.text-b.block-066","segment.r017.book1.ch11.text-b.block-067","segment.r017.book1.ch11.text-b.block-068","segment.r017.book1.ch11.text-b.block-069","segment.r017.book1.ch11.text-b.block-070","segment.r017.book1.ch11.text-b.block-071","segment.r017.book1.ch11.text-b.block-072","segment.r017.book1.ch11.text-b.block-073","segment.r017.book1.ch11.text-b.block-074","segment.r017.book1.ch11.text-b.block-075","segment.r017.book1.ch11.text-b.block-076","segment.r017.book1.ch11.text-b.block-077","segment.r017.book1.ch11.text-b.block-078","segment.r017.book1.ch11.text-b.block-079","segment.r017.book1.ch11.text-b.block-080","segment.r017.book1.ch11.text-b.block-081","segment.r017.book1.ch11.text-b.block-082","segment.r017.book1.ch11.text-b.block-083","segment.r017.book1.ch11.text-b.block-084","segment.r017.book1.ch11.text-b.block-085","segment.r017.book1.ch11.text-b.block-086","segment.r017.book1.ch11.text-b.block-087","segment.r017.book1.ch11.text-b.block-088","segment.r017.book1.ch11.text-b.block-089","segment.r017.book1.ch11.text-b.block-090","segment.r017.book1.ch11.text-b.block-091","segment.r017.book1.ch11.text-b.block-092","segment.r017.book1.ch11.text-b.block-093","segment.r017.book1.ch11.text-b.block-094","segment.r017.book1.ch11.text-b.block-095","segment.r017.book1.ch11.text-b.block-096","segment.r017.book1.ch11.text-b.block-097","segment.r017.book1.ch11.text-b.block-098","segment.r017.book1.ch11.text-b.block-099","segment.r017.book1.ch11.text-b.block-100","segment.r017.book1.ch11.text-b.block-101","segment.r017.book1.ch11.text-b.block-102","segment.r017.book1.ch11.text-b.block-103","segment.r017.book1.ch11.text-b.block-104","segment.r017.book1.ch11.text-b.block-105","segment.r017.book1.ch11.text-b.block-106","segment.r017.book1.ch11.text-b.block-107","segment.r017.book1.ch11.text-b.block-108","segment.r017.book1.ch11.text-b.block-109","segment.r017.book1.ch11.text-b.block-110","segment.r017.book1.ch11.text-b.block-111","segment.r017.book1.ch11.text-b.block-112","segment.r017.book1.ch11.text-b.block-113","segment.r017.book1.ch11.text-b.block-114","segment.r017.book1.ch11.text-b.block-115","segment.r017.book1.ch11.text-b.block-116","segment.r017.book1.ch11.text-b.block-117","segment.r017.book1.ch11.text-b.block-118","segment.r017.book1.ch11.text-b.block-119","segment.r017.book1.ch11.text-b.block-120","segment.r017.book1.ch11.text-b.block-121","segment.r017.book1.ch11.text-b.block-122","segment.r017.book1.ch11.text-b.block-123","segment.r017.book1.ch11.text-b.block-124","segment.r017.book1.ch11.text-b.block-125","segment.r017.book1.ch11.text-b.block-126","segment.r017.book1.ch11.text-b.block-127","segment.r017.book1.ch11.text-b.block-128","segment.r017.book1.ch11.text-b.block-129","segment.r017.book1.ch11.text-b.block-130","segment.r017.book1.ch11.text-b.block-131","segment.r017.book1.ch11.text-b.block-132","segment.r017.book1.ch11.text-b.block-133","segment.r017.book1.ch11.text-b.block-134","segment.r017.book1.ch11.text-b.block-135","segment.r017.book1.ch11.text-b.block-136","segment.r017.book1.ch11.text-b.block-137"],"native":{"concept_id":"concept.complementary-slackness","evidence":"Full-corpus id-ID terminology audit","id":"term.complementary-slackness.id","preferred":"kelonggaran komplementer","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"complementary slackness","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch03.text.block-003"],"native":{"concept_id":"concept.conditional-formatting","evidence":"Chapter 3 terminology decision","id":"term.conditional-formatting.id","preferred":"pemformatan bersyarat","recorded_at":"2026-08-23T00:00:00+02:00","register":"technical","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"spreadsheet feature","source_locale":"en","source_term":"conditional formatting","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-004","segment.r017.book1.ch02.text.block-013"],"native":{"concept_id":"concept.constraint","evidence":"first-boundary editorial terminology decision","id":"term.constraint.id","preferred":"kendala","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"optimization model","source_locale":"en","source_term":"constraint","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["batasan"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch06.text.block-045","segment.r017.book1.ch06.text.block-124","segment.r017.book1.ch06.text.block-140","segment.r017.book1.ch06.text.block-143","segment.r017.book1.ch06.text.block-146"],"native":{"concept_id":"concept.convex-combination","evidence":"Chapter 6 terminology decision","id":"term.convex-combination.id","preferred":"kombinasi konveks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"convex geometry","source_locale":"en","source_term":"convex combination","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch06.readme.block-001","segment.o018.lab.ch06.readme.block-002","segment.o018.lab.ch06.readme.block-003","segment.o018.lab.ch06.readme.block-004","segment.o018.lab.ch06.readme.block-005","segment.o018.lab.ch06.readme.block-006","segment.o018.lab.ch06.readme.block-007","segment.o018.lab.ch06.readme.block-008","segment.o018.lab.ch06.readme.block-009","segment.o018.lab.ch06.readme.block-010","segment.r017.book1.ch06.text.block-045","segment.r017.book1.ch06.text.block-069","segment.r017.book1.ch06.text.block-089","segment.r017.book1.ch06.text.block-140","segment.r017.book1.ch06.text.block-143","segment.r017.book1.ch06.text.block-148","segment.r017.book1.ch06.text.block-151"],"native":{"concept_id":"concept.convex-set","evidence":"Chapter 6 terminology decision","id":"term.convex-set.id","preferred":"himpunan konveks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"convex geometry","source_locale":"en","source_term":"convex set","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-059"],"native":{"concept_id":"concept.convex-optimization","evidence":"first-boundary editorial terminology decision","id":"term.convex.id","preferred":"konveks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"geometry and optimization","source_locale":"en","source_term":"convex","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch06.readme.block-001","segment.o018.lab.ch06.readme.block-002","segment.o018.lab.ch06.readme.block-003","segment.o018.lab.ch06.readme.block-004","segment.o018.lab.ch06.readme.block-005","segment.o018.lab.ch06.readme.block-006","segment.o018.lab.ch06.readme.block-007","segment.o018.lab.ch06.readme.block-008","segment.o018.lab.ch06.readme.block-009","segment.o018.lab.ch06.readme.block-010","segment.r017.book1.ch06.text.block-032","segment.r017.book1.ch06.text.block-145"],"native":{"concept_id":"concept.corner-point","evidence":"Chapter 6 terminology decision","id":"term.corner-point.id","preferred":"titik sudut","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"polyhedral geometry; distinguish theorem terminology from general extreme point where needed","source_locale":"en","source_term":"corner point","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["titik ekstrem"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.cycling","evidence":"Chapter 7 terminology decision","id":"term.cycling.id","preferred":"siklus","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"simplex method","source_locale":"en","source_term":"cycling","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["perulangan siklik"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch03.text.block-003"],"native":{"concept_id":"concept.data-validation","evidence":"Chapter 3 terminology decision","id":"term.data-validation.id","preferred":"validasi data","recorded_at":"2026-08-23T00:00:00+02:00","register":"technical","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"spreadsheet feature","source_locale":"en","source_term":"data validation","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-004","segment.r017.book1.ch02.text.block-013"],"native":{"concept_id":"concept.decision-variable","evidence":"first-boundary editorial terminology decision","id":"term.decision-variable.id","preferred":"variabel keputusan","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"optimization model","source_locale":"en","source_term":"decision variable","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.degeneracy","evidence":"Chapter 7 terminology decision","id":"term.degeneracy.id","preferred":"degenerasi","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"simplex method","source_locale":"en","source_term":"degeneracy","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch02.text.block-075","segment.r017.book1.ch03.text.block-047","segment.r017.book1.ch05.text.block-144"],"native":{"concept_id":"concept.diet-problem","evidence":"Final id-ID corpus terminology audit","id":"term.diet-problem.id","preferred":"masalah diet","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"diet problem","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch14.attribution.block-001","segment.o018.lab.ch14.attribution.block-002","segment.o018.lab.ch14.attribution.block-003","segment.o018.lab.ch14.attribution.block-004","segment.o018.lab.ch14.attribution.block-005","segment.o018.lab.ch14.attribution.block-006","segment.o018.lab.ch14.attribution.block-007","segment.o018.lab.ch14.attribution.block-008","segment.o018.lab.ch14.attribution.block-009","segment.o018.lab.ch14.attribution.block-010","segment.o018.lab.ch14.attribution.block-011","segment.o018.lab.ch14.attribution.block-012","segment.o018.lab.ch14.attribution.block-013","segment.o018.lab.ch14.attribution.block-014","segment.o018.lab.ch14.attribution.block-015","segment.o018.lab.ch14.attribution.block-016","segment.o018.lab.ch14.readme.block-001","segment.o018.lab.ch14.readme.block-002","segment.o018.lab.ch14.readme.block-003","segment.o018.lab.ch14.readme.block-004","segment.o018.lab.ch14.readme.block-005","segment.o018.lab.ch14.readme.block-006","segment.o018.lab.ch14.readme.block-007","segment.o018.lab.ch14.readme.block-008","segment.o018.lab.ch14.readme.block-009","segment.o018.lab.ch14.readme.block-010","segment.r017.book1.ch14.text.block-001","segment.r017.book1.ch14.text.block-002","segment.r017.book1.ch14.text.block-003","segment.r017.book1.ch14.text.block-004","segment.r017.book1.ch14.text.block-005","segment.r017.book1.ch14.text.block-006","segment.r017.book1.ch14.text.block-007","segment.r017.book1.ch14.text.block-008","segment.r017.book1.ch14.text.block-009","segment.r017.book1.ch14.text.block-010","segment.r017.book1.ch14.text.block-011","segment.r017.book1.ch14.text.block-012","segment.r017.book1.ch14.text.block-013","segment.r017.book1.ch14.text.block-014","segment.r017.book1.ch14.text.block-015","segment.r017.book1.ch14.text.block-016","segment.r017.book1.ch14.text.block-017","segment.r017.book1.ch14.text.block-018","segment.r017.book1.ch14.text.block-019","segment.r017.book1.ch14.text.block-020","segment.r017.book1.ch14.text.block-021","segment.r017.book1.ch14.text.block-022","segment.r017.book1.ch14.text.block-023","segment.r017.book1.ch14.text.block-024","segment.r017.book1.ch14.text.block-025","segment.r017.book1.ch14.text.block-026","segment.r017.book1.ch14.text.block-027","segment.r017.book1.ch14.text.block-028","segment.r017.book1.ch14.text.block-029","segment.r017.book1.ch14.text.block-030","segment.r017.book1.ch14.text.block-031","segment.r017.book1.ch14.text.block-032","segment.r017.book1.ch14.text.block-033","segment.r017.book1.ch14.text.block-034","segment.r017.book1.ch14.text.block-035","segment.r017.book1.ch14.text.block-036","segment.r017.book1.ch14.text.block-037","segment.r017.book1.ch14.text.block-038","segment.r017.book1.ch14.text.block-039","segment.r017.book1.ch14.text.block-040","segment.r017.book1.ch14.text.block-041","segment.r017.book1.ch14.text.block-042","segment.r017.book1.ch14.text.block-043","segment.r017.book1.ch14.text.block-044","segment.r017.book1.ch14.text.block-045","segment.r017.book1.ch14.text.block-046","segment.r017.book1.ch14.text.block-047","segment.r017.book1.ch14.text.block-048","segment.r017.book1.ch14.text.block-049","segment.r017.book1.ch14.text.block-050","segment.r017.book1.ch14.text.block-051","segment.r017.book1.ch14.text.block-052","segment.r017.book1.ch14.text.block-053","segment.r017.book1.ch14.text.block-054","segment.r017.book1.ch14.text.block-055","segment.r017.book1.ch14.text.block-056","segment.r017.book1.ch14.text.block-057","segment.r017.book1.ch14.text.block-058","segment.r017.book1.ch14.text.block-059","segment.r017.book1.ch14.text.block-060","segment.r017.book1.ch14.text.block-061","segment.r017.book1.ch14.text.block-062","segment.r017.book1.ch14.text.block-063","segment.r017.book1.ch14.text.block-064","segment.r017.book1.ch14.text.block-065","segment.r017.book1.ch14.text.block-066","segment.r017.book1.ch14.text.block-067","segment.r017.book1.ch14.text.block-068","segment.r017.book1.ch14.text.block-069","segment.r017.book1.ch14.text.block-070","segment.r017.book1.ch14.text.block-071","segment.r017.book1.ch14.text.block-072","segment.r017.book1.ch14.text.block-073","segment.r017.book1.ch14.text.block-074","segment.r017.book1.ch14.text.block-075","segment.r017.book1.ch14.text.block-076","segment.r017.book1.ch14.text.block-077","segment.r017.book1.ch14.text.block-078","segment.r017.book1.ch14.text.block-079","segment.r017.book1.ch14.text.block-080","segment.r017.book1.ch14.text.block-081","segment.r017.book1.ch14.text.block-082","segment.r017.book1.ch14.text.block-083","segment.r017.book1.ch14.text.block-084","segment.r017.book1.ch14.text.block-085","segment.r017.book1.ch14.text.block-086","segment.r017.book1.ch14.text.block-087","segment.r017.book1.ch14.text.block-088","segment.r017.book1.ch14.text.block-089","segment.r017.book1.ch14.text.block-090","segment.r017.book1.ch14.text.block-091","segment.r017.book1.ch14.text.block-092","segment.r017.book1.ch14.text.block-093","segment.r017.book1.ch14.text.block-094","segment.r017.book1.ch14.text.block-095","segment.r017.book1.ch14.text.block-096","segment.r017.book1.ch14.text.block-097","segment.r017.book1.ch14.text.block-098","segment.r017.book1.ch14.text.block-099","segment.r017.book1.ch14.text.block-100","segment.r017.book1.ch14.text.block-101","segment.r017.book1.ch14.text.block-102","segment.r017.book1.ch14.text.block-103","segment.r017.book1.ch14.text.block-104","segment.r017.book1.ch14.text.block-105","segment.r017.book1.ch14.text.block-106","segment.r017.book1.ch14.text.block-107","segment.r017.book1.ch14.text.block-108","segment.r017.book1.ch14.text.block-109","segment.r017.book1.ch14.text.block-110","segment.r017.book1.ch14.text.block-111","segment.r017.book1.ch14.text.block-112","segment.r017.book1.ch14.text.block-113","segment.r017.book1.ch14.text.block-114","segment.r017.book1.ch14.text.block-115","segment.r017.book1.ch14.text.block-116","segment.r017.book1.ch14.text.block-117","segment.r017.book1.ch14.text.block-118","segment.r017.book1.ch14.text.block-119","segment.r017.book1.ch14.text.block-120","segment.r017.book1.ch14.text.block-121","segment.r017.book1.ch14.text.block-122","segment.r017.book1.ch14.text.block-123","segment.r017.book1.ch14.text.block-124","segment.r017.book1.ch14.text.block-125","segment.r017.book1.ch14.text.block-126","segment.r017.book1.ch14.text.block-127","segment.r017.book1.ch14.text.block-128","segment.r017.book1.ch14.text.block-129","segment.r017.book1.ch14.text.block-130","segment.r017.book1.ch14.text.block-131","segment.r017.book1.ch14.text.block-132","segment.r017.book1.ch14.text.block-133","segment.r017.book1.ch14.text.block-134","segment.r017.book1.ch14.text.block-135","segment.r017.book1.ch14.text.block-136","segment.r017.book1.ch14.text.block-137","segment.r017.book1.ch14.text.block-138","segment.r017.book1.ch14.text.block-139","segment.r017.book1.ch14.text.block-140","segment.r017.book1.ch14.text.block-141","segment.r017.book1.ch14.text.block-142","segment.r017.book1.ch14.text.block-143","segment.r017.book1.ch14.text.block-144","segment.r017.book1.ch14.text.block-145","segment.r017.book1.ch14.text.block-146","segment.r017.book1.ch14.text.block-147","segment.r017.book1.ch14.text.block-148","segment.r017.book1.ch14.text.block-149","segment.r017.book1.ch14.text.block-150","segment.r017.book1.ch14.text.block-151","segment.r017.book1.ch14.text.block-152","segment.r017.book1.ch14.text.block-153","segment.r017.book1.ch14.text.block-154","segment.r017.book1.ch14.text.block-155","segment.r017.book1.ch14.text.block-156","segment.r017.book1.ch14.text.block-157","segment.r017.book1.ch14.text.block-158","segment.r017.book1.ch14.text.block-159","segment.r017.book1.ch14.text.block-160","segment.r017.book1.ch14.text.block-161","segment.r017.book1.ch14.text.block-162","segment.r017.book1.ch14.text.block-163","segment.r017.book1.ch14.text.block-164","segment.r017.book1.ch14.text.block-165","segment.r017.book1.ch14.text.block-166","segment.r017.book1.ch14.text.block-167","segment.r017.book1.ch14.text.block-168","segment.r017.book1.ch14.text.block-169","segment.r017.book1.ch14.text.block-170","segment.r017.book1.ch14.text.block-171","segment.r017.book1.ch14.text.block-172","segment.r017.book1.ch14.text.block-173","segment.r017.book1.ch14.text.block-174","segment.r017.book1.ch14.text.block-175","segment.r017.book1.ch14.text.block-176","segment.r017.book1.ch14.text.block-177","segment.r017.book1.ch14.text.block-178","segment.r017.book1.ch14.text.block-179","segment.r017.book1.ch14.text.block-180","segment.r017.book1.ch14.text.block-181","segment.r017.book1.ch14.text.block-182","segment.r017.book1.ch14.text.block-183","segment.r017.book1.ch14.text.block-184","segment.r017.book1.ch14.text.block-185","segment.r017.book1.ch14.text.block-186","segment.r017.book1.ch14.text.block-187","segment.r017.book1.ch14.text.block-188","segment.r017.book1.ch14.text.block-189","segment.r017.book1.ch14.text.block-190","segment.r017.book1.ch14.text.block-191","segment.r017.book1.ch14.text.block-192","segment.r017.book1.ch14.text.block-193","segment.r017.book1.ch14.text.block-194","segment.r017.book1.ch14.text.block-195","segment.r017.book1.ch14.text.block-196","segment.r017.book1.ch14.text.block-197","segment.r017.book1.ch14.text.block-198","segment.r017.book1.ch14.text.block-199","segment.r017.book1.ch14.text.block-200","segment.r017.book1.ch14.text.block-201","segment.r017.book1.ch14.text.block-202","segment.r017.book1.ch14.text.block-203","segment.r017.book1.ch14.text.block-204","segment.r017.book1.ch14.text.block-205","segment.r017.book1.ch14.text.block-206","segment.r017.book1.ch14.text.block-207","segment.r017.book1.ch14.text.block-208","segment.r017.book1.ch14.text.block-209","segment.r017.book1.ch14.text.block-210","segment.r017.book1.ch14.text.block-211","segment.r017.book1.ch14.text.block-212","segment.r017.book1.ch14.text.block-213","segment.r017.book1.ch14.text.block-214","segment.r017.book1.ch14.text.block-215","segment.r017.book1.ch14.text.block-216","segment.r017.book1.ch14.text.block-217","segment.r017.book1.ch14.text.block-218","segment.r017.book1.ch14.text.block-219","segment.r017.book1.ch14.text.block-220","segment.r017.book1.ch14.text.block-221","segment.r017.book1.ch14.text.block-222","segment.r017.book1.ch14.text.block-223","segment.r017.book1.ch14.text.block-224","segment.r017.book1.ch14.text.block-225","segment.r017.book1.ch14.text.block-226","segment.r017.book1.ch14.text.block-227","segment.r017.book1.ch14.text.block-228","segment.r017.book1.ch14.text.block-229","segment.r017.book1.ch14.text.block-230","segment.r017.book1.ch14.text.block-231","segment.r017.book1.ch14.text.block-232","segment.r017.book1.ch14.text.block-233","segment.r017.book1.ch14.text.block-234","segment.r017.book1.ch14.text.block-235","segment.r017.book1.ch14.text.block-236","segment.r017.book1.ch14.text.block-237","segment.r017.book1.ch14.text.block-238","segment.r017.book1.ch14.text.block-239","segment.r017.book1.ch14.text.block-240","segment.r017.book1.ch14.text.block-241","segment.r017.book1.ch14.text.block-242","segment.r017.book1.ch14.text.block-243","segment.r017.book1.ch14.text.block-244","segment.r017.book1.ch14.text.block-245","segment.r017.book1.ch14.text.block-246","segment.r017.book1.ch14.text.block-247","segment.r017.book1.ch14.text.block-248","segment.r017.book1.ch14.text.block-249","segment.r017.book1.ch14.text.block-250","segment.r017.book1.ch14.text.block-251","segment.r017.book1.ch14.text.block-252","segment.r017.book1.ch14.text.block-253","segment.r017.book1.ch14.text.block-254","segment.r017.book1.ch14.text.block-255","segment.r017.book1.ch14.text.block-256","segment.r017.book1.ch14.text.block-257","segment.r017.book1.ch14.text.block-258","segment.r017.book1.ch14.text.block-259","segment.r017.book1.ch14.text.block-260","segment.r017.book1.ch14.text.block-261","segment.r017.book1.ch14.text.block-262","segment.r017.book1.ch14.text.block-263","segment.r017.book1.ch14.text.block-264","segment.r017.book1.ch14.text.block-265","segment.r017.book1.ch14.text.block-266","segment.r017.book1.ch14.text.block-267","segment.r017.book1.ch14.text.block-268","segment.r017.book1.ch14.text.block-269","segment.r017.book1.ch14.text.block-270","segment.r017.book1.ch14.text.block-271","segment.r017.book1.ch14.text.block-272","segment.r017.book1.ch14.text.block-273","segment.r017.book1.ch14.text.block-274","segment.r017.book1.ch14.text.block-275","segment.r017.book1.ch14.text.block-276","segment.r017.book1.ch14.text.block-277","segment.r017.book1.ch14.text.block-278","segment.r017.book1.ch14.text.block-279","segment.r017.book1.ch14.text.block-280","segment.r017.book1.ch14.text.block-281","segment.r017.book1.ch14.text.block-282","segment.r017.book1.ch14.text.block-283","segment.r017.book1.ch14.text.block-284","segment.r017.book1.ch14.text.block-285","segment.r017.book1.ch14.text.block-286","segment.r017.book1.ch14.text.block-287","segment.r017.book1.ch14.text.block-288","segment.r017.book1.ch14.text.block-289","segment.r017.book1.ch14.text.block-290","segment.r017.book1.ch14.text.block-291","segment.r017.book1.ch14.text.block-292","segment.r017.book1.ch14.text.block-293","segment.r017.book1.ch14.text.block-294","segment.r017.book1.ch14.text.block-295","segment.r017.book1.ch14.text.block-296","segment.r017.book1.ch14.text.block-297","segment.r017.book1.ch14.text.block-298","segment.r017.book1.ch14.text.block-299","segment.r017.book1.ch14.text.block-300","segment.r017.book1.ch14.text.block-301","segment.r017.book1.ch14.text.block-302","segment.r017.book1.ch14.text.block-303","segment.r017.book1.ch14.text.block-304","segment.r017.book1.ch14.text.block-305","segment.r017.book1.ch14.text.block-306","segment.r017.book1.ch14.text.block-307","segment.r017.book1.ch14.text.block-308","segment.r017.book1.ch14.text.block-309","segment.r017.book1.ch14.text.block-310","segment.r017.book1.ch14.text.block-311","segment.r017.book1.ch14.text.block-312","segment.r017.book1.ch14.text.block-313","segment.r017.book1.ch14.text.block-314","segment.r017.book1.ch14.text.block-315","segment.r017.book1.ch14.text.block-316","segment.r017.book1.ch14.text.block-317","segment.r017.book1.ch14.text.block-318","segment.r017.book1.ch14.text.block-319","segment.r017.book1.ch14.text.block-320","segment.r017.book1.ch14.text.block-321","segment.r017.book1.ch14.text.block-322","segment.r017.book1.ch14.text.block-323","segment.r017.book1.ch14.text.block-324","segment.r017.book1.ch14.text.block-325","segment.r017.book1.ch14.text.block-326","segment.r017.book1.ch14.text.block-327","segment.r017.book1.ch14.text.block-328","segment.r017.book1.ch14.text.block-329","segment.r017.book1.ch14.text.block-330","segment.r017.book1.ch14.text.block-331","segment.r017.book1.ch14.text.block-332","segment.r017.book1.ch14.text.block-333","segment.r017.book1.ch14.text.block-334","segment.r017.book1.ch14.text.block-335","segment.r017.book1.ch14.text.block-336","segment.r017.book1.ch14.text.block-337","segment.r017.book1.ch14.text.block-338","segment.r017.book1.ch14.text.block-339","segment.r017.book1.ch14.text.block-340","segment.r017.book1.ch14.text.block-341","segment.r017.book1.ch14.text.block-342","segment.r017.book1.ch14.text.block-343","segment.r017.book1.ch14.text.block-344","segment.r017.book1.ch14.text.block-345","segment.r017.book1.ch14.text.block-346","segment.r017.book1.ch14.text.block-347","segment.r017.book1.ch14.text.block-348","segment.r017.book1.ch14.text.block-349","segment.r017.book1.ch14.text.block-350","segment.r017.book1.ch14.text.block-351","segment.r017.book1.ch14.text.block-352","segment.r017.book1.ch14.text.block-353","segment.r017.book1.ch14.text.block-354","segment.r017.book1.ch14.text.block-355","segment.r017.book1.ch14.text.block-356","segment.r017.book1.ch14.text.block-357","segment.r017.book1.ch14.text.block-358","segment.r017.book1.ch14.text.block-359","segment.r017.book1.ch14.text.block-360","segment.r017.book1.ch14.text.block-361","segment.r017.book1.ch14.text.block-362","segment.r017.book1.ch14.text.block-363","segment.r017.book1.ch14.text.block-364","segment.r017.book1.ch14.text.block-365","segment.r017.book1.ch14.text.block-366","segment.r017.book1.ch14.text.block-367","segment.r017.book1.ch14.text.block-368","segment.r017.book1.ch14.text.block-369","segment.r017.book1.ch14.text.block-370","segment.r017.book1.ch14.text.block-371","segment.r017.book1.ch14.text.block-372","segment.r017.book1.ch14.text.block-373","segment.r017.book1.ch14.text.block-374","segment.r017.book1.ch14.text.block-375","segment.r017.book1.ch14.text.block-376","segment.r017.book1.ch14.text.block-377","segment.r017.book1.ch14.text.block-378","segment.r017.book1.ch14.text.block-379","segment.r017.book1.ch14.text.block-380","segment.r017.book1.ch14.text.block-381","segment.r017.book1.ch14.text.block-382","segment.r017.book1.ch14.text.block-383","segment.r017.book1.ch14.text.block-384","segment.r017.book1.ch14.text.block-385","segment.r017.book1.ch14.text.block-386","segment.r017.book1.ch14.text.block-387","segment.r017.book1.ch14.text.block-388","segment.r017.book1.ch14.text.block-389","segment.r017.book1.ch14.text.block-390","segment.r017.book1.ch14.text.block-391","segment.r017.book1.ch14.text.block-392","segment.r017.book1.ch14.text.block-393","segment.r017.book1.ch14.text.block-394","segment.r017.book1.ch14.text.block-395","segment.r017.book1.ch14.text.block-396","segment.r017.book1.ch14.text.block-397","segment.r017.book1.ch14.text.block-398","segment.r017.book1.ch14.text.block-399","segment.r017.book1.ch14.text.block-400","segment.r017.book1.ch14.text.block-401","segment.r017.book1.ch14.text.block-402","segment.r017.book1.ch14.text.block-403","segment.r017.book1.ch14.text.block-404","segment.r017.book1.ch14.text.block-405","segment.r017.book1.ch14.text.block-406","segment.r017.book1.ch14.text.block-407","segment.r017.book1.ch14.text.block-408","segment.r017.book1.ch14.text.block-409","segment.r017.book1.ch14.text.block-410","segment.r017.book1.ch14.text.block-411","segment.r017.book1.ch14.text.block-412","segment.r017.book1.ch14.text.block-413","segment.r017.book1.ch14.text.block-414","segment.r017.book1.ch14.text.block-415","segment.r017.book1.ch14.text.block-416","segment.r017.book1.ch14.text.block-417","segment.r017.book1.ch14.text.block-418","segment.r017.book1.ch14.text.block-419","segment.r017.book1.ch14.text.block-420","segment.r017.book1.ch14.text.block-421","segment.r017.book1.ch14.text.block-422","segment.r017.book1.ch14.text.block-423","segment.r017.book1.ch14.text.block-424","segment.r017.book1.ch14.text.block-425","segment.r017.book1.ch14.text.block-426","segment.r017.book1.ch14.text.block-427","segment.r017.book1.ch14.text.block-428"],"native":{"concept_id":"concept.dijkstra-algorithm","evidence":"Full-corpus id-ID terminology audit","id":"term.dijkstra-algorithm.id","preferred":"algoritme Dijkstra","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"Dijkstra algorithm","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch14.attribution.block-001","segment.o018.lab.ch14.attribution.block-002","segment.o018.lab.ch14.attribution.block-003","segment.o018.lab.ch14.attribution.block-004","segment.o018.lab.ch14.attribution.block-005","segment.o018.lab.ch14.attribution.block-006","segment.o018.lab.ch14.attribution.block-007","segment.o018.lab.ch14.attribution.block-008","segment.o018.lab.ch14.attribution.block-009","segment.o018.lab.ch14.attribution.block-010","segment.o018.lab.ch14.attribution.block-011","segment.o018.lab.ch14.attribution.block-012","segment.o018.lab.ch14.attribution.block-013","segment.o018.lab.ch14.attribution.block-014","segment.o018.lab.ch14.attribution.block-015","segment.o018.lab.ch14.attribution.block-016","segment.o018.lab.ch14.readme.block-001","segment.o018.lab.ch14.readme.block-002","segment.o018.lab.ch14.readme.block-003","segment.o018.lab.ch14.readme.block-004","segment.o018.lab.ch14.readme.block-005","segment.o018.lab.ch14.readme.block-006","segment.o018.lab.ch14.readme.block-007","segment.o018.lab.ch14.readme.block-008","segment.o018.lab.ch14.readme.block-009","segment.o018.lab.ch14.readme.block-010","segment.r017.book1.ch04.text-b.block-001","segment.r017.book1.ch04.text-b.block-183","segment.r017.book1.ch14.solutions-manual.block-001","segment.r017.book1.ch14.solutions-manual.block-002","segment.r017.book1.ch14.solutions-manual.block-003","segment.r017.book1.ch14.solutions-manual.block-004","segment.r017.book1.ch14.solutions-manual.block-005","segment.r017.book1.ch14.solutions-manual.block-006","segment.r017.book1.ch14.solutions-manual.block-007","segment.r017.book1.ch14.solutions-manual.block-008","segment.r017.book1.ch14.solutions-manual.block-009","segment.r017.book1.ch14.solutions-manual.block-010","segment.r017.book1.ch14.solutions-manual.block-011","segment.r017.book1.ch14.solutions-manual.block-012","segment.r017.book1.ch14.solutions-manual.block-013","segment.r017.book1.ch14.solutions-manual.block-014","segment.r017.book1.ch14.solutions-manual.block-015","segment.r017.book1.ch14.solutions-manual.block-016","segment.r017.book1.ch14.solutions-manual.block-017","segment.r017.book1.ch14.solutions-manual.block-018","segment.r017.book1.ch14.solutions-manual.block-019","segment.r017.book1.ch14.solutions-manual.block-020","segment.r017.book1.ch14.solutions-manual.block-021","segment.r017.book1.ch14.solutions-manual.block-022","segment.r017.book1.ch14.solutions-manual.block-023","segment.r017.book1.ch14.solutions-manual.block-024","segment.r017.book1.ch14.solutions-manual.block-025","segment.r017.book1.ch14.solutions-manual.block-026","segment.r017.book1.ch14.solutions-manual.block-027","segment.r017.book1.ch14.solutions-manual.block-028","segment.r017.book1.ch14.solutions-manual.block-029","segment.r017.book1.ch14.solutions-manual.block-030","segment.r017.book1.ch14.solutions-manual.block-031","segment.r017.book1.ch14.solutions-manual.block-032","segment.r017.book1.ch14.solutions-manual.block-033","segment.r017.book1.ch14.solutions-manual.block-034","segment.r017.book1.ch14.solutions-manual.block-035","segment.r017.book1.ch14.solutions-manual.block-036","segment.r017.book1.ch14.solutions-manual.block-037","segment.r017.book1.ch14.solutions-manual.block-038","segment.r017.book1.ch14.solutions-manual.block-039","segment.r017.book1.ch14.solutions-manual.block-040","segment.r017.book1.ch14.solutions-manual.block-041","segment.r017.book1.ch14.solutions-manual.block-042","segment.r017.book1.ch14.solutions-manual.block-043","segment.r017.book1.ch14.solutions-manual.block-044","segment.r017.book1.ch14.solutions-manual.block-045","segment.r017.book1.ch14.solutions-manual.block-046","segment.r017.book1.ch14.solutions-manual.block-047","segment.r017.book1.ch14.solutions-manual.block-048","segment.r017.book1.ch14.solutions-manual.block-049","segment.r017.book1.ch14.solutions-manual.block-050","segment.r017.book1.ch14.solutions-manual.block-051","segment.r017.book1.ch14.solutions-manual.block-052","segment.r017.book1.ch14.solutions-manual.block-053","segment.r017.book1.ch14.solutions-manual.block-054","segment.r017.book1.ch14.solutions-manual.block-055","segment.r017.book1.ch14.solutions-manual.block-056","segment.r017.book1.ch14.solutions-manual.block-057","segment.r017.book1.ch14.solutions-manual.block-058","segment.r017.book1.ch14.solutions-manual.block-059","segment.r017.book1.ch14.text.block-001","segment.r017.book1.ch14.text.block-002","segment.r017.book1.ch14.text.block-003","segment.r017.book1.ch14.text.block-004","segment.r017.book1.ch14.text.block-005","segment.r017.book1.ch14.text.block-006","segment.r017.book1.ch14.text.block-007","segment.r017.book1.ch14.text.block-008","segment.r017.book1.ch14.text.block-009","segment.r017.book1.ch14.text.block-010","segment.r017.book1.ch14.text.block-011","segment.r017.book1.ch14.text.block-012","segment.r017.book1.ch14.text.block-013","segment.r017.book1.ch14.text.block-014","segment.r017.book1.ch14.text.block-015","segment.r017.book1.ch14.text.block-016","segment.r017.book1.ch14.text.block-017","segment.r017.book1.ch14.text.block-018","segment.r017.book1.ch14.text.block-019","segment.r017.book1.ch14.text.block-020","segment.r017.book1.ch14.text.block-021","segment.r017.book1.ch14.text.block-022","segment.r017.book1.ch14.text.block-023","segment.r017.book1.ch14.text.block-024","segment.r017.book1.ch14.text.block-025","segment.r017.book1.ch14.text.block-026","segment.r017.book1.ch14.text.block-027","segment.r017.book1.ch14.text.block-028","segment.r017.book1.ch14.text.block-029","segment.r017.book1.ch14.text.block-030","segment.r017.book1.ch14.text.block-031","segment.r017.book1.ch14.text.block-032","segment.r017.book1.ch14.text.block-033","segment.r017.book1.ch14.text.block-034","segment.r017.book1.ch14.text.block-035","segment.r017.book1.ch14.text.block-036","segment.r017.book1.ch14.text.block-037","segment.r017.book1.ch14.text.block-038","segment.r017.book1.ch14.text.block-039","segment.r017.book1.ch14.text.block-040","segment.r017.book1.ch14.text.block-041","segment.r017.book1.ch14.text.block-042","segment.r017.book1.ch14.text.block-043","segment.r017.book1.ch14.text.block-044","segment.r017.book1.ch14.text.block-045","segment.r017.book1.ch14.text.block-046","segment.r017.book1.ch14.text.block-047","segment.r017.book1.ch14.text.block-048","segment.r017.book1.ch14.text.block-049","segment.r017.book1.ch14.text.block-050","segment.r017.book1.ch14.text.block-051","segment.r017.book1.ch14.text.block-052","segment.r017.book1.ch14.text.block-053","segment.r017.book1.ch14.text.block-054","segment.r017.book1.ch14.text.block-055","segment.r017.book1.ch14.text.block-056","segment.r017.book1.ch14.text.block-057","segment.r017.book1.ch14.text.block-058","segment.r017.book1.ch14.text.block-059","segment.r017.book1.ch14.text.block-060","segment.r017.book1.ch14.text.block-061","segment.r017.book1.ch14.text.block-062","segment.r017.book1.ch14.text.block-063","segment.r017.book1.ch14.text.block-064","segment.r017.book1.ch14.text.block-065","segment.r017.book1.ch14.text.block-066","segment.r017.book1.ch14.text.block-067","segment.r017.book1.ch14.text.block-068","segment.r017.book1.ch14.text.block-069","segment.r017.book1.ch14.text.block-070","segment.r017.book1.ch14.text.block-071","segment.r017.book1.ch14.text.block-072","segment.r017.book1.ch14.text.block-073","segment.r017.book1.ch14.text.block-074","segment.r017.book1.ch14.text.block-075","segment.r017.book1.ch14.text.block-076","segment.r017.book1.ch14.text.block-077","segment.r017.book1.ch14.text.block-078","segment.r017.book1.ch14.text.block-079","segment.r017.book1.ch14.text.block-080","segment.r017.book1.ch14.text.block-081","segment.r017.book1.ch14.text.block-082","segment.r017.book1.ch14.text.block-083","segment.r017.book1.ch14.text.block-084","segment.r017.book1.ch14.text.block-085","segment.r017.book1.ch14.text.block-086","segment.r017.book1.ch14.text.block-087","segment.r017.book1.ch14.text.block-088","segment.r017.book1.ch14.text.block-089","segment.r017.book1.ch14.text.block-090","segment.r017.book1.ch14.text.block-091","segment.r017.book1.ch14.text.block-092","segment.r017.book1.ch14.text.block-093","segment.r017.book1.ch14.text.block-094","segment.r017.book1.ch14.text.block-095","segment.r017.book1.ch14.text.block-096","segment.r017.book1.ch14.text.block-097","segment.r017.book1.ch14.text.block-098","segment.r017.book1.ch14.text.block-099","segment.r017.book1.ch14.text.block-100","segment.r017.book1.ch14.text.block-101","segment.r017.book1.ch14.text.block-102","segment.r017.book1.ch14.text.block-103","segment.r017.book1.ch14.text.block-104","segment.r017.book1.ch14.text.block-105","segment.r017.book1.ch14.text.block-106","segment.r017.book1.ch14.text.block-107","segment.r017.book1.ch14.text.block-108","segment.r017.book1.ch14.text.block-109","segment.r017.book1.ch14.text.block-110","segment.r017.book1.ch14.text.block-111","segment.r017.book1.ch14.text.block-112","segment.r017.book1.ch14.text.block-113","segment.r017.book1.ch14.text.block-114","segment.r017.book1.ch14.text.block-115","segment.r017.book1.ch14.text.block-116","segment.r017.book1.ch14.text.block-117","segment.r017.book1.ch14.text.block-118","segment.r017.book1.ch14.text.block-119","segment.r017.book1.ch14.text.block-120","segment.r017.book1.ch14.text.block-121","segment.r017.book1.ch14.text.block-122","segment.r017.book1.ch14.text.block-123","segment.r017.book1.ch14.text.block-124","segment.r017.book1.ch14.text.block-125","segment.r017.book1.ch14.text.block-126","segment.r017.book1.ch14.text.block-127","segment.r017.book1.ch14.text.block-128","segment.r017.book1.ch14.text.block-129","segment.r017.book1.ch14.text.block-130","segment.r017.book1.ch14.text.block-131","segment.r017.book1.ch14.text.block-132","segment.r017.book1.ch14.text.block-133","segment.r017.book1.ch14.text.block-134","segment.r017.book1.ch14.text.block-135","segment.r017.book1.ch14.text.block-136","segment.r017.book1.ch14.text.block-137","segment.r017.book1.ch14.text.block-138","segment.r017.book1.ch14.text.block-139","segment.r017.book1.ch14.text.block-140","segment.r017.book1.ch14.text.block-141","segment.r017.book1.ch14.text.block-142","segment.r017.book1.ch14.text.block-143","segment.r017.book1.ch14.text.block-144","segment.r017.book1.ch14.text.block-145","segment.r017.book1.ch14.text.block-146","segment.r017.book1.ch14.text.block-147","segment.r017.book1.ch14.text.block-148","segment.r017.book1.ch14.text.block-149","segment.r017.book1.ch14.text.block-150","segment.r017.book1.ch14.text.block-151","segment.r017.book1.ch14.text.block-152","segment.r017.book1.ch14.text.block-153","segment.r017.book1.ch14.text.block-154","segment.r017.book1.ch14.text.block-155","segment.r017.book1.ch14.text.block-156","segment.r017.book1.ch14.text.block-157","segment.r017.book1.ch14.text.block-158","segment.r017.book1.ch14.text.block-159","segment.r017.book1.ch14.text.block-160","segment.r017.book1.ch14.text.block-161","segment.r017.book1.ch14.text.block-162","segment.r017.book1.ch14.text.block-163","segment.r017.book1.ch14.text.block-164","segment.r017.book1.ch14.text.block-165","segment.r017.book1.ch14.text.block-166","segment.r017.book1.ch14.text.block-167","segment.r017.book1.ch14.text.block-168","segment.r017.book1.ch14.text.block-169","segment.r017.book1.ch14.text.block-170","segment.r017.book1.ch14.text.block-171","segment.r017.book1.ch14.text.block-172","segment.r017.book1.ch14.text.block-173","segment.r017.book1.ch14.text.block-174","segment.r017.book1.ch14.text.block-175","segment.r017.book1.ch14.text.block-176","segment.r017.book1.ch14.text.block-177","segment.r017.book1.ch14.text.block-178","segment.r017.book1.ch14.text.block-179","segment.r017.book1.ch14.text.block-180","segment.r017.book1.ch14.text.block-181","segment.r017.book1.ch14.text.block-182","segment.r017.book1.ch14.text.block-183","segment.r017.book1.ch14.text.block-184","segment.r017.book1.ch14.text.block-185","segment.r017.book1.ch14.text.block-186","segment.r017.book1.ch14.text.block-187","segment.r017.book1.ch14.text.block-188","segment.r017.book1.ch14.text.block-189","segment.r017.book1.ch14.text.block-190","segment.r017.book1.ch14.text.block-191","segment.r017.book1.ch14.text.block-192","segment.r017.book1.ch14.text.block-193","segment.r017.book1.ch14.text.block-194","segment.r017.book1.ch14.text.block-195","segment.r017.book1.ch14.text.block-196","segment.r017.book1.ch14.text.block-197","segment.r017.book1.ch14.text.block-198","segment.r017.book1.ch14.text.block-199","segment.r017.book1.ch14.text.block-200","segment.r017.book1.ch14.text.block-201","segment.r017.book1.ch14.text.block-202","segment.r017.book1.ch14.text.block-203","segment.r017.book1.ch14.text.block-204","segment.r017.book1.ch14.text.block-205","segment.r017.book1.ch14.text.block-206","segment.r017.book1.ch14.text.block-207","segment.r017.book1.ch14.text.block-208","segment.r017.book1.ch14.text.block-209","segment.r017.book1.ch14.text.block-210","segment.r017.book1.ch14.text.block-211","segment.r017.book1.ch14.text.block-212","segment.r017.book1.ch14.text.block-213","segment.r017.book1.ch14.text.block-214","segment.r017.book1.ch14.text.block-215","segment.r017.book1.ch14.text.block-216","segment.r017.book1.ch14.text.block-217","segment.r017.book1.ch14.text.block-218","segment.r017.book1.ch14.text.block-219","segment.r017.book1.ch14.text.block-220","segment.r017.book1.ch14.text.block-221","segment.r017.book1.ch14.text.block-222","segment.r017.book1.ch14.text.block-223","segment.r017.book1.ch14.text.block-224","segment.r017.book1.ch14.text.block-225","segment.r017.book1.ch14.text.block-226","segment.r017.book1.ch14.text.block-227","segment.r017.book1.ch14.text.block-228","segment.r017.book1.ch14.text.block-229","segment.r017.book1.ch14.text.block-230","segment.r017.book1.ch14.text.block-231","segment.r017.book1.ch14.text.block-232","segment.r017.book1.ch14.text.block-233","segment.r017.book1.ch14.text.block-234","segment.r017.book1.ch14.text.block-235","segment.r017.book1.ch14.text.block-236","segment.r017.book1.ch14.text.block-237","segment.r017.book1.ch14.text.block-238","segment.r017.book1.ch14.text.block-239","segment.r017.book1.ch14.text.block-240","segment.r017.book1.ch14.text.block-241","segment.r017.book1.ch14.text.block-242","segment.r017.book1.ch14.text.block-243","segment.r017.book1.ch14.text.block-244","segment.r017.book1.ch14.text.block-245","segment.r017.book1.ch14.text.block-246","segment.r017.book1.ch14.text.block-247","segment.r017.book1.ch14.text.block-248","segment.r017.book1.ch14.text.block-249","segment.r017.book1.ch14.text.block-250","segment.r017.book1.ch14.text.block-251","segment.r017.book1.ch14.text.block-252","segment.r017.book1.ch14.text.block-253","segment.r017.book1.ch14.text.block-254","segment.r017.book1.ch14.text.block-255","segment.r017.book1.ch14.text.block-256","segment.r017.book1.ch14.text.block-257","segment.r017.book1.ch14.text.block-258","segment.r017.book1.ch14.text.block-259","segment.r017.book1.ch14.text.block-260","segment.r017.book1.ch14.text.block-261","segment.r017.book1.ch14.text.block-262","segment.r017.book1.ch14.text.block-263","segment.r017.book1.ch14.text.block-264","segment.r017.book1.ch14.text.block-265","segment.r017.book1.ch14.text.block-266","segment.r017.book1.ch14.text.block-267","segment.r017.book1.ch14.text.block-268","segment.r017.book1.ch14.text.block-269","segment.r017.book1.ch14.text.block-270","segment.r017.book1.ch14.text.block-271","segment.r017.book1.ch14.text.block-272","segment.r017.book1.ch14.text.block-273","segment.r017.book1.ch14.text.block-274","segment.r017.book1.ch14.text.block-275","segment.r017.book1.ch14.text.block-276","segment.r017.book1.ch14.text.block-277","segment.r017.book1.ch14.text.block-278","segment.r017.book1.ch14.text.block-279","segment.r017.book1.ch14.text.block-280","segment.r017.book1.ch14.text.block-281","segment.r017.book1.ch14.text.block-282","segment.r017.book1.ch14.text.block-283","segment.r017.book1.ch14.text.block-284","segment.r017.book1.ch14.text.block-285","segment.r017.book1.ch14.text.block-286","segment.r017.book1.ch14.text.block-287","segment.r017.book1.ch14.text.block-288","segment.r017.book1.ch14.text.block-289","segment.r017.book1.ch14.text.block-290","segment.r017.book1.ch14.text.block-291","segment.r017.book1.ch14.text.block-292","segment.r017.book1.ch14.text.block-293","segment.r017.book1.ch14.text.block-294","segment.r017.book1.ch14.text.block-295","segment.r017.book1.ch14.text.block-296","segment.r017.book1.ch14.text.block-297","segment.r017.book1.ch14.text.block-298","segment.r017.book1.ch14.text.block-299","segment.r017.book1.ch14.text.block-300","segment.r017.book1.ch14.text.block-301","segment.r017.book1.ch14.text.block-302","segment.r017.book1.ch14.text.block-303","segment.r017.book1.ch14.text.block-304","segment.r017.book1.ch14.text.block-305","segment.r017.book1.ch14.text.block-306","segment.r017.book1.ch14.text.block-307","segment.r017.book1.ch14.text.block-308","segment.r017.book1.ch14.text.block-309","segment.r017.book1.ch14.text.block-310","segment.r017.book1.ch14.text.block-311","segment.r017.book1.ch14.text.block-312","segment.r017.book1.ch14.text.block-313","segment.r017.book1.ch14.text.block-314","segment.r017.book1.ch14.text.block-315","segment.r017.book1.ch14.text.block-316","segment.r017.book1.ch14.text.block-317","segment.r017.book1.ch14.text.block-318","segment.r017.book1.ch14.text.block-319","segment.r017.book1.ch14.text.block-320","segment.r017.book1.ch14.text.block-321","segment.r017.book1.ch14.text.block-322","segment.r017.book1.ch14.text.block-323","segment.r017.book1.ch14.text.block-324","segment.r017.book1.ch14.text.block-325","segment.r017.book1.ch14.text.block-326","segment.r017.book1.ch14.text.block-327","segment.r017.book1.ch14.text.block-328","segment.r017.book1.ch14.text.block-329","segment.r017.book1.ch14.text.block-330","segment.r017.book1.ch14.text.block-331","segment.r017.book1.ch14.text.block-332","segment.r017.book1.ch14.text.block-333","segment.r017.book1.ch14.text.block-334","segment.r017.book1.ch14.text.block-335","segment.r017.book1.ch14.text.block-336","segment.r017.book1.ch14.text.block-337","segment.r017.book1.ch14.text.block-338","segment.r017.book1.ch14.text.block-339","segment.r017.book1.ch14.text.block-340","segment.r017.book1.ch14.text.block-341","segment.r017.book1.ch14.text.block-342","segment.r017.book1.ch14.text.block-343","segment.r017.book1.ch14.text.block-344","segment.r017.book1.ch14.text.block-345","segment.r017.book1.ch14.text.block-346","segment.r017.book1.ch14.text.block-347","segment.r017.book1.ch14.text.block-348","segment.r017.book1.ch14.text.block-349","segment.r017.book1.ch14.text.block-350","segment.r017.book1.ch14.text.block-351","segment.r017.book1.ch14.text.block-352","segment.r017.book1.ch14.text.block-353","segment.r017.book1.ch14.text.block-354","segment.r017.book1.ch14.text.block-355","segment.r017.book1.ch14.text.block-356","segment.r017.book1.ch14.text.block-357","segment.r017.book1.ch14.text.block-358","segment.r017.book1.ch14.text.block-359","segment.r017.book1.ch14.text.block-360","segment.r017.book1.ch14.text.block-361","segment.r017.book1.ch14.text.block-362","segment.r017.book1.ch14.text.block-363","segment.r017.book1.ch14.text.block-364","segment.r017.book1.ch14.text.block-365","segment.r017.book1.ch14.text.block-366","segment.r017.book1.ch14.text.block-367","segment.r017.book1.ch14.text.block-368","segment.r017.book1.ch14.text.block-369","segment.r017.book1.ch14.text.block-370","segment.r017.book1.ch14.text.block-371","segment.r017.book1.ch14.text.block-372","segment.r017.book1.ch14.text.block-373","segment.r017.book1.ch14.text.block-374","segment.r017.book1.ch14.text.block-375","segment.r017.book1.ch14.text.block-376","segment.r017.book1.ch14.text.block-377","segment.r017.book1.ch14.text.block-378","segment.r017.book1.ch14.text.block-379","segment.r017.book1.ch14.text.block-380","segment.r017.book1.ch14.text.block-381","segment.r017.book1.ch14.text.block-382","segment.r017.book1.ch14.text.block-383","segment.r017.book1.ch14.text.block-384","segment.r017.book1.ch14.text.block-385","segment.r017.book1.ch14.text.block-386","segment.r017.book1.ch14.text.block-387","segment.r017.book1.ch14.text.block-388","segment.r017.book1.ch14.text.block-389","segment.r017.book1.ch14.text.block-390","segment.r017.book1.ch14.text.block-391","segment.r017.book1.ch14.text.block-392","segment.r017.book1.ch14.text.block-393","segment.r017.book1.ch14.text.block-394","segment.r017.book1.ch14.text.block-395","segment.r017.book1.ch14.text.block-396","segment.r017.book1.ch14.text.block-397","segment.r017.book1.ch14.text.block-398","segment.r017.book1.ch14.text.block-399","segment.r017.book1.ch14.text.block-400","segment.r017.book1.ch14.text.block-401","segment.r017.book1.ch14.text.block-402","segment.r017.book1.ch14.text.block-403","segment.r017.book1.ch14.text.block-404","segment.r017.book1.ch14.text.block-405","segment.r017.book1.ch14.text.block-406","segment.r017.book1.ch14.text.block-407","segment.r017.book1.ch14.text.block-408","segment.r017.book1.ch14.text.block-409","segment.r017.book1.ch14.text.block-410","segment.r017.book1.ch14.text.block-411","segment.r017.book1.ch14.text.block-412","segment.r017.book1.ch14.text.block-413","segment.r017.book1.ch14.text.block-414","segment.r017.book1.ch14.text.block-415","segment.r017.book1.ch14.text.block-416","segment.r017.book1.ch14.text.block-417","segment.r017.book1.ch14.text.block-418","segment.r017.book1.ch14.text.block-419","segment.r017.book1.ch14.text.block-420","segment.r017.book1.ch14.text.block-421","segment.r017.book1.ch14.text.block-422","segment.r017.book1.ch14.text.block-423","segment.r017.book1.ch14.text.block-424","segment.r017.book1.ch14.text.block-425","segment.r017.book1.ch14.text.block-426","segment.r017.book1.ch14.text.block-427","segment.r017.book1.ch14.text.block-428"],"native":{"concept_id":"concept.graph-theory","evidence":"Chapter 4 terminology decision","id":"term.directed-graph.id","preferred":"graf berarah","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"network modeling","source_locale":"en","source_term":"directed graph","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch02.text.block-031"],"native":{"concept_id":"concept.lp-modeling-assumptions","evidence":"Chapter 2 Assumptions section","id":"term.divisibility.id","preferred":"keterbagian","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear-programming modeling assumption","source_locale":"en","source_term":"divisibility","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.appendix.vectors.dot-controller.block-001","segment.r017.book1.appendix.vectors.dot-controller.block-002","segment.r017.book1.appendix.vectors.dot-controller.block-003","segment.r017.book1.appendix.vectors.dot-significance.block-001","segment.r017.book1.appendix.vectors.dot-significance.block-002","segment.r017.book1.appendix.vectors.dot-significance.block-003","segment.r017.book1.appendix.vectors.dot-significance.block-004","segment.r017.book1.appendix.vectors.dot-significance.block-005","segment.r017.book1.appendix.vectors.dot-significance.block-006","segment.r017.book1.appendix.vectors.dot-significance.block-007","segment.r017.book1.appendix.vectors.dot-significance.block-008","segment.r017.book1.appendix.vectors.dot-significance.block-009","segment.r017.book1.appendix.vectors.dot-significance.block-010","segment.r017.book1.appendix.vectors.dot-significance.block-011","segment.r017.book1.appendix.vectors.dot-significance.block-012","segment.r017.book1.appendix.vectors.dot-significance.block-013","segment.r017.book1.appendix.vectors.dot-significance.block-014","segment.r017.book1.appendix.vectors.dot-significance.block-015","segment.r017.book1.appendix.vectors.dot-significance.block-016","segment.r017.book1.appendix.vectors.dot-significance.block-017","segment.r017.book1.appendix.vectors.dot-significance.block-018","segment.r017.book1.appendix.vectors.dot-significance.block-019","segment.r017.book1.appendix.vectors.dot-significance.block-020","segment.r017.book1.appendix.vectors.dot-significance.block-021","segment.r017.book1.appendix.vectors.dot-significance.block-022","segment.r017.book1.appendix.vectors.dot-significance.block-023","segment.r017.book1.appendix.vectors.dot-significance.block-024","segment.r017.book1.appendix.vectors.dot-significance.block-025","segment.r017.book1.appendix.vectors.dot-significance.block-026","segment.r017.book1.appendix.vectors.dot-significance.block-027","segment.r017.book1.appendix.vectors.dot-significance.block-028","segment.r017.book1.appendix.vectors.dot.block-001","segment.r017.book1.appendix.vectors.dot.block-002","segment.r017.book1.appendix.vectors.dot.block-003","segment.r017.book1.appendix.vectors.dot.block-004","segment.r017.book1.appendix.vectors.dot.block-005","segment.r017.book1.appendix.vectors.dot.block-006","segment.r017.book1.appendix.vectors.dot.block-007","segment.r017.book1.appendix.vectors.dot.block-008","segment.r017.book1.appendix.vectors.dot.block-009","segment.r017.book1.appendix.vectors.dot.block-010","segment.r017.book1.appendix.vectors.dot.block-011","segment.r017.book1.appendix.vectors.dot.block-012","segment.r017.book1.appendix.vectors.dot.block-013","segment.r017.book1.appendix.vectors.dot.block-014","segment.r017.book1.appendix.vectors.dot.block-015","segment.r017.book1.appendix.vectors.dot.block-016","segment.r017.book1.appendix.vectors.dot.block-017","segment.r017.book1.appendix.vectors.dot.block-018","segment.r017.book1.appendix.vectors.dot.block-019","segment.r017.book1.appendix.vectors.dot.block-020","segment.r017.book1.appendix.vectors.dot.block-021","segment.r017.book1.appendix.vectors.dot.block-022","segment.r017.book1.appendix.vectors.dot.block-023","segment.r017.book1.appendix.vectors.dot.block-024","segment.r017.book1.appendix.vectors.dot.block-025","segment.r017.book1.appendix.vectors.dot.block-026","segment.r017.book1.appendix.vectors.dot.block-027"],"native":{"concept_id":"concept.dot-product","evidence":"Full-corpus id-ID terminology audit","id":"term.dot-product.id","preferred":"hasil kali titik","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"dot product","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch11.attribution.block-001","segment.o018.lab.ch11.attribution.block-002","segment.o018.lab.ch11.attribution.block-003","segment.o018.lab.ch11.attribution.block-004","segment.o018.lab.ch11.attribution.block-005","segment.o018.lab.ch11.attribution.block-006","segment.o018.lab.ch11.attribution.block-007","segment.o018.lab.ch11.attribution.block-008","segment.o018.lab.ch11.attribution.block-009","segment.o018.lab.ch11.attribution.block-010","segment.o018.lab.ch11.attribution.block-011","segment.o018.lab.ch11.attribution.block-012","segment.o018.lab.ch11.attribution.block-013","segment.o018.lab.ch11.attribution.block-014","segment.o018.lab.ch11.attribution.block-015","segment.o018.lab.ch11.attribution.block-016","segment.o018.lab.ch11.attribution.block-017","segment.o018.lab.ch11.attribution.block-018","segment.o018.lab.ch11.readme.block-001","segment.o018.lab.ch11.readme.block-002","segment.o018.lab.ch11.readme.block-003","segment.o018.lab.ch11.readme.block-004","segment.o018.lab.ch11.readme.block-005","segment.o018.lab.ch11.readme.block-006","segment.o018.lab.ch11.readme.block-007","segment.o018.lab.ch11.readme.block-008","segment.o018.lab.ch11.readme.block-009","segment.o018.lab.ch11.readme.block-010","segment.r017.book1.ch11.solutions-manual.block-001","segment.r017.book1.ch11.solutions-manual.block-002","segment.r017.book1.ch11.solutions-manual.block-003","segment.r017.book1.ch11.solutions-manual.block-004","segment.r017.book1.ch11.solutions-manual.block-005","segment.r017.book1.ch11.solutions-manual.block-006","segment.r017.book1.ch11.solutions-manual.block-007","segment.r017.book1.ch11.solutions-manual.block-008","segment.r017.book1.ch11.solutions-manual.block-009","segment.r017.book1.ch11.solutions-manual.block-010","segment.r017.book1.ch11.solutions-manual.block-011","segment.r017.book1.ch11.solutions-manual.block-012","segment.r017.book1.ch11.solutions-manual.block-013","segment.r017.book1.ch11.solutions-manual.block-014","segment.r017.book1.ch11.solutions-manual.block-015","segment.r017.book1.ch11.solutions-manual.block-016","segment.r017.book1.ch11.solutions-manual.block-017","segment.r017.book1.ch11.solutions-manual.block-018","segment.r017.book1.ch11.solutions-manual.block-019","segment.r017.book1.ch11.solutions-manual.block-020","segment.r017.book1.ch11.solutions-manual.block-021","segment.r017.book1.ch11.solutions-manual.block-022","segment.r017.book1.ch11.solutions-manual.block-023","segment.r017.book1.ch11.solutions-manual.block-024","segment.r017.book1.ch11.solutions-manual.block-025","segment.r017.book1.ch11.solutions-manual.block-026","segment.r017.book1.ch11.solutions-manual.block-027","segment.r017.book1.ch11.solutions-manual.block-028","segment.r017.book1.ch11.solutions-manual.block-029","segment.r017.book1.ch11.solutions-manual.block-030","segment.r017.book1.ch11.solutions-manual.block-031","segment.r017.book1.ch11.solutions-manual.block-032","segment.r017.book1.ch11.solutions-manual.block-033","segment.r017.book1.ch11.solutions-manual.block-034","segment.r017.book1.ch11.solutions-manual.block-035","segment.r017.book1.ch11.solutions-manual.block-036","segment.r017.book1.ch11.solutions-manual.block-037","segment.r017.book1.ch11.solutions-manual.block-038","segment.r017.book1.ch11.solutions-manual.block-039","segment.r017.book1.ch11.solutions-manual.block-040","segment.r017.book1.ch11.solutions-manual.block-041","segment.r017.book1.ch11.solutions-manual.block-042","segment.r017.book1.ch11.solutions-manual.block-043","segment.r017.book1.ch11.solutions-manual.block-044","segment.r017.book1.ch11.solutions-manual.block-045","segment.r017.book1.ch11.solutions-manual.block-046","segment.r017.book1.ch11.solutions-manual.block-047","segment.r017.book1.ch11.solutions-manual.block-048","segment.r017.book1.ch11.solutions-manual.block-049","segment.r017.book1.ch11.solutions-manual.block-050","segment.r017.book1.ch11.solutions-manual.block-051","segment.r017.book1.ch11.solutions-manual.block-052","segment.r017.book1.ch11.solutions-manual.block-053","segment.r017.book1.ch11.solutions-manual.block-054","segment.r017.book1.ch11.solutions-manual.block-055","segment.r017.book1.ch11.solutions-manual.block-056","segment.r017.book1.ch11.solutions-manual.block-057","segment.r017.book1.ch11.solutions-manual.block-058","segment.r017.book1.ch11.solutions-manual.block-059","segment.r017.book1.ch11.solutions-manual.block-060","segment.r017.book1.ch11.solutions-manual.block-061","segment.r017.book1.ch11.solutions-manual.block-062","segment.r017.book1.ch11.text-a.block-001","segment.r017.book1.ch11.text-a.block-002","segment.r017.book1.ch11.text-a.block-003","segment.r017.book1.ch11.text-a.block-004","segment.r017.book1.ch11.text-a.block-005","segment.r017.book1.ch11.text-a.block-006","segment.r017.book1.ch11.text-a.block-007","segment.r017.book1.ch11.text-a.block-008","segment.r017.book1.ch11.text-a.block-009","segment.r017.book1.ch11.text-a.block-010","segment.r017.book1.ch11.text-a.block-011","segment.r017.book1.ch11.text-a.block-012","segment.r017.book1.ch11.text-a.block-013","segment.r017.book1.ch11.text-a.block-014","segment.r017.book1.ch11.text-a.block-015","segment.r017.book1.ch11.text-a.block-016","segment.r017.book1.ch11.text-a.block-017","segment.r017.book1.ch11.text-a.block-018","segment.r017.book1.ch11.text-a.block-019","segment.r017.book1.ch11.text-a.block-020","segment.r017.book1.ch11.text-a.block-021","segment.r017.book1.ch11.text-a.block-022","segment.r017.book1.ch11.text-a.block-023","segment.r017.book1.ch11.text-a.block-024","segment.r017.book1.ch11.text-a.block-025","segment.r017.book1.ch11.text-a.block-026","segment.r017.book1.ch11.text-a.block-027","segment.r017.book1.ch11.text-a.block-028","segment.r017.book1.ch11.text-a.block-029","segment.r017.book1.ch11.text-a.block-030","segment.r017.book1.ch11.text-a.block-031","segment.r017.book1.ch11.text-a.block-032","segment.r017.book1.ch11.text-a.block-033","segment.r017.book1.ch11.text-a.block-034","segment.r017.book1.ch11.text-a.block-035","segment.r017.book1.ch11.text-a.block-036","segment.r017.book1.ch11.text-a.block-037","segment.r017.book1.ch11.text-a.block-038","segment.r017.book1.ch11.text-a.block-039","segment.r017.book1.ch11.text-a.block-040","segment.r017.book1.ch11.text-a.block-041","segment.r017.book1.ch11.text-a.block-042","segment.r017.book1.ch11.text-a.block-043","segment.r017.book1.ch11.text-a.block-044","segment.r017.book1.ch11.text-a.block-045","segment.r017.book1.ch11.text-a.block-046","segment.r017.book1.ch11.text-a.block-047","segment.r017.book1.ch11.text-a.block-048","segment.r017.book1.ch11.text-a.block-049","segment.r017.book1.ch11.text-a.block-050","segment.r017.book1.ch11.text-a.block-051","segment.r017.book1.ch11.text-a.block-052","segment.r017.book1.ch11.text-a.block-053","segment.r017.book1.ch11.text-a.block-054","segment.r017.book1.ch11.text-a.block-055","segment.r017.book1.ch11.text-a.block-056","segment.r017.book1.ch11.text-a.block-057","segment.r017.book1.ch11.text-a.block-058","segment.r017.book1.ch11.text-a.block-059","segment.r017.book1.ch11.text-a.block-060","segment.r017.book1.ch11.text-a.block-061","segment.r017.book1.ch11.text-a.block-062","segment.r017.book1.ch11.text-a.block-063","segment.r017.book1.ch11.text-a.block-064","segment.r017.book1.ch11.text-a.block-065","segment.r017.book1.ch11.text-a.block-066","segment.r017.book1.ch11.text-a.block-067","segment.r017.book1.ch11.text-a.block-068","segment.r017.book1.ch11.text-a.block-069","segment.r017.book1.ch11.text-a.block-070","segment.r017.book1.ch11.text-a.block-071","segment.r017.book1.ch11.text-a.block-072","segment.r017.book1.ch11.text-a.block-073","segment.r017.book1.ch11.text-a.block-074","segment.r017.book1.ch11.text-a.block-075","segment.r017.book1.ch11.text-a.block-076","segment.r017.book1.ch11.text-a.block-077","segment.r017.book1.ch11.text-a.block-078","segment.r017.book1.ch11.text-a.block-079","segment.r017.book1.ch11.text-a.block-080","segment.r017.book1.ch11.text-a.block-081","segment.r017.book1.ch11.text-a.block-082","segment.r017.book1.ch11.text-a.block-083","segment.r017.book1.ch11.text-a.block-084","segment.r017.book1.ch11.text-a.block-085","segment.r017.book1.ch11.text-a.block-086","segment.r017.book1.ch11.text-a.block-087","segment.r017.book1.ch11.text-a.block-088","segment.r017.book1.ch11.text-a.block-089","segment.r017.book1.ch11.text-a.block-090","segment.r017.book1.ch11.text-a.block-091","segment.r017.book1.ch11.text-a.block-092","segment.r017.book1.ch11.text-a.block-093","segment.r017.book1.ch11.text-a.block-094","segment.r017.book1.ch11.text-a.block-095","segment.r017.book1.ch11.text-a.block-096","segment.r017.book1.ch11.text-a.block-097","segment.r017.book1.ch11.text-a.block-098","segment.r017.book1.ch11.text-a.block-099","segment.r017.book1.ch11.text-a.block-100","segment.r017.book1.ch11.text-a.block-101","segment.r017.book1.ch11.text-a.block-102","segment.r017.book1.ch11.text-a.block-103","segment.r017.book1.ch11.text-a.block-104","segment.r017.book1.ch11.text-a.block-105","segment.r017.book1.ch11.text-a.block-106","segment.r017.book1.ch11.text-a.block-107","segment.r017.book1.ch11.text-a.block-108","segment.r017.book1.ch11.text-a.block-109","segment.r017.book1.ch11.text-a.block-110","segment.r017.book1.ch11.text-a.block-111","segment.r017.book1.ch11.text-a.block-112","segment.r017.book1.ch11.text-a.block-113","segment.r017.book1.ch11.text-a.block-114","segment.r017.book1.ch11.text-a.block-115","segment.r017.book1.ch11.text-a.block-116","segment.r017.book1.ch11.text-a.block-117","segment.r017.book1.ch11.text-a.block-118","segment.r017.book1.ch11.text-a.block-119","segment.r017.book1.ch11.text-a.block-120","segment.r017.book1.ch11.text-a.block-121","segment.r017.book1.ch11.text-a.block-122","segment.r017.book1.ch11.text-a.block-123","segment.r017.book1.ch11.text-a.block-124","segment.r017.book1.ch11.text-a.block-125","segment.r017.book1.ch11.text-a.block-126","segment.r017.book1.ch11.text-a.block-127","segment.r017.book1.ch11.text-a.block-128","segment.r017.book1.ch11.text-a.block-129","segment.r017.book1.ch11.text-a.block-130","segment.r017.book1.ch11.text-a.block-131","segment.r017.book1.ch11.text-a.block-132","segment.r017.book1.ch11.text-a.block-133","segment.r017.book1.ch11.text-a.block-134","segment.r017.book1.ch11.text-a.block-135","segment.r017.book1.ch11.text-a.block-136","segment.r017.book1.ch11.text-a.block-137","segment.r017.book1.ch11.text-a.block-138","segment.r017.book1.ch11.text-a.block-139","segment.r017.book1.ch11.text-a.block-140","segment.r017.book1.ch11.text-a.block-141","segment.r017.book1.ch11.text-a.block-142","segment.r017.book1.ch11.text-a.block-143","segment.r017.book1.ch11.text-a.block-144","segment.r017.book1.ch11.text-a.block-145","segment.r017.book1.ch11.text-a.block-146","segment.r017.book1.ch11.text-a.block-147","segment.r017.book1.ch11.text-a.block-148","segment.r017.book1.ch11.text-a.block-149","segment.r017.book1.ch11.text-a.block-150","segment.r017.book1.ch11.text-a.block-151","segment.r017.book1.ch11.text-a.block-152","segment.r017.book1.ch11.text-a.block-153","segment.r017.book1.ch11.text-a.block-154","segment.r017.book1.ch11.text-a.block-155","segment.r017.book1.ch11.text-a.block-156","segment.r017.book1.ch11.text-a.block-157","segment.r017.book1.ch11.text-a.block-158","segment.r017.book1.ch11.text-a.block-159","segment.r017.book1.ch11.text-a.block-160","segment.r017.book1.ch11.text-a.block-161","segment.r017.book1.ch11.text-a.block-162","segment.r017.book1.ch11.text-a.block-163","segment.r017.book1.ch11.text-a.block-164","segment.r017.book1.ch11.text-a.block-165","segment.r017.book1.ch11.text-a.block-166","segment.r017.book1.ch11.text-a.block-167","segment.r017.book1.ch11.text-a.block-168","segment.r017.book1.ch11.text-a.block-169","segment.r017.book1.ch11.text-a.block-170","segment.r017.book1.ch11.text-a.block-171","segment.r017.book1.ch11.text-a.block-172","segment.r017.book1.ch11.text-a.block-173","segment.r017.book1.ch11.text-a.block-174","segment.r017.book1.ch11.text-a.block-175","segment.r017.book1.ch11.text-a.block-176","segment.r017.book1.ch11.text-a.block-177","segment.r017.book1.ch11.text-a.block-178","segment.r017.book1.ch11.text-a.block-179","segment.r017.book1.ch11.text-a.block-180","segment.r017.book1.ch11.text-a.block-181","segment.r017.book1.ch11.text-a.block-182","segment.r017.book1.ch11.text-a.block-183","segment.r017.book1.ch11.text-a.block-184","segment.r017.book1.ch11.text-a.block-185","segment.r017.book1.ch11.text-a.block-186","segment.r017.book1.ch11.text-a.block-187","segment.r017.book1.ch11.text-a.block-188","segment.r017.book1.ch11.text-a.block-189","segment.r017.book1.ch11.text-a.block-190","segment.r017.book1.ch11.text-a.block-191","segment.r017.book1.ch11.text-a.block-192","segment.r017.book1.ch11.text-a.block-193","segment.r017.book1.ch11.text-a.block-194","segment.r017.book1.ch11.text-a.block-195","segment.r017.book1.ch11.text-a.block-196","segment.r017.book1.ch11.text-a.block-197","segment.r017.book1.ch11.text-a.block-198","segment.r017.book1.ch11.text-a.block-199","segment.r017.book1.ch11.text-a.block-200","segment.r017.book1.ch11.text-a.block-201","segment.r017.book1.ch11.text-a.block-202"],"native":{"concept_id":"concept.dual-formulation","evidence":"Full-corpus id-ID terminology audit","id":"term.dual-formulation.id","preferred":"formulasi dual","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"dual formulation","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.pivot-operation","evidence":"Chapter 7 terminology decision","id":"term.entering-variable.id","preferred":"variabel masuk","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"simplex pivot","source_locale":"en","source_term":"entering variable","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch13.attribution.block-001","segment.o018.lab.ch13.attribution.block-002","segment.o018.lab.ch13.attribution.block-003","segment.o018.lab.ch13.attribution.block-004","segment.o018.lab.ch13.attribution.block-005","segment.o018.lab.ch13.attribution.block-006","segment.o018.lab.ch13.attribution.block-007","segment.o018.lab.ch13.attribution.block-008","segment.o018.lab.ch13.attribution.block-009","segment.o018.lab.ch13.attribution.block-010","segment.o018.lab.ch13.attribution.block-011","segment.o018.lab.ch13.attribution.block-012","segment.o018.lab.ch13.attribution.block-013","segment.o018.lab.ch13.attribution.block-014","segment.o018.lab.ch13.attribution.block-015","segment.o018.lab.ch13.attribution.block-016","segment.o018.lab.ch13.attribution.block-017","segment.o018.lab.ch13.attribution.block-018","segment.o018.lab.ch13.readme.block-001","segment.o018.lab.ch13.readme.block-002","segment.o018.lab.ch13.readme.block-003","segment.o018.lab.ch13.readme.block-004","segment.o018.lab.ch13.readme.block-005","segment.o018.lab.ch13.readme.block-006","segment.o018.lab.ch13.readme.block-007","segment.o018.lab.ch13.readme.block-008","segment.o018.lab.ch13.readme.block-009","segment.o018.lab.ch13.readme.block-010","segment.r017.book1.ch13.text.block-001","segment.r017.book1.ch13.text.block-002","segment.r017.book1.ch13.text.block-003","segment.r017.book1.ch13.text.block-004","segment.r017.book1.ch13.text.block-005","segment.r017.book1.ch13.text.block-006","segment.r017.book1.ch13.text.block-007","segment.r017.book1.ch13.text.block-008","segment.r017.book1.ch13.text.block-009","segment.r017.book1.ch13.text.block-010","segment.r017.book1.ch13.text.block-011","segment.r017.book1.ch13.text.block-012","segment.r017.book1.ch13.text.block-013","segment.r017.book1.ch13.text.block-014","segment.r017.book1.ch13.text.block-015","segment.r017.book1.ch13.text.block-016","segment.r017.book1.ch13.text.block-017","segment.r017.book1.ch13.text.block-018","segment.r017.book1.ch13.text.block-019","segment.r017.book1.ch13.text.block-020","segment.r017.book1.ch13.text.block-021","segment.r017.book1.ch13.text.block-022","segment.r017.book1.ch13.text.block-023","segment.r017.book1.ch13.text.block-024","segment.r017.book1.ch13.text.block-025","segment.r017.book1.ch13.text.block-026","segment.r017.book1.ch13.text.block-027","segment.r017.book1.ch13.text.block-028","segment.r017.book1.ch13.text.block-029","segment.r017.book1.ch13.text.block-030","segment.r017.book1.ch13.text.block-031","segment.r017.book1.ch13.text.block-032","segment.r017.book1.ch13.text.block-033","segment.r017.book1.ch13.text.block-034","segment.r017.book1.ch13.text.block-035","segment.r017.book1.ch13.text.block-036","segment.r017.book1.ch13.text.block-037","segment.r017.book1.ch13.text.block-038","segment.r017.book1.ch13.text.block-039","segment.r017.book1.ch13.text.block-040","segment.r017.book1.ch13.text.block-041","segment.r017.book1.ch13.text.block-042","segment.r017.book1.ch13.text.block-043","segment.r017.book1.ch13.text.block-044","segment.r017.book1.ch13.text.block-045","segment.r017.book1.ch13.text.block-046","segment.r017.book1.ch13.text.block-047","segment.r017.book1.ch13.text.block-048","segment.r017.book1.ch13.text.block-049","segment.r017.book1.ch13.text.block-050","segment.r017.book1.ch13.text.block-051","segment.r017.book1.ch13.text.block-052","segment.r017.book1.ch13.text.block-053","segment.r017.book1.ch13.text.block-054","segment.r017.book1.ch13.text.block-055","segment.r017.book1.ch13.text.block-056","segment.r017.book1.ch13.text.block-057","segment.r017.book1.ch13.text.block-058","segment.r017.book1.ch13.text.block-059","segment.r017.book1.ch13.text.block-060","segment.r017.book1.ch13.text.block-061","segment.r017.book1.ch13.text.block-062","segment.r017.book1.ch13.text.block-063","segment.r017.book1.ch13.text.block-064","segment.r017.book1.ch13.text.block-065","segment.r017.book1.ch13.text.block-066","segment.r017.book1.ch13.text.block-067","segment.r017.book1.ch13.text.block-068","segment.r017.book1.ch13.text.block-069","segment.r017.book1.ch13.text.block-070","segment.r017.book1.ch13.text.block-071","segment.r017.book1.ch13.text.block-072","segment.r017.book1.ch13.text.block-073","segment.r017.book1.ch13.text.block-074","segment.r017.book1.ch13.text.block-075","segment.r017.book1.ch13.text.block-076","segment.r017.book1.ch13.text.block-077","segment.r017.book1.ch13.text.block-078","segment.r017.book1.ch13.text.block-079","segment.r017.book1.ch13.text.block-080","segment.r017.book1.ch13.text.block-081","segment.r017.book1.ch13.text.block-082","segment.r017.book1.ch13.text.block-083","segment.r017.book1.ch13.text.block-084","segment.r017.book1.ch13.text.block-085","segment.r017.book1.ch13.text.block-086","segment.r017.book1.ch13.text.block-087","segment.r017.book1.ch13.text.block-088","segment.r017.book1.ch13.text.block-089","segment.r017.book1.ch13.text.block-090","segment.r017.book1.ch13.text.block-091","segment.r017.book1.ch13.text.block-092","segment.r017.book1.ch13.text.block-093","segment.r017.book1.ch13.text.block-094","segment.r017.book1.ch13.text.block-095","segment.r017.book1.ch13.text.block-096","segment.r017.book1.ch13.text.block-097","segment.r017.book1.ch13.text.block-098","segment.r017.book1.ch13.text.block-099","segment.r017.book1.ch13.text.block-100","segment.r017.book1.ch13.text.block-101","segment.r017.book1.ch13.text.block-102","segment.r017.book1.ch13.text.block-103","segment.r017.book1.ch13.text.block-104","segment.r017.book1.ch13.text.block-105","segment.r017.book1.ch13.text.block-106","segment.r017.book1.ch13.text.block-107","segment.r017.book1.ch13.text.block-108","segment.r017.book1.ch13.text.block-109","segment.r017.book1.ch13.text.block-110","segment.r017.book1.ch13.text.block-111","segment.r017.book1.ch13.text.block-112","segment.r017.book1.ch13.text.block-113","segment.r017.book1.ch13.text.block-114","segment.r017.book1.ch13.text.block-115","segment.r017.book1.ch13.text.block-116","segment.r017.book1.ch13.text.block-117","segment.r017.book1.ch13.text.block-118","segment.r017.book1.ch13.text.block-119","segment.r017.book1.ch13.text.block-120","segment.r017.book1.ch13.text.block-121","segment.r017.book1.ch13.text.block-122"],"native":{"concept_id":"concept.epsilon-constraint-method","evidence":"Full-corpus id-ID terminology audit","id":"term.epsilon-constraint-method.id","preferred":"metode kendala epsilon","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"epsilon-constraint method","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["metode kendala ε"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch14.text.block-001","segment.r017.book1.ch14.text.block-002","segment.r017.book1.ch14.text.block-003","segment.r017.book1.ch14.text.block-004","segment.r017.book1.ch14.text.block-005","segment.r017.book1.ch14.text.block-006","segment.r017.book1.ch14.text.block-007","segment.r017.book1.ch14.text.block-008","segment.r017.book1.ch14.text.block-009","segment.r017.book1.ch14.text.block-010","segment.r017.book1.ch14.text.block-011","segment.r017.book1.ch14.text.block-012","segment.r017.book1.ch14.text.block-013","segment.r017.book1.ch14.text.block-014","segment.r017.book1.ch14.text.block-015","segment.r017.book1.ch14.text.block-016","segment.r017.book1.ch14.text.block-017","segment.r017.book1.ch14.text.block-018","segment.r017.book1.ch14.text.block-019","segment.r017.book1.ch14.text.block-020","segment.r017.book1.ch14.text.block-021","segment.r017.book1.ch14.text.block-022","segment.r017.book1.ch14.text.block-023","segment.r017.book1.ch14.text.block-024","segment.r017.book1.ch14.text.block-025","segment.r017.book1.ch14.text.block-026","segment.r017.book1.ch14.text.block-027","segment.r017.book1.ch14.text.block-028","segment.r017.book1.ch14.text.block-029","segment.r017.book1.ch14.text.block-030","segment.r017.book1.ch14.text.block-031","segment.r017.book1.ch14.text.block-032","segment.r017.book1.ch14.text.block-033","segment.r017.book1.ch14.text.block-034","segment.r017.book1.ch14.text.block-035","segment.r017.book1.ch14.text.block-036","segment.r017.book1.ch14.text.block-037","segment.r017.book1.ch14.text.block-038","segment.r017.book1.ch14.text.block-039","segment.r017.book1.ch14.text.block-040","segment.r017.book1.ch14.text.block-041","segment.r017.book1.ch14.text.block-042","segment.r017.book1.ch14.text.block-043","segment.r017.book1.ch14.text.block-044","segment.r017.book1.ch14.text.block-045","segment.r017.book1.ch14.text.block-046","segment.r017.book1.ch14.text.block-047","segment.r017.book1.ch14.text.block-048","segment.r017.book1.ch14.text.block-049","segment.r017.book1.ch14.text.block-050","segment.r017.book1.ch14.text.block-051","segment.r017.book1.ch14.text.block-052","segment.r017.book1.ch14.text.block-053","segment.r017.book1.ch14.text.block-054","segment.r017.book1.ch14.text.block-055","segment.r017.book1.ch14.text.block-056","segment.r017.book1.ch14.text.block-057","segment.r017.book1.ch14.text.block-058","segment.r017.book1.ch14.text.block-059","segment.r017.book1.ch14.text.block-060","segment.r017.book1.ch14.text.block-061","segment.r017.book1.ch14.text.block-062","segment.r017.book1.ch14.text.block-063","segment.r017.book1.ch14.text.block-064","segment.r017.book1.ch14.text.block-065","segment.r017.book1.ch14.text.block-066","segment.r017.book1.ch14.text.block-067","segment.r017.book1.ch14.text.block-068","segment.r017.book1.ch14.text.block-069","segment.r017.book1.ch14.text.block-070","segment.r017.book1.ch14.text.block-071","segment.r017.book1.ch14.text.block-072","segment.r017.book1.ch14.text.block-073","segment.r017.book1.ch14.text.block-074","segment.r017.book1.ch14.text.block-075","segment.r017.book1.ch14.text.block-076","segment.r017.book1.ch14.text.block-077","segment.r017.book1.ch14.text.block-078","segment.r017.book1.ch14.text.block-079","segment.r017.book1.ch14.text.block-080","segment.r017.book1.ch14.text.block-081","segment.r017.book1.ch14.text.block-082","segment.r017.book1.ch14.text.block-083","segment.r017.book1.ch14.text.block-084","segment.r017.book1.ch14.text.block-085","segment.r017.book1.ch14.text.block-086","segment.r017.book1.ch14.text.block-087","segment.r017.book1.ch14.text.block-088","segment.r017.book1.ch14.text.block-089","segment.r017.book1.ch14.text.block-090","segment.r017.book1.ch14.text.block-091","segment.r017.book1.ch14.text.block-092","segment.r017.book1.ch14.text.block-093","segment.r017.book1.ch14.text.block-094","segment.r017.book1.ch14.text.block-095","segment.r017.book1.ch14.text.block-096","segment.r017.book1.ch14.text.block-097","segment.r017.book1.ch14.text.block-098","segment.r017.book1.ch14.text.block-099","segment.r017.book1.ch14.text.block-100","segment.r017.book1.ch14.text.block-101","segment.r017.book1.ch14.text.block-102","segment.r017.book1.ch14.text.block-103","segment.r017.book1.ch14.text.block-104","segment.r017.book1.ch14.text.block-105","segment.r017.book1.ch14.text.block-106","segment.r017.book1.ch14.text.block-107","segment.r017.book1.ch14.text.block-108","segment.r017.book1.ch14.text.block-109","segment.r017.book1.ch14.text.block-110","segment.r017.book1.ch14.text.block-111","segment.r017.book1.ch14.text.block-112","segment.r017.book1.ch14.text.block-113","segment.r017.book1.ch14.text.block-114","segment.r017.book1.ch14.text.block-115","segment.r017.book1.ch14.text.block-116","segment.r017.book1.ch14.text.block-117","segment.r017.book1.ch14.text.block-118","segment.r017.book1.ch14.text.block-119","segment.r017.book1.ch14.text.block-120","segment.r017.book1.ch14.text.block-121","segment.r017.book1.ch14.text.block-122","segment.r017.book1.ch14.text.block-123","segment.r017.book1.ch14.text.block-124","segment.r017.book1.ch14.text.block-125","segment.r017.book1.ch14.text.block-126","segment.r017.book1.ch14.text.block-127","segment.r017.book1.ch14.text.block-128","segment.r017.book1.ch14.text.block-129","segment.r017.book1.ch14.text.block-130","segment.r017.book1.ch14.text.block-131","segment.r017.book1.ch14.text.block-132","segment.r017.book1.ch14.text.block-133","segment.r017.book1.ch14.text.block-134","segment.r017.book1.ch14.text.block-135","segment.r017.book1.ch14.text.block-136","segment.r017.book1.ch14.text.block-137","segment.r017.book1.ch14.text.block-138","segment.r017.book1.ch14.text.block-139","segment.r017.book1.ch14.text.block-140","segment.r017.book1.ch14.text.block-141","segment.r017.book1.ch14.text.block-142","segment.r017.book1.ch14.text.block-143","segment.r017.book1.ch14.text.block-144","segment.r017.book1.ch14.text.block-145","segment.r017.book1.ch14.text.block-146","segment.r017.book1.ch14.text.block-147","segment.r017.book1.ch14.text.block-148","segment.r017.book1.ch14.text.block-149","segment.r017.book1.ch14.text.block-150","segment.r017.book1.ch14.text.block-151","segment.r017.book1.ch14.text.block-152","segment.r017.book1.ch14.text.block-153","segment.r017.book1.ch14.text.block-154","segment.r017.book1.ch14.text.block-155","segment.r017.book1.ch14.text.block-156","segment.r017.book1.ch14.text.block-157","segment.r017.book1.ch14.text.block-158","segment.r017.book1.ch14.text.block-159","segment.r017.book1.ch14.text.block-160","segment.r017.book1.ch14.text.block-161","segment.r017.book1.ch14.text.block-162","segment.r017.book1.ch14.text.block-163","segment.r017.book1.ch14.text.block-164","segment.r017.book1.ch14.text.block-165","segment.r017.book1.ch14.text.block-166","segment.r017.book1.ch14.text.block-167","segment.r017.book1.ch14.text.block-168","segment.r017.book1.ch14.text.block-169","segment.r017.book1.ch14.text.block-170","segment.r017.book1.ch14.text.block-171","segment.r017.book1.ch14.text.block-172","segment.r017.book1.ch14.text.block-173","segment.r017.book1.ch14.text.block-174","segment.r017.book1.ch14.text.block-175","segment.r017.book1.ch14.text.block-176","segment.r017.book1.ch14.text.block-177","segment.r017.book1.ch14.text.block-178","segment.r017.book1.ch14.text.block-179","segment.r017.book1.ch14.text.block-180","segment.r017.book1.ch14.text.block-181","segment.r017.book1.ch14.text.block-182","segment.r017.book1.ch14.text.block-183","segment.r017.book1.ch14.text.block-184","segment.r017.book1.ch14.text.block-185","segment.r017.book1.ch14.text.block-186","segment.r017.book1.ch14.text.block-187","segment.r017.book1.ch14.text.block-188","segment.r017.book1.ch14.text.block-189","segment.r017.book1.ch14.text.block-190","segment.r017.book1.ch14.text.block-191","segment.r017.book1.ch14.text.block-192","segment.r017.book1.ch14.text.block-193","segment.r017.book1.ch14.text.block-194","segment.r017.book1.ch14.text.block-195","segment.r017.book1.ch14.text.block-196","segment.r017.book1.ch14.text.block-197","segment.r017.book1.ch14.text.block-198","segment.r017.book1.ch14.text.block-199","segment.r017.book1.ch14.text.block-200","segment.r017.book1.ch14.text.block-201","segment.r017.book1.ch14.text.block-202","segment.r017.book1.ch14.text.block-203","segment.r017.book1.ch14.text.block-204","segment.r017.book1.ch14.text.block-205","segment.r017.book1.ch14.text.block-206","segment.r017.book1.ch14.text.block-207","segment.r017.book1.ch14.text.block-208","segment.r017.book1.ch14.text.block-209","segment.r017.book1.ch14.text.block-210","segment.r017.book1.ch14.text.block-211","segment.r017.book1.ch14.text.block-212","segment.r017.book1.ch14.text.block-213","segment.r017.book1.ch14.text.block-214","segment.r017.book1.ch14.text.block-215","segment.r017.book1.ch14.text.block-216","segment.r017.book1.ch14.text.block-217","segment.r017.book1.ch14.text.block-218","segment.r017.book1.ch14.text.block-219","segment.r017.book1.ch14.text.block-220","segment.r017.book1.ch14.text.block-221","segment.r017.book1.ch14.text.block-222","segment.r017.book1.ch14.text.block-223","segment.r017.book1.ch14.text.block-224","segment.r017.book1.ch14.text.block-225","segment.r017.book1.ch14.text.block-226","segment.r017.book1.ch14.text.block-227","segment.r017.book1.ch14.text.block-228","segment.r017.book1.ch14.text.block-229","segment.r017.book1.ch14.text.block-230","segment.r017.book1.ch14.text.block-231","segment.r017.book1.ch14.text.block-232","segment.r017.book1.ch14.text.block-233","segment.r017.book1.ch14.text.block-234","segment.r017.book1.ch14.text.block-235","segment.r017.book1.ch14.text.block-236","segment.r017.book1.ch14.text.block-237","segment.r017.book1.ch14.text.block-238","segment.r017.book1.ch14.text.block-239","segment.r017.book1.ch14.text.block-240","segment.r017.book1.ch14.text.block-241","segment.r017.book1.ch14.text.block-242","segment.r017.book1.ch14.text.block-243","segment.r017.book1.ch14.text.block-244","segment.r017.book1.ch14.text.block-245","segment.r017.book1.ch14.text.block-246","segment.r017.book1.ch14.text.block-247","segment.r017.book1.ch14.text.block-248","segment.r017.book1.ch14.text.block-249","segment.r017.book1.ch14.text.block-250","segment.r017.book1.ch14.text.block-251","segment.r017.book1.ch14.text.block-252","segment.r017.book1.ch14.text.block-253","segment.r017.book1.ch14.text.block-254","segment.r017.book1.ch14.text.block-255","segment.r017.book1.ch14.text.block-256","segment.r017.book1.ch14.text.block-257","segment.r017.book1.ch14.text.block-258","segment.r017.book1.ch14.text.block-259","segment.r017.book1.ch14.text.block-260","segment.r017.book1.ch14.text.block-261","segment.r017.book1.ch14.text.block-262","segment.r017.book1.ch14.text.block-263","segment.r017.book1.ch14.text.block-264","segment.r017.book1.ch14.text.block-265","segment.r017.book1.ch14.text.block-266","segment.r017.book1.ch14.text.block-267","segment.r017.book1.ch14.text.block-268","segment.r017.book1.ch14.text.block-269","segment.r017.book1.ch14.text.block-270","segment.r017.book1.ch14.text.block-271","segment.r017.book1.ch14.text.block-272","segment.r017.book1.ch14.text.block-273","segment.r017.book1.ch14.text.block-274","segment.r017.book1.ch14.text.block-275","segment.r017.book1.ch14.text.block-276","segment.r017.book1.ch14.text.block-277","segment.r017.book1.ch14.text.block-278","segment.r017.book1.ch14.text.block-279","segment.r017.book1.ch14.text.block-280","segment.r017.book1.ch14.text.block-281","segment.r017.book1.ch14.text.block-282","segment.r017.book1.ch14.text.block-283","segment.r017.book1.ch14.text.block-284","segment.r017.book1.ch14.text.block-285","segment.r017.book1.ch14.text.block-286","segment.r017.book1.ch14.text.block-287","segment.r017.book1.ch14.text.block-288","segment.r017.book1.ch14.text.block-289","segment.r017.book1.ch14.text.block-290","segment.r017.book1.ch14.text.block-291","segment.r017.book1.ch14.text.block-292","segment.r017.book1.ch14.text.block-293","segment.r017.book1.ch14.text.block-294","segment.r017.book1.ch14.text.block-295","segment.r017.book1.ch14.text.block-296","segment.r017.book1.ch14.text.block-297","segment.r017.book1.ch14.text.block-298","segment.r017.book1.ch14.text.block-299","segment.r017.book1.ch14.text.block-300","segment.r017.book1.ch14.text.block-301","segment.r017.book1.ch14.text.block-302","segment.r017.book1.ch14.text.block-303","segment.r017.book1.ch14.text.block-304","segment.r017.book1.ch14.text.block-305","segment.r017.book1.ch14.text.block-306","segment.r017.book1.ch14.text.block-307","segment.r017.book1.ch14.text.block-308","segment.r017.book1.ch14.text.block-309","segment.r017.book1.ch14.text.block-310","segment.r017.book1.ch14.text.block-311","segment.r017.book1.ch14.text.block-312","segment.r017.book1.ch14.text.block-313","segment.r017.book1.ch14.text.block-314","segment.r017.book1.ch14.text.block-315","segment.r017.book1.ch14.text.block-316","segment.r017.book1.ch14.text.block-317","segment.r017.book1.ch14.text.block-318","segment.r017.book1.ch14.text.block-319","segment.r017.book1.ch14.text.block-320","segment.r017.book1.ch14.text.block-321","segment.r017.book1.ch14.text.block-322","segment.r017.book1.ch14.text.block-323","segment.r017.book1.ch14.text.block-324","segment.r017.book1.ch14.text.block-325","segment.r017.book1.ch14.text.block-326","segment.r017.book1.ch14.text.block-327","segment.r017.book1.ch14.text.block-328","segment.r017.book1.ch14.text.block-329","segment.r017.book1.ch14.text.block-330","segment.r017.book1.ch14.text.block-331","segment.r017.book1.ch14.text.block-332","segment.r017.book1.ch14.text.block-333","segment.r017.book1.ch14.text.block-334","segment.r017.book1.ch14.text.block-335","segment.r017.book1.ch14.text.block-336","segment.r017.book1.ch14.text.block-337","segment.r017.book1.ch14.text.block-338","segment.r017.book1.ch14.text.block-339","segment.r017.book1.ch14.text.block-340","segment.r017.book1.ch14.text.block-341","segment.r017.book1.ch14.text.block-342","segment.r017.book1.ch14.text.block-343","segment.r017.book1.ch14.text.block-344","segment.r017.book1.ch14.text.block-345","segment.r017.book1.ch14.text.block-346","segment.r017.book1.ch14.text.block-347","segment.r017.book1.ch14.text.block-348","segment.r017.book1.ch14.text.block-349","segment.r017.book1.ch14.text.block-350","segment.r017.book1.ch14.text.block-351","segment.r017.book1.ch14.text.block-352","segment.r017.book1.ch14.text.block-353","segment.r017.book1.ch14.text.block-354","segment.r017.book1.ch14.text.block-355","segment.r017.book1.ch14.text.block-356","segment.r017.book1.ch14.text.block-357","segment.r017.book1.ch14.text.block-358","segment.r017.book1.ch14.text.block-359","segment.r017.book1.ch14.text.block-360","segment.r017.book1.ch14.text.block-361","segment.r017.book1.ch14.text.block-362","segment.r017.book1.ch14.text.block-363","segment.r017.book1.ch14.text.block-364","segment.r017.book1.ch14.text.block-365","segment.r017.book1.ch14.text.block-366","segment.r017.book1.ch14.text.block-367","segment.r017.book1.ch14.text.block-368","segment.r017.book1.ch14.text.block-369","segment.r017.book1.ch14.text.block-370","segment.r017.book1.ch14.text.block-371","segment.r017.book1.ch14.text.block-372","segment.r017.book1.ch14.text.block-373","segment.r017.book1.ch14.text.block-374","segment.r017.book1.ch14.text.block-375","segment.r017.book1.ch14.text.block-376","segment.r017.book1.ch14.text.block-377","segment.r017.book1.ch14.text.block-378","segment.r017.book1.ch14.text.block-379","segment.r017.book1.ch14.text.block-380","segment.r017.book1.ch14.text.block-381","segment.r017.book1.ch14.text.block-382","segment.r017.book1.ch14.text.block-383","segment.r017.book1.ch14.text.block-384","segment.r017.book1.ch14.text.block-385","segment.r017.book1.ch14.text.block-386","segment.r017.book1.ch14.text.block-387","segment.r017.book1.ch14.text.block-388","segment.r017.book1.ch14.text.block-389","segment.r017.book1.ch14.text.block-390","segment.r017.book1.ch14.text.block-391","segment.r017.book1.ch14.text.block-392","segment.r017.book1.ch14.text.block-393","segment.r017.book1.ch14.text.block-394","segment.r017.book1.ch14.text.block-395","segment.r017.book1.ch14.text.block-396","segment.r017.book1.ch14.text.block-397","segment.r017.book1.ch14.text.block-398","segment.r017.book1.ch14.text.block-399","segment.r017.book1.ch14.text.block-400","segment.r017.book1.ch14.text.block-401","segment.r017.book1.ch14.text.block-402","segment.r017.book1.ch14.text.block-403","segment.r017.book1.ch14.text.block-404","segment.r017.book1.ch14.text.block-405","segment.r017.book1.ch14.text.block-406","segment.r017.book1.ch14.text.block-407","segment.r017.book1.ch14.text.block-408","segment.r017.book1.ch14.text.block-409","segment.r017.book1.ch14.text.block-410","segment.r017.book1.ch14.text.block-411","segment.r017.book1.ch14.text.block-412","segment.r017.book1.ch14.text.block-413","segment.r017.book1.ch14.text.block-414","segment.r017.book1.ch14.text.block-415","segment.r017.book1.ch14.text.block-416","segment.r017.book1.ch14.text.block-417","segment.r017.book1.ch14.text.block-418","segment.r017.book1.ch14.text.block-419","segment.r017.book1.ch14.text.block-420","segment.r017.book1.ch14.text.block-421","segment.r017.book1.ch14.text.block-422","segment.r017.book1.ch14.text.block-423","segment.r017.book1.ch14.text.block-424","segment.r017.book1.ch14.text.block-425","segment.r017.book1.ch14.text.block-426","segment.r017.book1.ch14.text.block-427","segment.r017.book1.ch14.text.block-428"],"native":{"concept_id":"concept.euler-circuit","evidence":"Full-corpus id-ID terminology audit","id":"term.euler-circuit.id","preferred":"sirkuit Euler","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"Euler circuit","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch03.text.block-003","segment.r017.book1.ch03.text.block-044","segment.r017.book1.ch03.text.block-045","segment.r017.book1.ch03.text.block-047","segment.r017.book1.ch03.text.block-050","segment.r017.book1.ch03.text.block-055","segment.r017.book1.ch03.text.block-059","segment.r017.book1.ch03.text.block-063","segment.r017.book1.ch03.text.block-068","segment.r017.book1.ch03.text.block-070"],"native":{"concept_id":"concept.excel-solver","evidence":"Chapter 3 terminology decision","id":"term.excel-solver.id","preferred":"Solver Excel","recorded_at":"2026-08-23T00:00:00+02:00","register":"technical","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"Microsoft Excel optimization add-in; product token retained","source_locale":"en","source_term":"Excel Solver","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.expected-value-objective","evidence":"Final id-ID corpus terminology audit","id":"term.expected-value-objective.id","preferred":"fungsi tujuan nilai harapan","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"expected-value objective","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch05.readme.block-001","segment.o018.lab.ch05.readme.block-002","segment.o018.lab.ch05.readme.block-003","segment.o018.lab.ch05.readme.block-004","segment.o018.lab.ch05.readme.block-005","segment.o018.lab.ch05.readme.block-006","segment.o018.lab.ch05.readme.block-007","segment.o018.lab.ch05.readme.block-008","segment.o018.lab.ch05.readme.block-009","segment.o018.lab.ch05.readme.block-010","segment.o018.lab.ch05.readme.block-011","segment.o018.lab.ch05.readme.block-012","segment.o018.lab.ch05.readme.block-013","segment.o018.lab.ch05.readme.block-014","segment.r017.book1.ch05.text.block-136","segment.r017.book1.ch05.text.block-141","segment.r017.book1.ch05.text.block-148","segment.r017.book1.ch05.text.block-164","segment.r017.book1.ch06.text.block-032","segment.r017.book1.ch06.text.block-089","segment.r017.book1.ch06.text.block-145","segment.r017.book1.ch06.text.block-149"],"native":{"concept_id":"concept.extreme-point-optimality","evidence":"Chapter 5 terminology decision","id":"term.extreme-point.id","preferred":"titik ekstrem","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"polyhedral geometry","source_locale":"en","source_term":"extreme point","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["titik sudut"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch15.attribution.block-001","segment.o018.lab.ch15.attribution.block-002","segment.o018.lab.ch15.attribution.block-003","segment.o018.lab.ch15.attribution.block-004","segment.o018.lab.ch15.attribution.block-005","segment.o018.lab.ch15.attribution.block-006","segment.o018.lab.ch15.attribution.block-007","segment.o018.lab.ch15.attribution.block-008","segment.o018.lab.ch15.attribution.block-009","segment.o018.lab.ch15.attribution.block-010","segment.o018.lab.ch15.attribution.block-011","segment.o018.lab.ch15.attribution.block-012","segment.o018.lab.ch15.attribution.block-013","segment.o018.lab.ch15.attribution.block-014","segment.o018.lab.ch15.attribution.block-015","segment.o018.lab.ch15.readme.block-001","segment.o018.lab.ch15.readme.block-002","segment.o018.lab.ch15.readme.block-003","segment.o018.lab.ch15.readme.block-004","segment.o018.lab.ch15.readme.block-005","segment.o018.lab.ch15.readme.block-006","segment.o018.lab.ch15.readme.block-007","segment.o018.lab.ch15.readme.block-008","segment.o018.lab.ch15.readme.block-009","segment.r017.book1.ch15.text.block-001","segment.r017.book1.ch15.text.block-002","segment.r017.book1.ch15.text.block-003","segment.r017.book1.ch15.text.block-004","segment.r017.book1.ch15.text.block-005","segment.r017.book1.ch15.text.block-006","segment.r017.book1.ch15.text.block-007","segment.r017.book1.ch15.text.block-008","segment.r017.book1.ch15.text.block-009","segment.r017.book1.ch15.text.block-010","segment.r017.book1.ch15.text.block-011","segment.r017.book1.ch15.text.block-012","segment.r017.book1.ch15.text.block-013","segment.r017.book1.ch15.text.block-014","segment.r017.book1.ch15.text.block-015","segment.r017.book1.ch15.text.block-016","segment.r017.book1.ch15.text.block-017","segment.r017.book1.ch15.text.block-018","segment.r017.book1.ch15.text.block-019","segment.r017.book1.ch15.text.block-020","segment.r017.book1.ch15.text.block-021","segment.r017.book1.ch15.text.block-022","segment.r017.book1.ch15.text.block-023","segment.r017.book1.ch15.text.block-024","segment.r017.book1.ch15.text.block-025","segment.r017.book1.ch15.text.block-026","segment.r017.book1.ch15.text.block-027","segment.r017.book1.ch15.text.block-028","segment.r017.book1.ch15.text.block-029","segment.r017.book1.ch15.text.block-030","segment.r017.book1.ch15.text.block-031","segment.r017.book1.ch15.text.block-032","segment.r017.book1.ch15.text.block-033","segment.r017.book1.ch15.text.block-034","segment.r017.book1.ch15.text.block-035","segment.r017.book1.ch15.text.block-036","segment.r017.book1.ch15.text.block-037","segment.r017.book1.ch15.text.block-038","segment.r017.book1.ch15.text.block-039","segment.r017.book1.ch15.text.block-040","segment.r017.book1.ch15.text.block-041","segment.r017.book1.ch15.text.block-042","segment.r017.book1.ch15.text.block-043","segment.r017.book1.ch15.text.block-044","segment.r017.book1.ch15.text.block-045","segment.r017.book1.ch15.text.block-046","segment.r017.book1.ch15.text.block-047","segment.r017.book1.ch15.text.block-048","segment.r017.book1.ch15.text.block-049","segment.r017.book1.ch15.text.block-050","segment.r017.book1.ch15.text.block-051","segment.r017.book1.ch15.text.block-052","segment.r017.book1.ch15.text.block-053","segment.r017.book1.ch15.text.block-054","segment.r017.book1.ch15.text.block-055","segment.r017.book1.ch15.text.block-056","segment.r017.book1.ch15.text.block-057","segment.r017.book1.ch15.text.block-058","segment.r017.book1.ch15.text.block-059","segment.r017.book1.ch15.text.block-060","segment.r017.book1.ch15.text.block-061","segment.r017.book1.ch15.text.block-062","segment.r017.book1.ch15.text.block-063","segment.r017.book1.ch15.text.block-064","segment.r017.book1.ch15.text.block-065","segment.r017.book1.ch15.text.block-066","segment.r017.book1.ch15.text.block-067","segment.r017.book1.ch15.text.block-068","segment.r017.book1.ch15.text.block-069","segment.r017.book1.ch15.text.block-070","segment.r017.book1.ch15.text.block-071","segment.r017.book1.ch15.text.block-072","segment.r017.book1.ch15.text.block-073","segment.r017.book1.ch15.text.block-074","segment.r017.book1.ch15.text.block-075","segment.r017.book1.ch15.text.block-076","segment.r017.book1.ch15.text.block-077","segment.r017.book1.ch15.text.block-078","segment.r017.book1.ch15.text.block-079","segment.r017.book1.ch15.text.block-080","segment.r017.book1.ch15.text.block-081","segment.r017.book1.ch15.text.block-082","segment.r017.book1.ch15.text.block-083","segment.r017.book1.ch15.text.block-084","segment.r017.book1.ch15.text.block-085","segment.r017.book1.ch15.text.block-086","segment.r017.book1.ch15.text.block-087","segment.r017.book1.ch15.text.block-088","segment.r017.book1.ch15.text.block-089","segment.r017.book1.ch15.text.block-090","segment.r017.book1.ch15.text.block-091","segment.r017.book1.ch15.text.block-092","segment.r017.book1.ch15.text.block-093","segment.r017.book1.ch15.text.block-094","segment.r017.book1.ch15.text.block-095","segment.r017.book1.ch15.text.block-096","segment.r017.book1.ch15.text.block-097","segment.r017.book1.ch15.text.block-098","segment.r017.book1.ch15.text.block-099","segment.r017.book1.ch15.text.block-100","segment.r017.book1.ch15.text.block-101","segment.r017.book1.ch15.text.block-102","segment.r017.book1.ch15.text.block-103","segment.r017.book1.ch15.text.block-104","segment.r017.book1.ch15.text.block-105","segment.r017.book1.ch15.text.block-106","segment.r017.book1.ch15.text.block-107","segment.r017.book1.ch15.text.block-108","segment.r017.book1.ch15.text.block-109","segment.r017.book1.ch15.text.block-110","segment.r017.book1.ch15.text.block-111","segment.r017.book1.ch15.text.block-112","segment.r017.book1.ch15.text.block-113","segment.r017.book1.ch15.text.block-114","segment.r017.book1.ch15.text.block-115","segment.r017.book1.ch15.text.block-116","segment.r017.book1.ch15.text.block-117","segment.r017.book1.ch15.text.block-118","segment.r017.book1.ch15.text.block-119","segment.r017.book1.ch15.text.block-120","segment.r017.book1.ch15.text.block-121","segment.r017.book1.ch15.text.block-122","segment.r017.book1.ch15.text.block-123","segment.r017.book1.ch15.text.block-124","segment.r017.book1.ch15.text.block-125","segment.r017.book1.ch15.text.block-126","segment.r017.book1.ch15.text.block-127","segment.r017.book1.ch15.text.block-128","segment.r017.book1.ch15.text.block-129","segment.r017.book1.ch15.text.block-130","segment.r017.book1.ch15.text.block-131","segment.r017.book1.ch15.text.block-132","segment.r017.book1.ch15.text.block-133","segment.r017.book1.ch15.text.block-134","segment.r017.book1.ch15.text.block-135","segment.r017.book1.ch15.text.block-136","segment.r017.book1.ch15.text.block-137","segment.r017.book1.ch15.text.block-138","segment.r017.book1.ch15.text.block-139","segment.r017.book1.ch15.text.block-140","segment.r017.book1.ch15.text.block-141","segment.r017.book1.ch15.text.block-142","segment.r017.book1.ch15.text.block-143","segment.r017.book1.ch15.text.block-144","segment.r017.book1.ch15.text.block-145","segment.r017.book1.ch15.text.block-146","segment.r017.book1.ch15.text.block-147","segment.r017.book1.ch15.text.block-148","segment.r017.book1.ch15.text.block-149","segment.r017.book1.ch15.text.block-150","segment.r017.book1.ch15.text.block-151","segment.r017.book1.ch15.text.block-152","segment.r017.book1.ch15.text.block-153","segment.r017.book1.ch15.text.block-154","segment.r017.book1.ch15.text.block-155","segment.r017.book1.ch15.text.block-156","segment.r017.book1.ch15.text.block-157","segment.r017.book1.ch15.text.block-158","segment.r017.book1.ch15.text.block-159","segment.r017.book1.ch15.text.block-160","segment.r017.book1.ch15.text.block-161","segment.r017.book1.ch15.text.block-162","segment.r017.book1.ch15.text.block-163","segment.r017.book1.ch15.text.block-164","segment.r017.book1.ch15.text.block-165","segment.r017.book1.ch15.text.block-166","segment.r017.book1.ch15.text.block-167","segment.r017.book1.ch15.text.block-168","segment.r017.book1.ch15.text.block-169","segment.r017.book1.ch15.text.block-170","segment.r017.book1.ch15.text.block-171","segment.r017.book1.ch15.text.block-172","segment.r017.book1.ch15.text.block-173","segment.r017.book1.ch15.text.block-174","segment.r017.book1.ch15.text.block-175","segment.r017.book1.ch15.text.block-176","segment.r017.book1.ch15.text.block-177","segment.r017.book1.ch15.text.block-178","segment.r017.book1.ch15.text.block-179","segment.r017.book1.ch15.text.block-180","segment.r017.book1.ch15.text.block-181","segment.r017.book1.ch15.text.block-182","segment.r017.book1.ch15.text.block-183","segment.r017.book1.ch15.text.block-184","segment.r017.book1.ch15.text.block-185","segment.r017.book1.ch15.text.block-186","segment.r017.book1.ch15.text.block-187","segment.r017.book1.ch15.text.block-188","segment.r017.book1.ch15.text.block-189","segment.r017.book1.ch15.text.block-190","segment.r017.book1.ch15.text.block-191","segment.r017.book1.ch15.text.block-192","segment.r017.book1.ch15.text.block-193","segment.r017.book1.ch15.text.block-194","segment.r017.book1.ch15.text.block-195","segment.r017.book1.ch15.text.block-196","segment.r017.book1.ch15.text.block-197","segment.r017.book1.ch15.text.block-198","segment.r017.book1.ch15.text.block-199","segment.r017.book1.ch15.text.block-200","segment.r017.book1.ch15.text.block-201","segment.r017.book1.ch15.text.block-202","segment.r017.book1.ch15.text.block-203","segment.r017.book1.ch15.text.block-204","segment.r017.book1.ch15.text.block-205","segment.r017.book1.ch15.text.block-206","segment.r017.book1.ch15.text.block-207","segment.r017.book1.ch15.text.block-208","segment.r017.book1.ch15.text.block-209","segment.r017.book1.ch15.text.block-210","segment.r017.book1.ch15.text.block-211","segment.r017.book1.ch15.text.block-212","segment.r017.book1.ch15.text.block-213","segment.r017.book1.ch15.text.block-214","segment.r017.book1.ch15.text.block-215","segment.r017.book1.ch15.text.block-216","segment.r017.book1.ch15.text.block-217","segment.r017.book1.ch15.text.block-218","segment.r017.book1.ch15.text.block-219","segment.r017.book1.ch15.text.block-220","segment.r017.book1.ch15.text.block-221","segment.r017.book1.ch15.text.block-222","segment.r017.book1.ch15.text.block-223","segment.r017.book1.ch15.text.block-224","segment.r017.book1.ch15.text.block-225","segment.r017.book1.ch15.text.block-226","segment.r017.book1.ch15.text.block-227","segment.r017.book1.ch15.text.block-228","segment.r017.book1.ch15.text.block-229","segment.r017.book1.ch15.text.block-230","segment.r017.book1.ch15.text.block-231","segment.r017.book1.ch15.text.block-232","segment.r017.book1.ch15.text.block-233","segment.r017.book1.ch15.text.block-234","segment.r017.book1.ch15.text.block-235","segment.r017.book1.ch15.text.block-236","segment.r017.book1.ch15.text.block-237","segment.r017.book1.ch15.text.block-238","segment.r017.book1.ch15.text.block-239","segment.r017.book1.ch15.text.block-240","segment.r017.book1.ch15.text.block-241","segment.r017.book1.ch15.text.block-242","segment.r017.book1.ch15.text.block-243","segment.r017.book1.ch15.text.block-244","segment.r017.book1.ch15.text.block-245","segment.r017.book1.ch15.text.block-246","segment.r017.book1.ch15.text.block-247","segment.r017.book1.ch15.text.block-248","segment.r017.book1.ch15.text.block-249","segment.r017.book1.ch15.text.block-250","segment.r017.book1.ch15.text.block-251","segment.r017.book1.ch15.text.block-252","segment.r017.book1.ch15.text.block-253","segment.r017.book1.ch15.text.block-254","segment.r017.book1.ch15.text.block-255","segment.r017.book1.ch15.text.block-256","segment.r017.book1.ch15.text.block-257","segment.r017.book1.ch15.text.block-258","segment.r017.book1.ch15.text.block-259","segment.r017.book1.ch15.text.block-260","segment.r017.book1.ch15.text.block-261","segment.r017.book1.ch15.text.block-262","segment.r017.book1.ch15.text.block-263","segment.r017.book1.ch15.text.block-264","segment.r017.book1.ch15.text.block-265","segment.r017.book1.ch15.text.block-266","segment.r017.book1.ch15.text.block-267","segment.r017.book1.ch15.text.block-268","segment.r017.book1.ch15.text.block-269","segment.r017.book1.ch15.text.block-270","segment.r017.book1.ch15.text.block-271","segment.r017.book1.ch15.text.block-272","segment.r017.book1.ch15.text.block-273","segment.r017.book1.ch15.text.block-274","segment.r017.book1.ch15.text.block-275","segment.r017.book1.ch15.text.block-276","segment.r017.book1.ch15.text.block-277","segment.r017.book1.ch15.text.block-278","segment.r017.book1.ch15.text.block-279","segment.r017.book1.ch15.text.block-280","segment.r017.book1.ch15.text.block-281","segment.r017.book1.ch15.text.block-282","segment.r017.book1.ch15.text.block-283","segment.r017.book1.ch15.text.block-284","segment.r017.book1.ch15.text.block-285","segment.r017.book1.ch15.text.block-286","segment.r017.book1.ch15.text.block-287","segment.r017.book1.ch15.text.block-288","segment.r017.book1.ch15.text.block-289","segment.r017.book1.ch15.text.block-290","segment.r017.book1.ch15.text.block-291","segment.r017.book1.ch15.text.block-292","segment.r017.book1.ch15.text.block-293","segment.r017.book1.ch15.text.block-294","segment.r017.book1.ch15.text.block-295","segment.r017.book1.ch15.text.block-296","segment.r017.book1.ch15.text.block-297","segment.r017.book1.ch15.text.block-298","segment.r017.book1.ch15.text.block-299","segment.r017.book1.ch15.text.block-300","segment.r017.book1.ch15.text.block-301","segment.r017.book1.ch15.text.block-302","segment.r017.book1.ch15.text.block-303","segment.r017.book1.ch15.text.block-304","segment.r017.book1.ch15.text.block-305","segment.r017.book1.ch15.text.block-306","segment.r017.book1.ch15.text.block-307","segment.r017.book1.ch15.text.block-308","segment.r017.book1.ch15.text.block-309","segment.r017.book1.ch15.text.block-310","segment.r017.book1.ch15.text.block-311","segment.r017.book1.ch15.text.block-312","segment.r017.book1.ch15.text.block-313","segment.r017.book1.ch15.text.block-314","segment.r017.book1.ch15.text.block-315","segment.r017.book1.ch15.text.block-316","segment.r017.book1.ch15.text.block-317","segment.r017.book1.ch15.text.block-318","segment.r017.book1.ch15.text.block-319","segment.r017.book1.ch15.text.block-320","segment.r017.book1.ch15.text.block-321","segment.r017.book1.ch15.text.block-322","segment.r017.book1.ch15.text.block-323","segment.r017.book1.ch15.text.block-324","segment.r017.book1.ch15.text.block-325","segment.r017.book1.ch15.text.block-326","segment.r017.book1.ch15.text.block-327","segment.r017.book1.ch15.text.block-328","segment.r017.book1.ch15.text.block-329","segment.r017.book1.ch15.text.block-330","segment.r017.book1.ch15.text.block-331","segment.r017.book1.ch15.text.block-332","segment.r017.book1.ch15.text.block-333","segment.r017.book1.ch15.text.block-334","segment.r017.book1.ch15.text.block-335","segment.r017.book1.ch15.text.block-336","segment.r017.book1.ch15.text.block-337","segment.r017.book1.ch15.text.block-338","segment.r017.book1.ch15.text.block-339","segment.r017.book1.ch15.text.block-340","segment.r017.book1.ch15.text.block-341","segment.r017.book1.ch15.text.block-342"],"native":{"concept_id":"concept.facility-location","evidence":"Full-corpus id-ID terminology audit","id":"term.facility-location.id","preferred":"penentuan lokasi fasilitas","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"facility location","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-048","segment.r017.book1.ch05.text.block-135"],"native":{"concept_id":"concept.feasible-region","evidence":"first-boundary editorial decision; 2026-08-22 Indonesian field-usage QA found mixed fisibel/layak evidence and retained the scoped preferred-plus-variant policy","id":"term.feasible-region.id","preferred":"daerah fisibel","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"optimization model; gloss on first use","source_locale":"en","source_term":"feasible region","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["daerah layak"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch15.attribution.block-001","segment.o018.lab.ch15.attribution.block-002","segment.o018.lab.ch15.attribution.block-003","segment.o018.lab.ch15.attribution.block-004","segment.o018.lab.ch15.attribution.block-005","segment.o018.lab.ch15.attribution.block-006","segment.o018.lab.ch15.attribution.block-007","segment.o018.lab.ch15.attribution.block-008","segment.o018.lab.ch15.attribution.block-009","segment.o018.lab.ch15.attribution.block-010","segment.o018.lab.ch15.attribution.block-011","segment.o018.lab.ch15.attribution.block-012","segment.o018.lab.ch15.attribution.block-013","segment.o018.lab.ch15.attribution.block-014","segment.o018.lab.ch15.attribution.block-015","segment.o018.lab.ch15.readme.block-001","segment.o018.lab.ch15.readme.block-002","segment.o018.lab.ch15.readme.block-003","segment.o018.lab.ch15.readme.block-004","segment.o018.lab.ch15.readme.block-005","segment.o018.lab.ch15.readme.block-006","segment.o018.lab.ch15.readme.block-007","segment.o018.lab.ch15.readme.block-008","segment.o018.lab.ch15.readme.block-009","segment.r017.book1.ch15.text.block-001","segment.r017.book1.ch15.text.block-002","segment.r017.book1.ch15.text.block-003","segment.r017.book1.ch15.text.block-004","segment.r017.book1.ch15.text.block-005","segment.r017.book1.ch15.text.block-006","segment.r017.book1.ch15.text.block-007","segment.r017.book1.ch15.text.block-008","segment.r017.book1.ch15.text.block-009","segment.r017.book1.ch15.text.block-010","segment.r017.book1.ch15.text.block-011","segment.r017.book1.ch15.text.block-012","segment.r017.book1.ch15.text.block-013","segment.r017.book1.ch15.text.block-014","segment.r017.book1.ch15.text.block-015","segment.r017.book1.ch15.text.block-016","segment.r017.book1.ch15.text.block-017","segment.r017.book1.ch15.text.block-018","segment.r017.book1.ch15.text.block-019","segment.r017.book1.ch15.text.block-020","segment.r017.book1.ch15.text.block-021","segment.r017.book1.ch15.text.block-022","segment.r017.book1.ch15.text.block-023","segment.r017.book1.ch15.text.block-024","segment.r017.book1.ch15.text.block-025","segment.r017.book1.ch15.text.block-026","segment.r017.book1.ch15.text.block-027","segment.r017.book1.ch15.text.block-028","segment.r017.book1.ch15.text.block-029","segment.r017.book1.ch15.text.block-030","segment.r017.book1.ch15.text.block-031","segment.r017.book1.ch15.text.block-032","segment.r017.book1.ch15.text.block-033","segment.r017.book1.ch15.text.block-034","segment.r017.book1.ch15.text.block-035","segment.r017.book1.ch15.text.block-036","segment.r017.book1.ch15.text.block-037","segment.r017.book1.ch15.text.block-038","segment.r017.book1.ch15.text.block-039","segment.r017.book1.ch15.text.block-040","segment.r017.book1.ch15.text.block-041","segment.r017.book1.ch15.text.block-042","segment.r017.book1.ch15.text.block-043","segment.r017.book1.ch15.text.block-044","segment.r017.book1.ch15.text.block-045","segment.r017.book1.ch15.text.block-046","segment.r017.book1.ch15.text.block-047","segment.r017.book1.ch15.text.block-048","segment.r017.book1.ch15.text.block-049","segment.r017.book1.ch15.text.block-050","segment.r017.book1.ch15.text.block-051","segment.r017.book1.ch15.text.block-052","segment.r017.book1.ch15.text.block-053","segment.r017.book1.ch15.text.block-054","segment.r017.book1.ch15.text.block-055","segment.r017.book1.ch15.text.block-056","segment.r017.book1.ch15.text.block-057","segment.r017.book1.ch15.text.block-058","segment.r017.book1.ch15.text.block-059","segment.r017.book1.ch15.text.block-060","segment.r017.book1.ch15.text.block-061","segment.r017.book1.ch15.text.block-062","segment.r017.book1.ch15.text.block-063","segment.r017.book1.ch15.text.block-064","segment.r017.book1.ch15.text.block-065","segment.r017.book1.ch15.text.block-066","segment.r017.book1.ch15.text.block-067","segment.r017.book1.ch15.text.block-068","segment.r017.book1.ch15.text.block-069","segment.r017.book1.ch15.text.block-070","segment.r017.book1.ch15.text.block-071","segment.r017.book1.ch15.text.block-072","segment.r017.book1.ch15.text.block-073","segment.r017.book1.ch15.text.block-074","segment.r017.book1.ch15.text.block-075","segment.r017.book1.ch15.text.block-076","segment.r017.book1.ch15.text.block-077","segment.r017.book1.ch15.text.block-078","segment.r017.book1.ch15.text.block-079","segment.r017.book1.ch15.text.block-080","segment.r017.book1.ch15.text.block-081","segment.r017.book1.ch15.text.block-082","segment.r017.book1.ch15.text.block-083","segment.r017.book1.ch15.text.block-084","segment.r017.book1.ch15.text.block-085","segment.r017.book1.ch15.text.block-086","segment.r017.book1.ch15.text.block-087","segment.r017.book1.ch15.text.block-088","segment.r017.book1.ch15.text.block-089","segment.r017.book1.ch15.text.block-090","segment.r017.book1.ch15.text.block-091","segment.r017.book1.ch15.text.block-092","segment.r017.book1.ch15.text.block-093","segment.r017.book1.ch15.text.block-094","segment.r017.book1.ch15.text.block-095","segment.r017.book1.ch15.text.block-096","segment.r017.book1.ch15.text.block-097","segment.r017.book1.ch15.text.block-098","segment.r017.book1.ch15.text.block-099","segment.r017.book1.ch15.text.block-100","segment.r017.book1.ch15.text.block-101","segment.r017.book1.ch15.text.block-102","segment.r017.book1.ch15.text.block-103","segment.r017.book1.ch15.text.block-104","segment.r017.book1.ch15.text.block-105","segment.r017.book1.ch15.text.block-106","segment.r017.book1.ch15.text.block-107","segment.r017.book1.ch15.text.block-108","segment.r017.book1.ch15.text.block-109","segment.r017.book1.ch15.text.block-110","segment.r017.book1.ch15.text.block-111","segment.r017.book1.ch15.text.block-112","segment.r017.book1.ch15.text.block-113","segment.r017.book1.ch15.text.block-114","segment.r017.book1.ch15.text.block-115","segment.r017.book1.ch15.text.block-116","segment.r017.book1.ch15.text.block-117","segment.r017.book1.ch15.text.block-118","segment.r017.book1.ch15.text.block-119","segment.r017.book1.ch15.text.block-120","segment.r017.book1.ch15.text.block-121","segment.r017.book1.ch15.text.block-122","segment.r017.book1.ch15.text.block-123","segment.r017.book1.ch15.text.block-124","segment.r017.book1.ch15.text.block-125","segment.r017.book1.ch15.text.block-126","segment.r017.book1.ch15.text.block-127","segment.r017.book1.ch15.text.block-128","segment.r017.book1.ch15.text.block-129","segment.r017.book1.ch15.text.block-130","segment.r017.book1.ch15.text.block-131","segment.r017.book1.ch15.text.block-132","segment.r017.book1.ch15.text.block-133","segment.r017.book1.ch15.text.block-134","segment.r017.book1.ch15.text.block-135","segment.r017.book1.ch15.text.block-136","segment.r017.book1.ch15.text.block-137","segment.r017.book1.ch15.text.block-138","segment.r017.book1.ch15.text.block-139","segment.r017.book1.ch15.text.block-140","segment.r017.book1.ch15.text.block-141","segment.r017.book1.ch15.text.block-142","segment.r017.book1.ch15.text.block-143","segment.r017.book1.ch15.text.block-144","segment.r017.book1.ch15.text.block-145","segment.r017.book1.ch15.text.block-146","segment.r017.book1.ch15.text.block-147","segment.r017.book1.ch15.text.block-148","segment.r017.book1.ch15.text.block-149","segment.r017.book1.ch15.text.block-150","segment.r017.book1.ch15.text.block-151","segment.r017.book1.ch15.text.block-152","segment.r017.book1.ch15.text.block-153","segment.r017.book1.ch15.text.block-154","segment.r017.book1.ch15.text.block-155","segment.r017.book1.ch15.text.block-156","segment.r017.book1.ch15.text.block-157","segment.r017.book1.ch15.text.block-158","segment.r017.book1.ch15.text.block-159","segment.r017.book1.ch15.text.block-160","segment.r017.book1.ch15.text.block-161","segment.r017.book1.ch15.text.block-162","segment.r017.book1.ch15.text.block-163","segment.r017.book1.ch15.text.block-164","segment.r017.book1.ch15.text.block-165","segment.r017.book1.ch15.text.block-166","segment.r017.book1.ch15.text.block-167","segment.r017.book1.ch15.text.block-168","segment.r017.book1.ch15.text.block-169","segment.r017.book1.ch15.text.block-170","segment.r017.book1.ch15.text.block-171","segment.r017.book1.ch15.text.block-172","segment.r017.book1.ch15.text.block-173","segment.r017.book1.ch15.text.block-174","segment.r017.book1.ch15.text.block-175","segment.r017.book1.ch15.text.block-176","segment.r017.book1.ch15.text.block-177","segment.r017.book1.ch15.text.block-178","segment.r017.book1.ch15.text.block-179","segment.r017.book1.ch15.text.block-180","segment.r017.book1.ch15.text.block-181","segment.r017.book1.ch15.text.block-182","segment.r017.book1.ch15.text.block-183","segment.r017.book1.ch15.text.block-184","segment.r017.book1.ch15.text.block-185","segment.r017.book1.ch15.text.block-186","segment.r017.book1.ch15.text.block-187","segment.r017.book1.ch15.text.block-188","segment.r017.book1.ch15.text.block-189","segment.r017.book1.ch15.text.block-190","segment.r017.book1.ch15.text.block-191","segment.r017.book1.ch15.text.block-192","segment.r017.book1.ch15.text.block-193","segment.r017.book1.ch15.text.block-194","segment.r017.book1.ch15.text.block-195","segment.r017.book1.ch15.text.block-196","segment.r017.book1.ch15.text.block-197","segment.r017.book1.ch15.text.block-198","segment.r017.book1.ch15.text.block-199","segment.r017.book1.ch15.text.block-200","segment.r017.book1.ch15.text.block-201","segment.r017.book1.ch15.text.block-202","segment.r017.book1.ch15.text.block-203","segment.r017.book1.ch15.text.block-204","segment.r017.book1.ch15.text.block-205","segment.r017.book1.ch15.text.block-206","segment.r017.book1.ch15.text.block-207","segment.r017.book1.ch15.text.block-208","segment.r017.book1.ch15.text.block-209","segment.r017.book1.ch15.text.block-210","segment.r017.book1.ch15.text.block-211","segment.r017.book1.ch15.text.block-212","segment.r017.book1.ch15.text.block-213","segment.r017.book1.ch15.text.block-214","segment.r017.book1.ch15.text.block-215","segment.r017.book1.ch15.text.block-216","segment.r017.book1.ch15.text.block-217","segment.r017.book1.ch15.text.block-218","segment.r017.book1.ch15.text.block-219","segment.r017.book1.ch15.text.block-220","segment.r017.book1.ch15.text.block-221","segment.r017.book1.ch15.text.block-222","segment.r017.book1.ch15.text.block-223","segment.r017.book1.ch15.text.block-224","segment.r017.book1.ch15.text.block-225","segment.r017.book1.ch15.text.block-226","segment.r017.book1.ch15.text.block-227","segment.r017.book1.ch15.text.block-228","segment.r017.book1.ch15.text.block-229","segment.r017.book1.ch15.text.block-230","segment.r017.book1.ch15.text.block-231","segment.r017.book1.ch15.text.block-232","segment.r017.book1.ch15.text.block-233","segment.r017.book1.ch15.text.block-234","segment.r017.book1.ch15.text.block-235","segment.r017.book1.ch15.text.block-236","segment.r017.book1.ch15.text.block-237","segment.r017.book1.ch15.text.block-238","segment.r017.book1.ch15.text.block-239","segment.r017.book1.ch15.text.block-240","segment.r017.book1.ch15.text.block-241","segment.r017.book1.ch15.text.block-242","segment.r017.book1.ch15.text.block-243","segment.r017.book1.ch15.text.block-244","segment.r017.book1.ch15.text.block-245","segment.r017.book1.ch15.text.block-246","segment.r017.book1.ch15.text.block-247","segment.r017.book1.ch15.text.block-248","segment.r017.book1.ch15.text.block-249","segment.r017.book1.ch15.text.block-250","segment.r017.book1.ch15.text.block-251","segment.r017.book1.ch15.text.block-252","segment.r017.book1.ch15.text.block-253","segment.r017.book1.ch15.text.block-254","segment.r017.book1.ch15.text.block-255","segment.r017.book1.ch15.text.block-256","segment.r017.book1.ch15.text.block-257","segment.r017.book1.ch15.text.block-258","segment.r017.book1.ch15.text.block-259","segment.r017.book1.ch15.text.block-260","segment.r017.book1.ch15.text.block-261","segment.r017.book1.ch15.text.block-262","segment.r017.book1.ch15.text.block-263","segment.r017.book1.ch15.text.block-264","segment.r017.book1.ch15.text.block-265","segment.r017.book1.ch15.text.block-266","segment.r017.book1.ch15.text.block-267","segment.r017.book1.ch15.text.block-268","segment.r017.book1.ch15.text.block-269","segment.r017.book1.ch15.text.block-270","segment.r017.book1.ch15.text.block-271","segment.r017.book1.ch15.text.block-272","segment.r017.book1.ch15.text.block-273","segment.r017.book1.ch15.text.block-274","segment.r017.book1.ch15.text.block-275","segment.r017.book1.ch15.text.block-276","segment.r017.book1.ch15.text.block-277","segment.r017.book1.ch15.text.block-278","segment.r017.book1.ch15.text.block-279","segment.r017.book1.ch15.text.block-280","segment.r017.book1.ch15.text.block-281","segment.r017.book1.ch15.text.block-282","segment.r017.book1.ch15.text.block-283","segment.r017.book1.ch15.text.block-284","segment.r017.book1.ch15.text.block-285","segment.r017.book1.ch15.text.block-286","segment.r017.book1.ch15.text.block-287","segment.r017.book1.ch15.text.block-288","segment.r017.book1.ch15.text.block-289","segment.r017.book1.ch15.text.block-290","segment.r017.book1.ch15.text.block-291","segment.r017.book1.ch15.text.block-292","segment.r017.book1.ch15.text.block-293","segment.r017.book1.ch15.text.block-294","segment.r017.book1.ch15.text.block-295","segment.r017.book1.ch15.text.block-296","segment.r017.book1.ch15.text.block-297","segment.r017.book1.ch15.text.block-298","segment.r017.book1.ch15.text.block-299","segment.r017.book1.ch15.text.block-300","segment.r017.book1.ch15.text.block-301","segment.r017.book1.ch15.text.block-302","segment.r017.book1.ch15.text.block-303","segment.r017.book1.ch15.text.block-304","segment.r017.book1.ch15.text.block-305","segment.r017.book1.ch15.text.block-306","segment.r017.book1.ch15.text.block-307","segment.r017.book1.ch15.text.block-308","segment.r017.book1.ch15.text.block-309","segment.r017.book1.ch15.text.block-310","segment.r017.book1.ch15.text.block-311","segment.r017.book1.ch15.text.block-312","segment.r017.book1.ch15.text.block-313","segment.r017.book1.ch15.text.block-314","segment.r017.book1.ch15.text.block-315","segment.r017.book1.ch15.text.block-316","segment.r017.book1.ch15.text.block-317","segment.r017.book1.ch15.text.block-318","segment.r017.book1.ch15.text.block-319","segment.r017.book1.ch15.text.block-320","segment.r017.book1.ch15.text.block-321","segment.r017.book1.ch15.text.block-322","segment.r017.book1.ch15.text.block-323","segment.r017.book1.ch15.text.block-324","segment.r017.book1.ch15.text.block-325","segment.r017.book1.ch15.text.block-326","segment.r017.book1.ch15.text.block-327","segment.r017.book1.ch15.text.block-328","segment.r017.book1.ch15.text.block-329","segment.r017.book1.ch15.text.block-330","segment.r017.book1.ch15.text.block-331","segment.r017.book1.ch15.text.block-332","segment.r017.book1.ch15.text.block-333","segment.r017.book1.ch15.text.block-334","segment.r017.book1.ch15.text.block-335","segment.r017.book1.ch15.text.block-336","segment.r017.book1.ch15.text.block-337","segment.r017.book1.ch15.text.block-338","segment.r017.book1.ch15.text.block-339","segment.r017.book1.ch15.text.block-340","segment.r017.book1.ch15.text.block-341","segment.r017.book1.ch15.text.block-342"],"native":{"concept_id":"concept.fixed-charge-model","evidence":"Full-corpus id-ID terminology audit","id":"term.fixed-charge-model.id","preferred":"model biaya tetap","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"fixed-charge model","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch04.text-b.block-001","segment.r017.book1.ch04.text-b.block-037","segment.r017.book1.ch04.text-b.block-129","segment.r017.book1.ch04.text-b.block-200","segment.r017.book1.ch04.text-b.block-211"],"native":{"concept_id":"concept.flow-balance-sign-convention","evidence":"Chapter 4 terminology decision","id":"term.flow-balance-convention.id","preferred":"konvensi tanda keseimbangan aliran","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"comparison of out-minus-in and in-minus-out balance equations","source_locale":"en","source_term":"flow-balance sign convention","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch04.text-b.block-001","segment.r017.book1.ch04.text-b.block-018","segment.r017.book1.ch04.text-b.block-037","segment.r017.book1.ch04.text-b.block-072","segment.r017.book1.ch04.text-b.block-112","segment.r017.book1.ch04.text-b.block-120","segment.r017.book1.ch04.text-b.block-183","segment.r017.book1.ch04.text-b.block-188","segment.r017.book1.ch04.text-b.block-206","segment.r017.book1.ch04.text-b.block-211","segment.r017.book1.ch04.text-b.block-214","segment.r017.book1.ch04.text-b.target-native-multicommodity-routing"],"native":{"concept_id":"concept.flow-conservation","evidence":"Chapter 4 terminology decision","id":"term.flow-conservation.id","preferred":"konservasi aliran","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"network-flow constraints","source_locale":"en","source_term":"flow conservation","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["keseimbangan aliran"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch03.text.block-070"],"native":{"concept_id":"concept.short-selling","evidence":"Chapter 3 terminology decision","id":"term.free-variable.id","preferred":"variabel bebas","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"variable domain unrestricted in sign","source_locale":"en","source_term":"free variable","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.appendix.linear-systems.gaussian.block-001","segment.r017.book1.appendix.linear-systems.gaussian.block-002","segment.r017.book1.appendix.linear-systems.gaussian.block-003","segment.r017.book1.appendix.linear-systems.gaussian.block-004","segment.r017.book1.appendix.linear-systems.gaussian.block-005","segment.r017.book1.appendix.linear-systems.gaussian.block-006","segment.r017.book1.appendix.linear-systems.gaussian.block-007","segment.r017.book1.appendix.linear-systems.gaussian.block-008","segment.r017.book1.appendix.linear-systems.gaussian.block-009","segment.r017.book1.appendix.linear-systems.gaussian.block-010","segment.r017.book1.appendix.linear-systems.gaussian.block-011","segment.r017.book1.appendix.linear-systems.gaussian.block-012","segment.r017.book1.appendix.linear-systems.gaussian.block-013","segment.r017.book1.appendix.linear-systems.gaussian.block-014","segment.r017.book1.appendix.linear-systems.gaussian.block-015","segment.r017.book1.appendix.linear-systems.gaussian.block-016","segment.r017.book1.appendix.linear-systems.gaussian.block-017","segment.r017.book1.appendix.linear-systems.gaussian.block-018","segment.r017.book1.appendix.linear-systems.gaussian.block-019","segment.r017.book1.appendix.linear-systems.gaussian.block-020","segment.r017.book1.appendix.linear-systems.gaussian.block-021","segment.r017.book1.appendix.linear-systems.gaussian.block-022","segment.r017.book1.appendix.linear-systems.gaussian.block-023","segment.r017.book1.appendix.linear-systems.gaussian.block-024","segment.r017.book1.appendix.linear-systems.gaussian.block-025","segment.r017.book1.appendix.linear-systems.gaussian.block-026","segment.r017.book1.appendix.linear-systems.gaussian.block-027","segment.r017.book1.appendix.linear-systems.gaussian.block-028","segment.r017.book1.appendix.linear-systems.gaussian.block-029","segment.r017.book1.appendix.linear-systems.gaussian.block-030","segment.r017.book1.appendix.linear-systems.gaussian.block-031","segment.r017.book1.appendix.linear-systems.gaussian.block-032","segment.r017.book1.appendix.linear-systems.gaussian.block-033","segment.r017.book1.appendix.linear-systems.gaussian.block-034","segment.r017.book1.appendix.linear-systems.gaussian.block-035","segment.r017.book1.appendix.linear-systems.gaussian.block-036","segment.r017.book1.appendix.linear-systems.gaussian.block-037","segment.r017.book1.appendix.linear-systems.gaussian.block-038","segment.r017.book1.appendix.linear-systems.gaussian.block-039","segment.r017.book1.appendix.linear-systems.gaussian.block-040","segment.r017.book1.appendix.linear-systems.gaussian.block-041","segment.r017.book1.appendix.linear-systems.gaussian.block-042","segment.r017.book1.appendix.linear-systems.gaussian.block-043","segment.r017.book1.appendix.linear-systems.gaussian.block-044","segment.r017.book1.appendix.linear-systems.gaussian.block-045","segment.r017.book1.appendix.linear-systems.gaussian.block-046","segment.r017.book1.appendix.linear-systems.gaussian.block-047","segment.r017.book1.appendix.linear-systems.gaussian.block-048","segment.r017.book1.appendix.linear-systems.gaussian.block-049","segment.r017.book1.appendix.linear-systems.gaussian.block-050","segment.r017.book1.appendix.linear-systems.gaussian.block-051","segment.r017.book1.appendix.linear-systems.gaussian.block-052","segment.r017.book1.appendix.linear-systems.gaussian.block-053","segment.r017.book1.appendix.linear-systems.gaussian.block-054","segment.r017.book1.appendix.linear-systems.gaussian.block-055","segment.r017.book1.appendix.linear-systems.gaussian.block-056","segment.r017.book1.appendix.linear-systems.gaussian.block-057","segment.r017.book1.appendix.linear-systems.gaussian.block-058","segment.r017.book1.appendix.linear-systems.gaussian.block-059","segment.r017.book1.appendix.linear-systems.gaussian.block-060","segment.r017.book1.appendix.linear-systems.gaussian.block-061","segment.r017.book1.appendix.linear-systems.gaussian.block-062","segment.r017.book1.appendix.linear-systems.gaussian.block-063","segment.r017.book1.appendix.linear-systems.gaussian.block-064","segment.r017.book1.appendix.linear-systems.gaussian.block-065","segment.r017.book1.appendix.linear-systems.gaussian.block-066","segment.r017.book1.appendix.linear-systems.gaussian.block-067","segment.r017.book1.appendix.linear-systems.gaussian.block-068","segment.r017.book1.appendix.linear-systems.gaussian.block-069","segment.r017.book1.appendix.linear-systems.gaussian.block-070","segment.r017.book1.appendix.linear-systems.gaussian.block-071","segment.r017.book1.appendix.linear-systems.gaussian.block-072","segment.r017.book1.appendix.linear-systems.gaussian.block-073","segment.r017.book1.appendix.linear-systems.gaussian.block-074","segment.r017.book1.appendix.linear-systems.gaussian.block-075","segment.r017.book1.appendix.linear-systems.gaussian.block-076","segment.r017.book1.appendix.linear-systems.gaussian.block-077","segment.r017.book1.appendix.linear-systems.gaussian.block-078","segment.r017.book1.appendix.linear-systems.gaussian.block-079","segment.r017.book1.appendix.linear-systems.gaussian.block-080","segment.r017.book1.appendix.linear-systems.gaussian.block-081","segment.r017.book1.appendix.linear-systems.gaussian.block-082","segment.r017.book1.appendix.linear-systems.gaussian.block-083","segment.r017.book1.appendix.linear-systems.gaussian.block-084","segment.r017.book1.appendix.linear-systems.gaussian.block-085","segment.r017.book1.appendix.linear-systems.gaussian.block-086","segment.r017.book1.appendix.linear-systems.gaussian.block-087","segment.r017.book1.appendix.linear-systems.gaussian.block-088","segment.r017.book1.appendix.linear-systems.gaussian.block-089","segment.r017.book1.appendix.linear-systems.gaussian.block-090","segment.r017.book1.appendix.linear-systems.gaussian.block-091","segment.r017.book1.appendix.linear-systems.gaussian.block-092","segment.r017.book1.appendix.linear-systems.gaussian.block-093","segment.r017.book1.appendix.linear-systems.gaussian.block-094","segment.r017.book1.appendix.linear-systems.gaussian.block-095","segment.r017.book1.appendix.linear-systems.gaussian.block-096","segment.r017.book1.appendix.linear-systems.gaussian.block-097","segment.r017.book1.appendix.linear-systems.gaussian.block-098","segment.r017.book1.appendix.linear-systems.gaussian.block-099","segment.r017.book1.appendix.linear-systems.gaussian.block-100","segment.r017.book1.appendix.linear-systems.gaussian.block-101","segment.r017.book1.appendix.linear-systems.gaussian.block-102","segment.r017.book1.appendix.linear-systems.gaussian.block-103","segment.r017.book1.appendix.linear-systems.gaussian.block-104","segment.r017.book1.appendix.linear-systems.gaussian.block-105","segment.r017.book1.appendix.linear-systems.gaussian.block-106","segment.r017.book1.appendix.matrices.finding-inverse.block-001","segment.r017.book1.appendix.matrices.finding-inverse.block-002","segment.r017.book1.appendix.matrices.finding-inverse.block-003","segment.r017.book1.appendix.matrices.finding-inverse.block-004","segment.r017.book1.appendix.matrices.finding-inverse.block-005","segment.r017.book1.appendix.matrices.finding-inverse.block-006","segment.r017.book1.appendix.matrices.finding-inverse.block-007","segment.r017.book1.appendix.matrices.finding-inverse.block-008","segment.r017.book1.appendix.matrices.finding-inverse.block-009","segment.r017.book1.appendix.matrices.finding-inverse.block-010","segment.r017.book1.appendix.matrices.finding-inverse.block-011","segment.r017.book1.appendix.matrices.finding-inverse.block-012","segment.r017.book1.appendix.matrices.finding-inverse.block-013","segment.r017.book1.appendix.matrices.finding-inverse.block-014","segment.r017.book1.appendix.matrices.finding-inverse.block-015","segment.r017.book1.appendix.matrices.finding-inverse.block-016","segment.r017.book1.appendix.matrices.finding-inverse.block-017","segment.r017.book1.appendix.matrices.finding-inverse.block-018","segment.r017.book1.appendix.matrices.finding-inverse.block-019","segment.r017.book1.appendix.matrices.finding-inverse.block-020","segment.r017.book1.appendix.matrices.finding-inverse.block-021","segment.r017.book1.appendix.matrices.finding-inverse.block-022","segment.r017.book1.appendix.matrices.finding-inverse.block-023","segment.r017.book1.appendix.matrices.finding-inverse.block-024","segment.r017.book1.appendix.matrices.finding-inverse.block-025","segment.r017.book1.appendix.matrices.finding-inverse.block-026","segment.r017.book1.appendix.matrices.finding-inverse.block-027","segment.r017.book1.appendix.matrices.finding-inverse.block-028"],"native":{"concept_id":"concept.gaussian-elimination","evidence":"Full-corpus id-ID terminology audit","id":"term.gaussian-elimination.id","preferred":"eliminasi Gauss","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"Gaussian elimination","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch15.attribution.block-001","segment.o018.lab.ch15.attribution.block-002","segment.o018.lab.ch15.attribution.block-003","segment.o018.lab.ch15.attribution.block-004","segment.o018.lab.ch15.attribution.block-005","segment.o018.lab.ch15.attribution.block-006","segment.o018.lab.ch15.attribution.block-007","segment.o018.lab.ch15.attribution.block-008","segment.o018.lab.ch15.attribution.block-009","segment.o018.lab.ch15.attribution.block-010","segment.o018.lab.ch15.attribution.block-011","segment.o018.lab.ch15.attribution.block-012","segment.o018.lab.ch15.attribution.block-013","segment.o018.lab.ch15.attribution.block-014","segment.o018.lab.ch15.attribution.block-015","segment.o018.lab.ch15.readme.block-001","segment.o018.lab.ch15.readme.block-002","segment.o018.lab.ch15.readme.block-003","segment.o018.lab.ch15.readme.block-004","segment.o018.lab.ch15.readme.block-005","segment.o018.lab.ch15.readme.block-006","segment.o018.lab.ch15.readme.block-007","segment.o018.lab.ch15.readme.block-008","segment.o018.lab.ch15.readme.block-009","segment.r017.book1.ch15.text.block-001","segment.r017.book1.ch15.text.block-002","segment.r017.book1.ch15.text.block-003","segment.r017.book1.ch15.text.block-004","segment.r017.book1.ch15.text.block-005","segment.r017.book1.ch15.text.block-006","segment.r017.book1.ch15.text.block-007","segment.r017.book1.ch15.text.block-008","segment.r017.book1.ch15.text.block-009","segment.r017.book1.ch15.text.block-010","segment.r017.book1.ch15.text.block-011","segment.r017.book1.ch15.text.block-012","segment.r017.book1.ch15.text.block-013","segment.r017.book1.ch15.text.block-014","segment.r017.book1.ch15.text.block-015","segment.r017.book1.ch15.text.block-016","segment.r017.book1.ch15.text.block-017","segment.r017.book1.ch15.text.block-018","segment.r017.book1.ch15.text.block-019","segment.r017.book1.ch15.text.block-020","segment.r017.book1.ch15.text.block-021","segment.r017.book1.ch15.text.block-022","segment.r017.book1.ch15.text.block-023","segment.r017.book1.ch15.text.block-024","segment.r017.book1.ch15.text.block-025","segment.r017.book1.ch15.text.block-026","segment.r017.book1.ch15.text.block-027","segment.r017.book1.ch15.text.block-028","segment.r017.book1.ch15.text.block-029","segment.r017.book1.ch15.text.block-030","segment.r017.book1.ch15.text.block-031","segment.r017.book1.ch15.text.block-032","segment.r017.book1.ch15.text.block-033","segment.r017.book1.ch15.text.block-034","segment.r017.book1.ch15.text.block-035","segment.r017.book1.ch15.text.block-036","segment.r017.book1.ch15.text.block-037","segment.r017.book1.ch15.text.block-038","segment.r017.book1.ch15.text.block-039","segment.r017.book1.ch15.text.block-040","segment.r017.book1.ch15.text.block-041","segment.r017.book1.ch15.text.block-042","segment.r017.book1.ch15.text.block-043","segment.r017.book1.ch15.text.block-044","segment.r017.book1.ch15.text.block-045","segment.r017.book1.ch15.text.block-046","segment.r017.book1.ch15.text.block-047","segment.r017.book1.ch15.text.block-048","segment.r017.book1.ch15.text.block-049","segment.r017.book1.ch15.text.block-050","segment.r017.book1.ch15.text.block-051","segment.r017.book1.ch15.text.block-052","segment.r017.book1.ch15.text.block-053","segment.r017.book1.ch15.text.block-054","segment.r017.book1.ch15.text.block-055","segment.r017.book1.ch15.text.block-056","segment.r017.book1.ch15.text.block-057","segment.r017.book1.ch15.text.block-058","segment.r017.book1.ch15.text.block-059","segment.r017.book1.ch15.text.block-060","segment.r017.book1.ch15.text.block-061","segment.r017.book1.ch15.text.block-062","segment.r017.book1.ch15.text.block-063","segment.r017.book1.ch15.text.block-064","segment.r017.book1.ch15.text.block-065","segment.r017.book1.ch15.text.block-066","segment.r017.book1.ch15.text.block-067","segment.r017.book1.ch15.text.block-068","segment.r017.book1.ch15.text.block-069","segment.r017.book1.ch15.text.block-070","segment.r017.book1.ch15.text.block-071","segment.r017.book1.ch15.text.block-072","segment.r017.book1.ch15.text.block-073","segment.r017.book1.ch15.text.block-074","segment.r017.book1.ch15.text.block-075","segment.r017.book1.ch15.text.block-076","segment.r017.book1.ch15.text.block-077","segment.r017.book1.ch15.text.block-078","segment.r017.book1.ch15.text.block-079","segment.r017.book1.ch15.text.block-080","segment.r017.book1.ch15.text.block-081","segment.r017.book1.ch15.text.block-082","segment.r017.book1.ch15.text.block-083","segment.r017.book1.ch15.text.block-084","segment.r017.book1.ch15.text.block-085","segment.r017.book1.ch15.text.block-086","segment.r017.book1.ch15.text.block-087","segment.r017.book1.ch15.text.block-088","segment.r017.book1.ch15.text.block-089","segment.r017.book1.ch15.text.block-090","segment.r017.book1.ch15.text.block-091","segment.r017.book1.ch15.text.block-092","segment.r017.book1.ch15.text.block-093","segment.r017.book1.ch15.text.block-094","segment.r017.book1.ch15.text.block-095","segment.r017.book1.ch15.text.block-096","segment.r017.book1.ch15.text.block-097","segment.r017.book1.ch15.text.block-098","segment.r017.book1.ch15.text.block-099","segment.r017.book1.ch15.text.block-100","segment.r017.book1.ch15.text.block-101","segment.r017.book1.ch15.text.block-102","segment.r017.book1.ch15.text.block-103","segment.r017.book1.ch15.text.block-104","segment.r017.book1.ch15.text.block-105","segment.r017.book1.ch15.text.block-106","segment.r017.book1.ch15.text.block-107","segment.r017.book1.ch15.text.block-108","segment.r017.book1.ch15.text.block-109","segment.r017.book1.ch15.text.block-110","segment.r017.book1.ch15.text.block-111","segment.r017.book1.ch15.text.block-112","segment.r017.book1.ch15.text.block-113","segment.r017.book1.ch15.text.block-114","segment.r017.book1.ch15.text.block-115","segment.r017.book1.ch15.text.block-116","segment.r017.book1.ch15.text.block-117","segment.r017.book1.ch15.text.block-118","segment.r017.book1.ch15.text.block-119","segment.r017.book1.ch15.text.block-120","segment.r017.book1.ch15.text.block-121","segment.r017.book1.ch15.text.block-122","segment.r017.book1.ch15.text.block-123","segment.r017.book1.ch15.text.block-124","segment.r017.book1.ch15.text.block-125","segment.r017.book1.ch15.text.block-126","segment.r017.book1.ch15.text.block-127","segment.r017.book1.ch15.text.block-128","segment.r017.book1.ch15.text.block-129","segment.r017.book1.ch15.text.block-130","segment.r017.book1.ch15.text.block-131","segment.r017.book1.ch15.text.block-132","segment.r017.book1.ch15.text.block-133","segment.r017.book1.ch15.text.block-134","segment.r017.book1.ch15.text.block-135","segment.r017.book1.ch15.text.block-136","segment.r017.book1.ch15.text.block-137","segment.r017.book1.ch15.text.block-138","segment.r017.book1.ch15.text.block-139","segment.r017.book1.ch15.text.block-140","segment.r017.book1.ch15.text.block-141","segment.r017.book1.ch15.text.block-142","segment.r017.book1.ch15.text.block-143","segment.r017.book1.ch15.text.block-144","segment.r017.book1.ch15.text.block-145","segment.r017.book1.ch15.text.block-146","segment.r017.book1.ch15.text.block-147","segment.r017.book1.ch15.text.block-148","segment.r017.book1.ch15.text.block-149","segment.r017.book1.ch15.text.block-150","segment.r017.book1.ch15.text.block-151","segment.r017.book1.ch15.text.block-152","segment.r017.book1.ch15.text.block-153","segment.r017.book1.ch15.text.block-154","segment.r017.book1.ch15.text.block-155","segment.r017.book1.ch15.text.block-156","segment.r017.book1.ch15.text.block-157","segment.r017.book1.ch15.text.block-158","segment.r017.book1.ch15.text.block-159","segment.r017.book1.ch15.text.block-160","segment.r017.book1.ch15.text.block-161","segment.r017.book1.ch15.text.block-162","segment.r017.book1.ch15.text.block-163","segment.r017.book1.ch15.text.block-164","segment.r017.book1.ch15.text.block-165","segment.r017.book1.ch15.text.block-166","segment.r017.book1.ch15.text.block-167","segment.r017.book1.ch15.text.block-168","segment.r017.book1.ch15.text.block-169","segment.r017.book1.ch15.text.block-170","segment.r017.book1.ch15.text.block-171","segment.r017.book1.ch15.text.block-172","segment.r017.book1.ch15.text.block-173","segment.r017.book1.ch15.text.block-174","segment.r017.book1.ch15.text.block-175","segment.r017.book1.ch15.text.block-176","segment.r017.book1.ch15.text.block-177","segment.r017.book1.ch15.text.block-178","segment.r017.book1.ch15.text.block-179","segment.r017.book1.ch15.text.block-180","segment.r017.book1.ch15.text.block-181","segment.r017.book1.ch15.text.block-182","segment.r017.book1.ch15.text.block-183","segment.r017.book1.ch15.text.block-184","segment.r017.book1.ch15.text.block-185","segment.r017.book1.ch15.text.block-186","segment.r017.book1.ch15.text.block-187","segment.r017.book1.ch15.text.block-188","segment.r017.book1.ch15.text.block-189","segment.r017.book1.ch15.text.block-190","segment.r017.book1.ch15.text.block-191","segment.r017.book1.ch15.text.block-192","segment.r017.book1.ch15.text.block-193","segment.r017.book1.ch15.text.block-194","segment.r017.book1.ch15.text.block-195","segment.r017.book1.ch15.text.block-196","segment.r017.book1.ch15.text.block-197","segment.r017.book1.ch15.text.block-198","segment.r017.book1.ch15.text.block-199","segment.r017.book1.ch15.text.block-200","segment.r017.book1.ch15.text.block-201","segment.r017.book1.ch15.text.block-202","segment.r017.book1.ch15.text.block-203","segment.r017.book1.ch15.text.block-204","segment.r017.book1.ch15.text.block-205","segment.r017.book1.ch15.text.block-206","segment.r017.book1.ch15.text.block-207","segment.r017.book1.ch15.text.block-208","segment.r017.book1.ch15.text.block-209","segment.r017.book1.ch15.text.block-210","segment.r017.book1.ch15.text.block-211","segment.r017.book1.ch15.text.block-212","segment.r017.book1.ch15.text.block-213","segment.r017.book1.ch15.text.block-214","segment.r017.book1.ch15.text.block-215","segment.r017.book1.ch15.text.block-216","segment.r017.book1.ch15.text.block-217","segment.r017.book1.ch15.text.block-218","segment.r017.book1.ch15.text.block-219","segment.r017.book1.ch15.text.block-220","segment.r017.book1.ch15.text.block-221","segment.r017.book1.ch15.text.block-222","segment.r017.book1.ch15.text.block-223","segment.r017.book1.ch15.text.block-224","segment.r017.book1.ch15.text.block-225","segment.r017.book1.ch15.text.block-226","segment.r017.book1.ch15.text.block-227","segment.r017.book1.ch15.text.block-228","segment.r017.book1.ch15.text.block-229","segment.r017.book1.ch15.text.block-230","segment.r017.book1.ch15.text.block-231","segment.r017.book1.ch15.text.block-232","segment.r017.book1.ch15.text.block-233","segment.r017.book1.ch15.text.block-234","segment.r017.book1.ch15.text.block-235","segment.r017.book1.ch15.text.block-236","segment.r017.book1.ch15.text.block-237","segment.r017.book1.ch15.text.block-238","segment.r017.book1.ch15.text.block-239","segment.r017.book1.ch15.text.block-240","segment.r017.book1.ch15.text.block-241","segment.r017.book1.ch15.text.block-242","segment.r017.book1.ch15.text.block-243","segment.r017.book1.ch15.text.block-244","segment.r017.book1.ch15.text.block-245","segment.r017.book1.ch15.text.block-246","segment.r017.book1.ch15.text.block-247","segment.r017.book1.ch15.text.block-248","segment.r017.book1.ch15.text.block-249","segment.r017.book1.ch15.text.block-250","segment.r017.book1.ch15.text.block-251","segment.r017.book1.ch15.text.block-252","segment.r017.book1.ch15.text.block-253","segment.r017.book1.ch15.text.block-254","segment.r017.book1.ch15.text.block-255","segment.r017.book1.ch15.text.block-256","segment.r017.book1.ch15.text.block-257","segment.r017.book1.ch15.text.block-258","segment.r017.book1.ch15.text.block-259","segment.r017.book1.ch15.text.block-260","segment.r017.book1.ch15.text.block-261","segment.r017.book1.ch15.text.block-262","segment.r017.book1.ch15.text.block-263","segment.r017.book1.ch15.text.block-264","segment.r017.book1.ch15.text.block-265","segment.r017.book1.ch15.text.block-266","segment.r017.book1.ch15.text.block-267","segment.r017.book1.ch15.text.block-268","segment.r017.book1.ch15.text.block-269","segment.r017.book1.ch15.text.block-270","segment.r017.book1.ch15.text.block-271","segment.r017.book1.ch15.text.block-272","segment.r017.book1.ch15.text.block-273","segment.r017.book1.ch15.text.block-274","segment.r017.book1.ch15.text.block-275","segment.r017.book1.ch15.text.block-276","segment.r017.book1.ch15.text.block-277","segment.r017.book1.ch15.text.block-278","segment.r017.book1.ch15.text.block-279","segment.r017.book1.ch15.text.block-280","segment.r017.book1.ch15.text.block-281","segment.r017.book1.ch15.text.block-282","segment.r017.book1.ch15.text.block-283","segment.r017.book1.ch15.text.block-284","segment.r017.book1.ch15.text.block-285","segment.r017.book1.ch15.text.block-286","segment.r017.book1.ch15.text.block-287","segment.r017.book1.ch15.text.block-288","segment.r017.book1.ch15.text.block-289","segment.r017.book1.ch15.text.block-290","segment.r017.book1.ch15.text.block-291","segment.r017.book1.ch15.text.block-292","segment.r017.book1.ch15.text.block-293","segment.r017.book1.ch15.text.block-294","segment.r017.book1.ch15.text.block-295","segment.r017.book1.ch15.text.block-296","segment.r017.book1.ch15.text.block-297","segment.r017.book1.ch15.text.block-298","segment.r017.book1.ch15.text.block-299","segment.r017.book1.ch15.text.block-300","segment.r017.book1.ch15.text.block-301","segment.r017.book1.ch15.text.block-302","segment.r017.book1.ch15.text.block-303","segment.r017.book1.ch15.text.block-304","segment.r017.book1.ch15.text.block-305","segment.r017.book1.ch15.text.block-306","segment.r017.book1.ch15.text.block-307","segment.r017.book1.ch15.text.block-308","segment.r017.book1.ch15.text.block-309","segment.r017.book1.ch15.text.block-310","segment.r017.book1.ch15.text.block-311","segment.r017.book1.ch15.text.block-312","segment.r017.book1.ch15.text.block-313","segment.r017.book1.ch15.text.block-314","segment.r017.book1.ch15.text.block-315","segment.r017.book1.ch15.text.block-316","segment.r017.book1.ch15.text.block-317","segment.r017.book1.ch15.text.block-318","segment.r017.book1.ch15.text.block-319","segment.r017.book1.ch15.text.block-320","segment.r017.book1.ch15.text.block-321","segment.r017.book1.ch15.text.block-322","segment.r017.book1.ch15.text.block-323","segment.r017.book1.ch15.text.block-324","segment.r017.book1.ch15.text.block-325","segment.r017.book1.ch15.text.block-326","segment.r017.book1.ch15.text.block-327","segment.r017.book1.ch15.text.block-328","segment.r017.book1.ch15.text.block-329","segment.r017.book1.ch15.text.block-330","segment.r017.book1.ch15.text.block-331","segment.r017.book1.ch15.text.block-332","segment.r017.book1.ch15.text.block-333","segment.r017.book1.ch15.text.block-334","segment.r017.book1.ch15.text.block-335","segment.r017.book1.ch15.text.block-336","segment.r017.book1.ch15.text.block-337","segment.r017.book1.ch15.text.block-338","segment.r017.book1.ch15.text.block-339","segment.r017.book1.ch15.text.block-340","segment.r017.book1.ch15.text.block-341","segment.r017.book1.ch15.text.block-342"],"native":{"concept_id":"concept.graph-coloring","evidence":"Full-corpus id-ID terminology audit","id":"term.graph-coloring.id","preferred":"pewarnaan graf","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"graph coloring","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch14.attribution.block-001","segment.o018.lab.ch14.attribution.block-002","segment.o018.lab.ch14.attribution.block-003","segment.o018.lab.ch14.attribution.block-004","segment.o018.lab.ch14.attribution.block-005","segment.o018.lab.ch14.attribution.block-006","segment.o018.lab.ch14.attribution.block-007","segment.o018.lab.ch14.attribution.block-008","segment.o018.lab.ch14.attribution.block-009","segment.o018.lab.ch14.attribution.block-010","segment.o018.lab.ch14.attribution.block-011","segment.o018.lab.ch14.attribution.block-012","segment.o018.lab.ch14.attribution.block-013","segment.o018.lab.ch14.attribution.block-014","segment.o018.lab.ch14.attribution.block-015","segment.o018.lab.ch14.attribution.block-016","segment.o018.lab.ch14.readme.block-001","segment.o018.lab.ch14.readme.block-002","segment.o018.lab.ch14.readme.block-003","segment.o018.lab.ch14.readme.block-004","segment.o018.lab.ch14.readme.block-005","segment.o018.lab.ch14.readme.block-006","segment.o018.lab.ch14.readme.block-007","segment.o018.lab.ch14.readme.block-008","segment.o018.lab.ch14.readme.block-009","segment.o018.lab.ch14.readme.block-010","segment.r017.book1.ch04.text-b.block-001","segment.r017.book1.ch04.text-b.block-183","segment.r017.book1.ch14.solutions-manual.block-001","segment.r017.book1.ch14.solutions-manual.block-002","segment.r017.book1.ch14.solutions-manual.block-003","segment.r017.book1.ch14.solutions-manual.block-004","segment.r017.book1.ch14.solutions-manual.block-005","segment.r017.book1.ch14.solutions-manual.block-006","segment.r017.book1.ch14.solutions-manual.block-007","segment.r017.book1.ch14.solutions-manual.block-008","segment.r017.book1.ch14.solutions-manual.block-009","segment.r017.book1.ch14.solutions-manual.block-010","segment.r017.book1.ch14.solutions-manual.block-011","segment.r017.book1.ch14.solutions-manual.block-012","segment.r017.book1.ch14.solutions-manual.block-013","segment.r017.book1.ch14.solutions-manual.block-014","segment.r017.book1.ch14.solutions-manual.block-015","segment.r017.book1.ch14.solutions-manual.block-016","segment.r017.book1.ch14.solutions-manual.block-017","segment.r017.book1.ch14.solutions-manual.block-018","segment.r017.book1.ch14.solutions-manual.block-019","segment.r017.book1.ch14.solutions-manual.block-020","segment.r017.book1.ch14.solutions-manual.block-021","segment.r017.book1.ch14.solutions-manual.block-022","segment.r017.book1.ch14.solutions-manual.block-023","segment.r017.book1.ch14.solutions-manual.block-024","segment.r017.book1.ch14.solutions-manual.block-025","segment.r017.book1.ch14.solutions-manual.block-026","segment.r017.book1.ch14.solutions-manual.block-027","segment.r017.book1.ch14.solutions-manual.block-028","segment.r017.book1.ch14.solutions-manual.block-029","segment.r017.book1.ch14.solutions-manual.block-030","segment.r017.book1.ch14.solutions-manual.block-031","segment.r017.book1.ch14.solutions-manual.block-032","segment.r017.book1.ch14.solutions-manual.block-033","segment.r017.book1.ch14.solutions-manual.block-034","segment.r017.book1.ch14.solutions-manual.block-035","segment.r017.book1.ch14.solutions-manual.block-036","segment.r017.book1.ch14.solutions-manual.block-037","segment.r017.book1.ch14.solutions-manual.block-038","segment.r017.book1.ch14.solutions-manual.block-039","segment.r017.book1.ch14.solutions-manual.block-040","segment.r017.book1.ch14.solutions-manual.block-041","segment.r017.book1.ch14.solutions-manual.block-042","segment.r017.book1.ch14.solutions-manual.block-043","segment.r017.book1.ch14.solutions-manual.block-044","segment.r017.book1.ch14.solutions-manual.block-045","segment.r017.book1.ch14.solutions-manual.block-046","segment.r017.book1.ch14.solutions-manual.block-047","segment.r017.book1.ch14.solutions-manual.block-048","segment.r017.book1.ch14.solutions-manual.block-049","segment.r017.book1.ch14.solutions-manual.block-050","segment.r017.book1.ch14.solutions-manual.block-051","segment.r017.book1.ch14.solutions-manual.block-052","segment.r017.book1.ch14.solutions-manual.block-053","segment.r017.book1.ch14.solutions-manual.block-054","segment.r017.book1.ch14.solutions-manual.block-055","segment.r017.book1.ch14.solutions-manual.block-056","segment.r017.book1.ch14.solutions-manual.block-057","segment.r017.book1.ch14.solutions-manual.block-058","segment.r017.book1.ch14.solutions-manual.block-059","segment.r017.book1.ch14.text.block-001","segment.r017.book1.ch14.text.block-002","segment.r017.book1.ch14.text.block-003","segment.r017.book1.ch14.text.block-004","segment.r017.book1.ch14.text.block-005","segment.r017.book1.ch14.text.block-006","segment.r017.book1.ch14.text.block-007","segment.r017.book1.ch14.text.block-008","segment.r017.book1.ch14.text.block-009","segment.r017.book1.ch14.text.block-010","segment.r017.book1.ch14.text.block-011","segment.r017.book1.ch14.text.block-012","segment.r017.book1.ch14.text.block-013","segment.r017.book1.ch14.text.block-014","segment.r017.book1.ch14.text.block-015","segment.r017.book1.ch14.text.block-016","segment.r017.book1.ch14.text.block-017","segment.r017.book1.ch14.text.block-018","segment.r017.book1.ch14.text.block-019","segment.r017.book1.ch14.text.block-020","segment.r017.book1.ch14.text.block-021","segment.r017.book1.ch14.text.block-022","segment.r017.book1.ch14.text.block-023","segment.r017.book1.ch14.text.block-024","segment.r017.book1.ch14.text.block-025","segment.r017.book1.ch14.text.block-026","segment.r017.book1.ch14.text.block-027","segment.r017.book1.ch14.text.block-028","segment.r017.book1.ch14.text.block-029","segment.r017.book1.ch14.text.block-030","segment.r017.book1.ch14.text.block-031","segment.r017.book1.ch14.text.block-032","segment.r017.book1.ch14.text.block-033","segment.r017.book1.ch14.text.block-034","segment.r017.book1.ch14.text.block-035","segment.r017.book1.ch14.text.block-036","segment.r017.book1.ch14.text.block-037","segment.r017.book1.ch14.text.block-038","segment.r017.book1.ch14.text.block-039","segment.r017.book1.ch14.text.block-040","segment.r017.book1.ch14.text.block-041","segment.r017.book1.ch14.text.block-042","segment.r017.book1.ch14.text.block-043","segment.r017.book1.ch14.text.block-044","segment.r017.book1.ch14.text.block-045","segment.r017.book1.ch14.text.block-046","segment.r017.book1.ch14.text.block-047","segment.r017.book1.ch14.text.block-048","segment.r017.book1.ch14.text.block-049","segment.r017.book1.ch14.text.block-050","segment.r017.book1.ch14.text.block-051","segment.r017.book1.ch14.text.block-052","segment.r017.book1.ch14.text.block-053","segment.r017.book1.ch14.text.block-054","segment.r017.book1.ch14.text.block-055","segment.r017.book1.ch14.text.block-056","segment.r017.book1.ch14.text.block-057","segment.r017.book1.ch14.text.block-058","segment.r017.book1.ch14.text.block-059","segment.r017.book1.ch14.text.block-060","segment.r017.book1.ch14.text.block-061","segment.r017.book1.ch14.text.block-062","segment.r017.book1.ch14.text.block-063","segment.r017.book1.ch14.text.block-064","segment.r017.book1.ch14.text.block-065","segment.r017.book1.ch14.text.block-066","segment.r017.book1.ch14.text.block-067","segment.r017.book1.ch14.text.block-068","segment.r017.book1.ch14.text.block-069","segment.r017.book1.ch14.text.block-070","segment.r017.book1.ch14.text.block-071","segment.r017.book1.ch14.text.block-072","segment.r017.book1.ch14.text.block-073","segment.r017.book1.ch14.text.block-074","segment.r017.book1.ch14.text.block-075","segment.r017.book1.ch14.text.block-076","segment.r017.book1.ch14.text.block-077","segment.r017.book1.ch14.text.block-078","segment.r017.book1.ch14.text.block-079","segment.r017.book1.ch14.text.block-080","segment.r017.book1.ch14.text.block-081","segment.r017.book1.ch14.text.block-082","segment.r017.book1.ch14.text.block-083","segment.r017.book1.ch14.text.block-084","segment.r017.book1.ch14.text.block-085","segment.r017.book1.ch14.text.block-086","segment.r017.book1.ch14.text.block-087","segment.r017.book1.ch14.text.block-088","segment.r017.book1.ch14.text.block-089","segment.r017.book1.ch14.text.block-090","segment.r017.book1.ch14.text.block-091","segment.r017.book1.ch14.text.block-092","segment.r017.book1.ch14.text.block-093","segment.r017.book1.ch14.text.block-094","segment.r017.book1.ch14.text.block-095","segment.r017.book1.ch14.text.block-096","segment.r017.book1.ch14.text.block-097","segment.r017.book1.ch14.text.block-098","segment.r017.book1.ch14.text.block-099","segment.r017.book1.ch14.text.block-100","segment.r017.book1.ch14.text.block-101","segment.r017.book1.ch14.text.block-102","segment.r017.book1.ch14.text.block-103","segment.r017.book1.ch14.text.block-104","segment.r017.book1.ch14.text.block-105","segment.r017.book1.ch14.text.block-106","segment.r017.book1.ch14.text.block-107","segment.r017.book1.ch14.text.block-108","segment.r017.book1.ch14.text.block-109","segment.r017.book1.ch14.text.block-110","segment.r017.book1.ch14.text.block-111","segment.r017.book1.ch14.text.block-112","segment.r017.book1.ch14.text.block-113","segment.r017.book1.ch14.text.block-114","segment.r017.book1.ch14.text.block-115","segment.r017.book1.ch14.text.block-116","segment.r017.book1.ch14.text.block-117","segment.r017.book1.ch14.text.block-118","segment.r017.book1.ch14.text.block-119","segment.r017.book1.ch14.text.block-120","segment.r017.book1.ch14.text.block-121","segment.r017.book1.ch14.text.block-122","segment.r017.book1.ch14.text.block-123","segment.r017.book1.ch14.text.block-124","segment.r017.book1.ch14.text.block-125","segment.r017.book1.ch14.text.block-126","segment.r017.book1.ch14.text.block-127","segment.r017.book1.ch14.text.block-128","segment.r017.book1.ch14.text.block-129","segment.r017.book1.ch14.text.block-130","segment.r017.book1.ch14.text.block-131","segment.r017.book1.ch14.text.block-132","segment.r017.book1.ch14.text.block-133","segment.r017.book1.ch14.text.block-134","segment.r017.book1.ch14.text.block-135","segment.r017.book1.ch14.text.block-136","segment.r017.book1.ch14.text.block-137","segment.r017.book1.ch14.text.block-138","segment.r017.book1.ch14.text.block-139","segment.r017.book1.ch14.text.block-140","segment.r017.book1.ch14.text.block-141","segment.r017.book1.ch14.text.block-142","segment.r017.book1.ch14.text.block-143","segment.r017.book1.ch14.text.block-144","segment.r017.book1.ch14.text.block-145","segment.r017.book1.ch14.text.block-146","segment.r017.book1.ch14.text.block-147","segment.r017.book1.ch14.text.block-148","segment.r017.book1.ch14.text.block-149","segment.r017.book1.ch14.text.block-150","segment.r017.book1.ch14.text.block-151","segment.r017.book1.ch14.text.block-152","segment.r017.book1.ch14.text.block-153","segment.r017.book1.ch14.text.block-154","segment.r017.book1.ch14.text.block-155","segment.r017.book1.ch14.text.block-156","segment.r017.book1.ch14.text.block-157","segment.r017.book1.ch14.text.block-158","segment.r017.book1.ch14.text.block-159","segment.r017.book1.ch14.text.block-160","segment.r017.book1.ch14.text.block-161","segment.r017.book1.ch14.text.block-162","segment.r017.book1.ch14.text.block-163","segment.r017.book1.ch14.text.block-164","segment.r017.book1.ch14.text.block-165","segment.r017.book1.ch14.text.block-166","segment.r017.book1.ch14.text.block-167","segment.r017.book1.ch14.text.block-168","segment.r017.book1.ch14.text.block-169","segment.r017.book1.ch14.text.block-170","segment.r017.book1.ch14.text.block-171","segment.r017.book1.ch14.text.block-172","segment.r017.book1.ch14.text.block-173","segment.r017.book1.ch14.text.block-174","segment.r017.book1.ch14.text.block-175","segment.r017.book1.ch14.text.block-176","segment.r017.book1.ch14.text.block-177","segment.r017.book1.ch14.text.block-178","segment.r017.book1.ch14.text.block-179","segment.r017.book1.ch14.text.block-180","segment.r017.book1.ch14.text.block-181","segment.r017.book1.ch14.text.block-182","segment.r017.book1.ch14.text.block-183","segment.r017.book1.ch14.text.block-184","segment.r017.book1.ch14.text.block-185","segment.r017.book1.ch14.text.block-186","segment.r017.book1.ch14.text.block-187","segment.r017.book1.ch14.text.block-188","segment.r017.book1.ch14.text.block-189","segment.r017.book1.ch14.text.block-190","segment.r017.book1.ch14.text.block-191","segment.r017.book1.ch14.text.block-192","segment.r017.book1.ch14.text.block-193","segment.r017.book1.ch14.text.block-194","segment.r017.book1.ch14.text.block-195","segment.r017.book1.ch14.text.block-196","segment.r017.book1.ch14.text.block-197","segment.r017.book1.ch14.text.block-198","segment.r017.book1.ch14.text.block-199","segment.r017.book1.ch14.text.block-200","segment.r017.book1.ch14.text.block-201","segment.r017.book1.ch14.text.block-202","segment.r017.book1.ch14.text.block-203","segment.r017.book1.ch14.text.block-204","segment.r017.book1.ch14.text.block-205","segment.r017.book1.ch14.text.block-206","segment.r017.book1.ch14.text.block-207","segment.r017.book1.ch14.text.block-208","segment.r017.book1.ch14.text.block-209","segment.r017.book1.ch14.text.block-210","segment.r017.book1.ch14.text.block-211","segment.r017.book1.ch14.text.block-212","segment.r017.book1.ch14.text.block-213","segment.r017.book1.ch14.text.block-214","segment.r017.book1.ch14.text.block-215","segment.r017.book1.ch14.text.block-216","segment.r017.book1.ch14.text.block-217","segment.r017.book1.ch14.text.block-218","segment.r017.book1.ch14.text.block-219","segment.r017.book1.ch14.text.block-220","segment.r017.book1.ch14.text.block-221","segment.r017.book1.ch14.text.block-222","segment.r017.book1.ch14.text.block-223","segment.r017.book1.ch14.text.block-224","segment.r017.book1.ch14.text.block-225","segment.r017.book1.ch14.text.block-226","segment.r017.book1.ch14.text.block-227","segment.r017.book1.ch14.text.block-228","segment.r017.book1.ch14.text.block-229","segment.r017.book1.ch14.text.block-230","segment.r017.book1.ch14.text.block-231","segment.r017.book1.ch14.text.block-232","segment.r017.book1.ch14.text.block-233","segment.r017.book1.ch14.text.block-234","segment.r017.book1.ch14.text.block-235","segment.r017.book1.ch14.text.block-236","segment.r017.book1.ch14.text.block-237","segment.r017.book1.ch14.text.block-238","segment.r017.book1.ch14.text.block-239","segment.r017.book1.ch14.text.block-240","segment.r017.book1.ch14.text.block-241","segment.r017.book1.ch14.text.block-242","segment.r017.book1.ch14.text.block-243","segment.r017.book1.ch14.text.block-244","segment.r017.book1.ch14.text.block-245","segment.r017.book1.ch14.text.block-246","segment.r017.book1.ch14.text.block-247","segment.r017.book1.ch14.text.block-248","segment.r017.book1.ch14.text.block-249","segment.r017.book1.ch14.text.block-250","segment.r017.book1.ch14.text.block-251","segment.r017.book1.ch14.text.block-252","segment.r017.book1.ch14.text.block-253","segment.r017.book1.ch14.text.block-254","segment.r017.book1.ch14.text.block-255","segment.r017.book1.ch14.text.block-256","segment.r017.book1.ch14.text.block-257","segment.r017.book1.ch14.text.block-258","segment.r017.book1.ch14.text.block-259","segment.r017.book1.ch14.text.block-260","segment.r017.book1.ch14.text.block-261","segment.r017.book1.ch14.text.block-262","segment.r017.book1.ch14.text.block-263","segment.r017.book1.ch14.text.block-264","segment.r017.book1.ch14.text.block-265","segment.r017.book1.ch14.text.block-266","segment.r017.book1.ch14.text.block-267","segment.r017.book1.ch14.text.block-268","segment.r017.book1.ch14.text.block-269","segment.r017.book1.ch14.text.block-270","segment.r017.book1.ch14.text.block-271","segment.r017.book1.ch14.text.block-272","segment.r017.book1.ch14.text.block-273","segment.r017.book1.ch14.text.block-274","segment.r017.book1.ch14.text.block-275","segment.r017.book1.ch14.text.block-276","segment.r017.book1.ch14.text.block-277","segment.r017.book1.ch14.text.block-278","segment.r017.book1.ch14.text.block-279","segment.r017.book1.ch14.text.block-280","segment.r017.book1.ch14.text.block-281","segment.r017.book1.ch14.text.block-282","segment.r017.book1.ch14.text.block-283","segment.r017.book1.ch14.text.block-284","segment.r017.book1.ch14.text.block-285","segment.r017.book1.ch14.text.block-286","segment.r017.book1.ch14.text.block-287","segment.r017.book1.ch14.text.block-288","segment.r017.book1.ch14.text.block-289","segment.r017.book1.ch14.text.block-290","segment.r017.book1.ch14.text.block-291","segment.r017.book1.ch14.text.block-292","segment.r017.book1.ch14.text.block-293","segment.r017.book1.ch14.text.block-294","segment.r017.book1.ch14.text.block-295","segment.r017.book1.ch14.text.block-296","segment.r017.book1.ch14.text.block-297","segment.r017.book1.ch14.text.block-298","segment.r017.book1.ch14.text.block-299","segment.r017.book1.ch14.text.block-300","segment.r017.book1.ch14.text.block-301","segment.r017.book1.ch14.text.block-302","segment.r017.book1.ch14.text.block-303","segment.r017.book1.ch14.text.block-304","segment.r017.book1.ch14.text.block-305","segment.r017.book1.ch14.text.block-306","segment.r017.book1.ch14.text.block-307","segment.r017.book1.ch14.text.block-308","segment.r017.book1.ch14.text.block-309","segment.r017.book1.ch14.text.block-310","segment.r017.book1.ch14.text.block-311","segment.r017.book1.ch14.text.block-312","segment.r017.book1.ch14.text.block-313","segment.r017.book1.ch14.text.block-314","segment.r017.book1.ch14.text.block-315","segment.r017.book1.ch14.text.block-316","segment.r017.book1.ch14.text.block-317","segment.r017.book1.ch14.text.block-318","segment.r017.book1.ch14.text.block-319","segment.r017.book1.ch14.text.block-320","segment.r017.book1.ch14.text.block-321","segment.r017.book1.ch14.text.block-322","segment.r017.book1.ch14.text.block-323","segment.r017.book1.ch14.text.block-324","segment.r017.book1.ch14.text.block-325","segment.r017.book1.ch14.text.block-326","segment.r017.book1.ch14.text.block-327","segment.r017.book1.ch14.text.block-328","segment.r017.book1.ch14.text.block-329","segment.r017.book1.ch14.text.block-330","segment.r017.book1.ch14.text.block-331","segment.r017.book1.ch14.text.block-332","segment.r017.book1.ch14.text.block-333","segment.r017.book1.ch14.text.block-334","segment.r017.book1.ch14.text.block-335","segment.r017.book1.ch14.text.block-336","segment.r017.book1.ch14.text.block-337","segment.r017.book1.ch14.text.block-338","segment.r017.book1.ch14.text.block-339","segment.r017.book1.ch14.text.block-340","segment.r017.book1.ch14.text.block-341","segment.r017.book1.ch14.text.block-342","segment.r017.book1.ch14.text.block-343","segment.r017.book1.ch14.text.block-344","segment.r017.book1.ch14.text.block-345","segment.r017.book1.ch14.text.block-346","segment.r017.book1.ch14.text.block-347","segment.r017.book1.ch14.text.block-348","segment.r017.book1.ch14.text.block-349","segment.r017.book1.ch14.text.block-350","segment.r017.book1.ch14.text.block-351","segment.r017.book1.ch14.text.block-352","segment.r017.book1.ch14.text.block-353","segment.r017.book1.ch14.text.block-354","segment.r017.book1.ch14.text.block-355","segment.r017.book1.ch14.text.block-356","segment.r017.book1.ch14.text.block-357","segment.r017.book1.ch14.text.block-358","segment.r017.book1.ch14.text.block-359","segment.r017.book1.ch14.text.block-360","segment.r017.book1.ch14.text.block-361","segment.r017.book1.ch14.text.block-362","segment.r017.book1.ch14.text.block-363","segment.r017.book1.ch14.text.block-364","segment.r017.book1.ch14.text.block-365","segment.r017.book1.ch14.text.block-366","segment.r017.book1.ch14.text.block-367","segment.r017.book1.ch14.text.block-368","segment.r017.book1.ch14.text.block-369","segment.r017.book1.ch14.text.block-370","segment.r017.book1.ch14.text.block-371","segment.r017.book1.ch14.text.block-372","segment.r017.book1.ch14.text.block-373","segment.r017.book1.ch14.text.block-374","segment.r017.book1.ch14.text.block-375","segment.r017.book1.ch14.text.block-376","segment.r017.book1.ch14.text.block-377","segment.r017.book1.ch14.text.block-378","segment.r017.book1.ch14.text.block-379","segment.r017.book1.ch14.text.block-380","segment.r017.book1.ch14.text.block-381","segment.r017.book1.ch14.text.block-382","segment.r017.book1.ch14.text.block-383","segment.r017.book1.ch14.text.block-384","segment.r017.book1.ch14.text.block-385","segment.r017.book1.ch14.text.block-386","segment.r017.book1.ch14.text.block-387","segment.r017.book1.ch14.text.block-388","segment.r017.book1.ch14.text.block-389","segment.r017.book1.ch14.text.block-390","segment.r017.book1.ch14.text.block-391","segment.r017.book1.ch14.text.block-392","segment.r017.book1.ch14.text.block-393","segment.r017.book1.ch14.text.block-394","segment.r017.book1.ch14.text.block-395","segment.r017.book1.ch14.text.block-396","segment.r017.book1.ch14.text.block-397","segment.r017.book1.ch14.text.block-398","segment.r017.book1.ch14.text.block-399","segment.r017.book1.ch14.text.block-400","segment.r017.book1.ch14.text.block-401","segment.r017.book1.ch14.text.block-402","segment.r017.book1.ch14.text.block-403","segment.r017.book1.ch14.text.block-404","segment.r017.book1.ch14.text.block-405","segment.r017.book1.ch14.text.block-406","segment.r017.book1.ch14.text.block-407","segment.r017.book1.ch14.text.block-408","segment.r017.book1.ch14.text.block-409","segment.r017.book1.ch14.text.block-410","segment.r017.book1.ch14.text.block-411","segment.r017.book1.ch14.text.block-412","segment.r017.book1.ch14.text.block-413","segment.r017.book1.ch14.text.block-414","segment.r017.book1.ch14.text.block-415","segment.r017.book1.ch14.text.block-416","segment.r017.book1.ch14.text.block-417","segment.r017.book1.ch14.text.block-418","segment.r017.book1.ch14.text.block-419","segment.r017.book1.ch14.text.block-420","segment.r017.book1.ch14.text.block-421","segment.r017.book1.ch14.text.block-422","segment.r017.book1.ch14.text.block-423","segment.r017.book1.ch14.text.block-424","segment.r017.book1.ch14.text.block-425","segment.r017.book1.ch14.text.block-426","segment.r017.book1.ch14.text.block-427","segment.r017.book1.ch14.text.block-428"],"native":{"concept_id":"concept.graph-theory","evidence":"Chapter 4 terminology decision","id":"term.graph.id","preferred":"graf","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"network modeling","source_locale":"en","source_term":"graph","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch05.readme.block-001","segment.o018.lab.ch05.readme.block-002","segment.o018.lab.ch05.readme.block-003","segment.o018.lab.ch05.readme.block-004","segment.o018.lab.ch05.readme.block-005","segment.o018.lab.ch05.readme.block-006","segment.o018.lab.ch05.readme.block-007","segment.o018.lab.ch05.readme.block-008","segment.o018.lab.ch05.readme.block-009","segment.o018.lab.ch05.readme.block-010","segment.o018.lab.ch05.readme.block-011","segment.o018.lab.ch05.readme.block-012","segment.o018.lab.ch05.readme.block-013","segment.o018.lab.ch05.readme.block-014","segment.r017.book1.ch05.text.block-135","segment.r017.book1.ch05.text.block-136","segment.r017.book1.ch05.text.block-141"],"native":{"concept_id":"concept.graphical-lp-method","evidence":"Chapter 5 terminology decision","id":"term.graphical-method.id","preferred":"metode grafis","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"two-variable linear programming","source_locale":"en","source_term":"graphical method","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch06.text.block-045","segment.r017.book1.ch06.text.block-069","segment.r017.book1.ch06.text.block-151"],"native":{"concept_id":"concept.halfspace","evidence":"Chapter 6 terminology decision","id":"term.halfspace.id","preferred":"setengah ruang","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"polyhedral geometry","source_locale":"en","source_term":"halfspace","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch14.text.block-001","segment.r017.book1.ch14.text.block-002","segment.r017.book1.ch14.text.block-003","segment.r017.book1.ch14.text.block-004","segment.r017.book1.ch14.text.block-005","segment.r017.book1.ch14.text.block-006","segment.r017.book1.ch14.text.block-007","segment.r017.book1.ch14.text.block-008","segment.r017.book1.ch14.text.block-009","segment.r017.book1.ch14.text.block-010","segment.r017.book1.ch14.text.block-011","segment.r017.book1.ch14.text.block-012","segment.r017.book1.ch14.text.block-013","segment.r017.book1.ch14.text.block-014","segment.r017.book1.ch14.text.block-015","segment.r017.book1.ch14.text.block-016","segment.r017.book1.ch14.text.block-017","segment.r017.book1.ch14.text.block-018","segment.r017.book1.ch14.text.block-019","segment.r017.book1.ch14.text.block-020","segment.r017.book1.ch14.text.block-021","segment.r017.book1.ch14.text.block-022","segment.r017.book1.ch14.text.block-023","segment.r017.book1.ch14.text.block-024","segment.r017.book1.ch14.text.block-025","segment.r017.book1.ch14.text.block-026","segment.r017.book1.ch14.text.block-027","segment.r017.book1.ch14.text.block-028","segment.r017.book1.ch14.text.block-029","segment.r017.book1.ch14.text.block-030","segment.r017.book1.ch14.text.block-031","segment.r017.book1.ch14.text.block-032","segment.r017.book1.ch14.text.block-033","segment.r017.book1.ch14.text.block-034","segment.r017.book1.ch14.text.block-035","segment.r017.book1.ch14.text.block-036","segment.r017.book1.ch14.text.block-037","segment.r017.book1.ch14.text.block-038","segment.r017.book1.ch14.text.block-039","segment.r017.book1.ch14.text.block-040","segment.r017.book1.ch14.text.block-041","segment.r017.book1.ch14.text.block-042","segment.r017.book1.ch14.text.block-043","segment.r017.book1.ch14.text.block-044","segment.r017.book1.ch14.text.block-045","segment.r017.book1.ch14.text.block-046","segment.r017.book1.ch14.text.block-047","segment.r017.book1.ch14.text.block-048","segment.r017.book1.ch14.text.block-049","segment.r017.book1.ch14.text.block-050","segment.r017.book1.ch14.text.block-051","segment.r017.book1.ch14.text.block-052","segment.r017.book1.ch14.text.block-053","segment.r017.book1.ch14.text.block-054","segment.r017.book1.ch14.text.block-055","segment.r017.book1.ch14.text.block-056","segment.r017.book1.ch14.text.block-057","segment.r017.book1.ch14.text.block-058","segment.r017.book1.ch14.text.block-059","segment.r017.book1.ch14.text.block-060","segment.r017.book1.ch14.text.block-061","segment.r017.book1.ch14.text.block-062","segment.r017.book1.ch14.text.block-063","segment.r017.book1.ch14.text.block-064","segment.r017.book1.ch14.text.block-065","segment.r017.book1.ch14.text.block-066","segment.r017.book1.ch14.text.block-067","segment.r017.book1.ch14.text.block-068","segment.r017.book1.ch14.text.block-069","segment.r017.book1.ch14.text.block-070","segment.r017.book1.ch14.text.block-071","segment.r017.book1.ch14.text.block-072","segment.r017.book1.ch14.text.block-073","segment.r017.book1.ch14.text.block-074","segment.r017.book1.ch14.text.block-075","segment.r017.book1.ch14.text.block-076","segment.r017.book1.ch14.text.block-077","segment.r017.book1.ch14.text.block-078","segment.r017.book1.ch14.text.block-079","segment.r017.book1.ch14.text.block-080","segment.r017.book1.ch14.text.block-081","segment.r017.book1.ch14.text.block-082","segment.r017.book1.ch14.text.block-083","segment.r017.book1.ch14.text.block-084","segment.r017.book1.ch14.text.block-085","segment.r017.book1.ch14.text.block-086","segment.r017.book1.ch14.text.block-087","segment.r017.book1.ch14.text.block-088","segment.r017.book1.ch14.text.block-089","segment.r017.book1.ch14.text.block-090","segment.r017.book1.ch14.text.block-091","segment.r017.book1.ch14.text.block-092","segment.r017.book1.ch14.text.block-093","segment.r017.book1.ch14.text.block-094","segment.r017.book1.ch14.text.block-095","segment.r017.book1.ch14.text.block-096","segment.r017.book1.ch14.text.block-097","segment.r017.book1.ch14.text.block-098","segment.r017.book1.ch14.text.block-099","segment.r017.book1.ch14.text.block-100","segment.r017.book1.ch14.text.block-101","segment.r017.book1.ch14.text.block-102","segment.r017.book1.ch14.text.block-103","segment.r017.book1.ch14.text.block-104","segment.r017.book1.ch14.text.block-105","segment.r017.book1.ch14.text.block-106","segment.r017.book1.ch14.text.block-107","segment.r017.book1.ch14.text.block-108","segment.r017.book1.ch14.text.block-109","segment.r017.book1.ch14.text.block-110","segment.r017.book1.ch14.text.block-111","segment.r017.book1.ch14.text.block-112","segment.r017.book1.ch14.text.block-113","segment.r017.book1.ch14.text.block-114","segment.r017.book1.ch14.text.block-115","segment.r017.book1.ch14.text.block-116","segment.r017.book1.ch14.text.block-117","segment.r017.book1.ch14.text.block-118","segment.r017.book1.ch14.text.block-119","segment.r017.book1.ch14.text.block-120","segment.r017.book1.ch14.text.block-121","segment.r017.book1.ch14.text.block-122","segment.r017.book1.ch14.text.block-123","segment.r017.book1.ch14.text.block-124","segment.r017.book1.ch14.text.block-125","segment.r017.book1.ch14.text.block-126","segment.r017.book1.ch14.text.block-127","segment.r017.book1.ch14.text.block-128","segment.r017.book1.ch14.text.block-129","segment.r017.book1.ch14.text.block-130","segment.r017.book1.ch14.text.block-131","segment.r017.book1.ch14.text.block-132","segment.r017.book1.ch14.text.block-133","segment.r017.book1.ch14.text.block-134","segment.r017.book1.ch14.text.block-135","segment.r017.book1.ch14.text.block-136","segment.r017.book1.ch14.text.block-137","segment.r017.book1.ch14.text.block-138","segment.r017.book1.ch14.text.block-139","segment.r017.book1.ch14.text.block-140","segment.r017.book1.ch14.text.block-141","segment.r017.book1.ch14.text.block-142","segment.r017.book1.ch14.text.block-143","segment.r017.book1.ch14.text.block-144","segment.r017.book1.ch14.text.block-145","segment.r017.book1.ch14.text.block-146","segment.r017.book1.ch14.text.block-147","segment.r017.book1.ch14.text.block-148","segment.r017.book1.ch14.text.block-149","segment.r017.book1.ch14.text.block-150","segment.r017.book1.ch14.text.block-151","segment.r017.book1.ch14.text.block-152","segment.r017.book1.ch14.text.block-153","segment.r017.book1.ch14.text.block-154","segment.r017.book1.ch14.text.block-155","segment.r017.book1.ch14.text.block-156","segment.r017.book1.ch14.text.block-157","segment.r017.book1.ch14.text.block-158","segment.r017.book1.ch14.text.block-159","segment.r017.book1.ch14.text.block-160","segment.r017.book1.ch14.text.block-161","segment.r017.book1.ch14.text.block-162","segment.r017.book1.ch14.text.block-163","segment.r017.book1.ch14.text.block-164","segment.r017.book1.ch14.text.block-165","segment.r017.book1.ch14.text.block-166","segment.r017.book1.ch14.text.block-167","segment.r017.book1.ch14.text.block-168","segment.r017.book1.ch14.text.block-169","segment.r017.book1.ch14.text.block-170","segment.r017.book1.ch14.text.block-171","segment.r017.book1.ch14.text.block-172","segment.r017.book1.ch14.text.block-173","segment.r017.book1.ch14.text.block-174","segment.r017.book1.ch14.text.block-175","segment.r017.book1.ch14.text.block-176","segment.r017.book1.ch14.text.block-177","segment.r017.book1.ch14.text.block-178","segment.r017.book1.ch14.text.block-179","segment.r017.book1.ch14.text.block-180","segment.r017.book1.ch14.text.block-181","segment.r017.book1.ch14.text.block-182","segment.r017.book1.ch14.text.block-183","segment.r017.book1.ch14.text.block-184","segment.r017.book1.ch14.text.block-185","segment.r017.book1.ch14.text.block-186","segment.r017.book1.ch14.text.block-187","segment.r017.book1.ch14.text.block-188","segment.r017.book1.ch14.text.block-189","segment.r017.book1.ch14.text.block-190","segment.r017.book1.ch14.text.block-191","segment.r017.book1.ch14.text.block-192","segment.r017.book1.ch14.text.block-193","segment.r017.book1.ch14.text.block-194","segment.r017.book1.ch14.text.block-195","segment.r017.book1.ch14.text.block-196","segment.r017.book1.ch14.text.block-197","segment.r017.book1.ch14.text.block-198","segment.r017.book1.ch14.text.block-199","segment.r017.book1.ch14.text.block-200","segment.r017.book1.ch14.text.block-201","segment.r017.book1.ch14.text.block-202","segment.r017.book1.ch14.text.block-203","segment.r017.book1.ch14.text.block-204","segment.r017.book1.ch14.text.block-205","segment.r017.book1.ch14.text.block-206","segment.r017.book1.ch14.text.block-207","segment.r017.book1.ch14.text.block-208","segment.r017.book1.ch14.text.block-209","segment.r017.book1.ch14.text.block-210","segment.r017.book1.ch14.text.block-211","segment.r017.book1.ch14.text.block-212","segment.r017.book1.ch14.text.block-213","segment.r017.book1.ch14.text.block-214","segment.r017.book1.ch14.text.block-215","segment.r017.book1.ch14.text.block-216","segment.r017.book1.ch14.text.block-217","segment.r017.book1.ch14.text.block-218","segment.r017.book1.ch14.text.block-219","segment.r017.book1.ch14.text.block-220","segment.r017.book1.ch14.text.block-221","segment.r017.book1.ch14.text.block-222","segment.r017.book1.ch14.text.block-223","segment.r017.book1.ch14.text.block-224","segment.r017.book1.ch14.text.block-225","segment.r017.book1.ch14.text.block-226","segment.r017.book1.ch14.text.block-227","segment.r017.book1.ch14.text.block-228","segment.r017.book1.ch14.text.block-229","segment.r017.book1.ch14.text.block-230","segment.r017.book1.ch14.text.block-231","segment.r017.book1.ch14.text.block-232","segment.r017.book1.ch14.text.block-233","segment.r017.book1.ch14.text.block-234","segment.r017.book1.ch14.text.block-235","segment.r017.book1.ch14.text.block-236","segment.r017.book1.ch14.text.block-237","segment.r017.book1.ch14.text.block-238","segment.r017.book1.ch14.text.block-239","segment.r017.book1.ch14.text.block-240","segment.r017.book1.ch14.text.block-241","segment.r017.book1.ch14.text.block-242","segment.r017.book1.ch14.text.block-243","segment.r017.book1.ch14.text.block-244","segment.r017.book1.ch14.text.block-245","segment.r017.book1.ch14.text.block-246","segment.r017.book1.ch14.text.block-247","segment.r017.book1.ch14.text.block-248","segment.r017.book1.ch14.text.block-249","segment.r017.book1.ch14.text.block-250","segment.r017.book1.ch14.text.block-251","segment.r017.book1.ch14.text.block-252","segment.r017.book1.ch14.text.block-253","segment.r017.book1.ch14.text.block-254","segment.r017.book1.ch14.text.block-255","segment.r017.book1.ch14.text.block-256","segment.r017.book1.ch14.text.block-257","segment.r017.book1.ch14.text.block-258","segment.r017.book1.ch14.text.block-259","segment.r017.book1.ch14.text.block-260","segment.r017.book1.ch14.text.block-261","segment.r017.book1.ch14.text.block-262","segment.r017.book1.ch14.text.block-263","segment.r017.book1.ch14.text.block-264","segment.r017.book1.ch14.text.block-265","segment.r017.book1.ch14.text.block-266","segment.r017.book1.ch14.text.block-267","segment.r017.book1.ch14.text.block-268","segment.r017.book1.ch14.text.block-269","segment.r017.book1.ch14.text.block-270","segment.r017.book1.ch14.text.block-271","segment.r017.book1.ch14.text.block-272","segment.r017.book1.ch14.text.block-273","segment.r017.book1.ch14.text.block-274","segment.r017.book1.ch14.text.block-275","segment.r017.book1.ch14.text.block-276","segment.r017.book1.ch14.text.block-277","segment.r017.book1.ch14.text.block-278","segment.r017.book1.ch14.text.block-279","segment.r017.book1.ch14.text.block-280","segment.r017.book1.ch14.text.block-281","segment.r017.book1.ch14.text.block-282","segment.r017.book1.ch14.text.block-283","segment.r017.book1.ch14.text.block-284","segment.r017.book1.ch14.text.block-285","segment.r017.book1.ch14.text.block-286","segment.r017.book1.ch14.text.block-287","segment.r017.book1.ch14.text.block-288","segment.r017.book1.ch14.text.block-289","segment.r017.book1.ch14.text.block-290","segment.r017.book1.ch14.text.block-291","segment.r017.book1.ch14.text.block-292","segment.r017.book1.ch14.text.block-293","segment.r017.book1.ch14.text.block-294","segment.r017.book1.ch14.text.block-295","segment.r017.book1.ch14.text.block-296","segment.r017.book1.ch14.text.block-297","segment.r017.book1.ch14.text.block-298","segment.r017.book1.ch14.text.block-299","segment.r017.book1.ch14.text.block-300","segment.r017.book1.ch14.text.block-301","segment.r017.book1.ch14.text.block-302","segment.r017.book1.ch14.text.block-303","segment.r017.book1.ch14.text.block-304","segment.r017.book1.ch14.text.block-305","segment.r017.book1.ch14.text.block-306","segment.r017.book1.ch14.text.block-307","segment.r017.book1.ch14.text.block-308","segment.r017.book1.ch14.text.block-309","segment.r017.book1.ch14.text.block-310","segment.r017.book1.ch14.text.block-311","segment.r017.book1.ch14.text.block-312","segment.r017.book1.ch14.text.block-313","segment.r017.book1.ch14.text.block-314","segment.r017.book1.ch14.text.block-315","segment.r017.book1.ch14.text.block-316","segment.r017.book1.ch14.text.block-317","segment.r017.book1.ch14.text.block-318","segment.r017.book1.ch14.text.block-319","segment.r017.book1.ch14.text.block-320","segment.r017.book1.ch14.text.block-321","segment.r017.book1.ch14.text.block-322","segment.r017.book1.ch14.text.block-323","segment.r017.book1.ch14.text.block-324","segment.r017.book1.ch14.text.block-325","segment.r017.book1.ch14.text.block-326","segment.r017.book1.ch14.text.block-327","segment.r017.book1.ch14.text.block-328","segment.r017.book1.ch14.text.block-329","segment.r017.book1.ch14.text.block-330","segment.r017.book1.ch14.text.block-331","segment.r017.book1.ch14.text.block-332","segment.r017.book1.ch14.text.block-333","segment.r017.book1.ch14.text.block-334","segment.r017.book1.ch14.text.block-335","segment.r017.book1.ch14.text.block-336","segment.r017.book1.ch14.text.block-337","segment.r017.book1.ch14.text.block-338","segment.r017.book1.ch14.text.block-339","segment.r017.book1.ch14.text.block-340","segment.r017.book1.ch14.text.block-341","segment.r017.book1.ch14.text.block-342","segment.r017.book1.ch14.text.block-343","segment.r017.book1.ch14.text.block-344","segment.r017.book1.ch14.text.block-345","segment.r017.book1.ch14.text.block-346","segment.r017.book1.ch14.text.block-347","segment.r017.book1.ch14.text.block-348","segment.r017.book1.ch14.text.block-349","segment.r017.book1.ch14.text.block-350","segment.r017.book1.ch14.text.block-351","segment.r017.book1.ch14.text.block-352","segment.r017.book1.ch14.text.block-353","segment.r017.book1.ch14.text.block-354","segment.r017.book1.ch14.text.block-355","segment.r017.book1.ch14.text.block-356","segment.r017.book1.ch14.text.block-357","segment.r017.book1.ch14.text.block-358","segment.r017.book1.ch14.text.block-359","segment.r017.book1.ch14.text.block-360","segment.r017.book1.ch14.text.block-361","segment.r017.book1.ch14.text.block-362","segment.r017.book1.ch14.text.block-363","segment.r017.book1.ch14.text.block-364","segment.r017.book1.ch14.text.block-365","segment.r017.book1.ch14.text.block-366","segment.r017.book1.ch14.text.block-367","segment.r017.book1.ch14.text.block-368","segment.r017.book1.ch14.text.block-369","segment.r017.book1.ch14.text.block-370","segment.r017.book1.ch14.text.block-371","segment.r017.book1.ch14.text.block-372","segment.r017.book1.ch14.text.block-373","segment.r017.book1.ch14.text.block-374","segment.r017.book1.ch14.text.block-375","segment.r017.book1.ch14.text.block-376","segment.r017.book1.ch14.text.block-377","segment.r017.book1.ch14.text.block-378","segment.r017.book1.ch14.text.block-379","segment.r017.book1.ch14.text.block-380","segment.r017.book1.ch14.text.block-381","segment.r017.book1.ch14.text.block-382","segment.r017.book1.ch14.text.block-383","segment.r017.book1.ch14.text.block-384","segment.r017.book1.ch14.text.block-385","segment.r017.book1.ch14.text.block-386","segment.r017.book1.ch14.text.block-387","segment.r017.book1.ch14.text.block-388","segment.r017.book1.ch14.text.block-389","segment.r017.book1.ch14.text.block-390","segment.r017.book1.ch14.text.block-391","segment.r017.book1.ch14.text.block-392","segment.r017.book1.ch14.text.block-393","segment.r017.book1.ch14.text.block-394","segment.r017.book1.ch14.text.block-395","segment.r017.book1.ch14.text.block-396","segment.r017.book1.ch14.text.block-397","segment.r017.book1.ch14.text.block-398","segment.r017.book1.ch14.text.block-399","segment.r017.book1.ch14.text.block-400","segment.r017.book1.ch14.text.block-401","segment.r017.book1.ch14.text.block-402","segment.r017.book1.ch14.text.block-403","segment.r017.book1.ch14.text.block-404","segment.r017.book1.ch14.text.block-405","segment.r017.book1.ch14.text.block-406","segment.r017.book1.ch14.text.block-407","segment.r017.book1.ch14.text.block-408","segment.r017.book1.ch14.text.block-409","segment.r017.book1.ch14.text.block-410","segment.r017.book1.ch14.text.block-411","segment.r017.book1.ch14.text.block-412","segment.r017.book1.ch14.text.block-413","segment.r017.book1.ch14.text.block-414","segment.r017.book1.ch14.text.block-415","segment.r017.book1.ch14.text.block-416","segment.r017.book1.ch14.text.block-417","segment.r017.book1.ch14.text.block-418","segment.r017.book1.ch14.text.block-419","segment.r017.book1.ch14.text.block-420","segment.r017.book1.ch14.text.block-421","segment.r017.book1.ch14.text.block-422","segment.r017.book1.ch14.text.block-423","segment.r017.book1.ch14.text.block-424","segment.r017.book1.ch14.text.block-425","segment.r017.book1.ch14.text.block-426","segment.r017.book1.ch14.text.block-427","segment.r017.book1.ch14.text.block-428"],"native":{"concept_id":"concept.hamilton-circuit","evidence":"Full-corpus id-ID terminology audit","id":"term.hamilton-circuit.id","preferred":"sirkuit Hamilton","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"Hamilton circuit","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch05.text.block-140"],"native":{"concept_id":"concept.infeasible-linear-program","evidence":"Chapter 5 terminology decision","id":"term.infeasible.id","preferred":"tak layak","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear programming status","source_locale":"en","source_term":"infeasible","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["tidak layak"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch15.attribution.block-001","segment.o018.lab.ch15.attribution.block-002","segment.o018.lab.ch15.attribution.block-003","segment.o018.lab.ch15.attribution.block-004","segment.o018.lab.ch15.attribution.block-005","segment.o018.lab.ch15.attribution.block-006","segment.o018.lab.ch15.attribution.block-007","segment.o018.lab.ch15.attribution.block-008","segment.o018.lab.ch15.attribution.block-009","segment.o018.lab.ch15.attribution.block-010","segment.o018.lab.ch15.attribution.block-011","segment.o018.lab.ch15.attribution.block-012","segment.o018.lab.ch15.attribution.block-013","segment.o018.lab.ch15.attribution.block-014","segment.o018.lab.ch15.attribution.block-015","segment.o018.lab.ch15.readme.block-001","segment.o018.lab.ch15.readme.block-002","segment.o018.lab.ch15.readme.block-003","segment.o018.lab.ch15.readme.block-004","segment.o018.lab.ch15.readme.block-005","segment.o018.lab.ch15.readme.block-006","segment.o018.lab.ch15.readme.block-007","segment.o018.lab.ch15.readme.block-008","segment.o018.lab.ch15.readme.block-009","segment.o018.lab.readme.block-001","segment.o018.lab.readme.block-002","segment.o018.lab.readme.block-003","segment.o018.lab.readme.block-004","segment.o018.lab.readme.block-005","segment.o018.lab.readme.block-006","segment.o018.lab.readme.block-007","segment.o018.lab.readme.block-008","segment.o018.lab.readme.block-009","segment.o018.lab.readme.block-010","segment.o018.lab.readme.block-011","segment.r017.book1.ch01.text.block-052","segment.r017.book1.ch01.text.block-056","segment.r017.book1.ch02.text.block-101","segment.r017.book1.ch04.text-a.block-055","segment.r017.book1.ch04.text-b.block-182","segment.r017.book1.ch04.text-b.block-208","segment.r017.book1.ch15.solutions-manual.block-001","segment.r017.book1.ch15.solutions-manual.block-002","segment.r017.book1.ch15.solutions-manual.block-003","segment.r017.book1.ch15.solutions-manual.block-004","segment.r017.book1.ch15.solutions-manual.block-005","segment.r017.book1.ch15.solutions-manual.block-006","segment.r017.book1.ch15.solutions-manual.block-007","segment.r017.book1.ch15.solutions-manual.block-008","segment.r017.book1.ch15.solutions-manual.block-009","segment.r017.book1.ch15.solutions-manual.block-010","segment.r017.book1.ch15.solutions-manual.block-011","segment.r017.book1.ch15.solutions-manual.block-012","segment.r017.book1.ch15.solutions-manual.block-013","segment.r017.book1.ch15.solutions-manual.block-014","segment.r017.book1.ch15.solutions-manual.block-015","segment.r017.book1.ch15.solutions-manual.block-016","segment.r017.book1.ch15.solutions-manual.block-017","segment.r017.book1.ch15.solutions-manual.block-018","segment.r017.book1.ch15.solutions-manual.block-019","segment.r017.book1.ch15.solutions-manual.block-020","segment.r017.book1.ch15.solutions-manual.block-021","segment.r017.book1.ch15.solutions-manual.block-022","segment.r017.book1.ch15.solutions-manual.block-023","segment.r017.book1.ch15.solutions-manual.block-024","segment.r017.book1.ch15.solutions-manual.block-025","segment.r017.book1.ch15.solutions-manual.block-026","segment.r017.book1.ch15.solutions-manual.block-027","segment.r017.book1.ch15.solutions-manual.block-028","segment.r017.book1.ch15.solutions-manual.block-029","segment.r017.book1.ch15.solutions-manual.block-030","segment.r017.book1.ch15.solutions-manual.block-031","segment.r017.book1.ch15.solutions-manual.block-032","segment.r017.book1.ch15.solutions-manual.block-033","segment.r017.book1.ch15.solutions-manual.block-034","segment.r017.book1.ch15.solutions-manual.block-035","segment.r017.book1.ch15.solutions-manual.block-036","segment.r017.book1.ch15.solutions-manual.block-037","segment.r017.book1.ch15.solutions-manual.block-038","segment.r017.book1.ch15.solutions-manual.block-039","segment.r017.book1.ch15.solutions-manual.block-040","segment.r017.book1.ch15.solutions-manual.block-041","segment.r017.book1.ch15.solutions-manual.block-042","segment.r017.book1.ch15.solutions-manual.block-043","segment.r017.book1.ch15.solutions-manual.block-044","segment.r017.book1.ch15.solutions-manual.block-045","segment.r017.book1.ch15.solutions-manual.block-046","segment.r017.book1.ch15.solutions-manual.block-047","segment.r017.book1.ch15.solutions-manual.block-048","segment.r017.book1.ch15.solutions-manual.block-049","segment.r017.book1.ch15.solutions-manual.block-050","segment.r017.book1.ch15.solutions-manual.block-051","segment.r017.book1.ch15.solutions-manual.block-052","segment.r017.book1.ch15.text.block-001","segment.r017.book1.ch15.text.block-002","segment.r017.book1.ch15.text.block-003","segment.r017.book1.ch15.text.block-004","segment.r017.book1.ch15.text.block-005","segment.r017.book1.ch15.text.block-006","segment.r017.book1.ch15.text.block-007","segment.r017.book1.ch15.text.block-008","segment.r017.book1.ch15.text.block-009","segment.r017.book1.ch15.text.block-010","segment.r017.book1.ch15.text.block-011","segment.r017.book1.ch15.text.block-012","segment.r017.book1.ch15.text.block-013","segment.r017.book1.ch15.text.block-014","segment.r017.book1.ch15.text.block-015","segment.r017.book1.ch15.text.block-016","segment.r017.book1.ch15.text.block-017","segment.r017.book1.ch15.text.block-018","segment.r017.book1.ch15.text.block-019","segment.r017.book1.ch15.text.block-020","segment.r017.book1.ch15.text.block-021","segment.r017.book1.ch15.text.block-022","segment.r017.book1.ch15.text.block-023","segment.r017.book1.ch15.text.block-024","segment.r017.book1.ch15.text.block-025","segment.r017.book1.ch15.text.block-026","segment.r017.book1.ch15.text.block-027","segment.r017.book1.ch15.text.block-028","segment.r017.book1.ch15.text.block-029","segment.r017.book1.ch15.text.block-030","segment.r017.book1.ch15.text.block-031","segment.r017.book1.ch15.text.block-032","segment.r017.book1.ch15.text.block-033","segment.r017.book1.ch15.text.block-034","segment.r017.book1.ch15.text.block-035","segment.r017.book1.ch15.text.block-036","segment.r017.book1.ch15.text.block-037","segment.r017.book1.ch15.text.block-038","segment.r017.book1.ch15.text.block-039","segment.r017.book1.ch15.text.block-040","segment.r017.book1.ch15.text.block-041","segment.r017.book1.ch15.text.block-042","segment.r017.book1.ch15.text.block-043","segment.r017.book1.ch15.text.block-044","segment.r017.book1.ch15.text.block-045","segment.r017.book1.ch15.text.block-046","segment.r017.book1.ch15.text.block-047","segment.r017.book1.ch15.text.block-048","segment.r017.book1.ch15.text.block-049","segment.r017.book1.ch15.text.block-050","segment.r017.book1.ch15.text.block-051","segment.r017.book1.ch15.text.block-052","segment.r017.book1.ch15.text.block-053","segment.r017.book1.ch15.text.block-054","segment.r017.book1.ch15.text.block-055","segment.r017.book1.ch15.text.block-056","segment.r017.book1.ch15.text.block-057","segment.r017.book1.ch15.text.block-058","segment.r017.book1.ch15.text.block-059","segment.r017.book1.ch15.text.block-060","segment.r017.book1.ch15.text.block-061","segment.r017.book1.ch15.text.block-062","segment.r017.book1.ch15.text.block-063","segment.r017.book1.ch15.text.block-064","segment.r017.book1.ch15.text.block-065","segment.r017.book1.ch15.text.block-066","segment.r017.book1.ch15.text.block-067","segment.r017.book1.ch15.text.block-068","segment.r017.book1.ch15.text.block-069","segment.r017.book1.ch15.text.block-070","segment.r017.book1.ch15.text.block-071","segment.r017.book1.ch15.text.block-072","segment.r017.book1.ch15.text.block-073","segment.r017.book1.ch15.text.block-074","segment.r017.book1.ch15.text.block-075","segment.r017.book1.ch15.text.block-076","segment.r017.book1.ch15.text.block-077","segment.r017.book1.ch15.text.block-078","segment.r017.book1.ch15.text.block-079","segment.r017.book1.ch15.text.block-080","segment.r017.book1.ch15.text.block-081","segment.r017.book1.ch15.text.block-082","segment.r017.book1.ch15.text.block-083","segment.r017.book1.ch15.text.block-084","segment.r017.book1.ch15.text.block-085","segment.r017.book1.ch15.text.block-086","segment.r017.book1.ch15.text.block-087","segment.r017.book1.ch15.text.block-088","segment.r017.book1.ch15.text.block-089","segment.r017.book1.ch15.text.block-090","segment.r017.book1.ch15.text.block-091","segment.r017.book1.ch15.text.block-092","segment.r017.book1.ch15.text.block-093","segment.r017.book1.ch15.text.block-094","segment.r017.book1.ch15.text.block-095","segment.r017.book1.ch15.text.block-096","segment.r017.book1.ch15.text.block-097","segment.r017.book1.ch15.text.block-098","segment.r017.book1.ch15.text.block-099","segment.r017.book1.ch15.text.block-100","segment.r017.book1.ch15.text.block-101","segment.r017.book1.ch15.text.block-102","segment.r017.book1.ch15.text.block-103","segment.r017.book1.ch15.text.block-104","segment.r017.book1.ch15.text.block-105","segment.r017.book1.ch15.text.block-106","segment.r017.book1.ch15.text.block-107","segment.r017.book1.ch15.text.block-108","segment.r017.book1.ch15.text.block-109","segment.r017.book1.ch15.text.block-110","segment.r017.book1.ch15.text.block-111","segment.r017.book1.ch15.text.block-112","segment.r017.book1.ch15.text.block-113","segment.r017.book1.ch15.text.block-114","segment.r017.book1.ch15.text.block-115","segment.r017.book1.ch15.text.block-116","segment.r017.book1.ch15.text.block-117","segment.r017.book1.ch15.text.block-118","segment.r017.book1.ch15.text.block-119","segment.r017.book1.ch15.text.block-120","segment.r017.book1.ch15.text.block-121","segment.r017.book1.ch15.text.block-122","segment.r017.book1.ch15.text.block-123","segment.r017.book1.ch15.text.block-124","segment.r017.book1.ch15.text.block-125","segment.r017.book1.ch15.text.block-126","segment.r017.book1.ch15.text.block-127","segment.r017.book1.ch15.text.block-128","segment.r017.book1.ch15.text.block-129","segment.r017.book1.ch15.text.block-130","segment.r017.book1.ch15.text.block-131","segment.r017.book1.ch15.text.block-132","segment.r017.book1.ch15.text.block-133","segment.r017.book1.ch15.text.block-134","segment.r017.book1.ch15.text.block-135","segment.r017.book1.ch15.text.block-136","segment.r017.book1.ch15.text.block-137","segment.r017.book1.ch15.text.block-138","segment.r017.book1.ch15.text.block-139","segment.r017.book1.ch15.text.block-140","segment.r017.book1.ch15.text.block-141","segment.r017.book1.ch15.text.block-142","segment.r017.book1.ch15.text.block-143","segment.r017.book1.ch15.text.block-144","segment.r017.book1.ch15.text.block-145","segment.r017.book1.ch15.text.block-146","segment.r017.book1.ch15.text.block-147","segment.r017.book1.ch15.text.block-148","segment.r017.book1.ch15.text.block-149","segment.r017.book1.ch15.text.block-150","segment.r017.book1.ch15.text.block-151","segment.r017.book1.ch15.text.block-152","segment.r017.book1.ch15.text.block-153","segment.r017.book1.ch15.text.block-154","segment.r017.book1.ch15.text.block-155","segment.r017.book1.ch15.text.block-156","segment.r017.book1.ch15.text.block-157","segment.r017.book1.ch15.text.block-158","segment.r017.book1.ch15.text.block-159","segment.r017.book1.ch15.text.block-160","segment.r017.book1.ch15.text.block-161","segment.r017.book1.ch15.text.block-162","segment.r017.book1.ch15.text.block-163","segment.r017.book1.ch15.text.block-164","segment.r017.book1.ch15.text.block-165","segment.r017.book1.ch15.text.block-166","segment.r017.book1.ch15.text.block-167","segment.r017.book1.ch15.text.block-168","segment.r017.book1.ch15.text.block-169","segment.r017.book1.ch15.text.block-170","segment.r017.book1.ch15.text.block-171","segment.r017.book1.ch15.text.block-172","segment.r017.book1.ch15.text.block-173","segment.r017.book1.ch15.text.block-174","segment.r017.book1.ch15.text.block-175","segment.r017.book1.ch15.text.block-176","segment.r017.book1.ch15.text.block-177","segment.r017.book1.ch15.text.block-178","segment.r017.book1.ch15.text.block-179","segment.r017.book1.ch15.text.block-180","segment.r017.book1.ch15.text.block-181","segment.r017.book1.ch15.text.block-182","segment.r017.book1.ch15.text.block-183","segment.r017.book1.ch15.text.block-184","segment.r017.book1.ch15.text.block-185","segment.r017.book1.ch15.text.block-186","segment.r017.book1.ch15.text.block-187","segment.r017.book1.ch15.text.block-188","segment.r017.book1.ch15.text.block-189","segment.r017.book1.ch15.text.block-190","segment.r017.book1.ch15.text.block-191","segment.r017.book1.ch15.text.block-192","segment.r017.book1.ch15.text.block-193","segment.r017.book1.ch15.text.block-194","segment.r017.book1.ch15.text.block-195","segment.r017.book1.ch15.text.block-196","segment.r017.book1.ch15.text.block-197","segment.r017.book1.ch15.text.block-198","segment.r017.book1.ch15.text.block-199","segment.r017.book1.ch15.text.block-200","segment.r017.book1.ch15.text.block-201","segment.r017.book1.ch15.text.block-202","segment.r017.book1.ch15.text.block-203","segment.r017.book1.ch15.text.block-204","segment.r017.book1.ch15.text.block-205","segment.r017.book1.ch15.text.block-206","segment.r017.book1.ch15.text.block-207","segment.r017.book1.ch15.text.block-208","segment.r017.book1.ch15.text.block-209","segment.r017.book1.ch15.text.block-210","segment.r017.book1.ch15.text.block-211","segment.r017.book1.ch15.text.block-212","segment.r017.book1.ch15.text.block-213","segment.r017.book1.ch15.text.block-214","segment.r017.book1.ch15.text.block-215","segment.r017.book1.ch15.text.block-216","segment.r017.book1.ch15.text.block-217","segment.r017.book1.ch15.text.block-218","segment.r017.book1.ch15.text.block-219","segment.r017.book1.ch15.text.block-220","segment.r017.book1.ch15.text.block-221","segment.r017.book1.ch15.text.block-222","segment.r017.book1.ch15.text.block-223","segment.r017.book1.ch15.text.block-224","segment.r017.book1.ch15.text.block-225","segment.r017.book1.ch15.text.block-226","segment.r017.book1.ch15.text.block-227","segment.r017.book1.ch15.text.block-228","segment.r017.book1.ch15.text.block-229","segment.r017.book1.ch15.text.block-230","segment.r017.book1.ch15.text.block-231","segment.r017.book1.ch15.text.block-232","segment.r017.book1.ch15.text.block-233","segment.r017.book1.ch15.text.block-234","segment.r017.book1.ch15.text.block-235","segment.r017.book1.ch15.text.block-236","segment.r017.book1.ch15.text.block-237","segment.r017.book1.ch15.text.block-238","segment.r017.book1.ch15.text.block-239","segment.r017.book1.ch15.text.block-240","segment.r017.book1.ch15.text.block-241","segment.r017.book1.ch15.text.block-242","segment.r017.book1.ch15.text.block-243","segment.r017.book1.ch15.text.block-244","segment.r017.book1.ch15.text.block-245","segment.r017.book1.ch15.text.block-246","segment.r017.book1.ch15.text.block-247","segment.r017.book1.ch15.text.block-248","segment.r017.book1.ch15.text.block-249","segment.r017.book1.ch15.text.block-250","segment.r017.book1.ch15.text.block-251","segment.r017.book1.ch15.text.block-252","segment.r017.book1.ch15.text.block-253","segment.r017.book1.ch15.text.block-254","segment.r017.book1.ch15.text.block-255","segment.r017.book1.ch15.text.block-256","segment.r017.book1.ch15.text.block-257","segment.r017.book1.ch15.text.block-258","segment.r017.book1.ch15.text.block-259","segment.r017.book1.ch15.text.block-260","segment.r017.book1.ch15.text.block-261","segment.r017.book1.ch15.text.block-262","segment.r017.book1.ch15.text.block-263","segment.r017.book1.ch15.text.block-264","segment.r017.book1.ch15.text.block-265","segment.r017.book1.ch15.text.block-266","segment.r017.book1.ch15.text.block-267","segment.r017.book1.ch15.text.block-268","segment.r017.book1.ch15.text.block-269","segment.r017.book1.ch15.text.block-270","segment.r017.book1.ch15.text.block-271","segment.r017.book1.ch15.text.block-272","segment.r017.book1.ch15.text.block-273","segment.r017.book1.ch15.text.block-274","segment.r017.book1.ch15.text.block-275","segment.r017.book1.ch15.text.block-276","segment.r017.book1.ch15.text.block-277","segment.r017.book1.ch15.text.block-278","segment.r017.book1.ch15.text.block-279","segment.r017.book1.ch15.text.block-280","segment.r017.book1.ch15.text.block-281","segment.r017.book1.ch15.text.block-282","segment.r017.book1.ch15.text.block-283","segment.r017.book1.ch15.text.block-284","segment.r017.book1.ch15.text.block-285","segment.r017.book1.ch15.text.block-286","segment.r017.book1.ch15.text.block-287","segment.r017.book1.ch15.text.block-288","segment.r017.book1.ch15.text.block-289","segment.r017.book1.ch15.text.block-290","segment.r017.book1.ch15.text.block-291","segment.r017.book1.ch15.text.block-292","segment.r017.book1.ch15.text.block-293","segment.r017.book1.ch15.text.block-294","segment.r017.book1.ch15.text.block-295","segment.r017.book1.ch15.text.block-296","segment.r017.book1.ch15.text.block-297","segment.r017.book1.ch15.text.block-298","segment.r017.book1.ch15.text.block-299","segment.r017.book1.ch15.text.block-300","segment.r017.book1.ch15.text.block-301","segment.r017.book1.ch15.text.block-302","segment.r017.book1.ch15.text.block-303","segment.r017.book1.ch15.text.block-304","segment.r017.book1.ch15.text.block-305","segment.r017.book1.ch15.text.block-306","segment.r017.book1.ch15.text.block-307","segment.r017.book1.ch15.text.block-308","segment.r017.book1.ch15.text.block-309","segment.r017.book1.ch15.text.block-310","segment.r017.book1.ch15.text.block-311","segment.r017.book1.ch15.text.block-312","segment.r017.book1.ch15.text.block-313","segment.r017.book1.ch15.text.block-314","segment.r017.book1.ch15.text.block-315","segment.r017.book1.ch15.text.block-316","segment.r017.book1.ch15.text.block-317","segment.r017.book1.ch15.text.block-318","segment.r017.book1.ch15.text.block-319","segment.r017.book1.ch15.text.block-320","segment.r017.book1.ch15.text.block-321","segment.r017.book1.ch15.text.block-322","segment.r017.book1.ch15.text.block-323","segment.r017.book1.ch15.text.block-324","segment.r017.book1.ch15.text.block-325","segment.r017.book1.ch15.text.block-326","segment.r017.book1.ch15.text.block-327","segment.r017.book1.ch15.text.block-328","segment.r017.book1.ch15.text.block-329","segment.r017.book1.ch15.text.block-330","segment.r017.book1.ch15.text.block-331","segment.r017.book1.ch15.text.block-332","segment.r017.book1.ch15.text.block-333","segment.r017.book1.ch15.text.block-334","segment.r017.book1.ch15.text.block-335","segment.r017.book1.ch15.text.block-336","segment.r017.book1.ch15.text.block-337","segment.r017.book1.ch15.text.block-338","segment.r017.book1.ch15.text.block-339","segment.r017.book1.ch15.text.block-340","segment.r017.book1.ch15.text.block-341","segment.r017.book1.ch15.text.block-342"],"native":{"concept_id":"concept.integer-linear-programming","evidence":"Final id-ID corpus terminology audit","id":"term.integer-linear-programming.id","preferred":"pemrograman linear bilangan bulat","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"integer linear programming","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.readme.block-001","segment.o018.lab.readme.block-002","segment.o018.lab.readme.block-003","segment.o018.lab.readme.block-004","segment.o018.lab.readme.block-005","segment.o018.lab.readme.block-006","segment.o018.lab.readme.block-007","segment.o018.lab.readme.block-008","segment.o018.lab.readme.block-009","segment.o018.lab.readme.block-010","segment.o018.lab.readme.block-011","segment.r017.book1.ch02.text.block-045","segment.r017.book1.ch03.text.block-045","segment.r017.book1.ch04.text-a.block-017","segment.r017.book1.ch04.text-a.block-030","segment.r017.book1.ch04.text-b.block-181","segment.r017.book1.ch04.text-b.block-209"],"native":{"concept_id":"concept.inventory-balance","evidence":"O018 README and Chapter 1 exercise ex:shirt-full-lp","id":"term.inventory-balance.id","preferred":"keseimbangan persediaan","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"shirt-ordering model","source_locale":"en","source_term":"inventory balance","status":"source_frozen","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch15.attribution.block-001","segment.o018.lab.ch15.attribution.block-002","segment.o018.lab.ch15.attribution.block-003","segment.o018.lab.ch15.attribution.block-004","segment.o018.lab.ch15.attribution.block-005","segment.o018.lab.ch15.attribution.block-006","segment.o018.lab.ch15.attribution.block-007","segment.o018.lab.ch15.attribution.block-008","segment.o018.lab.ch15.attribution.block-009","segment.o018.lab.ch15.attribution.block-010","segment.o018.lab.ch15.attribution.block-011","segment.o018.lab.ch15.attribution.block-012","segment.o018.lab.ch15.attribution.block-013","segment.o018.lab.ch15.attribution.block-014","segment.o018.lab.ch15.attribution.block-015","segment.o018.lab.ch15.readme.block-001","segment.o018.lab.ch15.readme.block-002","segment.o018.lab.ch15.readme.block-003","segment.o018.lab.ch15.readme.block-004","segment.o018.lab.ch15.readme.block-005","segment.o018.lab.ch15.readme.block-006","segment.o018.lab.ch15.readme.block-007","segment.o018.lab.ch15.readme.block-008","segment.o018.lab.ch15.readme.block-009","segment.r017.book1.ch15.text.block-001","segment.r017.book1.ch15.text.block-002","segment.r017.book1.ch15.text.block-003","segment.r017.book1.ch15.text.block-004","segment.r017.book1.ch15.text.block-005","segment.r017.book1.ch15.text.block-006","segment.r017.book1.ch15.text.block-007","segment.r017.book1.ch15.text.block-008","segment.r017.book1.ch15.text.block-009","segment.r017.book1.ch15.text.block-010","segment.r017.book1.ch15.text.block-011","segment.r017.book1.ch15.text.block-012","segment.r017.book1.ch15.text.block-013","segment.r017.book1.ch15.text.block-014","segment.r017.book1.ch15.text.block-015","segment.r017.book1.ch15.text.block-016","segment.r017.book1.ch15.text.block-017","segment.r017.book1.ch15.text.block-018","segment.r017.book1.ch15.text.block-019","segment.r017.book1.ch15.text.block-020","segment.r017.book1.ch15.text.block-021","segment.r017.book1.ch15.text.block-022","segment.r017.book1.ch15.text.block-023","segment.r017.book1.ch15.text.block-024","segment.r017.book1.ch15.text.block-025","segment.r017.book1.ch15.text.block-026","segment.r017.book1.ch15.text.block-027","segment.r017.book1.ch15.text.block-028","segment.r017.book1.ch15.text.block-029","segment.r017.book1.ch15.text.block-030","segment.r017.book1.ch15.text.block-031","segment.r017.book1.ch15.text.block-032","segment.r017.book1.ch15.text.block-033","segment.r017.book1.ch15.text.block-034","segment.r017.book1.ch15.text.block-035","segment.r017.book1.ch15.text.block-036","segment.r017.book1.ch15.text.block-037","segment.r017.book1.ch15.text.block-038","segment.r017.book1.ch15.text.block-039","segment.r017.book1.ch15.text.block-040","segment.r017.book1.ch15.text.block-041","segment.r017.book1.ch15.text.block-042","segment.r017.book1.ch15.text.block-043","segment.r017.book1.ch15.text.block-044","segment.r017.book1.ch15.text.block-045","segment.r017.book1.ch15.text.block-046","segment.r017.book1.ch15.text.block-047","segment.r017.book1.ch15.text.block-048","segment.r017.book1.ch15.text.block-049","segment.r017.book1.ch15.text.block-050","segment.r017.book1.ch15.text.block-051","segment.r017.book1.ch15.text.block-052","segment.r017.book1.ch15.text.block-053","segment.r017.book1.ch15.text.block-054","segment.r017.book1.ch15.text.block-055","segment.r017.book1.ch15.text.block-056","segment.r017.book1.ch15.text.block-057","segment.r017.book1.ch15.text.block-058","segment.r017.book1.ch15.text.block-059","segment.r017.book1.ch15.text.block-060","segment.r017.book1.ch15.text.block-061","segment.r017.book1.ch15.text.block-062","segment.r017.book1.ch15.text.block-063","segment.r017.book1.ch15.text.block-064","segment.r017.book1.ch15.text.block-065","segment.r017.book1.ch15.text.block-066","segment.r017.book1.ch15.text.block-067","segment.r017.book1.ch15.text.block-068","segment.r017.book1.ch15.text.block-069","segment.r017.book1.ch15.text.block-070","segment.r017.book1.ch15.text.block-071","segment.r017.book1.ch15.text.block-072","segment.r017.book1.ch15.text.block-073","segment.r017.book1.ch15.text.block-074","segment.r017.book1.ch15.text.block-075","segment.r017.book1.ch15.text.block-076","segment.r017.book1.ch15.text.block-077","segment.r017.book1.ch15.text.block-078","segment.r017.book1.ch15.text.block-079","segment.r017.book1.ch15.text.block-080","segment.r017.book1.ch15.text.block-081","segment.r017.book1.ch15.text.block-082","segment.r017.book1.ch15.text.block-083","segment.r017.book1.ch15.text.block-084","segment.r017.book1.ch15.text.block-085","segment.r017.book1.ch15.text.block-086","segment.r017.book1.ch15.text.block-087","segment.r017.book1.ch15.text.block-088","segment.r017.book1.ch15.text.block-089","segment.r017.book1.ch15.text.block-090","segment.r017.book1.ch15.text.block-091","segment.r017.book1.ch15.text.block-092","segment.r017.book1.ch15.text.block-093","segment.r017.book1.ch15.text.block-094","segment.r017.book1.ch15.text.block-095","segment.r017.book1.ch15.text.block-096","segment.r017.book1.ch15.text.block-097","segment.r017.book1.ch15.text.block-098","segment.r017.book1.ch15.text.block-099","segment.r017.book1.ch15.text.block-100","segment.r017.book1.ch15.text.block-101","segment.r017.book1.ch15.text.block-102","segment.r017.book1.ch15.text.block-103","segment.r017.book1.ch15.text.block-104","segment.r017.book1.ch15.text.block-105","segment.r017.book1.ch15.text.block-106","segment.r017.book1.ch15.text.block-107","segment.r017.book1.ch15.text.block-108","segment.r017.book1.ch15.text.block-109","segment.r017.book1.ch15.text.block-110","segment.r017.book1.ch15.text.block-111","segment.r017.book1.ch15.text.block-112","segment.r017.book1.ch15.text.block-113","segment.r017.book1.ch15.text.block-114","segment.r017.book1.ch15.text.block-115","segment.r017.book1.ch15.text.block-116","segment.r017.book1.ch15.text.block-117","segment.r017.book1.ch15.text.block-118","segment.r017.book1.ch15.text.block-119","segment.r017.book1.ch15.text.block-120","segment.r017.book1.ch15.text.block-121","segment.r017.book1.ch15.text.block-122","segment.r017.book1.ch15.text.block-123","segment.r017.book1.ch15.text.block-124","segment.r017.book1.ch15.text.block-125","segment.r017.book1.ch15.text.block-126","segment.r017.book1.ch15.text.block-127","segment.r017.book1.ch15.text.block-128","segment.r017.book1.ch15.text.block-129","segment.r017.book1.ch15.text.block-130","segment.r017.book1.ch15.text.block-131","segment.r017.book1.ch15.text.block-132","segment.r017.book1.ch15.text.block-133","segment.r017.book1.ch15.text.block-134","segment.r017.book1.ch15.text.block-135","segment.r017.book1.ch15.text.block-136","segment.r017.book1.ch15.text.block-137","segment.r017.book1.ch15.text.block-138","segment.r017.book1.ch15.text.block-139","segment.r017.book1.ch15.text.block-140","segment.r017.book1.ch15.text.block-141","segment.r017.book1.ch15.text.block-142","segment.r017.book1.ch15.text.block-143","segment.r017.book1.ch15.text.block-144","segment.r017.book1.ch15.text.block-145","segment.r017.book1.ch15.text.block-146","segment.r017.book1.ch15.text.block-147","segment.r017.book1.ch15.text.block-148","segment.r017.book1.ch15.text.block-149","segment.r017.book1.ch15.text.block-150","segment.r017.book1.ch15.text.block-151","segment.r017.book1.ch15.text.block-152","segment.r017.book1.ch15.text.block-153","segment.r017.book1.ch15.text.block-154","segment.r017.book1.ch15.text.block-155","segment.r017.book1.ch15.text.block-156","segment.r017.book1.ch15.text.block-157","segment.r017.book1.ch15.text.block-158","segment.r017.book1.ch15.text.block-159","segment.r017.book1.ch15.text.block-160","segment.r017.book1.ch15.text.block-161","segment.r017.book1.ch15.text.block-162","segment.r017.book1.ch15.text.block-163","segment.r017.book1.ch15.text.block-164","segment.r017.book1.ch15.text.block-165","segment.r017.book1.ch15.text.block-166","segment.r017.book1.ch15.text.block-167","segment.r017.book1.ch15.text.block-168","segment.r017.book1.ch15.text.block-169","segment.r017.book1.ch15.text.block-170","segment.r017.book1.ch15.text.block-171","segment.r017.book1.ch15.text.block-172","segment.r017.book1.ch15.text.block-173","segment.r017.book1.ch15.text.block-174","segment.r017.book1.ch15.text.block-175","segment.r017.book1.ch15.text.block-176","segment.r017.book1.ch15.text.block-177","segment.r017.book1.ch15.text.block-178","segment.r017.book1.ch15.text.block-179","segment.r017.book1.ch15.text.block-180","segment.r017.book1.ch15.text.block-181","segment.r017.book1.ch15.text.block-182","segment.r017.book1.ch15.text.block-183","segment.r017.book1.ch15.text.block-184","segment.r017.book1.ch15.text.block-185","segment.r017.book1.ch15.text.block-186","segment.r017.book1.ch15.text.block-187","segment.r017.book1.ch15.text.block-188","segment.r017.book1.ch15.text.block-189","segment.r017.book1.ch15.text.block-190","segment.r017.book1.ch15.text.block-191","segment.r017.book1.ch15.text.block-192","segment.r017.book1.ch15.text.block-193","segment.r017.book1.ch15.text.block-194","segment.r017.book1.ch15.text.block-195","segment.r017.book1.ch15.text.block-196","segment.r017.book1.ch15.text.block-197","segment.r017.book1.ch15.text.block-198","segment.r017.book1.ch15.text.block-199","segment.r017.book1.ch15.text.block-200","segment.r017.book1.ch15.text.block-201","segment.r017.book1.ch15.text.block-202","segment.r017.book1.ch15.text.block-203","segment.r017.book1.ch15.text.block-204","segment.r017.book1.ch15.text.block-205","segment.r017.book1.ch15.text.block-206","segment.r017.book1.ch15.text.block-207","segment.r017.book1.ch15.text.block-208","segment.r017.book1.ch15.text.block-209","segment.r017.book1.ch15.text.block-210","segment.r017.book1.ch15.text.block-211","segment.r017.book1.ch15.text.block-212","segment.r017.book1.ch15.text.block-213","segment.r017.book1.ch15.text.block-214","segment.r017.book1.ch15.text.block-215","segment.r017.book1.ch15.text.block-216","segment.r017.book1.ch15.text.block-217","segment.r017.book1.ch15.text.block-218","segment.r017.book1.ch15.text.block-219","segment.r017.book1.ch15.text.block-220","segment.r017.book1.ch15.text.block-221","segment.r017.book1.ch15.text.block-222","segment.r017.book1.ch15.text.block-223","segment.r017.book1.ch15.text.block-224","segment.r017.book1.ch15.text.block-225","segment.r017.book1.ch15.text.block-226","segment.r017.book1.ch15.text.block-227","segment.r017.book1.ch15.text.block-228","segment.r017.book1.ch15.text.block-229","segment.r017.book1.ch15.text.block-230","segment.r017.book1.ch15.text.block-231","segment.r017.book1.ch15.text.block-232","segment.r017.book1.ch15.text.block-233","segment.r017.book1.ch15.text.block-234","segment.r017.book1.ch15.text.block-235","segment.r017.book1.ch15.text.block-236","segment.r017.book1.ch15.text.block-237","segment.r017.book1.ch15.text.block-238","segment.r017.book1.ch15.text.block-239","segment.r017.book1.ch15.text.block-240","segment.r017.book1.ch15.text.block-241","segment.r017.book1.ch15.text.block-242","segment.r017.book1.ch15.text.block-243","segment.r017.book1.ch15.text.block-244","segment.r017.book1.ch15.text.block-245","segment.r017.book1.ch15.text.block-246","segment.r017.book1.ch15.text.block-247","segment.r017.book1.ch15.text.block-248","segment.r017.book1.ch15.text.block-249","segment.r017.book1.ch15.text.block-250","segment.r017.book1.ch15.text.block-251","segment.r017.book1.ch15.text.block-252","segment.r017.book1.ch15.text.block-253","segment.r017.book1.ch15.text.block-254","segment.r017.book1.ch15.text.block-255","segment.r017.book1.ch15.text.block-256","segment.r017.book1.ch15.text.block-257","segment.r017.book1.ch15.text.block-258","segment.r017.book1.ch15.text.block-259","segment.r017.book1.ch15.text.block-260","segment.r017.book1.ch15.text.block-261","segment.r017.book1.ch15.text.block-262","segment.r017.book1.ch15.text.block-263","segment.r017.book1.ch15.text.block-264","segment.r017.book1.ch15.text.block-265","segment.r017.book1.ch15.text.block-266","segment.r017.book1.ch15.text.block-267","segment.r017.book1.ch15.text.block-268","segment.r017.book1.ch15.text.block-269","segment.r017.book1.ch15.text.block-270","segment.r017.book1.ch15.text.block-271","segment.r017.book1.ch15.text.block-272","segment.r017.book1.ch15.text.block-273","segment.r017.book1.ch15.text.block-274","segment.r017.book1.ch15.text.block-275","segment.r017.book1.ch15.text.block-276","segment.r017.book1.ch15.text.block-277","segment.r017.book1.ch15.text.block-278","segment.r017.book1.ch15.text.block-279","segment.r017.book1.ch15.text.block-280","segment.r017.book1.ch15.text.block-281","segment.r017.book1.ch15.text.block-282","segment.r017.book1.ch15.text.block-283","segment.r017.book1.ch15.text.block-284","segment.r017.book1.ch15.text.block-285","segment.r017.book1.ch15.text.block-286","segment.r017.book1.ch15.text.block-287","segment.r017.book1.ch15.text.block-288","segment.r017.book1.ch15.text.block-289","segment.r017.book1.ch15.text.block-290","segment.r017.book1.ch15.text.block-291","segment.r017.book1.ch15.text.block-292","segment.r017.book1.ch15.text.block-293","segment.r017.book1.ch15.text.block-294","segment.r017.book1.ch15.text.block-295","segment.r017.book1.ch15.text.block-296","segment.r017.book1.ch15.text.block-297","segment.r017.book1.ch15.text.block-298","segment.r017.book1.ch15.text.block-299","segment.r017.book1.ch15.text.block-300","segment.r017.book1.ch15.text.block-301","segment.r017.book1.ch15.text.block-302","segment.r017.book1.ch15.text.block-303","segment.r017.book1.ch15.text.block-304","segment.r017.book1.ch15.text.block-305","segment.r017.book1.ch15.text.block-306","segment.r017.book1.ch15.text.block-307","segment.r017.book1.ch15.text.block-308","segment.r017.book1.ch15.text.block-309","segment.r017.book1.ch15.text.block-310","segment.r017.book1.ch15.text.block-311","segment.r017.book1.ch15.text.block-312","segment.r017.book1.ch15.text.block-313","segment.r017.book1.ch15.text.block-314","segment.r017.book1.ch15.text.block-315","segment.r017.book1.ch15.text.block-316","segment.r017.book1.ch15.text.block-317","segment.r017.book1.ch15.text.block-318","segment.r017.book1.ch15.text.block-319","segment.r017.book1.ch15.text.block-320","segment.r017.book1.ch15.text.block-321","segment.r017.book1.ch15.text.block-322","segment.r017.book1.ch15.text.block-323","segment.r017.book1.ch15.text.block-324","segment.r017.book1.ch15.text.block-325","segment.r017.book1.ch15.text.block-326","segment.r017.book1.ch15.text.block-327","segment.r017.book1.ch15.text.block-328","segment.r017.book1.ch15.text.block-329","segment.r017.book1.ch15.text.block-330","segment.r017.book1.ch15.text.block-331","segment.r017.book1.ch15.text.block-332","segment.r017.book1.ch15.text.block-333","segment.r017.book1.ch15.text.block-334","segment.r017.book1.ch15.text.block-335","segment.r017.book1.ch15.text.block-336","segment.r017.book1.ch15.text.block-337","segment.r017.book1.ch15.text.block-338","segment.r017.book1.ch15.text.block-339","segment.r017.book1.ch15.text.block-340","segment.r017.book1.ch15.text.block-341","segment.r017.book1.ch15.text.block-342"],"native":{"concept_id":"concept.job-shop-scheduling","evidence":"Full-corpus id-ID terminology audit","id":"term.job-shop-scheduling.id","preferred":"penjadwalan job shop","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"job-shop scheduling","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch02.text.block-116"],"native":{"concept_id":"concept.knapsack-model","evidence":"Chapter 2 Knapsack Problem subsection","id":"term.knapsack.id","preferred":"masalah ransel","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"binary integer-programming model class","source_locale":"en","source_term":"knapsack problem","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["model ransel"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch14.attribution.block-001","segment.o018.lab.ch14.attribution.block-002","segment.o018.lab.ch14.attribution.block-003","segment.o018.lab.ch14.attribution.block-004","segment.o018.lab.ch14.attribution.block-005","segment.o018.lab.ch14.attribution.block-006","segment.o018.lab.ch14.attribution.block-007","segment.o018.lab.ch14.attribution.block-008","segment.o018.lab.ch14.attribution.block-009","segment.o018.lab.ch14.attribution.block-010","segment.o018.lab.ch14.attribution.block-011","segment.o018.lab.ch14.attribution.block-012","segment.o018.lab.ch14.attribution.block-013","segment.o018.lab.ch14.attribution.block-014","segment.o018.lab.ch14.attribution.block-015","segment.o018.lab.ch14.attribution.block-016","segment.o018.lab.ch14.readme.block-001","segment.o018.lab.ch14.readme.block-002","segment.o018.lab.ch14.readme.block-003","segment.o018.lab.ch14.readme.block-004","segment.o018.lab.ch14.readme.block-005","segment.o018.lab.ch14.readme.block-006","segment.o018.lab.ch14.readme.block-007","segment.o018.lab.ch14.readme.block-008","segment.o018.lab.ch14.readme.block-009","segment.o018.lab.ch14.readme.block-010","segment.r017.book1.ch14.text.block-001","segment.r017.book1.ch14.text.block-002","segment.r017.book1.ch14.text.block-003","segment.r017.book1.ch14.text.block-004","segment.r017.book1.ch14.text.block-005","segment.r017.book1.ch14.text.block-006","segment.r017.book1.ch14.text.block-007","segment.r017.book1.ch14.text.block-008","segment.r017.book1.ch14.text.block-009","segment.r017.book1.ch14.text.block-010","segment.r017.book1.ch14.text.block-011","segment.r017.book1.ch14.text.block-012","segment.r017.book1.ch14.text.block-013","segment.r017.book1.ch14.text.block-014","segment.r017.book1.ch14.text.block-015","segment.r017.book1.ch14.text.block-016","segment.r017.book1.ch14.text.block-017","segment.r017.book1.ch14.text.block-018","segment.r017.book1.ch14.text.block-019","segment.r017.book1.ch14.text.block-020","segment.r017.book1.ch14.text.block-021","segment.r017.book1.ch14.text.block-022","segment.r017.book1.ch14.text.block-023","segment.r017.book1.ch14.text.block-024","segment.r017.book1.ch14.text.block-025","segment.r017.book1.ch14.text.block-026","segment.r017.book1.ch14.text.block-027","segment.r017.book1.ch14.text.block-028","segment.r017.book1.ch14.text.block-029","segment.r017.book1.ch14.text.block-030","segment.r017.book1.ch14.text.block-031","segment.r017.book1.ch14.text.block-032","segment.r017.book1.ch14.text.block-033","segment.r017.book1.ch14.text.block-034","segment.r017.book1.ch14.text.block-035","segment.r017.book1.ch14.text.block-036","segment.r017.book1.ch14.text.block-037","segment.r017.book1.ch14.text.block-038","segment.r017.book1.ch14.text.block-039","segment.r017.book1.ch14.text.block-040","segment.r017.book1.ch14.text.block-041","segment.r017.book1.ch14.text.block-042","segment.r017.book1.ch14.text.block-043","segment.r017.book1.ch14.text.block-044","segment.r017.book1.ch14.text.block-045","segment.r017.book1.ch14.text.block-046","segment.r017.book1.ch14.text.block-047","segment.r017.book1.ch14.text.block-048","segment.r017.book1.ch14.text.block-049","segment.r017.book1.ch14.text.block-050","segment.r017.book1.ch14.text.block-051","segment.r017.book1.ch14.text.block-052","segment.r017.book1.ch14.text.block-053","segment.r017.book1.ch14.text.block-054","segment.r017.book1.ch14.text.block-055","segment.r017.book1.ch14.text.block-056","segment.r017.book1.ch14.text.block-057","segment.r017.book1.ch14.text.block-058","segment.r017.book1.ch14.text.block-059","segment.r017.book1.ch14.text.block-060","segment.r017.book1.ch14.text.block-061","segment.r017.book1.ch14.text.block-062","segment.r017.book1.ch14.text.block-063","segment.r017.book1.ch14.text.block-064","segment.r017.book1.ch14.text.block-065","segment.r017.book1.ch14.text.block-066","segment.r017.book1.ch14.text.block-067","segment.r017.book1.ch14.text.block-068","segment.r017.book1.ch14.text.block-069","segment.r017.book1.ch14.text.block-070","segment.r017.book1.ch14.text.block-071","segment.r017.book1.ch14.text.block-072","segment.r017.book1.ch14.text.block-073","segment.r017.book1.ch14.text.block-074","segment.r017.book1.ch14.text.block-075","segment.r017.book1.ch14.text.block-076","segment.r017.book1.ch14.text.block-077","segment.r017.book1.ch14.text.block-078","segment.r017.book1.ch14.text.block-079","segment.r017.book1.ch14.text.block-080","segment.r017.book1.ch14.text.block-081","segment.r017.book1.ch14.text.block-082","segment.r017.book1.ch14.text.block-083","segment.r017.book1.ch14.text.block-084","segment.r017.book1.ch14.text.block-085","segment.r017.book1.ch14.text.block-086","segment.r017.book1.ch14.text.block-087","segment.r017.book1.ch14.text.block-088","segment.r017.book1.ch14.text.block-089","segment.r017.book1.ch14.text.block-090","segment.r017.book1.ch14.text.block-091","segment.r017.book1.ch14.text.block-092","segment.r017.book1.ch14.text.block-093","segment.r017.book1.ch14.text.block-094","segment.r017.book1.ch14.text.block-095","segment.r017.book1.ch14.text.block-096","segment.r017.book1.ch14.text.block-097","segment.r017.book1.ch14.text.block-098","segment.r017.book1.ch14.text.block-099","segment.r017.book1.ch14.text.block-100","segment.r017.book1.ch14.text.block-101","segment.r017.book1.ch14.text.block-102","segment.r017.book1.ch14.text.block-103","segment.r017.book1.ch14.text.block-104","segment.r017.book1.ch14.text.block-105","segment.r017.book1.ch14.text.block-106","segment.r017.book1.ch14.text.block-107","segment.r017.book1.ch14.text.block-108","segment.r017.book1.ch14.text.block-109","segment.r017.book1.ch14.text.block-110","segment.r017.book1.ch14.text.block-111","segment.r017.book1.ch14.text.block-112","segment.r017.book1.ch14.text.block-113","segment.r017.book1.ch14.text.block-114","segment.r017.book1.ch14.text.block-115","segment.r017.book1.ch14.text.block-116","segment.r017.book1.ch14.text.block-117","segment.r017.book1.ch14.text.block-118","segment.r017.book1.ch14.text.block-119","segment.r017.book1.ch14.text.block-120","segment.r017.book1.ch14.text.block-121","segment.r017.book1.ch14.text.block-122","segment.r017.book1.ch14.text.block-123","segment.r017.book1.ch14.text.block-124","segment.r017.book1.ch14.text.block-125","segment.r017.book1.ch14.text.block-126","segment.r017.book1.ch14.text.block-127","segment.r017.book1.ch14.text.block-128","segment.r017.book1.ch14.text.block-129","segment.r017.book1.ch14.text.block-130","segment.r017.book1.ch14.text.block-131","segment.r017.book1.ch14.text.block-132","segment.r017.book1.ch14.text.block-133","segment.r017.book1.ch14.text.block-134","segment.r017.book1.ch14.text.block-135","segment.r017.book1.ch14.text.block-136","segment.r017.book1.ch14.text.block-137","segment.r017.book1.ch14.text.block-138","segment.r017.book1.ch14.text.block-139","segment.r017.book1.ch14.text.block-140","segment.r017.book1.ch14.text.block-141","segment.r017.book1.ch14.text.block-142","segment.r017.book1.ch14.text.block-143","segment.r017.book1.ch14.text.block-144","segment.r017.book1.ch14.text.block-145","segment.r017.book1.ch14.text.block-146","segment.r017.book1.ch14.text.block-147","segment.r017.book1.ch14.text.block-148","segment.r017.book1.ch14.text.block-149","segment.r017.book1.ch14.text.block-150","segment.r017.book1.ch14.text.block-151","segment.r017.book1.ch14.text.block-152","segment.r017.book1.ch14.text.block-153","segment.r017.book1.ch14.text.block-154","segment.r017.book1.ch14.text.block-155","segment.r017.book1.ch14.text.block-156","segment.r017.book1.ch14.text.block-157","segment.r017.book1.ch14.text.block-158","segment.r017.book1.ch14.text.block-159","segment.r017.book1.ch14.text.block-160","segment.r017.book1.ch14.text.block-161","segment.r017.book1.ch14.text.block-162","segment.r017.book1.ch14.text.block-163","segment.r017.book1.ch14.text.block-164","segment.r017.book1.ch14.text.block-165","segment.r017.book1.ch14.text.block-166","segment.r017.book1.ch14.text.block-167","segment.r017.book1.ch14.text.block-168","segment.r017.book1.ch14.text.block-169","segment.r017.book1.ch14.text.block-170","segment.r017.book1.ch14.text.block-171","segment.r017.book1.ch14.text.block-172","segment.r017.book1.ch14.text.block-173","segment.r017.book1.ch14.text.block-174","segment.r017.book1.ch14.text.block-175","segment.r017.book1.ch14.text.block-176","segment.r017.book1.ch14.text.block-177","segment.r017.book1.ch14.text.block-178","segment.r017.book1.ch14.text.block-179","segment.r017.book1.ch14.text.block-180","segment.r017.book1.ch14.text.block-181","segment.r017.book1.ch14.text.block-182","segment.r017.book1.ch14.text.block-183","segment.r017.book1.ch14.text.block-184","segment.r017.book1.ch14.text.block-185","segment.r017.book1.ch14.text.block-186","segment.r017.book1.ch14.text.block-187","segment.r017.book1.ch14.text.block-188","segment.r017.book1.ch14.text.block-189","segment.r017.book1.ch14.text.block-190","segment.r017.book1.ch14.text.block-191","segment.r017.book1.ch14.text.block-192","segment.r017.book1.ch14.text.block-193","segment.r017.book1.ch14.text.block-194","segment.r017.book1.ch14.text.block-195","segment.r017.book1.ch14.text.block-196","segment.r017.book1.ch14.text.block-197","segment.r017.book1.ch14.text.block-198","segment.r017.book1.ch14.text.block-199","segment.r017.book1.ch14.text.block-200","segment.r017.book1.ch14.text.block-201","segment.r017.book1.ch14.text.block-202","segment.r017.book1.ch14.text.block-203","segment.r017.book1.ch14.text.block-204","segment.r017.book1.ch14.text.block-205","segment.r017.book1.ch14.text.block-206","segment.r017.book1.ch14.text.block-207","segment.r017.book1.ch14.text.block-208","segment.r017.book1.ch14.text.block-209","segment.r017.book1.ch14.text.block-210","segment.r017.book1.ch14.text.block-211","segment.r017.book1.ch14.text.block-212","segment.r017.book1.ch14.text.block-213","segment.r017.book1.ch14.text.block-214","segment.r017.book1.ch14.text.block-215","segment.r017.book1.ch14.text.block-216","segment.r017.book1.ch14.text.block-217","segment.r017.book1.ch14.text.block-218","segment.r017.book1.ch14.text.block-219","segment.r017.book1.ch14.text.block-220","segment.r017.book1.ch14.text.block-221","segment.r017.book1.ch14.text.block-222","segment.r017.book1.ch14.text.block-223","segment.r017.book1.ch14.text.block-224","segment.r017.book1.ch14.text.block-225","segment.r017.book1.ch14.text.block-226","segment.r017.book1.ch14.text.block-227","segment.r017.book1.ch14.text.block-228","segment.r017.book1.ch14.text.block-229","segment.r017.book1.ch14.text.block-230","segment.r017.book1.ch14.text.block-231","segment.r017.book1.ch14.text.block-232","segment.r017.book1.ch14.text.block-233","segment.r017.book1.ch14.text.block-234","segment.r017.book1.ch14.text.block-235","segment.r017.book1.ch14.text.block-236","segment.r017.book1.ch14.text.block-237","segment.r017.book1.ch14.text.block-238","segment.r017.book1.ch14.text.block-239","segment.r017.book1.ch14.text.block-240","segment.r017.book1.ch14.text.block-241","segment.r017.book1.ch14.text.block-242","segment.r017.book1.ch14.text.block-243","segment.r017.book1.ch14.text.block-244","segment.r017.book1.ch14.text.block-245","segment.r017.book1.ch14.text.block-246","segment.r017.book1.ch14.text.block-247","segment.r017.book1.ch14.text.block-248","segment.r017.book1.ch14.text.block-249","segment.r017.book1.ch14.text.block-250","segment.r017.book1.ch14.text.block-251","segment.r017.book1.ch14.text.block-252","segment.r017.book1.ch14.text.block-253","segment.r017.book1.ch14.text.block-254","segment.r017.book1.ch14.text.block-255","segment.r017.book1.ch14.text.block-256","segment.r017.book1.ch14.text.block-257","segment.r017.book1.ch14.text.block-258","segment.r017.book1.ch14.text.block-259","segment.r017.book1.ch14.text.block-260","segment.r017.book1.ch14.text.block-261","segment.r017.book1.ch14.text.block-262","segment.r017.book1.ch14.text.block-263","segment.r017.book1.ch14.text.block-264","segment.r017.book1.ch14.text.block-265","segment.r017.book1.ch14.text.block-266","segment.r017.book1.ch14.text.block-267","segment.r017.book1.ch14.text.block-268","segment.r017.book1.ch14.text.block-269","segment.r017.book1.ch14.text.block-270","segment.r017.book1.ch14.text.block-271","segment.r017.book1.ch14.text.block-272","segment.r017.book1.ch14.text.block-273","segment.r017.book1.ch14.text.block-274","segment.r017.book1.ch14.text.block-275","segment.r017.book1.ch14.text.block-276","segment.r017.book1.ch14.text.block-277","segment.r017.book1.ch14.text.block-278","segment.r017.book1.ch14.text.block-279","segment.r017.book1.ch14.text.block-280","segment.r017.book1.ch14.text.block-281","segment.r017.book1.ch14.text.block-282","segment.r017.book1.ch14.text.block-283","segment.r017.book1.ch14.text.block-284","segment.r017.book1.ch14.text.block-285","segment.r017.book1.ch14.text.block-286","segment.r017.book1.ch14.text.block-287","segment.r017.book1.ch14.text.block-288","segment.r017.book1.ch14.text.block-289","segment.r017.book1.ch14.text.block-290","segment.r017.book1.ch14.text.block-291","segment.r017.book1.ch14.text.block-292","segment.r017.book1.ch14.text.block-293","segment.r017.book1.ch14.text.block-294","segment.r017.book1.ch14.text.block-295","segment.r017.book1.ch14.text.block-296","segment.r017.book1.ch14.text.block-297","segment.r017.book1.ch14.text.block-298","segment.r017.book1.ch14.text.block-299","segment.r017.book1.ch14.text.block-300","segment.r017.book1.ch14.text.block-301","segment.r017.book1.ch14.text.block-302","segment.r017.book1.ch14.text.block-303","segment.r017.book1.ch14.text.block-304","segment.r017.book1.ch14.text.block-305","segment.r017.book1.ch14.text.block-306","segment.r017.book1.ch14.text.block-307","segment.r017.book1.ch14.text.block-308","segment.r017.book1.ch14.text.block-309","segment.r017.book1.ch14.text.block-310","segment.r017.book1.ch14.text.block-311","segment.r017.book1.ch14.text.block-312","segment.r017.book1.ch14.text.block-313","segment.r017.book1.ch14.text.block-314","segment.r017.book1.ch14.text.block-315","segment.r017.book1.ch14.text.block-316","segment.r017.book1.ch14.text.block-317","segment.r017.book1.ch14.text.block-318","segment.r017.book1.ch14.text.block-319","segment.r017.book1.ch14.text.block-320","segment.r017.book1.ch14.text.block-321","segment.r017.book1.ch14.text.block-322","segment.r017.book1.ch14.text.block-323","segment.r017.book1.ch14.text.block-324","segment.r017.book1.ch14.text.block-325","segment.r017.book1.ch14.text.block-326","segment.r017.book1.ch14.text.block-327","segment.r017.book1.ch14.text.block-328","segment.r017.book1.ch14.text.block-329","segment.r017.book1.ch14.text.block-330","segment.r017.book1.ch14.text.block-331","segment.r017.book1.ch14.text.block-332","segment.r017.book1.ch14.text.block-333","segment.r017.book1.ch14.text.block-334","segment.r017.book1.ch14.text.block-335","segment.r017.book1.ch14.text.block-336","segment.r017.book1.ch14.text.block-337","segment.r017.book1.ch14.text.block-338","segment.r017.book1.ch14.text.block-339","segment.r017.book1.ch14.text.block-340","segment.r017.book1.ch14.text.block-341","segment.r017.book1.ch14.text.block-342","segment.r017.book1.ch14.text.block-343","segment.r017.book1.ch14.text.block-344","segment.r017.book1.ch14.text.block-345","segment.r017.book1.ch14.text.block-346","segment.r017.book1.ch14.text.block-347","segment.r017.book1.ch14.text.block-348","segment.r017.book1.ch14.text.block-349","segment.r017.book1.ch14.text.block-350","segment.r017.book1.ch14.text.block-351","segment.r017.book1.ch14.text.block-352","segment.r017.book1.ch14.text.block-353","segment.r017.book1.ch14.text.block-354","segment.r017.book1.ch14.text.block-355","segment.r017.book1.ch14.text.block-356","segment.r017.book1.ch14.text.block-357","segment.r017.book1.ch14.text.block-358","segment.r017.book1.ch14.text.block-359","segment.r017.book1.ch14.text.block-360","segment.r017.book1.ch14.text.block-361","segment.r017.book1.ch14.text.block-362","segment.r017.book1.ch14.text.block-363","segment.r017.book1.ch14.text.block-364","segment.r017.book1.ch14.text.block-365","segment.r017.book1.ch14.text.block-366","segment.r017.book1.ch14.text.block-367","segment.r017.book1.ch14.text.block-368","segment.r017.book1.ch14.text.block-369","segment.r017.book1.ch14.text.block-370","segment.r017.book1.ch14.text.block-371","segment.r017.book1.ch14.text.block-372","segment.r017.book1.ch14.text.block-373","segment.r017.book1.ch14.text.block-374","segment.r017.book1.ch14.text.block-375","segment.r017.book1.ch14.text.block-376","segment.r017.book1.ch14.text.block-377","segment.r017.book1.ch14.text.block-378","segment.r017.book1.ch14.text.block-379","segment.r017.book1.ch14.text.block-380","segment.r017.book1.ch14.text.block-381","segment.r017.book1.ch14.text.block-382","segment.r017.book1.ch14.text.block-383","segment.r017.book1.ch14.text.block-384","segment.r017.book1.ch14.text.block-385","segment.r017.book1.ch14.text.block-386","segment.r017.book1.ch14.text.block-387","segment.r017.book1.ch14.text.block-388","segment.r017.book1.ch14.text.block-389","segment.r017.book1.ch14.text.block-390","segment.r017.book1.ch14.text.block-391","segment.r017.book1.ch14.text.block-392","segment.r017.book1.ch14.text.block-393","segment.r017.book1.ch14.text.block-394","segment.r017.book1.ch14.text.block-395","segment.r017.book1.ch14.text.block-396","segment.r017.book1.ch14.text.block-397","segment.r017.book1.ch14.text.block-398","segment.r017.book1.ch14.text.block-399","segment.r017.book1.ch14.text.block-400","segment.r017.book1.ch14.text.block-401","segment.r017.book1.ch14.text.block-402","segment.r017.book1.ch14.text.block-403","segment.r017.book1.ch14.text.block-404","segment.r017.book1.ch14.text.block-405","segment.r017.book1.ch14.text.block-406","segment.r017.book1.ch14.text.block-407","segment.r017.book1.ch14.text.block-408","segment.r017.book1.ch14.text.block-409","segment.r017.book1.ch14.text.block-410","segment.r017.book1.ch14.text.block-411","segment.r017.book1.ch14.text.block-412","segment.r017.book1.ch14.text.block-413","segment.r017.book1.ch14.text.block-414","segment.r017.book1.ch14.text.block-415","segment.r017.book1.ch14.text.block-416","segment.r017.book1.ch14.text.block-417","segment.r017.book1.ch14.text.block-418","segment.r017.book1.ch14.text.block-419","segment.r017.book1.ch14.text.block-420","segment.r017.book1.ch14.text.block-421","segment.r017.book1.ch14.text.block-422","segment.r017.book1.ch14.text.block-423","segment.r017.book1.ch14.text.block-424","segment.r017.book1.ch14.text.block-425","segment.r017.book1.ch14.text.block-426","segment.r017.book1.ch14.text.block-427","segment.r017.book1.ch14.text.block-428"],"native":{"concept_id":"concept.kruskal-algorithm","evidence":"Full-corpus id-ID terminology audit","id":"term.kruskal-algorithm.id","preferred":"algoritme Kruskal","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"Kruskal algorithm","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.learning-outcomes","evidence":"first-boundary editorial terminology decision","id":"term.learning-outcomes.id","preferred":"capaian pembelajaran","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"pedagogy","source_locale":"en","source_term":"learning outcomes","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.pivot-operation","evidence":"Chapter 7 terminology decision","id":"term.leaving-variable.id","preferred":"variabel keluar","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"simplex pivot","source_locale":"en","source_term":"leaving variable","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.level-curve","evidence":"Chapter 5 terminology decision","id":"term.level-curve.id","preferred":"kurva aras","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear objective geometry","source_locale":"en","source_term":"level curve","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["garis aras"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch13.attribution.block-001","segment.o018.lab.ch13.attribution.block-002","segment.o018.lab.ch13.attribution.block-003","segment.o018.lab.ch13.attribution.block-004","segment.o018.lab.ch13.attribution.block-005","segment.o018.lab.ch13.attribution.block-006","segment.o018.lab.ch13.attribution.block-007","segment.o018.lab.ch13.attribution.block-008","segment.o018.lab.ch13.attribution.block-009","segment.o018.lab.ch13.attribution.block-010","segment.o018.lab.ch13.attribution.block-011","segment.o018.lab.ch13.attribution.block-012","segment.o018.lab.ch13.attribution.block-013","segment.o018.lab.ch13.attribution.block-014","segment.o018.lab.ch13.attribution.block-015","segment.o018.lab.ch13.attribution.block-016","segment.o018.lab.ch13.attribution.block-017","segment.o018.lab.ch13.attribution.block-018","segment.o018.lab.ch13.readme.block-001","segment.o018.lab.ch13.readme.block-002","segment.o018.lab.ch13.readme.block-003","segment.o018.lab.ch13.readme.block-004","segment.o018.lab.ch13.readme.block-005","segment.o018.lab.ch13.readme.block-006","segment.o018.lab.ch13.readme.block-007","segment.o018.lab.ch13.readme.block-008","segment.o018.lab.ch13.readme.block-009","segment.o018.lab.ch13.readme.block-010","segment.r017.book1.ch13.text.block-001","segment.r017.book1.ch13.text.block-002","segment.r017.book1.ch13.text.block-003","segment.r017.book1.ch13.text.block-004","segment.r017.book1.ch13.text.block-005","segment.r017.book1.ch13.text.block-006","segment.r017.book1.ch13.text.block-007","segment.r017.book1.ch13.text.block-008","segment.r017.book1.ch13.text.block-009","segment.r017.book1.ch13.text.block-010","segment.r017.book1.ch13.text.block-011","segment.r017.book1.ch13.text.block-012","segment.r017.book1.ch13.text.block-013","segment.r017.book1.ch13.text.block-014","segment.r017.book1.ch13.text.block-015","segment.r017.book1.ch13.text.block-016","segment.r017.book1.ch13.text.block-017","segment.r017.book1.ch13.text.block-018","segment.r017.book1.ch13.text.block-019","segment.r017.book1.ch13.text.block-020","segment.r017.book1.ch13.text.block-021","segment.r017.book1.ch13.text.block-022","segment.r017.book1.ch13.text.block-023","segment.r017.book1.ch13.text.block-024","segment.r017.book1.ch13.text.block-025","segment.r017.book1.ch13.text.block-026","segment.r017.book1.ch13.text.block-027","segment.r017.book1.ch13.text.block-028","segment.r017.book1.ch13.text.block-029","segment.r017.book1.ch13.text.block-030","segment.r017.book1.ch13.text.block-031","segment.r017.book1.ch13.text.block-032","segment.r017.book1.ch13.text.block-033","segment.r017.book1.ch13.text.block-034","segment.r017.book1.ch13.text.block-035","segment.r017.book1.ch13.text.block-036","segment.r017.book1.ch13.text.block-037","segment.r017.book1.ch13.text.block-038","segment.r017.book1.ch13.text.block-039","segment.r017.book1.ch13.text.block-040","segment.r017.book1.ch13.text.block-041","segment.r017.book1.ch13.text.block-042","segment.r017.book1.ch13.text.block-043","segment.r017.book1.ch13.text.block-044","segment.r017.book1.ch13.text.block-045","segment.r017.book1.ch13.text.block-046","segment.r017.book1.ch13.text.block-047","segment.r017.book1.ch13.text.block-048","segment.r017.book1.ch13.text.block-049","segment.r017.book1.ch13.text.block-050","segment.r017.book1.ch13.text.block-051","segment.r017.book1.ch13.text.block-052","segment.r017.book1.ch13.text.block-053","segment.r017.book1.ch13.text.block-054","segment.r017.book1.ch13.text.block-055","segment.r017.book1.ch13.text.block-056","segment.r017.book1.ch13.text.block-057","segment.r017.book1.ch13.text.block-058","segment.r017.book1.ch13.text.block-059","segment.r017.book1.ch13.text.block-060","segment.r017.book1.ch13.text.block-061","segment.r017.book1.ch13.text.block-062","segment.r017.book1.ch13.text.block-063","segment.r017.book1.ch13.text.block-064","segment.r017.book1.ch13.text.block-065","segment.r017.book1.ch13.text.block-066","segment.r017.book1.ch13.text.block-067","segment.r017.book1.ch13.text.block-068","segment.r017.book1.ch13.text.block-069","segment.r017.book1.ch13.text.block-070","segment.r017.book1.ch13.text.block-071","segment.r017.book1.ch13.text.block-072","segment.r017.book1.ch13.text.block-073","segment.r017.book1.ch13.text.block-074","segment.r017.book1.ch13.text.block-075","segment.r017.book1.ch13.text.block-076","segment.r017.book1.ch13.text.block-077","segment.r017.book1.ch13.text.block-078","segment.r017.book1.ch13.text.block-079","segment.r017.book1.ch13.text.block-080","segment.r017.book1.ch13.text.block-081","segment.r017.book1.ch13.text.block-082","segment.r017.book1.ch13.text.block-083","segment.r017.book1.ch13.text.block-084","segment.r017.book1.ch13.text.block-085","segment.r017.book1.ch13.text.block-086","segment.r017.book1.ch13.text.block-087","segment.r017.book1.ch13.text.block-088","segment.r017.book1.ch13.text.block-089","segment.r017.book1.ch13.text.block-090","segment.r017.book1.ch13.text.block-091","segment.r017.book1.ch13.text.block-092","segment.r017.book1.ch13.text.block-093","segment.r017.book1.ch13.text.block-094","segment.r017.book1.ch13.text.block-095","segment.r017.book1.ch13.text.block-096","segment.r017.book1.ch13.text.block-097","segment.r017.book1.ch13.text.block-098","segment.r017.book1.ch13.text.block-099","segment.r017.book1.ch13.text.block-100","segment.r017.book1.ch13.text.block-101","segment.r017.book1.ch13.text.block-102","segment.r017.book1.ch13.text.block-103","segment.r017.book1.ch13.text.block-104","segment.r017.book1.ch13.text.block-105","segment.r017.book1.ch13.text.block-106","segment.r017.book1.ch13.text.block-107","segment.r017.book1.ch13.text.block-108","segment.r017.book1.ch13.text.block-109","segment.r017.book1.ch13.text.block-110","segment.r017.book1.ch13.text.block-111","segment.r017.book1.ch13.text.block-112","segment.r017.book1.ch13.text.block-113","segment.r017.book1.ch13.text.block-114","segment.r017.book1.ch13.text.block-115","segment.r017.book1.ch13.text.block-116","segment.r017.book1.ch13.text.block-117","segment.r017.book1.ch13.text.block-118","segment.r017.book1.ch13.text.block-119","segment.r017.book1.ch13.text.block-120","segment.r017.book1.ch13.text.block-121","segment.r017.book1.ch13.text.block-122"],"native":{"concept_id":"concept.lexicographic-optimization","evidence":"Full-corpus id-ID terminology audit","id":"term.lexicographic-optimization.id","preferred":"optimisasi leksikografis","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"lexicographic optimization","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch06.text.block-005"],"native":{"concept_id":"concept.linear-combination","evidence":"Chapter 6 terminology decision","id":"term.linear-combination.id","preferred":"kombinasi linier","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear algebra and polyhedral theory","source_locale":"en","source_term":"linear combination","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch06.text.block-005","segment.r017.book1.ch06.text.block-032"],"native":{"concept_id":"concept.linear-independence","evidence":"Chapter 6 terminology decision","id":"term.linear-independence.id","preferred":"kebebasan linier","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear algebra","source_locale":"en","source_term":"linear independence","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["independensi linier"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.readme.block-001","segment.o018.lab.readme.block-002","segment.o018.lab.readme.block-003","segment.o018.lab.readme.block-004","segment.o018.lab.readme.block-005","segment.o018.lab.readme.block-006","segment.o018.lab.readme.block-007","segment.o018.lab.readme.block-008","segment.o018.lab.readme.block-009","segment.o018.lab.readme.block-010","segment.o018.lab.readme.block-011","segment.r017.book1.ch01.text.block-042","segment.r017.book1.ch01.text.block-043","segment.r017.book1.ch01.text.block-048","segment.r017.book1.ch01.text.block-049","segment.r017.book1.ch02.text.block-013","segment.r017.book1.ch02.text.block-031","segment.r017.book1.ch02.text.block-045","segment.r017.book1.ch02.text.block-075","segment.r017.book1.ch02.text.block-130","segment.r017.book1.ch03.text.block-068","segment.r017.book1.ch05.text.block-144","segment.r017.book1.ch06.text.block-141"],"native":{"concept_id":"concept.linear-programming","evidence":"first-boundary editorial decision; 2026-08-22 Indonesian field-usage QA validated the preferred form and added linier spelling variants for retrieval","id":"term.linear-programming.id","preferred":"pemrograman linear","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"model class; abbreviation LP retained","source_locale":"en","source_term":"linear programming","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["program linear","pemrograman linier","program linier"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.appendix.equations-lines.text.block-001","segment.r017.book1.appendix.equations-lines.text.block-002","segment.r017.book1.appendix.equations-lines.text.block-003","segment.r017.book1.appendix.equations-lines.text.block-004","segment.r017.book1.appendix.equations-lines.text.block-005","segment.r017.book1.appendix.equations-lines.text.block-006","segment.r017.book1.appendix.equations-lines.text.block-007","segment.r017.book1.appendix.equations-lines.text.block-008","segment.r017.book1.appendix.equations-lines.text.block-009","segment.r017.book1.appendix.equations-lines.text.block-010","segment.r017.book1.appendix.equations-lines.text.block-011","segment.r017.book1.appendix.equations-lines.text.block-012","segment.r017.book1.appendix.equations-lines.text.block-013","segment.r017.book1.appendix.equations-lines.text.block-014","segment.r017.book1.appendix.equations-lines.text.block-015","segment.r017.book1.appendix.equations-lines.text.block-016","segment.r017.book1.appendix.equations-lines.text.block-017","segment.r017.book1.appendix.equations-lines.text.block-018","segment.r017.book1.appendix.equations-lines.text.block-019","segment.r017.book1.appendix.equations-lines.text.block-020","segment.r017.book1.appendix.equations-lines.text.block-021","segment.r017.book1.appendix.equations-lines.text.block-022","segment.r017.book1.appendix.equations-lines.text.block-023","segment.r017.book1.appendix.equations-lines.text.block-024","segment.r017.book1.appendix.equations-lines.text.block-025","segment.r017.book1.appendix.equations-lines.text.block-026","segment.r017.book1.appendix.equations-lines.text.block-027","segment.r017.book1.appendix.equations-lines.text.block-028","segment.r017.book1.appendix.equations-lines.text.block-029","segment.r017.book1.appendix.equations-lines.text.block-030","segment.r017.book1.appendix.equations-lines.text.block-031","segment.r017.book1.appendix.equations-lines.text.block-032","segment.r017.book1.appendix.equations-lines.text.block-033","segment.r017.book1.appendix.equations-lines.text.block-034","segment.r017.book1.appendix.equations-lines.text.block-035","segment.r017.book1.appendix.equations-lines.text.block-036","segment.r017.book1.appendix.equations-lines.text.block-037","segment.r017.book1.appendix.equations-lines.text.block-038","segment.r017.book1.appendix.equations-lines.text.block-039","segment.r017.book1.appendix.equations-lines.text.block-040","segment.r017.book1.appendix.equations-lines.text.block-041","segment.r017.book1.appendix.equations-lines.text.block-042","segment.r017.book1.appendix.equations-lines.text.block-043","segment.r017.book1.appendix.equations-lines.text.block-044","segment.r017.book1.appendix.equations-lines.text.block-045","segment.r017.book1.appendix.equations-lines.text.block-046","segment.r017.book1.appendix.equations-lines.text.block-047","segment.r017.book1.appendix.equations-lines.text.block-048","segment.r017.book1.appendix.equations-lines.text.block-049","segment.r017.book1.appendix.equations-lines.text.block-050","segment.r017.book1.appendix.equations-lines.text.block-051","segment.r017.book1.appendix.equations-lines.text.block-052","segment.r017.book1.appendix.equations-lines.text.block-053","segment.r017.book1.appendix.equations-lines.text.block-054","segment.r017.book1.appendix.equations-lines.text.block-055","segment.r017.book1.appendix.equations-lines.text.block-056","segment.r017.book1.appendix.equations-lines.text.block-057","segment.r017.book1.appendix.equations-lines.text.block-058","segment.r017.book1.appendix.equations-lines.text.block-059","segment.r017.book1.appendix.equations-lines.text.block-060","segment.r017.book1.appendix.equations-lines.text.block-061","segment.r017.book1.appendix.equations-lines.text.block-062","segment.r017.book1.appendix.equations-lines.text.block-063","segment.r017.book1.appendix.equations-lines.text.block-064","segment.r017.book1.appendix.equations-lines.text.block-065","segment.r017.book1.appendix.equations-lines.text.block-066","segment.r017.book1.appendix.equations-lines.text.block-067","segment.r017.book1.appendix.equations-lines.text.block-068","segment.r017.book1.appendix.equations-lines.text.block-069","segment.r017.book1.appendix.equations-lines.text.block-070","segment.r017.book1.appendix.equations-lines.text.block-071","segment.r017.book1.appendix.equations-lines.text.block-072","segment.r017.book1.appendix.equations-lines.text.block-073","segment.r017.book1.appendix.equations-lines.text.block-074","segment.r017.book1.appendix.equations-lines.text.block-075","segment.r017.book1.appendix.equations-lines.text.block-076","segment.r017.book1.appendix.equations-lines.text.block-077","segment.r017.book1.appendix.equations-lines.text.block-078","segment.r017.book1.appendix.equations-lines.text.block-079","segment.r017.book1.appendix.equations-lines.text.block-080","segment.r017.book1.appendix.equations-lines.text.block-081","segment.r017.book1.appendix.equations-lines.text.block-082","segment.r017.book1.appendix.equations-lines.text.block-083","segment.r017.book1.appendix.equations-lines.text.block-084","segment.r017.book1.appendix.equations-lines.text.block-085","segment.r017.book1.appendix.equations-lines.text.block-086","segment.r017.book1.appendix.equations-lines.text.block-087","segment.r017.book1.appendix.equations-lines.text.block-088","segment.r017.book1.appendix.equations-lines.text.block-089","segment.r017.book1.appendix.equations-lines.text.block-090","segment.r017.book1.appendix.equations-lines.text.block-091","segment.r017.book1.appendix.equations-lines.text.block-092","segment.r017.book1.appendix.equations-lines.text.block-093","segment.r017.book1.appendix.equations-lines.text.block-094","segment.r017.book1.appendix.equations-lines.text.block-095","segment.r017.book1.appendix.equations-lines.text.block-096","segment.r017.book1.appendix.equations-lines.text.block-097","segment.r017.book1.appendix.equations-lines.text.block-098","segment.r017.book1.appendix.equations-lines.text.block-099","segment.r017.book1.appendix.equations-lines.text.block-100","segment.r017.book1.appendix.equations-lines.text.block-101","segment.r017.book1.appendix.equations-lines.text.block-102","segment.r017.book1.appendix.equations-lines.text.block-103","segment.r017.book1.appendix.equations-lines.text.block-104","segment.r017.book1.appendix.equations-lines.text.block-105","segment.r017.book1.appendix.equations-lines.text.block-106","segment.r017.book1.appendix.equations-lines.text.block-107","segment.r017.book1.appendix.equations-lines.text.block-108","segment.r017.book1.appendix.equations-lines.text.block-109","segment.r017.book1.appendix.equations-lines.text.block-110","segment.r017.book1.appendix.equations-lines.text.block-111","segment.r017.book1.appendix.equations-lines.text.block-112","segment.r017.book1.appendix.equations-lines.text.block-113","segment.r017.book1.appendix.equations-lines.text.block-114","segment.r017.book1.appendix.equations-lines.text.block-115","segment.r017.book1.appendix.equations-lines.text.block-116","segment.r017.book1.appendix.equations-lines.text.block-117","segment.r017.book1.appendix.equations-lines.text.block-118","segment.r017.book1.appendix.equations-lines.text.block-119","segment.r017.book1.appendix.equations-lines.text.block-120","segment.r017.book1.appendix.equations-lines.text.block-121","segment.r017.book1.appendix.equations-lines.text.block-122","segment.r017.book1.appendix.equations-lines.text.block-123","segment.r017.book1.appendix.equations-lines.text.block-124","segment.r017.book1.appendix.equations-lines.text.block-125","segment.r017.book1.appendix.equations-lines.text.block-126","segment.r017.book1.appendix.equations-lines.text.block-127","segment.r017.book1.appendix.linear-systems.algebraic.block-001","segment.r017.book1.appendix.linear-systems.algebraic.block-002","segment.r017.book1.appendix.linear-systems.algebraic.block-003","segment.r017.book1.appendix.linear-systems.algebraic.block-004","segment.r017.book1.appendix.linear-systems.algebraic.block-005","segment.r017.book1.appendix.linear-systems.algebraic.block-006","segment.r017.book1.appendix.linear-systems.algebraic.block-007","segment.r017.book1.appendix.linear-systems.algebraic.block-008","segment.r017.book1.appendix.linear-systems.algebraic.block-009","segment.r017.book1.appendix.linear-systems.algebraic.block-010","segment.r017.book1.appendix.linear-systems.algebraic.block-011","segment.r017.book1.appendix.linear-systems.algebraic.block-012","segment.r017.book1.appendix.linear-systems.algebraic.block-013","segment.r017.book1.appendix.linear-systems.algebraic.block-014","segment.r017.book1.appendix.linear-systems.algebraic.block-015","segment.r017.book1.appendix.linear-systems.algebraic.block-016","segment.r017.book1.appendix.linear-systems.algebraic.block-017","segment.r017.book1.appendix.linear-systems.controller.block-001","segment.r017.book1.appendix.linear-systems.controller.block-002","segment.r017.book1.appendix.linear-systems.geometry.block-001","segment.r017.book1.appendix.linear-systems.geometry.block-002","segment.r017.book1.appendix.linear-systems.geometry.block-003","segment.r017.book1.appendix.linear-systems.geometry.block-004","segment.r017.book1.appendix.linear-systems.geometry.block-005","segment.r017.book1.appendix.linear-systems.geometry.block-006","segment.r017.book1.appendix.linear-systems.geometry.block-007","segment.r017.book1.appendix.linear-systems.geometry.block-008","segment.r017.book1.appendix.linear-systems.geometry.block-009","segment.r017.book1.appendix.linear-systems.geometry.block-010","segment.r017.book1.appendix.linear-systems.geometry.block-011","segment.r017.book1.appendix.linear-systems.geometry.block-012","segment.r017.book1.appendix.linear-systems.geometry.block-013","segment.r017.book1.appendix.linear-systems.geometry.block-014","segment.r017.book1.appendix.linear-systems.geometry.block-015","segment.r017.book1.appendix.linear-systems.geometry.block-016","segment.r017.book1.appendix.linear-systems.geometry.block-017","segment.r017.book1.appendix.linear-systems.geometry.block-018","segment.r017.book1.appendix.linear-systems.geometry.block-019","segment.r017.book1.appendix.linear-systems.geometry.block-020","segment.r017.book1.appendix.linear-systems.geometry.block-021","segment.r017.book1.appendix.linear-systems.geometry.block-022","segment.r017.book1.appendix.linear-systems.geometry.block-023","segment.r017.book1.appendix.linear-systems.geometry.block-024","segment.r017.book1.appendix.linear-systems.geometry.block-025","segment.r017.book1.appendix.linear-systems.geometry.block-026","segment.r017.book1.appendix.linear-systems.geometry.block-027","segment.r017.book1.appendix.linear-systems.geometry.block-028","segment.r017.book1.appendix.linear-systems.geometry.block-029","segment.r017.book1.appendix.linear-systems.geometry.block-030","segment.r017.book1.appendix.linear-systems.geometry.block-031","segment.r017.book1.appendix.linear-systems.geometry.block-032","segment.r017.book1.appendix.linear-systems.geometry.block-033","segment.r017.book1.appendix.linear-systems.rank.block-001","segment.r017.book1.appendix.linear-systems.rank.block-002","segment.r017.book1.appendix.linear-systems.rank.block-003","segment.r017.book1.appendix.linear-systems.rank.block-004","segment.r017.book1.appendix.linear-systems.rank.block-005","segment.r017.book1.appendix.linear-systems.rank.block-006","segment.r017.book1.appendix.linear-systems.rank.block-007","segment.r017.book1.appendix.linear-systems.rank.block-008","segment.r017.book1.appendix.linear-systems.rank.block-009","segment.r017.book1.appendix.linear-systems.rank.block-010","segment.r017.book1.appendix.linear-systems.rank.block-011","segment.r017.book1.appendix.linear-systems.rank.block-012","segment.r017.book1.appendix.linear-systems.rank.block-013","segment.r017.book1.appendix.linear-systems.rank.block-014","segment.r017.book1.appendix.linear-systems.rank.block-015","segment.r017.book1.appendix.linear-systems.rank.block-016","segment.r017.book1.appendix.linear-systems.rank.block-017","segment.r017.book1.appendix.linear-systems.rank.block-018","segment.r017.book1.appendix.linear-systems.rank.block-019","segment.r017.book1.appendix.linear-systems.rank.block-020","segment.r017.book1.appendix.linear-systems.rank.block-021","segment.r017.book1.appendix.linear-systems.rank.block-022","segment.r017.book1.appendix.linear-systems.rank.block-023","segment.r017.book1.appendix.linear-systems.rank.block-024","segment.r017.book1.appendix.linear-systems.rank.block-025","segment.r017.book1.appendix.linear-systems.rank.block-026","segment.r017.book1.appendix.linear-systems.rank.block-027","segment.r017.book1.appendix.linear-systems.rank.block-028","segment.r017.book1.appendix.linear-systems.rank.block-029","segment.r017.book1.appendix.linear-systems.rank.block-030","segment.r017.book1.appendix.linear-systems.rank.block-031","segment.r017.book1.appendix.linear-systems.rank.block-032","segment.r017.book1.appendix.linear-systems.rank.block-033","segment.r017.book1.appendix.linear-systems.rank.block-034"],"native":{"concept_id":"concept.linear-system","evidence":"Full-corpus id-ID terminology audit","id":"term.linear-system.id","preferred":"sistem persamaan linear","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"system of linear equations","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch15.attribution.block-001","segment.o018.lab.ch15.attribution.block-002","segment.o018.lab.ch15.attribution.block-003","segment.o018.lab.ch15.attribution.block-004","segment.o018.lab.ch15.attribution.block-005","segment.o018.lab.ch15.attribution.block-006","segment.o018.lab.ch15.attribution.block-007","segment.o018.lab.ch15.attribution.block-008","segment.o018.lab.ch15.attribution.block-009","segment.o018.lab.ch15.attribution.block-010","segment.o018.lab.ch15.attribution.block-011","segment.o018.lab.ch15.attribution.block-012","segment.o018.lab.ch15.attribution.block-013","segment.o018.lab.ch15.attribution.block-014","segment.o018.lab.ch15.attribution.block-015","segment.o018.lab.ch15.readme.block-001","segment.o018.lab.ch15.readme.block-002","segment.o018.lab.ch15.readme.block-003","segment.o018.lab.ch15.readme.block-004","segment.o018.lab.ch15.readme.block-005","segment.o018.lab.ch15.readme.block-006","segment.o018.lab.ch15.readme.block-007","segment.o018.lab.ch15.readme.block-008","segment.o018.lab.ch15.readme.block-009","segment.r017.book1.ch15.text.block-001","segment.r017.book1.ch15.text.block-002","segment.r017.book1.ch15.text.block-003","segment.r017.book1.ch15.text.block-004","segment.r017.book1.ch15.text.block-005","segment.r017.book1.ch15.text.block-006","segment.r017.book1.ch15.text.block-007","segment.r017.book1.ch15.text.block-008","segment.r017.book1.ch15.text.block-009","segment.r017.book1.ch15.text.block-010","segment.r017.book1.ch15.text.block-011","segment.r017.book1.ch15.text.block-012","segment.r017.book1.ch15.text.block-013","segment.r017.book1.ch15.text.block-014","segment.r017.book1.ch15.text.block-015","segment.r017.book1.ch15.text.block-016","segment.r017.book1.ch15.text.block-017","segment.r017.book1.ch15.text.block-018","segment.r017.book1.ch15.text.block-019","segment.r017.book1.ch15.text.block-020","segment.r017.book1.ch15.text.block-021","segment.r017.book1.ch15.text.block-022","segment.r017.book1.ch15.text.block-023","segment.r017.book1.ch15.text.block-024","segment.r017.book1.ch15.text.block-025","segment.r017.book1.ch15.text.block-026","segment.r017.book1.ch15.text.block-027","segment.r017.book1.ch15.text.block-028","segment.r017.book1.ch15.text.block-029","segment.r017.book1.ch15.text.block-030","segment.r017.book1.ch15.text.block-031","segment.r017.book1.ch15.text.block-032","segment.r017.book1.ch15.text.block-033","segment.r017.book1.ch15.text.block-034","segment.r017.book1.ch15.text.block-035","segment.r017.book1.ch15.text.block-036","segment.r017.book1.ch15.text.block-037","segment.r017.book1.ch15.text.block-038","segment.r017.book1.ch15.text.block-039","segment.r017.book1.ch15.text.block-040","segment.r017.book1.ch15.text.block-041","segment.r017.book1.ch15.text.block-042","segment.r017.book1.ch15.text.block-043","segment.r017.book1.ch15.text.block-044","segment.r017.book1.ch15.text.block-045","segment.r017.book1.ch15.text.block-046","segment.r017.book1.ch15.text.block-047","segment.r017.book1.ch15.text.block-048","segment.r017.book1.ch15.text.block-049","segment.r017.book1.ch15.text.block-050","segment.r017.book1.ch15.text.block-051","segment.r017.book1.ch15.text.block-052","segment.r017.book1.ch15.text.block-053","segment.r017.book1.ch15.text.block-054","segment.r017.book1.ch15.text.block-055","segment.r017.book1.ch15.text.block-056","segment.r017.book1.ch15.text.block-057","segment.r017.book1.ch15.text.block-058","segment.r017.book1.ch15.text.block-059","segment.r017.book1.ch15.text.block-060","segment.r017.book1.ch15.text.block-061","segment.r017.book1.ch15.text.block-062","segment.r017.book1.ch15.text.block-063","segment.r017.book1.ch15.text.block-064","segment.r017.book1.ch15.text.block-065","segment.r017.book1.ch15.text.block-066","segment.r017.book1.ch15.text.block-067","segment.r017.book1.ch15.text.block-068","segment.r017.book1.ch15.text.block-069","segment.r017.book1.ch15.text.block-070","segment.r017.book1.ch15.text.block-071","segment.r017.book1.ch15.text.block-072","segment.r017.book1.ch15.text.block-073","segment.r017.book1.ch15.text.block-074","segment.r017.book1.ch15.text.block-075","segment.r017.book1.ch15.text.block-076","segment.r017.book1.ch15.text.block-077","segment.r017.book1.ch15.text.block-078","segment.r017.book1.ch15.text.block-079","segment.r017.book1.ch15.text.block-080","segment.r017.book1.ch15.text.block-081","segment.r017.book1.ch15.text.block-082","segment.r017.book1.ch15.text.block-083","segment.r017.book1.ch15.text.block-084","segment.r017.book1.ch15.text.block-085","segment.r017.book1.ch15.text.block-086","segment.r017.book1.ch15.text.block-087","segment.r017.book1.ch15.text.block-088","segment.r017.book1.ch15.text.block-089","segment.r017.book1.ch15.text.block-090","segment.r017.book1.ch15.text.block-091","segment.r017.book1.ch15.text.block-092","segment.r017.book1.ch15.text.block-093","segment.r017.book1.ch15.text.block-094","segment.r017.book1.ch15.text.block-095","segment.r017.book1.ch15.text.block-096","segment.r017.book1.ch15.text.block-097","segment.r017.book1.ch15.text.block-098","segment.r017.book1.ch15.text.block-099","segment.r017.book1.ch15.text.block-100","segment.r017.book1.ch15.text.block-101","segment.r017.book1.ch15.text.block-102","segment.r017.book1.ch15.text.block-103","segment.r017.book1.ch15.text.block-104","segment.r017.book1.ch15.text.block-105","segment.r017.book1.ch15.text.block-106","segment.r017.book1.ch15.text.block-107","segment.r017.book1.ch15.text.block-108","segment.r017.book1.ch15.text.block-109","segment.r017.book1.ch15.text.block-110","segment.r017.book1.ch15.text.block-111","segment.r017.book1.ch15.text.block-112","segment.r017.book1.ch15.text.block-113","segment.r017.book1.ch15.text.block-114","segment.r017.book1.ch15.text.block-115","segment.r017.book1.ch15.text.block-116","segment.r017.book1.ch15.text.block-117","segment.r017.book1.ch15.text.block-118","segment.r017.book1.ch15.text.block-119","segment.r017.book1.ch15.text.block-120","segment.r017.book1.ch15.text.block-121","segment.r017.book1.ch15.text.block-122","segment.r017.book1.ch15.text.block-123","segment.r017.book1.ch15.text.block-124","segment.r017.book1.ch15.text.block-125","segment.r017.book1.ch15.text.block-126","segment.r017.book1.ch15.text.block-127","segment.r017.book1.ch15.text.block-128","segment.r017.book1.ch15.text.block-129","segment.r017.book1.ch15.text.block-130","segment.r017.book1.ch15.text.block-131","segment.r017.book1.ch15.text.block-132","segment.r017.book1.ch15.text.block-133","segment.r017.book1.ch15.text.block-134","segment.r017.book1.ch15.text.block-135","segment.r017.book1.ch15.text.block-136","segment.r017.book1.ch15.text.block-137","segment.r017.book1.ch15.text.block-138","segment.r017.book1.ch15.text.block-139","segment.r017.book1.ch15.text.block-140","segment.r017.book1.ch15.text.block-141","segment.r017.book1.ch15.text.block-142","segment.r017.book1.ch15.text.block-143","segment.r017.book1.ch15.text.block-144","segment.r017.book1.ch15.text.block-145","segment.r017.book1.ch15.text.block-146","segment.r017.book1.ch15.text.block-147","segment.r017.book1.ch15.text.block-148","segment.r017.book1.ch15.text.block-149","segment.r017.book1.ch15.text.block-150","segment.r017.book1.ch15.text.block-151","segment.r017.book1.ch15.text.block-152","segment.r017.book1.ch15.text.block-153","segment.r017.book1.ch15.text.block-154","segment.r017.book1.ch15.text.block-155","segment.r017.book1.ch15.text.block-156","segment.r017.book1.ch15.text.block-157","segment.r017.book1.ch15.text.block-158","segment.r017.book1.ch15.text.block-159","segment.r017.book1.ch15.text.block-160","segment.r017.book1.ch15.text.block-161","segment.r017.book1.ch15.text.block-162","segment.r017.book1.ch15.text.block-163","segment.r017.book1.ch15.text.block-164","segment.r017.book1.ch15.text.block-165","segment.r017.book1.ch15.text.block-166","segment.r017.book1.ch15.text.block-167","segment.r017.book1.ch15.text.block-168","segment.r017.book1.ch15.text.block-169","segment.r017.book1.ch15.text.block-170","segment.r017.book1.ch15.text.block-171","segment.r017.book1.ch15.text.block-172","segment.r017.book1.ch15.text.block-173","segment.r017.book1.ch15.text.block-174","segment.r017.book1.ch15.text.block-175","segment.r017.book1.ch15.text.block-176","segment.r017.book1.ch15.text.block-177","segment.r017.book1.ch15.text.block-178","segment.r017.book1.ch15.text.block-179","segment.r017.book1.ch15.text.block-180","segment.r017.book1.ch15.text.block-181","segment.r017.book1.ch15.text.block-182","segment.r017.book1.ch15.text.block-183","segment.r017.book1.ch15.text.block-184","segment.r017.book1.ch15.text.block-185","segment.r017.book1.ch15.text.block-186","segment.r017.book1.ch15.text.block-187","segment.r017.book1.ch15.text.block-188","segment.r017.book1.ch15.text.block-189","segment.r017.book1.ch15.text.block-190","segment.r017.book1.ch15.text.block-191","segment.r017.book1.ch15.text.block-192","segment.r017.book1.ch15.text.block-193","segment.r017.book1.ch15.text.block-194","segment.r017.book1.ch15.text.block-195","segment.r017.book1.ch15.text.block-196","segment.r017.book1.ch15.text.block-197","segment.r017.book1.ch15.text.block-198","segment.r017.book1.ch15.text.block-199","segment.r017.book1.ch15.text.block-200","segment.r017.book1.ch15.text.block-201","segment.r017.book1.ch15.text.block-202","segment.r017.book1.ch15.text.block-203","segment.r017.book1.ch15.text.block-204","segment.r017.book1.ch15.text.block-205","segment.r017.book1.ch15.text.block-206","segment.r017.book1.ch15.text.block-207","segment.r017.book1.ch15.text.block-208","segment.r017.book1.ch15.text.block-209","segment.r017.book1.ch15.text.block-210","segment.r017.book1.ch15.text.block-211","segment.r017.book1.ch15.text.block-212","segment.r017.book1.ch15.text.block-213","segment.r017.book1.ch15.text.block-214","segment.r017.book1.ch15.text.block-215","segment.r017.book1.ch15.text.block-216","segment.r017.book1.ch15.text.block-217","segment.r017.book1.ch15.text.block-218","segment.r017.book1.ch15.text.block-219","segment.r017.book1.ch15.text.block-220","segment.r017.book1.ch15.text.block-221","segment.r017.book1.ch15.text.block-222","segment.r017.book1.ch15.text.block-223","segment.r017.book1.ch15.text.block-224","segment.r017.book1.ch15.text.block-225","segment.r017.book1.ch15.text.block-226","segment.r017.book1.ch15.text.block-227","segment.r017.book1.ch15.text.block-228","segment.r017.book1.ch15.text.block-229","segment.r017.book1.ch15.text.block-230","segment.r017.book1.ch15.text.block-231","segment.r017.book1.ch15.text.block-232","segment.r017.book1.ch15.text.block-233","segment.r017.book1.ch15.text.block-234","segment.r017.book1.ch15.text.block-235","segment.r017.book1.ch15.text.block-236","segment.r017.book1.ch15.text.block-237","segment.r017.book1.ch15.text.block-238","segment.r017.book1.ch15.text.block-239","segment.r017.book1.ch15.text.block-240","segment.r017.book1.ch15.text.block-241","segment.r017.book1.ch15.text.block-242","segment.r017.book1.ch15.text.block-243","segment.r017.book1.ch15.text.block-244","segment.r017.book1.ch15.text.block-245","segment.r017.book1.ch15.text.block-246","segment.r017.book1.ch15.text.block-247","segment.r017.book1.ch15.text.block-248","segment.r017.book1.ch15.text.block-249","segment.r017.book1.ch15.text.block-250","segment.r017.book1.ch15.text.block-251","segment.r017.book1.ch15.text.block-252","segment.r017.book1.ch15.text.block-253","segment.r017.book1.ch15.text.block-254","segment.r017.book1.ch15.text.block-255","segment.r017.book1.ch15.text.block-256","segment.r017.book1.ch15.text.block-257","segment.r017.book1.ch15.text.block-258","segment.r017.book1.ch15.text.block-259","segment.r017.book1.ch15.text.block-260","segment.r017.book1.ch15.text.block-261","segment.r017.book1.ch15.text.block-262","segment.r017.book1.ch15.text.block-263","segment.r017.book1.ch15.text.block-264","segment.r017.book1.ch15.text.block-265","segment.r017.book1.ch15.text.block-266","segment.r017.book1.ch15.text.block-267","segment.r017.book1.ch15.text.block-268","segment.r017.book1.ch15.text.block-269","segment.r017.book1.ch15.text.block-270","segment.r017.book1.ch15.text.block-271","segment.r017.book1.ch15.text.block-272","segment.r017.book1.ch15.text.block-273","segment.r017.book1.ch15.text.block-274","segment.r017.book1.ch15.text.block-275","segment.r017.book1.ch15.text.block-276","segment.r017.book1.ch15.text.block-277","segment.r017.book1.ch15.text.block-278","segment.r017.book1.ch15.text.block-279","segment.r017.book1.ch15.text.block-280","segment.r017.book1.ch15.text.block-281","segment.r017.book1.ch15.text.block-282","segment.r017.book1.ch15.text.block-283","segment.r017.book1.ch15.text.block-284","segment.r017.book1.ch15.text.block-285","segment.r017.book1.ch15.text.block-286","segment.r017.book1.ch15.text.block-287","segment.r017.book1.ch15.text.block-288","segment.r017.book1.ch15.text.block-289","segment.r017.book1.ch15.text.block-290","segment.r017.book1.ch15.text.block-291","segment.r017.book1.ch15.text.block-292","segment.r017.book1.ch15.text.block-293","segment.r017.book1.ch15.text.block-294","segment.r017.book1.ch15.text.block-295","segment.r017.book1.ch15.text.block-296","segment.r017.book1.ch15.text.block-297","segment.r017.book1.ch15.text.block-298","segment.r017.book1.ch15.text.block-299","segment.r017.book1.ch15.text.block-300","segment.r017.book1.ch15.text.block-301","segment.r017.book1.ch15.text.block-302","segment.r017.book1.ch15.text.block-303","segment.r017.book1.ch15.text.block-304","segment.r017.book1.ch15.text.block-305","segment.r017.book1.ch15.text.block-306","segment.r017.book1.ch15.text.block-307","segment.r017.book1.ch15.text.block-308","segment.r017.book1.ch15.text.block-309","segment.r017.book1.ch15.text.block-310","segment.r017.book1.ch15.text.block-311","segment.r017.book1.ch15.text.block-312","segment.r017.book1.ch15.text.block-313","segment.r017.book1.ch15.text.block-314","segment.r017.book1.ch15.text.block-315","segment.r017.book1.ch15.text.block-316","segment.r017.book1.ch15.text.block-317","segment.r017.book1.ch15.text.block-318","segment.r017.book1.ch15.text.block-319","segment.r017.book1.ch15.text.block-320","segment.r017.book1.ch15.text.block-321","segment.r017.book1.ch15.text.block-322","segment.r017.book1.ch15.text.block-323","segment.r017.book1.ch15.text.block-324","segment.r017.book1.ch15.text.block-325","segment.r017.book1.ch15.text.block-326","segment.r017.book1.ch15.text.block-327","segment.r017.book1.ch15.text.block-328","segment.r017.book1.ch15.text.block-329","segment.r017.book1.ch15.text.block-330","segment.r017.book1.ch15.text.block-331","segment.r017.book1.ch15.text.block-332","segment.r017.book1.ch15.text.block-333","segment.r017.book1.ch15.text.block-334","segment.r017.book1.ch15.text.block-335","segment.r017.book1.ch15.text.block-336","segment.r017.book1.ch15.text.block-337","segment.r017.book1.ch15.text.block-338","segment.r017.book1.ch15.text.block-339","segment.r017.book1.ch15.text.block-340","segment.r017.book1.ch15.text.block-341","segment.r017.book1.ch15.text.block-342"],"native":{"concept_id":"concept.logical-binary-constraints","evidence":"Full-corpus id-ID terminology audit","id":"term.logical-binary-constraints.id","preferred":"kendala logis biner","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"logical binary constraints","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.loss-function","evidence":"first-boundary editorial terminology decision","id":"term.loss-function.id","preferred":"fungsi kerugian","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"machine learning","source_locale":"en","source_term":"loss function","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.readme.block-001","segment.o018.lab.readme.block-002","segment.o018.lab.readme.block-003","segment.o018.lab.readme.block-004","segment.o018.lab.readme.block-005","segment.o018.lab.readme.block-006","segment.o018.lab.readme.block-007","segment.o018.lab.readme.block-008","segment.o018.lab.readme.block-009","segment.o018.lab.readme.block-010","segment.o018.lab.readme.block-011","segment.r017.book1.ch01.text.block-042","segment.r017.book1.ch01.text.block-043","segment.r017.book1.ch01.text.block-048","segment.r017.book1.ch01.text.block-049","segment.r017.book1.ch02.text.block-013","segment.r017.book1.ch02.text.block-031","segment.r017.book1.ch02.text.block-045","segment.r017.book1.ch02.text.block-075","segment.r017.book1.ch02.text.block-130","segment.r017.book1.ch03.text.block-068","segment.r017.book1.ch05.text.block-144","segment.r017.book1.ch06.text.block-141"],"native":{"concept_id":"concept.linear-programming","evidence":"Chapter 2 staffing and bakery models","id":"term.lp-relaxation.id","preferred":"relaksasi LP","recorded_at":"2026-08-23T00:00:00+02:00","register":"technical","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"continuous relaxation of an integer model","source_locale":"en","source_term":"LP relaxation","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["relaksasi pemrograman linear"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-059","segment.r017.book1.ch01.text.block-071","segment.r017.book1.ch01.text.block-074"],"native":{"concept_id":"concept.machine-learning-optimization","evidence":"Final id-ID corpus terminology audit","id":"term.machine-learning-optimization.id","preferred":"optimisasi dalam pembelajaran mesin","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"optimization in machine learning","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-030","segment.r017.book1.ch01.text.block-032"],"native":{"concept_id":"concept.mathematical-programming","evidence":"first-boundary editorial terminology decision","id":"term.mathematical-programming.id","preferred":"pemrograman matematis","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"discipline and model class","source_locale":"en","source_term":"mathematical programming","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["optimisasi matematis"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.appendix.matrices.addition.block-001","segment.r017.book1.appendix.matrices.addition.block-002","segment.r017.book1.appendix.matrices.addition.block-003","segment.r017.book1.appendix.matrices.addition.block-004","segment.r017.book1.appendix.matrices.addition.block-005","segment.r017.book1.appendix.matrices.addition.block-006","segment.r017.book1.appendix.matrices.addition.block-007","segment.r017.book1.appendix.matrices.addition.block-008","segment.r017.book1.appendix.matrices.addition.block-009","segment.r017.book1.appendix.matrices.addition.block-010","segment.r017.book1.appendix.matrices.addition.block-011","segment.r017.book1.appendix.matrices.addition.block-012","segment.r017.book1.appendix.matrices.addition.block-013","segment.r017.book1.appendix.matrices.addition.block-014","segment.r017.book1.appendix.matrices.addition.block-015","segment.r017.book1.appendix.matrices.addition.block-016","segment.r017.book1.appendix.matrices.addition.block-017","segment.r017.book1.appendix.matrices.arithmetic.block-001","segment.r017.book1.appendix.matrices.arithmetic.block-002","segment.r017.book1.appendix.matrices.arithmetic.block-003","segment.r017.book1.appendix.matrices.arithmetic.block-004","segment.r017.book1.appendix.matrices.arithmetic.block-005","segment.r017.book1.appendix.matrices.arithmetic.block-006","segment.r017.book1.appendix.matrices.arithmetic.block-007","segment.r017.book1.appendix.matrices.arithmetic.block-008","segment.r017.book1.appendix.matrices.arithmetic.block-009","segment.r017.book1.appendix.matrices.arithmetic.block-010","segment.r017.book1.appendix.matrices.arithmetic.block-011","segment.r017.book1.appendix.matrices.arithmetic.block-012","segment.r017.book1.appendix.matrices.arithmetic.block-013","segment.r017.book1.appendix.matrices.arithmetic.block-014","segment.r017.book1.appendix.matrices.arithmetic.block-015","segment.r017.book1.appendix.matrices.arithmetic.block-016","segment.r017.book1.appendix.matrices.arithmetic.block-017","segment.r017.book1.appendix.matrices.arithmetic.block-018","segment.r017.book1.appendix.matrices.arithmetic.block-019","segment.r017.book1.appendix.matrices.arithmetic.block-020","segment.r017.book1.appendix.matrices.arithmetic.block-021","segment.r017.book1.appendix.matrices.arithmetic.block-022","segment.r017.book1.appendix.matrices.arithmetic.block-023","segment.r017.book1.appendix.matrices.arithmetic.block-024","segment.r017.book1.appendix.matrices.arithmetic.block-025","segment.r017.book1.appendix.matrices.controller.block-001","segment.r017.book1.appendix.matrices.multiplication.block-001","segment.r017.book1.appendix.matrices.multiplication.block-002","segment.r017.book1.appendix.matrices.multiplication.block-003","segment.r017.book1.appendix.matrices.multiplication.block-004","segment.r017.book1.appendix.matrices.multiplication.block-005","segment.r017.book1.appendix.matrices.multiplication.block-006","segment.r017.book1.appendix.matrices.multiplication.block-007","segment.r017.book1.appendix.matrices.multiplication.block-008","segment.r017.book1.appendix.matrices.multiplication.block-009","segment.r017.book1.appendix.matrices.multiplication.block-010","segment.r017.book1.appendix.matrices.multiplication.block-011","segment.r017.book1.appendix.matrices.multiplication.block-012","segment.r017.book1.appendix.matrices.multiplication.block-013","segment.r017.book1.appendix.matrices.multiplication.block-014","segment.r017.book1.appendix.matrices.multiplication.block-015","segment.r017.book1.appendix.matrices.multiplication.block-016","segment.r017.book1.appendix.matrices.multiplication.block-017","segment.r017.book1.appendix.matrices.multiplication.block-018","segment.r017.book1.appendix.matrices.multiplication.block-019","segment.r017.book1.appendix.matrices.multiplication.block-020","segment.r017.book1.appendix.matrices.multiplication.block-021","segment.r017.book1.appendix.matrices.multiplication.block-022","segment.r017.book1.appendix.matrices.multiplication.block-023","segment.r017.book1.appendix.matrices.multiplication.block-024","segment.r017.book1.appendix.matrices.multiplication.block-025","segment.r017.book1.appendix.matrices.multiplication.block-026","segment.r017.book1.appendix.matrices.multiplication.block-027","segment.r017.book1.appendix.matrices.multiplication.block-028","segment.r017.book1.appendix.matrices.multiplication.block-029","segment.r017.book1.appendix.matrices.multiplication.block-030","segment.r017.book1.appendix.matrices.multiplication.block-031","segment.r017.book1.appendix.matrices.multiplication.block-032","segment.r017.book1.appendix.matrices.multiplication.block-033","segment.r017.book1.appendix.matrices.multiplication.block-034","segment.r017.book1.appendix.matrices.multiplication.block-035","segment.r017.book1.appendix.matrices.multiplication.block-036","segment.r017.book1.appendix.matrices.multiplication.block-037","segment.r017.book1.appendix.matrices.multiplication.block-038","segment.r017.book1.appendix.matrices.multiplication.block-039","segment.r017.book1.appendix.matrices.multiplication.block-040","segment.r017.book1.appendix.matrices.multiplication.block-041","segment.r017.book1.appendix.matrices.multiplication.block-042","segment.r017.book1.appendix.matrices.multiplication.block-043","segment.r017.book1.appendix.matrices.multiplication.block-044","segment.r017.book1.appendix.matrices.multiplication.block-045","segment.r017.book1.appendix.matrices.multiplication.block-046","segment.r017.book1.appendix.matrices.product-entry.block-001","segment.r017.book1.appendix.matrices.product-entry.block-002","segment.r017.book1.appendix.matrices.product-entry.block-003","segment.r017.book1.appendix.matrices.product-entry.block-004","segment.r017.book1.appendix.matrices.product-entry.block-005","segment.r017.book1.appendix.matrices.product-entry.block-006","segment.r017.book1.appendix.matrices.product-entry.block-007","segment.r017.book1.appendix.matrices.product-entry.block-008","segment.r017.book1.appendix.matrices.product-entry.block-009","segment.r017.book1.appendix.matrices.product-entry.block-010","segment.r017.book1.appendix.matrices.product-entry.block-011","segment.r017.book1.appendix.matrices.product-entry.block-012","segment.r017.book1.appendix.matrices.product-entry.block-013","segment.r017.book1.appendix.matrices.product-entry.block-014","segment.r017.book1.appendix.matrices.product-entry.block-015","segment.r017.book1.appendix.matrices.product-entry.block-016","segment.r017.book1.appendix.matrices.product-entry.block-017","segment.r017.book1.appendix.matrices.product-entry.block-018","segment.r017.book1.appendix.matrices.product-entry.block-019","segment.r017.book1.appendix.matrices.product-entry.block-020","segment.r017.book1.appendix.matrices.properties.block-001","segment.r017.book1.appendix.matrices.properties.block-002","segment.r017.book1.appendix.matrices.properties.block-003","segment.r017.book1.appendix.matrices.properties.block-004","segment.r017.book1.appendix.matrices.properties.block-005","segment.r017.book1.appendix.matrices.properties.block-006","segment.r017.book1.appendix.matrices.properties.block-007","segment.r017.book1.appendix.matrices.properties.block-008","segment.r017.book1.appendix.matrices.properties.block-009","segment.r017.book1.appendix.matrices.properties.block-010","segment.r017.book1.appendix.matrices.properties.block-011","segment.r017.book1.appendix.matrices.properties.block-012","segment.r017.book1.appendix.matrices.properties.block-013","segment.r017.book1.appendix.matrices.scalar.block-001","segment.r017.book1.appendix.matrices.scalar.block-002","segment.r017.book1.appendix.matrices.scalar.block-003","segment.r017.book1.appendix.matrices.scalar.block-004","segment.r017.book1.appendix.matrices.scalar.block-005","segment.r017.book1.appendix.matrices.scalar.block-006","segment.r017.book1.appendix.matrices.scalar.block-007","segment.r017.book1.appendix.matrices.scalar.block-008","segment.r017.book1.appendix.matrices.scalar.block-009","segment.r017.book1.appendix.matrices.scalar.block-010","segment.r017.book1.appendix.matrices.scalar.block-011","segment.r017.book1.appendix.matrices.scalar.block-012","segment.r017.book1.appendix.matrices.scalar.block-013","segment.r017.book1.appendix.matrices.scalar.block-014","segment.r017.book1.appendix.matrices.scalar.block-015","segment.r017.book1.appendix.matrices.transpose.block-001","segment.r017.book1.appendix.matrices.transpose.block-002","segment.r017.book1.appendix.matrices.transpose.block-003","segment.r017.book1.appendix.matrices.transpose.block-004","segment.r017.book1.appendix.matrices.transpose.block-005","segment.r017.book1.appendix.matrices.transpose.block-006","segment.r017.book1.appendix.matrices.transpose.block-007","segment.r017.book1.appendix.matrices.transpose.block-008","segment.r017.book1.appendix.matrices.transpose.block-009","segment.r017.book1.appendix.matrices.transpose.block-010","segment.r017.book1.appendix.matrices.transpose.block-011","segment.r017.book1.appendix.matrices.transpose.block-012","segment.r017.book1.appendix.matrices.transpose.block-013","segment.r017.book1.appendix.matrices.transpose.block-014","segment.r017.book1.appendix.matrices.transpose.block-015","segment.r017.book1.appendix.matrices.transpose.block-016","segment.r017.book1.appendix.matrices.transpose.block-017","segment.r017.book1.appendix.matrices.transpose.block-018","segment.r017.book1.appendix.matrices.transpose.block-019","segment.r017.book1.appendix.matrices.transpose.block-020","segment.r017.book1.appendix.matrices.transpose.block-021"],"native":{"concept_id":"concept.matrix-arithmetic","evidence":"Full-corpus id-ID terminology audit","id":"term.matrix-arithmetic.id","preferred":"aritmetika matriks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"matrix arithmetic","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.appendix.matrices.finding-inverse.block-001","segment.r017.book1.appendix.matrices.finding-inverse.block-002","segment.r017.book1.appendix.matrices.finding-inverse.block-003","segment.r017.book1.appendix.matrices.finding-inverse.block-004","segment.r017.book1.appendix.matrices.finding-inverse.block-005","segment.r017.book1.appendix.matrices.finding-inverse.block-006","segment.r017.book1.appendix.matrices.finding-inverse.block-007","segment.r017.book1.appendix.matrices.finding-inverse.block-008","segment.r017.book1.appendix.matrices.finding-inverse.block-009","segment.r017.book1.appendix.matrices.finding-inverse.block-010","segment.r017.book1.appendix.matrices.finding-inverse.block-011","segment.r017.book1.appendix.matrices.finding-inverse.block-012","segment.r017.book1.appendix.matrices.finding-inverse.block-013","segment.r017.book1.appendix.matrices.finding-inverse.block-014","segment.r017.book1.appendix.matrices.finding-inverse.block-015","segment.r017.book1.appendix.matrices.finding-inverse.block-016","segment.r017.book1.appendix.matrices.finding-inverse.block-017","segment.r017.book1.appendix.matrices.finding-inverse.block-018","segment.r017.book1.appendix.matrices.finding-inverse.block-019","segment.r017.book1.appendix.matrices.finding-inverse.block-020","segment.r017.book1.appendix.matrices.finding-inverse.block-021","segment.r017.book1.appendix.matrices.finding-inverse.block-022","segment.r017.book1.appendix.matrices.finding-inverse.block-023","segment.r017.book1.appendix.matrices.finding-inverse.block-024","segment.r017.book1.appendix.matrices.finding-inverse.block-025","segment.r017.book1.appendix.matrices.finding-inverse.block-026","segment.r017.book1.appendix.matrices.finding-inverse.block-027","segment.r017.book1.appendix.matrices.finding-inverse.block-028","segment.r017.book1.appendix.matrices.identity-inverse.block-001","segment.r017.book1.appendix.matrices.identity-inverse.block-002","segment.r017.book1.appendix.matrices.identity-inverse.block-003","segment.r017.book1.appendix.matrices.identity-inverse.block-004","segment.r017.book1.appendix.matrices.identity-inverse.block-005","segment.r017.book1.appendix.matrices.identity-inverse.block-006","segment.r017.book1.appendix.matrices.identity-inverse.block-007","segment.r017.book1.appendix.matrices.identity-inverse.block-008","segment.r017.book1.appendix.matrices.identity-inverse.block-009","segment.r017.book1.appendix.matrices.identity-inverse.block-010","segment.r017.book1.appendix.matrices.identity-inverse.block-011","segment.r017.book1.appendix.matrices.identity-inverse.block-012","segment.r017.book1.appendix.matrices.identity-inverse.block-013","segment.r017.book1.appendix.matrices.identity-inverse.block-014","segment.r017.book1.appendix.matrices.identity-inverse.block-015","segment.r017.book1.appendix.matrices.identity-inverse.block-016"],"native":{"concept_id":"concept.matrix-inverse","evidence":"Full-corpus id-ID terminology audit","id":"term.matrix-inverse.id","preferred":"invers matriks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"matrix inverse","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch06.readme.block-001","segment.o018.lab.ch06.readme.block-002","segment.o018.lab.ch06.readme.block-003","segment.o018.lab.ch06.readme.block-004","segment.o018.lab.ch06.readme.block-005","segment.o018.lab.ch06.readme.block-006","segment.o018.lab.ch06.readme.block-007","segment.o018.lab.ch06.readme.block-008","segment.o018.lab.ch06.readme.block-009","segment.o018.lab.ch06.readme.block-010","segment.r017.book1.appendix.linear-systems.rank.block-001","segment.r017.book1.appendix.linear-systems.rank.block-002","segment.r017.book1.appendix.linear-systems.rank.block-003","segment.r017.book1.appendix.linear-systems.rank.block-004","segment.r017.book1.appendix.linear-systems.rank.block-005","segment.r017.book1.appendix.linear-systems.rank.block-006","segment.r017.book1.appendix.linear-systems.rank.block-007","segment.r017.book1.appendix.linear-systems.rank.block-008","segment.r017.book1.appendix.linear-systems.rank.block-009","segment.r017.book1.appendix.linear-systems.rank.block-010","segment.r017.book1.appendix.linear-systems.rank.block-011","segment.r017.book1.appendix.linear-systems.rank.block-012","segment.r017.book1.appendix.linear-systems.rank.block-013","segment.r017.book1.appendix.linear-systems.rank.block-014","segment.r017.book1.appendix.linear-systems.rank.block-015","segment.r017.book1.appendix.linear-systems.rank.block-016","segment.r017.book1.appendix.linear-systems.rank.block-017","segment.r017.book1.appendix.linear-systems.rank.block-018","segment.r017.book1.appendix.linear-systems.rank.block-019","segment.r017.book1.appendix.linear-systems.rank.block-020","segment.r017.book1.appendix.linear-systems.rank.block-021","segment.r017.book1.appendix.linear-systems.rank.block-022","segment.r017.book1.appendix.linear-systems.rank.block-023","segment.r017.book1.appendix.linear-systems.rank.block-024","segment.r017.book1.appendix.linear-systems.rank.block-025","segment.r017.book1.appendix.linear-systems.rank.block-026","segment.r017.book1.appendix.linear-systems.rank.block-027","segment.r017.book1.appendix.linear-systems.rank.block-028","segment.r017.book1.appendix.linear-systems.rank.block-029","segment.r017.book1.appendix.linear-systems.rank.block-030","segment.r017.book1.appendix.linear-systems.rank.block-031","segment.r017.book1.appendix.linear-systems.rank.block-032","segment.r017.book1.appendix.linear-systems.rank.block-033","segment.r017.book1.appendix.linear-systems.rank.block-034","segment.r017.book1.ch06.text.block-005","segment.r017.book1.ch06.text.block-141"],"native":{"concept_id":"concept.matrix-rank","evidence":"Chapter 6 terminology decision","id":"term.matrix-rank.id","preferred":"rank matriks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear algebra","source_locale":"en","source_term":"matrix rank","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["peringkat matriks"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch04.text-b.block-185","segment.r017.book1.ch04.text-b.block-215"],"native":{"concept_id":"concept.assignment-fairness","evidence":"Chapter 4 terminology decision","id":"term.max-min-fairness.id","preferred":"keadilan maks-min","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"assignment fairness objectives","source_locale":"en","source_term":"max-min fairness","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch04.readme.block-001","segment.o018.lab.ch04.readme.block-002","segment.o018.lab.ch04.readme.block-003","segment.o018.lab.ch04.readme.block-004","segment.o018.lab.ch04.readme.block-005","segment.o018.lab.ch04.readme.block-006","segment.o018.lab.ch04.readme.block-007","segment.o018.lab.ch04.readme.block-008","segment.o018.lab.ch04.readme.block-009","segment.o018.lab.ch04.readme.block-010","segment.o018.lab.ch04.readme.block-011","segment.o018.lab.ch04.readme.block-012","segment.o018.lab.ch04.readme.block-013","segment.o018.lab.ch04.readme.block-014","segment.o018.lab.ch04.readme.block-015","segment.o018.lab.ch04.readme.block-016","segment.o018.lab.ch04.readme.block-017","segment.o018.lab.ch04.readme.block-018","segment.o018.lab.ch04.readme.block-019","segment.o018.lab.ch04.readme.block-020","segment.o018.lab.ch04.readme.block-021","segment.o018.lab.ch04.readme.block-022","segment.o018.lab.ch04.readme.block-023","segment.o018.lab.ch04.readme.block-024","segment.o018.lab.ch04.readme.block-025","segment.o018.lab.ch04.readme.block-026","segment.r017.book1.ch04.text-b.block-072","segment.r017.book1.ch04.text-b.block-188","segment.r017.book1.ch04.text-b.block-195"],"native":{"concept_id":"concept.maximum-flow","evidence":"Chapter 4 terminology decision","id":"term.maximum-flow.id","preferred":"aliran maksimum","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"network optimization","source_locale":"en","source_term":"maximum flow","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch04.text-b.block-185","segment.r017.book1.ch04.text-b.block-215"],"native":{"concept_id":"concept.assignment-fairness","evidence":"Chapter 4 terminology decision","id":"term.min-max-fairness.id","preferred":"keadilan min-maks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"assignment fairness objectives","source_locale":"en","source_term":"min-max fairness","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch04.readme.block-001","segment.o018.lab.ch04.readme.block-002","segment.o018.lab.ch04.readme.block-003","segment.o018.lab.ch04.readme.block-004","segment.o018.lab.ch04.readme.block-005","segment.o018.lab.ch04.readme.block-006","segment.o018.lab.ch04.readme.block-007","segment.o018.lab.ch04.readme.block-008","segment.o018.lab.ch04.readme.block-009","segment.o018.lab.ch04.readme.block-010","segment.o018.lab.ch04.readme.block-011","segment.o018.lab.ch04.readme.block-012","segment.o018.lab.ch04.readme.block-013","segment.o018.lab.ch04.readme.block-014","segment.o018.lab.ch04.readme.block-015","segment.o018.lab.ch04.readme.block-016","segment.o018.lab.ch04.readme.block-017","segment.o018.lab.ch04.readme.block-018","segment.o018.lab.ch04.readme.block-019","segment.o018.lab.ch04.readme.block-020","segment.o018.lab.ch04.readme.block-021","segment.o018.lab.ch04.readme.block-022","segment.o018.lab.ch04.readme.block-023","segment.o018.lab.ch04.readme.block-024","segment.o018.lab.ch04.readme.block-025","segment.o018.lab.ch04.readme.block-026","segment.r017.book1.ch03.text.block-044","segment.r017.book1.ch04.text-b.block-018","segment.r017.book1.ch04.text-b.block-037","segment.r017.book1.ch04.text-b.block-142","segment.r017.book1.ch04.text-b.block-200"],"native":{"concept_id":"concept.network-flow","evidence":"Chapter 4 terminology decision","id":"term.minimum-cost-flow.id","preferred":"aliran berbiaya minimum","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"network optimization","source_locale":"en","source_term":"minimum-cost flow","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["aliran biaya minimum"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch04.text-b.block-072","segment.r017.book1.ch04.text-b.block-188","segment.r017.book1.ch04.text-b.block-195"],"native":{"concept_id":"concept.minimum-cut","evidence":"Chapter 4 terminology decision","id":"term.minimum-cut.id","preferred":"potongan minimum","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"maximum-flow/minimum-cut theory","source_locale":"en","source_term":"minimum cut","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch14.attribution.block-001","segment.o018.lab.ch14.attribution.block-002","segment.o018.lab.ch14.attribution.block-003","segment.o018.lab.ch14.attribution.block-004","segment.o018.lab.ch14.attribution.block-005","segment.o018.lab.ch14.attribution.block-006","segment.o018.lab.ch14.attribution.block-007","segment.o018.lab.ch14.attribution.block-008","segment.o018.lab.ch14.attribution.block-009","segment.o018.lab.ch14.attribution.block-010","segment.o018.lab.ch14.attribution.block-011","segment.o018.lab.ch14.attribution.block-012","segment.o018.lab.ch14.attribution.block-013","segment.o018.lab.ch14.attribution.block-014","segment.o018.lab.ch14.attribution.block-015","segment.o018.lab.ch14.attribution.block-016","segment.o018.lab.ch14.readme.block-001","segment.o018.lab.ch14.readme.block-002","segment.o018.lab.ch14.readme.block-003","segment.o018.lab.ch14.readme.block-004","segment.o018.lab.ch14.readme.block-005","segment.o018.lab.ch14.readme.block-006","segment.o018.lab.ch14.readme.block-007","segment.o018.lab.ch14.readme.block-008","segment.o018.lab.ch14.readme.block-009","segment.o018.lab.ch14.readme.block-010","segment.r017.book1.ch14.solutions-manual.block-001","segment.r017.book1.ch14.solutions-manual.block-002","segment.r017.book1.ch14.solutions-manual.block-003","segment.r017.book1.ch14.solutions-manual.block-004","segment.r017.book1.ch14.solutions-manual.block-005","segment.r017.book1.ch14.solutions-manual.block-006","segment.r017.book1.ch14.solutions-manual.block-007","segment.r017.book1.ch14.solutions-manual.block-008","segment.r017.book1.ch14.solutions-manual.block-009","segment.r017.book1.ch14.solutions-manual.block-010","segment.r017.book1.ch14.solutions-manual.block-011","segment.r017.book1.ch14.solutions-manual.block-012","segment.r017.book1.ch14.solutions-manual.block-013","segment.r017.book1.ch14.solutions-manual.block-014","segment.r017.book1.ch14.solutions-manual.block-015","segment.r017.book1.ch14.solutions-manual.block-016","segment.r017.book1.ch14.solutions-manual.block-017","segment.r017.book1.ch14.solutions-manual.block-018","segment.r017.book1.ch14.solutions-manual.block-019","segment.r017.book1.ch14.solutions-manual.block-020","segment.r017.book1.ch14.solutions-manual.block-021","segment.r017.book1.ch14.solutions-manual.block-022","segment.r017.book1.ch14.solutions-manual.block-023","segment.r017.book1.ch14.solutions-manual.block-024","segment.r017.book1.ch14.solutions-manual.block-025","segment.r017.book1.ch14.solutions-manual.block-026","segment.r017.book1.ch14.solutions-manual.block-027","segment.r017.book1.ch14.solutions-manual.block-028","segment.r017.book1.ch14.solutions-manual.block-029","segment.r017.book1.ch14.solutions-manual.block-030","segment.r017.book1.ch14.solutions-manual.block-031","segment.r017.book1.ch14.solutions-manual.block-032","segment.r017.book1.ch14.solutions-manual.block-033","segment.r017.book1.ch14.solutions-manual.block-034","segment.r017.book1.ch14.solutions-manual.block-035","segment.r017.book1.ch14.solutions-manual.block-036","segment.r017.book1.ch14.solutions-manual.block-037","segment.r017.book1.ch14.solutions-manual.block-038","segment.r017.book1.ch14.solutions-manual.block-039","segment.r017.book1.ch14.solutions-manual.block-040","segment.r017.book1.ch14.solutions-manual.block-041","segment.r017.book1.ch14.solutions-manual.block-042","segment.r017.book1.ch14.solutions-manual.block-043","segment.r017.book1.ch14.solutions-manual.block-044","segment.r017.book1.ch14.solutions-manual.block-045","segment.r017.book1.ch14.solutions-manual.block-046","segment.r017.book1.ch14.solutions-manual.block-047","segment.r017.book1.ch14.solutions-manual.block-048","segment.r017.book1.ch14.solutions-manual.block-049","segment.r017.book1.ch14.solutions-manual.block-050","segment.r017.book1.ch14.solutions-manual.block-051","segment.r017.book1.ch14.solutions-manual.block-052","segment.r017.book1.ch14.solutions-manual.block-053","segment.r017.book1.ch14.solutions-manual.block-054","segment.r017.book1.ch14.solutions-manual.block-055","segment.r017.book1.ch14.solutions-manual.block-056","segment.r017.book1.ch14.solutions-manual.block-057","segment.r017.book1.ch14.solutions-manual.block-058","segment.r017.book1.ch14.solutions-manual.block-059","segment.r017.book1.ch14.text.block-001","segment.r017.book1.ch14.text.block-002","segment.r017.book1.ch14.text.block-003","segment.r017.book1.ch14.text.block-004","segment.r017.book1.ch14.text.block-005","segment.r017.book1.ch14.text.block-006","segment.r017.book1.ch14.text.block-007","segment.r017.book1.ch14.text.block-008","segment.r017.book1.ch14.text.block-009","segment.r017.book1.ch14.text.block-010","segment.r017.book1.ch14.text.block-011","segment.r017.book1.ch14.text.block-012","segment.r017.book1.ch14.text.block-013","segment.r017.book1.ch14.text.block-014","segment.r017.book1.ch14.text.block-015","segment.r017.book1.ch14.text.block-016","segment.r017.book1.ch14.text.block-017","segment.r017.book1.ch14.text.block-018","segment.r017.book1.ch14.text.block-019","segment.r017.book1.ch14.text.block-020","segment.r017.book1.ch14.text.block-021","segment.r017.book1.ch14.text.block-022","segment.r017.book1.ch14.text.block-023","segment.r017.book1.ch14.text.block-024","segment.r017.book1.ch14.text.block-025","segment.r017.book1.ch14.text.block-026","segment.r017.book1.ch14.text.block-027","segment.r017.book1.ch14.text.block-028","segment.r017.book1.ch14.text.block-029","segment.r017.book1.ch14.text.block-030","segment.r017.book1.ch14.text.block-031","segment.r017.book1.ch14.text.block-032","segment.r017.book1.ch14.text.block-033","segment.r017.book1.ch14.text.block-034","segment.r017.book1.ch14.text.block-035","segment.r017.book1.ch14.text.block-036","segment.r017.book1.ch14.text.block-037","segment.r017.book1.ch14.text.block-038","segment.r017.book1.ch14.text.block-039","segment.r017.book1.ch14.text.block-040","segment.r017.book1.ch14.text.block-041","segment.r017.book1.ch14.text.block-042","segment.r017.book1.ch14.text.block-043","segment.r017.book1.ch14.text.block-044","segment.r017.book1.ch14.text.block-045","segment.r017.book1.ch14.text.block-046","segment.r017.book1.ch14.text.block-047","segment.r017.book1.ch14.text.block-048","segment.r017.book1.ch14.text.block-049","segment.r017.book1.ch14.text.block-050","segment.r017.book1.ch14.text.block-051","segment.r017.book1.ch14.text.block-052","segment.r017.book1.ch14.text.block-053","segment.r017.book1.ch14.text.block-054","segment.r017.book1.ch14.text.block-055","segment.r017.book1.ch14.text.block-056","segment.r017.book1.ch14.text.block-057","segment.r017.book1.ch14.text.block-058","segment.r017.book1.ch14.text.block-059","segment.r017.book1.ch14.text.block-060","segment.r017.book1.ch14.text.block-061","segment.r017.book1.ch14.text.block-062","segment.r017.book1.ch14.text.block-063","segment.r017.book1.ch14.text.block-064","segment.r017.book1.ch14.text.block-065","segment.r017.book1.ch14.text.block-066","segment.r017.book1.ch14.text.block-067","segment.r017.book1.ch14.text.block-068","segment.r017.book1.ch14.text.block-069","segment.r017.book1.ch14.text.block-070","segment.r017.book1.ch14.text.block-071","segment.r017.book1.ch14.text.block-072","segment.r017.book1.ch14.text.block-073","segment.r017.book1.ch14.text.block-074","segment.r017.book1.ch14.text.block-075","segment.r017.book1.ch14.text.block-076","segment.r017.book1.ch14.text.block-077","segment.r017.book1.ch14.text.block-078","segment.r017.book1.ch14.text.block-079","segment.r017.book1.ch14.text.block-080","segment.r017.book1.ch14.text.block-081","segment.r017.book1.ch14.text.block-082","segment.r017.book1.ch14.text.block-083","segment.r017.book1.ch14.text.block-084","segment.r017.book1.ch14.text.block-085","segment.r017.book1.ch14.text.block-086","segment.r017.book1.ch14.text.block-087","segment.r017.book1.ch14.text.block-088","segment.r017.book1.ch14.text.block-089","segment.r017.book1.ch14.text.block-090","segment.r017.book1.ch14.text.block-091","segment.r017.book1.ch14.text.block-092","segment.r017.book1.ch14.text.block-093","segment.r017.book1.ch14.text.block-094","segment.r017.book1.ch14.text.block-095","segment.r017.book1.ch14.text.block-096","segment.r017.book1.ch14.text.block-097","segment.r017.book1.ch14.text.block-098","segment.r017.book1.ch14.text.block-099","segment.r017.book1.ch14.text.block-100","segment.r017.book1.ch14.text.block-101","segment.r017.book1.ch14.text.block-102","segment.r017.book1.ch14.text.block-103","segment.r017.book1.ch14.text.block-104","segment.r017.book1.ch14.text.block-105","segment.r017.book1.ch14.text.block-106","segment.r017.book1.ch14.text.block-107","segment.r017.book1.ch14.text.block-108","segment.r017.book1.ch14.text.block-109","segment.r017.book1.ch14.text.block-110","segment.r017.book1.ch14.text.block-111","segment.r017.book1.ch14.text.block-112","segment.r017.book1.ch14.text.block-113","segment.r017.book1.ch14.text.block-114","segment.r017.book1.ch14.text.block-115","segment.r017.book1.ch14.text.block-116","segment.r017.book1.ch14.text.block-117","segment.r017.book1.ch14.text.block-118","segment.r017.book1.ch14.text.block-119","segment.r017.book1.ch14.text.block-120","segment.r017.book1.ch14.text.block-121","segment.r017.book1.ch14.text.block-122","segment.r017.book1.ch14.text.block-123","segment.r017.book1.ch14.text.block-124","segment.r017.book1.ch14.text.block-125","segment.r017.book1.ch14.text.block-126","segment.r017.book1.ch14.text.block-127","segment.r017.book1.ch14.text.block-128","segment.r017.book1.ch14.text.block-129","segment.r017.book1.ch14.text.block-130","segment.r017.book1.ch14.text.block-131","segment.r017.book1.ch14.text.block-132","segment.r017.book1.ch14.text.block-133","segment.r017.book1.ch14.text.block-134","segment.r017.book1.ch14.text.block-135","segment.r017.book1.ch14.text.block-136","segment.r017.book1.ch14.text.block-137","segment.r017.book1.ch14.text.block-138","segment.r017.book1.ch14.text.block-139","segment.r017.book1.ch14.text.block-140","segment.r017.book1.ch14.text.block-141","segment.r017.book1.ch14.text.block-142","segment.r017.book1.ch14.text.block-143","segment.r017.book1.ch14.text.block-144","segment.r017.book1.ch14.text.block-145","segment.r017.book1.ch14.text.block-146","segment.r017.book1.ch14.text.block-147","segment.r017.book1.ch14.text.block-148","segment.r017.book1.ch14.text.block-149","segment.r017.book1.ch14.text.block-150","segment.r017.book1.ch14.text.block-151","segment.r017.book1.ch14.text.block-152","segment.r017.book1.ch14.text.block-153","segment.r017.book1.ch14.text.block-154","segment.r017.book1.ch14.text.block-155","segment.r017.book1.ch14.text.block-156","segment.r017.book1.ch14.text.block-157","segment.r017.book1.ch14.text.block-158","segment.r017.book1.ch14.text.block-159","segment.r017.book1.ch14.text.block-160","segment.r017.book1.ch14.text.block-161","segment.r017.book1.ch14.text.block-162","segment.r017.book1.ch14.text.block-163","segment.r017.book1.ch14.text.block-164","segment.r017.book1.ch14.text.block-165","segment.r017.book1.ch14.text.block-166","segment.r017.book1.ch14.text.block-167","segment.r017.book1.ch14.text.block-168","segment.r017.book1.ch14.text.block-169","segment.r017.book1.ch14.text.block-170","segment.r017.book1.ch14.text.block-171","segment.r017.book1.ch14.text.block-172","segment.r017.book1.ch14.text.block-173","segment.r017.book1.ch14.text.block-174","segment.r017.book1.ch14.text.block-175","segment.r017.book1.ch14.text.block-176","segment.r017.book1.ch14.text.block-177","segment.r017.book1.ch14.text.block-178","segment.r017.book1.ch14.text.block-179","segment.r017.book1.ch14.text.block-180","segment.r017.book1.ch14.text.block-181","segment.r017.book1.ch14.text.block-182","segment.r017.book1.ch14.text.block-183","segment.r017.book1.ch14.text.block-184","segment.r017.book1.ch14.text.block-185","segment.r017.book1.ch14.text.block-186","segment.r017.book1.ch14.text.block-187","segment.r017.book1.ch14.text.block-188","segment.r017.book1.ch14.text.block-189","segment.r017.book1.ch14.text.block-190","segment.r017.book1.ch14.text.block-191","segment.r017.book1.ch14.text.block-192","segment.r017.book1.ch14.text.block-193","segment.r017.book1.ch14.text.block-194","segment.r017.book1.ch14.text.block-195","segment.r017.book1.ch14.text.block-196","segment.r017.book1.ch14.text.block-197","segment.r017.book1.ch14.text.block-198","segment.r017.book1.ch14.text.block-199","segment.r017.book1.ch14.text.block-200","segment.r017.book1.ch14.text.block-201","segment.r017.book1.ch14.text.block-202","segment.r017.book1.ch14.text.block-203","segment.r017.book1.ch14.text.block-204","segment.r017.book1.ch14.text.block-205","segment.r017.book1.ch14.text.block-206","segment.r017.book1.ch14.text.block-207","segment.r017.book1.ch14.text.block-208","segment.r017.book1.ch14.text.block-209","segment.r017.book1.ch14.text.block-210","segment.r017.book1.ch14.text.block-211","segment.r017.book1.ch14.text.block-212","segment.r017.book1.ch14.text.block-213","segment.r017.book1.ch14.text.block-214","segment.r017.book1.ch14.text.block-215","segment.r017.book1.ch14.text.block-216","segment.r017.book1.ch14.text.block-217","segment.r017.book1.ch14.text.block-218","segment.r017.book1.ch14.text.block-219","segment.r017.book1.ch14.text.block-220","segment.r017.book1.ch14.text.block-221","segment.r017.book1.ch14.text.block-222","segment.r017.book1.ch14.text.block-223","segment.r017.book1.ch14.text.block-224","segment.r017.book1.ch14.text.block-225","segment.r017.book1.ch14.text.block-226","segment.r017.book1.ch14.text.block-227","segment.r017.book1.ch14.text.block-228","segment.r017.book1.ch14.text.block-229","segment.r017.book1.ch14.text.block-230","segment.r017.book1.ch14.text.block-231","segment.r017.book1.ch14.text.block-232","segment.r017.book1.ch14.text.block-233","segment.r017.book1.ch14.text.block-234","segment.r017.book1.ch14.text.block-235","segment.r017.book1.ch14.text.block-236","segment.r017.book1.ch14.text.block-237","segment.r017.book1.ch14.text.block-238","segment.r017.book1.ch14.text.block-239","segment.r017.book1.ch14.text.block-240","segment.r017.book1.ch14.text.block-241","segment.r017.book1.ch14.text.block-242","segment.r017.book1.ch14.text.block-243","segment.r017.book1.ch14.text.block-244","segment.r017.book1.ch14.text.block-245","segment.r017.book1.ch14.text.block-246","segment.r017.book1.ch14.text.block-247","segment.r017.book1.ch14.text.block-248","segment.r017.book1.ch14.text.block-249","segment.r017.book1.ch14.text.block-250","segment.r017.book1.ch14.text.block-251","segment.r017.book1.ch14.text.block-252","segment.r017.book1.ch14.text.block-253","segment.r017.book1.ch14.text.block-254","segment.r017.book1.ch14.text.block-255","segment.r017.book1.ch14.text.block-256","segment.r017.book1.ch14.text.block-257","segment.r017.book1.ch14.text.block-258","segment.r017.book1.ch14.text.block-259","segment.r017.book1.ch14.text.block-260","segment.r017.book1.ch14.text.block-261","segment.r017.book1.ch14.text.block-262","segment.r017.book1.ch14.text.block-263","segment.r017.book1.ch14.text.block-264","segment.r017.book1.ch14.text.block-265","segment.r017.book1.ch14.text.block-266","segment.r017.book1.ch14.text.block-267","segment.r017.book1.ch14.text.block-268","segment.r017.book1.ch14.text.block-269","segment.r017.book1.ch14.text.block-270","segment.r017.book1.ch14.text.block-271","segment.r017.book1.ch14.text.block-272","segment.r017.book1.ch14.text.block-273","segment.r017.book1.ch14.text.block-274","segment.r017.book1.ch14.text.block-275","segment.r017.book1.ch14.text.block-276","segment.r017.book1.ch14.text.block-277","segment.r017.book1.ch14.text.block-278","segment.r017.book1.ch14.text.block-279","segment.r017.book1.ch14.text.block-280","segment.r017.book1.ch14.text.block-281","segment.r017.book1.ch14.text.block-282","segment.r017.book1.ch14.text.block-283","segment.r017.book1.ch14.text.block-284","segment.r017.book1.ch14.text.block-285","segment.r017.book1.ch14.text.block-286","segment.r017.book1.ch14.text.block-287","segment.r017.book1.ch14.text.block-288","segment.r017.book1.ch14.text.block-289","segment.r017.book1.ch14.text.block-290","segment.r017.book1.ch14.text.block-291","segment.r017.book1.ch14.text.block-292","segment.r017.book1.ch14.text.block-293","segment.r017.book1.ch14.text.block-294","segment.r017.book1.ch14.text.block-295","segment.r017.book1.ch14.text.block-296","segment.r017.book1.ch14.text.block-297","segment.r017.book1.ch14.text.block-298","segment.r017.book1.ch14.text.block-299","segment.r017.book1.ch14.text.block-300","segment.r017.book1.ch14.text.block-301","segment.r017.book1.ch14.text.block-302","segment.r017.book1.ch14.text.block-303","segment.r017.book1.ch14.text.block-304","segment.r017.book1.ch14.text.block-305","segment.r017.book1.ch14.text.block-306","segment.r017.book1.ch14.text.block-307","segment.r017.book1.ch14.text.block-308","segment.r017.book1.ch14.text.block-309","segment.r017.book1.ch14.text.block-310","segment.r017.book1.ch14.text.block-311","segment.r017.book1.ch14.text.block-312","segment.r017.book1.ch14.text.block-313","segment.r017.book1.ch14.text.block-314","segment.r017.book1.ch14.text.block-315","segment.r017.book1.ch14.text.block-316","segment.r017.book1.ch14.text.block-317","segment.r017.book1.ch14.text.block-318","segment.r017.book1.ch14.text.block-319","segment.r017.book1.ch14.text.block-320","segment.r017.book1.ch14.text.block-321","segment.r017.book1.ch14.text.block-322","segment.r017.book1.ch14.text.block-323","segment.r017.book1.ch14.text.block-324","segment.r017.book1.ch14.text.block-325","segment.r017.book1.ch14.text.block-326","segment.r017.book1.ch14.text.block-327","segment.r017.book1.ch14.text.block-328","segment.r017.book1.ch14.text.block-329","segment.r017.book1.ch14.text.block-330","segment.r017.book1.ch14.text.block-331","segment.r017.book1.ch14.text.block-332","segment.r017.book1.ch14.text.block-333","segment.r017.book1.ch14.text.block-334","segment.r017.book1.ch14.text.block-335","segment.r017.book1.ch14.text.block-336","segment.r017.book1.ch14.text.block-337","segment.r017.book1.ch14.text.block-338","segment.r017.book1.ch14.text.block-339","segment.r017.book1.ch14.text.block-340","segment.r017.book1.ch14.text.block-341","segment.r017.book1.ch14.text.block-342","segment.r017.book1.ch14.text.block-343","segment.r017.book1.ch14.text.block-344","segment.r017.book1.ch14.text.block-345","segment.r017.book1.ch14.text.block-346","segment.r017.book1.ch14.text.block-347","segment.r017.book1.ch14.text.block-348","segment.r017.book1.ch14.text.block-349","segment.r017.book1.ch14.text.block-350","segment.r017.book1.ch14.text.block-351","segment.r017.book1.ch14.text.block-352","segment.r017.book1.ch14.text.block-353","segment.r017.book1.ch14.text.block-354","segment.r017.book1.ch14.text.block-355","segment.r017.book1.ch14.text.block-356","segment.r017.book1.ch14.text.block-357","segment.r017.book1.ch14.text.block-358","segment.r017.book1.ch14.text.block-359","segment.r017.book1.ch14.text.block-360","segment.r017.book1.ch14.text.block-361","segment.r017.book1.ch14.text.block-362","segment.r017.book1.ch14.text.block-363","segment.r017.book1.ch14.text.block-364","segment.r017.book1.ch14.text.block-365","segment.r017.book1.ch14.text.block-366","segment.r017.book1.ch14.text.block-367","segment.r017.book1.ch14.text.block-368","segment.r017.book1.ch14.text.block-369","segment.r017.book1.ch14.text.block-370","segment.r017.book1.ch14.text.block-371","segment.r017.book1.ch14.text.block-372","segment.r017.book1.ch14.text.block-373","segment.r017.book1.ch14.text.block-374","segment.r017.book1.ch14.text.block-375","segment.r017.book1.ch14.text.block-376","segment.r017.book1.ch14.text.block-377","segment.r017.book1.ch14.text.block-378","segment.r017.book1.ch14.text.block-379","segment.r017.book1.ch14.text.block-380","segment.r017.book1.ch14.text.block-381","segment.r017.book1.ch14.text.block-382","segment.r017.book1.ch14.text.block-383","segment.r017.book1.ch14.text.block-384","segment.r017.book1.ch14.text.block-385","segment.r017.book1.ch14.text.block-386","segment.r017.book1.ch14.text.block-387","segment.r017.book1.ch14.text.block-388","segment.r017.book1.ch14.text.block-389","segment.r017.book1.ch14.text.block-390","segment.r017.book1.ch14.text.block-391","segment.r017.book1.ch14.text.block-392","segment.r017.book1.ch14.text.block-393","segment.r017.book1.ch14.text.block-394","segment.r017.book1.ch14.text.block-395","segment.r017.book1.ch14.text.block-396","segment.r017.book1.ch14.text.block-397","segment.r017.book1.ch14.text.block-398","segment.r017.book1.ch14.text.block-399","segment.r017.book1.ch14.text.block-400","segment.r017.book1.ch14.text.block-401","segment.r017.book1.ch14.text.block-402","segment.r017.book1.ch14.text.block-403","segment.r017.book1.ch14.text.block-404","segment.r017.book1.ch14.text.block-405","segment.r017.book1.ch14.text.block-406","segment.r017.book1.ch14.text.block-407","segment.r017.book1.ch14.text.block-408","segment.r017.book1.ch14.text.block-409","segment.r017.book1.ch14.text.block-410","segment.r017.book1.ch14.text.block-411","segment.r017.book1.ch14.text.block-412","segment.r017.book1.ch14.text.block-413","segment.r017.book1.ch14.text.block-414","segment.r017.book1.ch14.text.block-415","segment.r017.book1.ch14.text.block-416","segment.r017.book1.ch14.text.block-417","segment.r017.book1.ch14.text.block-418","segment.r017.book1.ch14.text.block-419","segment.r017.book1.ch14.text.block-420","segment.r017.book1.ch14.text.block-421","segment.r017.book1.ch14.text.block-422","segment.r017.book1.ch14.text.block-423","segment.r017.book1.ch14.text.block-424","segment.r017.book1.ch14.text.block-425","segment.r017.book1.ch14.text.block-426","segment.r017.book1.ch14.text.block-427","segment.r017.book1.ch14.text.block-428"],"native":{"concept_id":"concept.minimum-spanning-tree","evidence":"Full-corpus id-ID terminology audit","id":"term.minimum-spanning-tree.id","preferred":"pohon merentang minimum","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"minimum spanning tree","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-042","segment.r017.book1.ch01.text.block-043","segment.r017.book1.ch01.text.block-052","segment.r017.book1.ch01.text.block-058"],"native":{"concept_id":"concept.mixed-integer-linear-programming","evidence":"first-boundary editorial terminology decision","id":"term.mixed-integer-linear-programming.id","preferred":"pemrograman linear bilangan bulat campuran","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"model class; abbreviation MILP retained","source_locale":"en","source_term":"mixed-integer linear programming","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-042","segment.r017.book1.ch01.text.block-043","segment.r017.book1.ch01.text.block-076","segment.r017.book1.ch01.text.block-077"],"native":{"concept_id":"concept.mixed-integer-nonlinear-programming","evidence":"Final id-ID corpus terminology audit","id":"term.mixed-integer-nonlinear-programming.id","preferred":"pemrograman nonlinier bilangan bulat campuran","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"mixed-integer nonlinear programming","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-004","segment.r017.book1.ch01.text.block-008"],"native":{"concept_id":"concept.model-development-cycle","evidence":"Final id-ID corpus terminology audit","id":"term.model-development-cycle.id","preferred":"siklus pengembangan model","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"model development cycle","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.modeling","evidence":"first-boundary editorial terminology decision","id":"term.modeling.id","preferred":"pemodelan","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"general","source_locale":"en","source_term":"modeling","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch04.readme.block-001","segment.o018.lab.ch04.readme.block-002","segment.o018.lab.ch04.readme.block-003","segment.o018.lab.ch04.readme.block-004","segment.o018.lab.ch04.readme.block-005","segment.o018.lab.ch04.readme.block-006","segment.o018.lab.ch04.readme.block-007","segment.o018.lab.ch04.readme.block-008","segment.o018.lab.ch04.readme.block-009","segment.o018.lab.ch04.readme.block-010","segment.o018.lab.ch04.readme.block-011","segment.o018.lab.ch04.readme.block-012","segment.o018.lab.ch04.readme.block-013","segment.o018.lab.ch04.readme.block-014","segment.o018.lab.ch04.readme.block-015","segment.o018.lab.ch04.readme.block-016","segment.o018.lab.ch04.readme.block-017","segment.o018.lab.ch04.readme.block-018","segment.o018.lab.ch04.readme.block-019","segment.o018.lab.ch04.readme.block-020","segment.o018.lab.ch04.readme.block-021","segment.o018.lab.ch04.readme.block-022","segment.o018.lab.ch04.readme.block-023","segment.o018.lab.ch04.readme.block-024","segment.o018.lab.ch04.readme.block-025","segment.o018.lab.ch04.readme.block-026","segment.r017.book1.ch04.text-b.block-154","segment.r017.book1.ch04.text-b.block-155"],"native":{"concept_id":"concept.multi-period-investment","evidence":"Chapter 4 terminology decision","id":"term.multi-period-capital-investment.id","preferred":"investasi modal multiperiodik","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"capital-allocation modeling","source_locale":"en","source_term":"multi-period capital investment","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["investasi modal multi-periode"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch04.readme.block-001","segment.o018.lab.ch04.readme.block-002","segment.o018.lab.ch04.readme.block-003","segment.o018.lab.ch04.readme.block-004","segment.o018.lab.ch04.readme.block-005","segment.o018.lab.ch04.readme.block-006","segment.o018.lab.ch04.readme.block-007","segment.o018.lab.ch04.readme.block-008","segment.o018.lab.ch04.readme.block-009","segment.o018.lab.ch04.readme.block-010","segment.o018.lab.ch04.readme.block-011","segment.o018.lab.ch04.readme.block-012","segment.o018.lab.ch04.readme.block-013","segment.o018.lab.ch04.readme.block-014","segment.o018.lab.ch04.readme.block-015","segment.o018.lab.ch04.readme.block-016","segment.o018.lab.ch04.readme.block-017","segment.o018.lab.ch04.readme.block-018","segment.o018.lab.ch04.readme.block-019","segment.o018.lab.ch04.readme.block-020","segment.o018.lab.ch04.readme.block-021","segment.o018.lab.ch04.readme.block-022","segment.o018.lab.ch04.readme.block-023","segment.o018.lab.ch04.readme.block-024","segment.o018.lab.ch04.readme.block-025","segment.o018.lab.ch04.readme.block-026","segment.r017.book1.ch04.text-b.block-112","segment.r017.book1.ch04.text-b.block-120","segment.r017.book1.ch04.text-b.block-129","segment.r017.book1.ch04.text-b.block-214","segment.r017.book1.ch04.text-b.target-native-multicommodity-routing"],"native":{"concept_id":"concept.multicommodity-flow","evidence":"Chapter 4 terminology decision","id":"term.multicommodity-flow.id","preferred":"aliran multikomoditas","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"network optimization","source_locale":"en","source_term":"multicommodity flow","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch13.attribution.block-001","segment.o018.lab.ch13.attribution.block-002","segment.o018.lab.ch13.attribution.block-003","segment.o018.lab.ch13.attribution.block-004","segment.o018.lab.ch13.attribution.block-005","segment.o018.lab.ch13.attribution.block-006","segment.o018.lab.ch13.attribution.block-007","segment.o018.lab.ch13.attribution.block-008","segment.o018.lab.ch13.attribution.block-009","segment.o018.lab.ch13.attribution.block-010","segment.o018.lab.ch13.attribution.block-011","segment.o018.lab.ch13.attribution.block-012","segment.o018.lab.ch13.attribution.block-013","segment.o018.lab.ch13.attribution.block-014","segment.o018.lab.ch13.attribution.block-015","segment.o018.lab.ch13.attribution.block-016","segment.o018.lab.ch13.attribution.block-017","segment.o018.lab.ch13.attribution.block-018","segment.o018.lab.ch13.readme.block-001","segment.o018.lab.ch13.readme.block-002","segment.o018.lab.ch13.readme.block-003","segment.o018.lab.ch13.readme.block-004","segment.o018.lab.ch13.readme.block-005","segment.o018.lab.ch13.readme.block-006","segment.o018.lab.ch13.readme.block-007","segment.o018.lab.ch13.readme.block-008","segment.o018.lab.ch13.readme.block-009","segment.o018.lab.ch13.readme.block-010","segment.r017.book1.ch13.solutions-manual.block-001","segment.r017.book1.ch13.solutions-manual.block-002","segment.r017.book1.ch13.solutions-manual.block-003","segment.r017.book1.ch13.solutions-manual.block-004","segment.r017.book1.ch13.solutions-manual.block-005","segment.r017.book1.ch13.solutions-manual.block-006","segment.r017.book1.ch13.solutions-manual.block-007","segment.r017.book1.ch13.solutions-manual.block-008","segment.r017.book1.ch13.solutions-manual.block-009","segment.r017.book1.ch13.solutions-manual.block-010","segment.r017.book1.ch13.solutions-manual.block-011","segment.r017.book1.ch13.solutions-manual.block-012","segment.r017.book1.ch13.solutions-manual.block-013","segment.r017.book1.ch13.solutions-manual.block-014","segment.r017.book1.ch13.solutions-manual.block-015","segment.r017.book1.ch13.solutions-manual.block-016","segment.r017.book1.ch13.solutions-manual.block-017","segment.r017.book1.ch13.solutions-manual.block-018","segment.r017.book1.ch13.solutions-manual.block-019","segment.r017.book1.ch13.solutions-manual.block-020","segment.r017.book1.ch13.solutions-manual.block-021","segment.r017.book1.ch13.solutions-manual.block-022","segment.r017.book1.ch13.solutions-manual.block-023","segment.r017.book1.ch13.solutions-manual.block-024","segment.r017.book1.ch13.solutions-manual.block-025","segment.r017.book1.ch13.solutions-manual.block-026","segment.r017.book1.ch13.solutions-manual.block-027","segment.r017.book1.ch13.solutions-manual.block-028","segment.r017.book1.ch13.solutions-manual.block-029","segment.r017.book1.ch13.solutions-manual.block-030","segment.r017.book1.ch13.solutions-manual.block-031","segment.r017.book1.ch13.solutions-manual.block-032","segment.r017.book1.ch13.text.block-001","segment.r017.book1.ch13.text.block-002","segment.r017.book1.ch13.text.block-003","segment.r017.book1.ch13.text.block-004","segment.r017.book1.ch13.text.block-005","segment.r017.book1.ch13.text.block-006","segment.r017.book1.ch13.text.block-007","segment.r017.book1.ch13.text.block-008","segment.r017.book1.ch13.text.block-009","segment.r017.book1.ch13.text.block-010","segment.r017.book1.ch13.text.block-011","segment.r017.book1.ch13.text.block-012","segment.r017.book1.ch13.text.block-013","segment.r017.book1.ch13.text.block-014","segment.r017.book1.ch13.text.block-015","segment.r017.book1.ch13.text.block-016","segment.r017.book1.ch13.text.block-017","segment.r017.book1.ch13.text.block-018","segment.r017.book1.ch13.text.block-019","segment.r017.book1.ch13.text.block-020","segment.r017.book1.ch13.text.block-021","segment.r017.book1.ch13.text.block-022","segment.r017.book1.ch13.text.block-023","segment.r017.book1.ch13.text.block-024","segment.r017.book1.ch13.text.block-025","segment.r017.book1.ch13.text.block-026","segment.r017.book1.ch13.text.block-027","segment.r017.book1.ch13.text.block-028","segment.r017.book1.ch13.text.block-029","segment.r017.book1.ch13.text.block-030","segment.r017.book1.ch13.text.block-031","segment.r017.book1.ch13.text.block-032","segment.r017.book1.ch13.text.block-033","segment.r017.book1.ch13.text.block-034","segment.r017.book1.ch13.text.block-035","segment.r017.book1.ch13.text.block-036","segment.r017.book1.ch13.text.block-037","segment.r017.book1.ch13.text.block-038","segment.r017.book1.ch13.text.block-039","segment.r017.book1.ch13.text.block-040","segment.r017.book1.ch13.text.block-041","segment.r017.book1.ch13.text.block-042","segment.r017.book1.ch13.text.block-043","segment.r017.book1.ch13.text.block-044","segment.r017.book1.ch13.text.block-045","segment.r017.book1.ch13.text.block-046","segment.r017.book1.ch13.text.block-047","segment.r017.book1.ch13.text.block-048","segment.r017.book1.ch13.text.block-049","segment.r017.book1.ch13.text.block-050","segment.r017.book1.ch13.text.block-051","segment.r017.book1.ch13.text.block-052","segment.r017.book1.ch13.text.block-053","segment.r017.book1.ch13.text.block-054","segment.r017.book1.ch13.text.block-055","segment.r017.book1.ch13.text.block-056","segment.r017.book1.ch13.text.block-057","segment.r017.book1.ch13.text.block-058","segment.r017.book1.ch13.text.block-059","segment.r017.book1.ch13.text.block-060","segment.r017.book1.ch13.text.block-061","segment.r017.book1.ch13.text.block-062","segment.r017.book1.ch13.text.block-063","segment.r017.book1.ch13.text.block-064","segment.r017.book1.ch13.text.block-065","segment.r017.book1.ch13.text.block-066","segment.r017.book1.ch13.text.block-067","segment.r017.book1.ch13.text.block-068","segment.r017.book1.ch13.text.block-069","segment.r017.book1.ch13.text.block-070","segment.r017.book1.ch13.text.block-071","segment.r017.book1.ch13.text.block-072","segment.r017.book1.ch13.text.block-073","segment.r017.book1.ch13.text.block-074","segment.r017.book1.ch13.text.block-075","segment.r017.book1.ch13.text.block-076","segment.r017.book1.ch13.text.block-077","segment.r017.book1.ch13.text.block-078","segment.r017.book1.ch13.text.block-079","segment.r017.book1.ch13.text.block-080","segment.r017.book1.ch13.text.block-081","segment.r017.book1.ch13.text.block-082","segment.r017.book1.ch13.text.block-083","segment.r017.book1.ch13.text.block-084","segment.r017.book1.ch13.text.block-085","segment.r017.book1.ch13.text.block-086","segment.r017.book1.ch13.text.block-087","segment.r017.book1.ch13.text.block-088","segment.r017.book1.ch13.text.block-089","segment.r017.book1.ch13.text.block-090","segment.r017.book1.ch13.text.block-091","segment.r017.book1.ch13.text.block-092","segment.r017.book1.ch13.text.block-093","segment.r017.book1.ch13.text.block-094","segment.r017.book1.ch13.text.block-095","segment.r017.book1.ch13.text.block-096","segment.r017.book1.ch13.text.block-097","segment.r017.book1.ch13.text.block-098","segment.r017.book1.ch13.text.block-099","segment.r017.book1.ch13.text.block-100","segment.r017.book1.ch13.text.block-101","segment.r017.book1.ch13.text.block-102","segment.r017.book1.ch13.text.block-103","segment.r017.book1.ch13.text.block-104","segment.r017.book1.ch13.text.block-105","segment.r017.book1.ch13.text.block-106","segment.r017.book1.ch13.text.block-107","segment.r017.book1.ch13.text.block-108","segment.r017.book1.ch13.text.block-109","segment.r017.book1.ch13.text.block-110","segment.r017.book1.ch13.text.block-111","segment.r017.book1.ch13.text.block-112","segment.r017.book1.ch13.text.block-113","segment.r017.book1.ch13.text.block-114","segment.r017.book1.ch13.text.block-115","segment.r017.book1.ch13.text.block-116","segment.r017.book1.ch13.text.block-117","segment.r017.book1.ch13.text.block-118","segment.r017.book1.ch13.text.block-119","segment.r017.book1.ch13.text.block-120","segment.r017.book1.ch13.text.block-121","segment.r017.book1.ch13.text.block-122"],"native":{"concept_id":"concept.multiobjective-optimization","evidence":"Full-corpus id-ID terminology audit","id":"term.multiobjective-optimization.id","preferred":"optimisasi multiobjektif","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"multiobjective optimization","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-059"],"native":{"concept_id":"concept.nonconvex-optimization","evidence":"first-boundary editorial terminology decision","id":"term.nonconvex.id","preferred":"nonkonveks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"geometry and optimization","source_locale":"en","source_term":"nonconvex","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-042","segment.r017.book1.ch01.text.block-043","segment.r017.book1.ch01.text.block-059","segment.r017.book1.ch01.text.block-071","segment.r017.book1.ch01.text.block-074","segment.r017.book1.ch03.text.block-068"],"native":{"concept_id":"concept.nonlinear-programming","evidence":"first-boundary editorial terminology decision","id":"term.nonlinear-programming.id","preferred":"pemrograman nonlinier","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"model class; abbreviation NLP retained","source_locale":"en","source_term":"nonlinear programming","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["pemrograman nonlinear"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-042","segment.r017.book1.ch01.text.block-043","segment.r017.book1.ch01.text.block-052","segment.r017.book1.ch01.text.block-076"],"native":{"concept_id":"concept.computational-complexity","evidence":"first-boundary editorial terminology decision","id":"term.np-hard.id","preferred":"NP-hard","recorded_at":"2026-08-23T00:00:00+02:00","register":"technical","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"complexity class; formal token retained and gloss permitted","source_locale":"en","source_term":"NP-hard","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["NP-sukar"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-004","segment.r017.book1.ch02.text.block-013"],"native":{"concept_id":"concept.objective-function","evidence":"first-boundary editorial decision; 2026-08-22 Indonesian field-usage QA retained the preferred form and added a modern retrieval variant","id":"term.objective-function.id","preferred":"fungsi tujuan","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"optimization model","source_locale":"en","source_term":"objective function","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["fungsi objektif"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.attribution.block-001","segment.o018.lab.attribution.block-002","segment.o018.lab.attribution.block-003","segment.o018.lab.attribution.block-004","segment.o018.lab.attribution.block-005","segment.o018.lab.attribution.block-006","segment.o018.lab.attribution.block-007","segment.o018.lab.attribution.block-008","segment.o018.lab.attribution.block-009","segment.o018.lab.attribution.block-010","segment.o018.lab.ch03.attribution.block-001","segment.o018.lab.ch03.attribution.block-002","segment.o018.lab.ch03.attribution.block-003","segment.o018.lab.ch03.attribution.block-004","segment.o018.lab.ch03.attribution.block-005","segment.o018.lab.ch03.attribution.block-006","segment.o018.lab.ch03.attribution.block-007","segment.o018.lab.ch03.attribution.block-008","segment.o018.lab.ch03.attribution.block-009","segment.o018.lab.ch03.attribution.block-010","segment.o018.lab.ch03.attribution.block-011","segment.o018.lab.ch03.attribution.block-012","segment.o018.lab.ch03.attribution.block-013","segment.o018.lab.ch03.readme.block-001","segment.o018.lab.ch03.readme.block-002","segment.o018.lab.ch03.readme.block-003","segment.o018.lab.ch03.readme.block-004","segment.o018.lab.ch03.readme.block-005","segment.o018.lab.ch03.readme.block-006","segment.o018.lab.ch03.readme.block-007","segment.o018.lab.ch03.readme.block-008","segment.o018.lab.ch03.readme.block-009","segment.o018.lab.ch03.readme.block-010","segment.o018.lab.ch03.readme.block-011","segment.o018.lab.ch03.readme.block-012","segment.o018.lab.ch03.readme.block-013","segment.o018.lab.ch03.readme.block-014","segment.o018.lab.ch03.readme.block-015","segment.o018.lab.ch03.readme.block-016","segment.o018.lab.ch03.readme.block-017","segment.o018.lab.ch03.readme.block-018","segment.o018.lab.ch04.attribution.block-001","segment.o018.lab.ch04.attribution.block-002","segment.o018.lab.ch04.attribution.block-003","segment.o018.lab.ch04.attribution.block-004","segment.o018.lab.ch04.attribution.block-005","segment.o018.lab.ch04.attribution.block-006","segment.o018.lab.ch04.attribution.block-007","segment.o018.lab.ch04.attribution.block-008","segment.o018.lab.ch04.attribution.block-009","segment.o018.lab.ch04.attribution.block-010","segment.o018.lab.ch04.attribution.block-011","segment.o018.lab.ch04.attribution.block-012","segment.o018.lab.ch04.attribution.block-013","segment.o018.lab.ch04.attribution.block-014","segment.o018.lab.ch04.attribution.block-015","segment.o018.lab.ch04.attribution.block-016","segment.o018.lab.ch04.attribution.block-017","segment.o018.lab.ch04.attribution.block-018","segment.o018.lab.ch04.readme.block-001","segment.o018.lab.ch04.readme.block-002","segment.o018.lab.ch04.readme.block-003","segment.o018.lab.ch04.readme.block-004","segment.o018.lab.ch04.readme.block-005","segment.o018.lab.ch04.readme.block-006","segment.o018.lab.ch04.readme.block-007","segment.o018.lab.ch04.readme.block-008","segment.o018.lab.ch04.readme.block-009","segment.o018.lab.ch04.readme.block-010","segment.o018.lab.ch04.readme.block-011","segment.o018.lab.ch04.readme.block-012","segment.o018.lab.ch04.readme.block-013","segment.o018.lab.ch04.readme.block-014","segment.o018.lab.ch04.readme.block-015","segment.o018.lab.ch04.readme.block-016","segment.o018.lab.ch04.readme.block-017","segment.o018.lab.ch04.readme.block-018","segment.o018.lab.ch04.readme.block-019","segment.o018.lab.ch04.readme.block-020","segment.o018.lab.ch04.readme.block-021","segment.o018.lab.ch04.readme.block-022","segment.o018.lab.ch04.readme.block-023","segment.o018.lab.ch04.readme.block-024","segment.o018.lab.ch04.readme.block-025","segment.o018.lab.ch04.readme.block-026","segment.o018.lab.ch05.attribution.block-001","segment.o018.lab.ch05.attribution.block-002","segment.o018.lab.ch05.attribution.block-003","segment.o018.lab.ch05.attribution.block-004","segment.o018.lab.ch05.attribution.block-005","segment.o018.lab.ch05.attribution.block-006","segment.o018.lab.ch05.attribution.block-007","segment.o018.lab.ch05.attribution.block-008","segment.o018.lab.ch05.attribution.block-009","segment.o018.lab.ch05.attribution.block-010","segment.o018.lab.ch05.attribution.block-011","segment.o018.lab.ch05.attribution.block-012","segment.o018.lab.ch05.attribution.block-013","segment.o018.lab.ch05.attribution.block-014","segment.o018.lab.ch05.attribution.block-015","segment.o018.lab.ch05.attribution.block-016","segment.o018.lab.ch05.attribution.block-017","segment.o018.lab.ch05.attribution.block-018","segment.o018.lab.ch05.readme.block-001","segment.o018.lab.ch05.readme.block-002","segment.o018.lab.ch05.readme.block-003","segment.o018.lab.ch05.readme.block-004","segment.o018.lab.ch05.readme.block-005","segment.o018.lab.ch05.readme.block-006","segment.o018.lab.ch05.readme.block-007","segment.o018.lab.ch05.readme.block-008","segment.o018.lab.ch05.readme.block-009","segment.o018.lab.ch05.readme.block-010","segment.o018.lab.ch05.readme.block-011","segment.o018.lab.ch05.readme.block-012","segment.o018.lab.ch05.readme.block-013","segment.o018.lab.ch05.readme.block-014","segment.o018.lab.ch06.attribution.block-001","segment.o018.lab.ch06.attribution.block-002","segment.o018.lab.ch06.attribution.block-003","segment.o018.lab.ch06.attribution.block-004","segment.o018.lab.ch06.attribution.block-005","segment.o018.lab.ch06.attribution.block-006","segment.o018.lab.ch06.attribution.block-007","segment.o018.lab.ch06.attribution.block-008","segment.o018.lab.ch06.attribution.block-009","segment.o018.lab.ch06.attribution.block-010","segment.o018.lab.ch06.attribution.block-011","segment.o018.lab.ch06.attribution.block-012","segment.o018.lab.ch06.attribution.block-013","segment.o018.lab.ch06.attribution.block-014","segment.o018.lab.ch06.attribution.block-015","segment.o018.lab.ch06.readme.block-001","segment.o018.lab.ch06.readme.block-002","segment.o018.lab.ch06.readme.block-003","segment.o018.lab.ch06.readme.block-004","segment.o018.lab.ch06.readme.block-005","segment.o018.lab.ch06.readme.block-006","segment.o018.lab.ch06.readme.block-007","segment.o018.lab.ch06.readme.block-008","segment.o018.lab.ch06.readme.block-009","segment.o018.lab.ch06.readme.block-010","segment.o018.lab.ch10.attribution.block-001","segment.o018.lab.ch10.attribution.block-002","segment.o018.lab.ch10.attribution.block-003","segment.o018.lab.ch10.attribution.block-004","segment.o018.lab.ch10.attribution.block-005","segment.o018.lab.ch10.attribution.block-006","segment.o018.lab.ch10.attribution.block-007","segment.o018.lab.ch10.attribution.block-008","segment.o018.lab.ch10.attribution.block-009","segment.o018.lab.ch10.attribution.block-010","segment.o018.lab.ch10.attribution.block-011","segment.o018.lab.ch10.attribution.block-012","segment.o018.lab.ch10.attribution.block-013","segment.o018.lab.ch10.attribution.block-014","segment.o018.lab.ch10.attribution.block-015","segment.o018.lab.ch10.attribution.block-016","segment.o018.lab.ch10.attribution.block-017","segment.o018.lab.ch10.readme.block-001","segment.o018.lab.ch10.readme.block-002","segment.o018.lab.ch10.readme.block-003","segment.o018.lab.ch10.readme.block-004","segment.o018.lab.ch10.readme.block-005","segment.o018.lab.ch10.readme.block-006","segment.o018.lab.ch10.readme.block-007","segment.o018.lab.ch10.readme.block-008","segment.o018.lab.ch10.readme.block-009","segment.o018.lab.ch10.readme.block-010","segment.o018.lab.ch11.attribution.block-001","segment.o018.lab.ch11.attribution.block-002","segment.o018.lab.ch11.attribution.block-003","segment.o018.lab.ch11.attribution.block-004","segment.o018.lab.ch11.attribution.block-005","segment.o018.lab.ch11.attribution.block-006","segment.o018.lab.ch11.attribution.block-007","segment.o018.lab.ch11.attribution.block-008","segment.o018.lab.ch11.attribution.block-009","segment.o018.lab.ch11.attribution.block-010","segment.o018.lab.ch11.attribution.block-011","segment.o018.lab.ch11.attribution.block-012","segment.o018.lab.ch11.attribution.block-013","segment.o018.lab.ch11.attribution.block-014","segment.o018.lab.ch11.attribution.block-015","segment.o018.lab.ch11.attribution.block-016","segment.o018.lab.ch11.attribution.block-017","segment.o018.lab.ch11.attribution.block-018","segment.o018.lab.ch11.readme.block-001","segment.o018.lab.ch11.readme.block-002","segment.o018.lab.ch11.readme.block-003","segment.o018.lab.ch11.readme.block-004","segment.o018.lab.ch11.readme.block-005","segment.o018.lab.ch11.readme.block-006","segment.o018.lab.ch11.readme.block-007","segment.o018.lab.ch11.readme.block-008","segment.o018.lab.ch11.readme.block-009","segment.o018.lab.ch11.readme.block-010","segment.o018.lab.ch12.attribution.block-001","segment.o018.lab.ch12.attribution.block-002","segment.o018.lab.ch12.attribution.block-003","segment.o018.lab.ch12.attribution.block-004","segment.o018.lab.ch12.attribution.block-005","segment.o018.lab.ch12.attribution.block-006","segment.o018.lab.ch12.attribution.block-007","segment.o018.lab.ch12.attribution.block-008","segment.o018.lab.ch12.attribution.block-009","segment.o018.lab.ch12.attribution.block-010","segment.o018.lab.ch12.attribution.block-011","segment.o018.lab.ch12.attribution.block-012","segment.o018.lab.ch12.attribution.block-013","segment.o018.lab.ch12.attribution.block-014","segment.o018.lab.ch12.readme.block-001","segment.o018.lab.ch12.readme.block-002","segment.o018.lab.ch12.readme.block-003","segment.o018.lab.ch12.readme.block-004","segment.o018.lab.ch12.readme.block-005","segment.o018.lab.ch12.readme.block-006","segment.o018.lab.ch12.readme.block-007","segment.o018.lab.ch12.readme.block-008","segment.o018.lab.ch12.readme.block-009","segment.o018.lab.ch12.readme.block-010","segment.o018.lab.ch12.readme.block-011","segment.o018.lab.ch12.readme.block-012","segment.o018.lab.ch12.readme.block-013","segment.o018.lab.ch13.attribution.block-001","segment.o018.lab.ch13.attribution.block-002","segment.o018.lab.ch13.attribution.block-003","segment.o018.lab.ch13.attribution.block-004","segment.o018.lab.ch13.attribution.block-005","segment.o018.lab.ch13.attribution.block-006","segment.o018.lab.ch13.attribution.block-007","segment.o018.lab.ch13.attribution.block-008","segment.o018.lab.ch13.attribution.block-009","segment.o018.lab.ch13.attribution.block-010","segment.o018.lab.ch13.attribution.block-011","segment.o018.lab.ch13.attribution.block-012","segment.o018.lab.ch13.attribution.block-013","segment.o018.lab.ch13.attribution.block-014","segment.o018.lab.ch13.attribution.block-015","segment.o018.lab.ch13.attribution.block-016","segment.o018.lab.ch13.attribution.block-017","segment.o018.lab.ch13.attribution.block-018","segment.o018.lab.ch13.readme.block-001","segment.o018.lab.ch13.readme.block-002","segment.o018.lab.ch13.readme.block-003","segment.o018.lab.ch13.readme.block-004","segment.o018.lab.ch13.readme.block-005","segment.o018.lab.ch13.readme.block-006","segment.o018.lab.ch13.readme.block-007","segment.o018.lab.ch13.readme.block-008","segment.o018.lab.ch13.readme.block-009","segment.o018.lab.ch13.readme.block-010","segment.o018.lab.ch14.attribution.block-001","segment.o018.lab.ch14.attribution.block-002","segment.o018.lab.ch14.attribution.block-003","segment.o018.lab.ch14.attribution.block-004","segment.o018.lab.ch14.attribution.block-005","segment.o018.lab.ch14.attribution.block-006","segment.o018.lab.ch14.attribution.block-007","segment.o018.lab.ch14.attribution.block-008","segment.o018.lab.ch14.attribution.block-009","segment.o018.lab.ch14.attribution.block-010","segment.o018.lab.ch14.attribution.block-011","segment.o018.lab.ch14.attribution.block-012","segment.o018.lab.ch14.attribution.block-013","segment.o018.lab.ch14.attribution.block-014","segment.o018.lab.ch14.attribution.block-015","segment.o018.lab.ch14.attribution.block-016","segment.o018.lab.ch14.readme.block-001","segment.o018.lab.ch14.readme.block-002","segment.o018.lab.ch14.readme.block-003","segment.o018.lab.ch14.readme.block-004","segment.o018.lab.ch14.readme.block-005","segment.o018.lab.ch14.readme.block-006","segment.o018.lab.ch14.readme.block-007","segment.o018.lab.ch14.readme.block-008","segment.o018.lab.ch14.readme.block-009","segment.o018.lab.ch14.readme.block-010","segment.o018.lab.ch15.attribution.block-001","segment.o018.lab.ch15.attribution.block-002","segment.o018.lab.ch15.attribution.block-003","segment.o018.lab.ch15.attribution.block-004","segment.o018.lab.ch15.attribution.block-005","segment.o018.lab.ch15.attribution.block-006","segment.o018.lab.ch15.attribution.block-007","segment.o018.lab.ch15.attribution.block-008","segment.o018.lab.ch15.attribution.block-009","segment.o018.lab.ch15.attribution.block-010","segment.o018.lab.ch15.attribution.block-011","segment.o018.lab.ch15.attribution.block-012","segment.o018.lab.ch15.attribution.block-013","segment.o018.lab.ch15.attribution.block-014","segment.o018.lab.ch15.attribution.block-015","segment.o018.lab.ch15.readme.block-001","segment.o018.lab.ch15.readme.block-002","segment.o018.lab.ch15.readme.block-003","segment.o018.lab.ch15.readme.block-004","segment.o018.lab.ch15.readme.block-005","segment.o018.lab.ch15.readme.block-006","segment.o018.lab.ch15.readme.block-007","segment.o018.lab.ch15.readme.block-008","segment.o018.lab.ch15.readme.block-009","segment.o018.lab.readme.block-001","segment.o018.lab.readme.block-002","segment.o018.lab.readme.block-003","segment.o018.lab.readme.block-004","segment.o018.lab.readme.block-005","segment.o018.lab.readme.block-006","segment.o018.lab.readme.block-007","segment.o018.lab.readme.block-008","segment.o018.lab.readme.block-009","segment.o018.lab.readme.block-010","segment.o018.lab.readme.block-011","segment.o018.lab.simplex.attribution.block-001","segment.o018.lab.simplex.attribution.block-002","segment.o018.lab.simplex.attribution.block-003","segment.o018.lab.simplex.attribution.block-004","segment.o018.lab.simplex.attribution.block-005","segment.o018.lab.simplex.attribution.block-006","segment.o018.lab.simplex.attribution.block-007","segment.o018.lab.simplex.attribution.block-008","segment.o018.lab.simplex.attribution.block-009","segment.o018.lab.simplex.attribution.block-010","segment.o018.lab.simplex.attribution.block-011","segment.o018.lab.simplex.attribution.block-012","segment.o018.lab.simplex.attribution.block-013","segment.o018.lab.simplex.attribution.block-014","segment.o018.lab.simplex.attribution.block-015","segment.o018.lab.simplex.attribution.block-016","segment.o018.lab.simplex.readme.block-001","segment.o018.lab.simplex.readme.block-002","segment.o018.lab.simplex.readme.block-003","segment.o018.lab.simplex.readme.block-004","segment.o018.lab.simplex.readme.block-005","segment.o018.lab.simplex.readme.block-006","segment.o018.lab.simplex.readme.block-007","segment.o018.lab.simplex.readme.block-008","segment.o018.lab.simplex.readme.block-009","segment.o018.lab.simplex.readme.block-010","segment.r017.book1.backmatter.software-resources.block-001","segment.r017.book1.backmatter.software-resources.block-002","segment.r017.book1.backmatter.software-resources.block-003","segment.r017.book1.backmatter.software-resources.block-004","segment.r017.book1.backmatter.software-resources.block-005","segment.r017.book1.backmatter.software-resources.block-006","segment.r017.book1.backmatter.software-resources.block-007","segment.r017.book1.backmatter.software-resources.block-008","segment.r017.book1.backmatter.software-resources.block-009","segment.r017.book1.backmatter.software-resources.block-010","segment.r017.book1.backmatter.software-resources.block-011","segment.r017.book1.backmatter.software-resources.block-012","segment.r017.book1.backmatter.software-resources.block-013","segment.r017.book1.backmatter.software-resources.block-014","segment.r017.book1.backmatter.software-resources.block-015","segment.r017.book1.backmatter.software-resources.block-016","segment.r017.book1.backmatter.software-resources.block-017","segment.r017.book1.backmatter.software-resources.block-018","segment.r017.book1.backmatter.software-resources.block-019","segment.r017.book1.backmatter.software-resources.block-020","segment.r017.book1.backmatter.software-resources.block-021","segment.r017.book1.backmatter.software-resources.block-022","segment.r017.book1.ch12.text.block-001","segment.r017.book1.ch12.text.block-002","segment.r017.book1.ch12.text.block-003","segment.r017.book1.ch12.text.block-004","segment.r017.book1.ch12.text.block-005","segment.r017.book1.ch12.text.block-006","segment.r017.book1.ch12.text.block-007","segment.r017.book1.ch12.text.block-008","segment.r017.book1.ch12.text.block-009","segment.r017.book1.ch12.text.block-010","segment.r017.book1.ch12.text.block-011","segment.r017.book1.ch12.text.block-012","segment.r017.book1.ch12.text.block-013","segment.r017.book1.ch12.text.block-014","segment.r017.book1.ch12.text.block-015","segment.r017.book1.ch12.text.block-016","segment.r017.book1.ch12.text.block-017","segment.r017.book1.ch12.text.block-018","segment.r017.book1.ch12.text.block-019","segment.r017.book1.ch12.text.block-020","segment.r017.book1.ch12.text.block-021","segment.r017.book1.ch12.text.block-022","segment.r017.book1.ch12.text.block-023","segment.r017.book1.ch12.text.block-024","segment.r017.book1.ch12.text.block-025","segment.r017.book1.ch12.text.block-026","segment.r017.book1.ch12.text.block-027","segment.r017.book1.ch12.text.block-028","segment.r017.book1.ch12.text.block-029","segment.r017.book1.ch12.text.block-030","segment.r017.book1.ch12.text.block-031","segment.r017.book1.ch12.text.block-032","segment.r017.book1.ch12.text.block-033","segment.r017.book1.ch12.text.block-034","segment.r017.book1.ch12.text.block-035","segment.r017.book1.ch12.text.block-036","segment.r017.book1.ch12.text.block-037","segment.r017.book1.ch12.text.block-038","segment.r017.book1.ch12.text.block-039","segment.r017.book1.ch12.text.block-040","segment.r017.book1.ch12.text.block-041","segment.r017.book1.ch12.text.block-042","segment.r017.book1.ch12.text.block-043","segment.r017.book1.ch12.text.block-044","segment.r017.book1.ch12.text.block-045","segment.r017.book1.ch12.text.block-046","segment.r017.book1.ch12.text.block-047","segment.r017.book1.ch12.text.block-048","segment.r017.book1.ch12.text.block-049","segment.r017.book1.ch12.text.block-050","segment.r017.book1.ch12.text.block-051","segment.r017.book1.ch12.text.block-052","segment.r017.book1.ch12.text.block-053","segment.r017.book1.ch12.text.block-054","segment.r017.book1.ch12.text.block-055","segment.r017.book1.ch12.text.block-056","segment.r017.book1.ch12.text.block-057","segment.r017.book1.ch12.text.block-058","segment.r017.book1.ch12.text.block-059","segment.r017.book1.ch12.text.block-060","segment.r017.book1.ch12.text.block-061","segment.r017.book1.ch12.text.block-062","segment.r017.book1.ch12.text.block-063","segment.r017.book1.ch12.text.block-064","segment.r017.book1.ch12.text.block-065","segment.r017.book1.ch12.text.block-066","segment.r017.book1.ch12.text.block-067","segment.r017.book1.ch12.text.block-068","segment.r017.book1.ch12.text.block-069","segment.r017.book1.ch12.text.block-070","segment.r017.book1.ch12.text.block-071","segment.r017.book1.ch12.text.block-072","segment.r017.book1.ch12.text.block-073","segment.r017.book1.ch12.text.block-074","segment.r017.book1.ch12.text.block-075","segment.r017.book1.ch12.text.block-076","segment.r017.book1.ch12.text.block-077","segment.r017.book1.ch12.text.block-078","segment.r017.book1.ch12.text.block-079","segment.r017.book1.ch12.text.block-080","segment.r017.book1.ch12.text.block-081","segment.r017.book1.ch12.text.block-082","segment.r017.book1.ch12.text.block-083","segment.r017.book1.ch12.text.block-084","segment.r017.book1.ch12.text.block-085","segment.r017.book1.ch12.text.block-086","segment.r017.book1.ch12.text.block-087","segment.r017.book1.ch12.text.block-088","segment.r017.book1.ch12.text.block-089","segment.r017.book1.ch12.text.block-090","segment.r017.book1.ch12.text.block-091","segment.r017.book1.ch12.text.block-092","segment.r017.book1.ch12.text.block-093","segment.r017.book1.ch12.text.block-094","segment.r017.book1.ch12.text.block-095","segment.r017.book1.ch12.text.block-096","segment.r017.book1.ch12.text.block-097","segment.r017.book1.ch12.text.block-098","segment.r017.book1.ch12.text.block-099","segment.r017.book1.ch12.text.block-100","segment.r017.book1.ch12.text.block-101","segment.r017.book1.ch12.text.block-102","segment.r017.book1.ch12.text.block-103","segment.r017.book1.ch12.text.block-104","segment.r017.book1.ch12.text.block-105","segment.r017.book1.ch12.text.block-106","segment.r017.book1.ch12.text.block-107","segment.r017.book1.ch12.text.block-108","segment.r017.book1.ch12.text.block-109","segment.r017.book1.ch12.text.block-110","segment.r017.book1.ch12.text.block-111","segment.r017.book1.ch12.text.block-112","segment.r017.book1.ch12.text.block-113","segment.r017.book1.ch12.text.block-114","segment.r017.book1.ch12.text.block-115","segment.r017.book1.ch12.text.block-116","segment.r017.book1.ch12.text.block-117","segment.r017.book1.ch12.text.block-118","segment.r017.book1.ch12.text.block-119","segment.r017.book1.ch12.text.block-120","segment.r017.book1.ch12.text.block-121","segment.r017.book1.ch12.text.block-122","segment.r017.book1.ch12.text.block-123","segment.r017.book1.ch12.text.block-124","segment.r017.book1.ch12.text.block-125","segment.r017.book1.ch12.text.block-126","segment.r017.book1.ch12.text.block-127","segment.r017.book1.ch12.text.block-128","segment.r017.book1.ch12.text.block-129","segment.r017.book1.ch12.text.block-130","segment.r017.book1.ch12.text.block-131","segment.r017.book1.ch12.text.block-132","segment.r017.book1.ch12.text.block-133","segment.r017.book1.ch12.text.block-134","segment.r017.book1.ch12.text.block-135","segment.r017.book1.ch12.text.block-136","segment.r017.book1.ch12.text.block-137","segment.r017.book1.ch12.text.block-138","segment.r017.book1.ch12.text.block-139","segment.r017.book1.ch12.text.block-140","segment.r017.book1.ch12.text.block-141","segment.r017.book1.ch12.text.block-142","segment.r017.book1.ch12.text.block-143","segment.r017.book1.ch12.text.block-144","segment.r017.book1.ch12.text.block-145","segment.r017.book1.ch12.text.block-146","segment.r017.book1.ch12.text.block-147","segment.r017.book1.ch12.text.block-148","segment.r017.book1.ch12.text.block-149","segment.r017.book1.ch12.text.block-150","segment.r017.book1.ch12.text.block-151","segment.r017.book1.ch12.text.block-152","segment.r017.book1.ch12.text.block-153","segment.r017.book1.ch12.text.block-154","segment.r017.book1.ch12.text.block-155","segment.r017.book1.ch12.text.block-156","segment.r017.book1.ch12.text.block-157","segment.r017.book1.ch12.text.block-158","segment.r017.book1.ch12.text.block-159","segment.r017.book1.ch12.text.block-160","segment.r017.book1.ch12.text.block-161","segment.r017.book1.ch12.text.block-162","segment.r017.book1.ch12.text.block-163","segment.r017.book1.ch12.text.block-164","segment.r017.book1.ch12.text.block-165","segment.r017.book1.ch12.text.block-166","segment.r017.book1.ch12.text.block-167","segment.r017.book1.ch12.text.block-168","segment.r017.book1.ch12.text.block-169","segment.r017.book1.ch12.text.block-170","segment.r017.book1.ch12.text.block-171","segment.r017.book1.ch12.text.block-172","segment.r017.book1.ch12.text.block-173","segment.r017.book1.ch12.text.block-174","segment.r017.book1.ch12.text.block-175","segment.r017.book1.ch12.text.block-176","segment.r017.book1.ch12.text.block-177","segment.r017.book1.ch12.text.block-178","segment.r017.book1.ch12.text.block-179","segment.r017.book1.ch12.text.block-180","segment.r017.book1.ch12.text.block-181","segment.r017.book1.ch12.text.block-182","segment.r017.book1.ch12.text.block-183","segment.r017.book1.ch12.text.block-184","segment.r017.book1.ch12.text.block-185","segment.r017.book1.ch12.text.block-186","segment.r017.book1.ch12.text.block-187","segment.r017.book1.ch12.text.block-188","segment.r017.book1.ch12.text.block-189","segment.r017.book1.ch12.text.block-190","segment.r017.book1.ch12.text.block-191","segment.r017.book1.ch12.text.block-192","segment.r017.book1.ch12.text.block-193","segment.r017.book1.ch12.text.block-194","segment.r017.book1.ch12.text.block-195","segment.r017.book1.ch12.text.block-196","segment.r017.book1.ch12.text.block-197","segment.r017.book1.ch12.text.block-198","segment.r017.book1.ch12.text.block-199","segment.r017.book1.ch12.text.block-200","segment.r017.book1.ch12.text.block-201","segment.r017.book1.ch12.text.block-202","segment.r017.book1.ch12.text.block-203","segment.r017.book1.ch12.text.block-204","segment.r017.book1.ch12.text.block-205","segment.r017.book1.ch12.text.block-206","segment.r017.book1.ch12.text.block-207","segment.r017.book1.ch12.text.block-208","segment.r017.book1.ch12.text.block-209","segment.r017.book1.ch12.text.block-210","segment.r017.book1.ch12.text.block-211","segment.r017.book1.ch12.text.block-212","segment.r017.book1.ch12.text.block-213","segment.r017.book1.ch12.text.block-214","segment.r017.book1.ch12.text.block-215","segment.r017.book1.ch12.text.block-216","segment.r017.book1.ch12.text.block-217","segment.r017.book1.ch12.text.block-218","segment.r017.book1.ch12.text.block-219","segment.r017.book1.ch12.text.block-220","segment.r017.book1.ch12.text.block-221","segment.r017.book1.ch12.text.block-222","segment.r017.book1.ch12.text.block-223","segment.r017.book1.ch12.text.block-224","segment.r017.book1.ch12.text.block-225","segment.r017.book1.ch12.text.block-226","segment.r017.book1.ch12.text.block-227","segment.r017.book1.ch12.text.block-228","segment.r017.book1.ch12.text.block-229","segment.r017.book1.ch12.text.block-230","segment.r017.book1.ch12.text.block-231","segment.r017.book1.ch12.text.block-232","segment.r017.book1.ch12.text.block-233","segment.r017.book1.ch12.text.block-234","segment.r017.book1.ch12.text.block-235","segment.r017.book1.ch12.text.block-236","segment.r017.book1.ch12.text.block-237","segment.r017.book1.ch12.text.block-238","segment.r017.book1.ch12.text.block-239","segment.r017.book1.ch12.text.block-240","segment.r017.book1.ch12.text.block-241","segment.r017.book1.ch12.text.block-242","segment.r017.book1.ch12.text.block-243","segment.r017.book1.ch12.text.block-244","segment.r017.book1.ch12.text.block-245","segment.r017.book1.ch12.text.block-246","segment.r017.book1.ch12.text.block-247","segment.r017.book1.ch12.text.block-248","segment.r017.book1.ch12.text.block-249","segment.r017.book1.ch12.text.block-250","segment.r017.book1.ch12.text.block-251","segment.r017.book1.ch12.text.block-252","segment.r017.book1.ch12.text.block-253","segment.r017.book1.ch12.text.block-254","segment.r017.book1.ch12.text.block-255","segment.r017.book1.ch12.text.block-256","segment.r017.book1.ch12.text.block-257","segment.r017.book1.ch12.text.block-258","segment.r017.book1.ch12.text.block-259","segment.r017.book1.ch12.text.block-260","segment.r017.book1.ch12.text.block-261","segment.r017.book1.ch12.text.block-262","segment.r017.book1.ch12.text.block-263","segment.r017.book1.ch12.text.block-264","segment.r017.book1.ch12.text.block-265","segment.r017.book1.ch12.text.block-266","segment.r017.book1.ch12.text.block-267","segment.r017.book1.ch12.text.block-268","segment.r017.book1.ch12.text.block-269","segment.r017.book1.ch12.text.block-270","segment.r017.book1.ch12.text.block-271","segment.r017.book1.ch12.text.block-272","segment.r017.book1.ch12.text.block-273","segment.r017.book1.ch12.text.block-274","segment.r017.book1.ch12.text.block-275","segment.r017.book1.ch12.text.block-276","segment.r017.book1.ch12.text.block-277","segment.r017.book1.ch12.text.block-278","segment.r017.book1.ch12.text.block-279","segment.r017.book1.ch12.text.block-280","segment.r017.book1.ch12.text.block-281","segment.r017.book1.ch12.text.block-282","segment.r017.book1.ch12.text.block-283","segment.r017.book1.ch12.text.block-284","segment.r017.book1.ch12.text.block-285","segment.r017.book1.ch12.text.block-286","segment.r017.book1.ch12.text.block-287","segment.r017.book1.ch12.text.block-288","segment.r017.book1.ch12.text.block-289","segment.r017.book1.ch12.text.block-290","segment.r017.book1.ch12.text.block-291","segment.r017.book1.ch12.text.block-292","segment.r017.book1.ch12.text.block-293","segment.r017.book1.ch12.text.block-294","segment.r017.book1.ch12.text.block-295","segment.r017.book1.ch12.text.block-296","segment.r017.book1.ch12.text.block-297","segment.r017.book1.ch12.text.block-298","segment.r017.book1.ch12.text.block-299","segment.r017.book1.ch12.text.block-300","segment.r017.book1.ch12.text.block-301","segment.r017.book1.ch12.text.block-302","segment.r017.book1.ch12.text.block-303","segment.r017.book1.ch12.text.block-304","segment.r017.book1.ch12.text.block-305","segment.r017.book1.ch12.text.block-306","segment.r017.book1.ch12.text.block-307","segment.r017.book1.ch12.text.block-308","segment.r017.book1.ch12.text.block-309","segment.r017.book1.ch12.text.block-310","segment.r017.book1.ch12.text.block-311","segment.r017.book1.ch12.text.block-312","segment.r017.book1.ch12.text.block-313","segment.r017.book1.ch12.text.block-314","segment.r017.book1.ch12.text.block-315","segment.r017.book1.ch12.text.block-316","segment.r017.book1.ch12.text.block-317","segment.r017.book1.ch12.text.block-318","segment.r017.book1.ch12.text.block-319","segment.r017.book1.ch12.text.block-320","segment.r017.book1.ch12.text.block-321","segment.r017.book1.ch12.text.block-322","segment.r017.book1.ch12.text.block-323","segment.r017.book1.ch12.text.block-324","segment.r017.book1.ch12.text.block-325","segment.r017.book1.ch12.text.block-326","segment.r017.book1.ch12.text.block-327","segment.r017.book1.ch12.text.block-328","segment.r017.book1.ch12.text.block-329","segment.r017.book1.ch12.text.block-330","segment.r017.book1.ch12.text.block-331","segment.r017.book1.ch12.text.block-332","segment.r017.book1.ch12.text.block-333","segment.r017.book1.ch12.text.block-334","segment.r017.book1.ch12.text.block-335","segment.r017.book1.ch12.text.block-336","segment.r017.book1.ch12.text.block-337","segment.r017.book1.ch12.text.block-338","segment.r017.book1.ch12.text.block-339","segment.r017.book1.ch12.text.block-340","segment.r017.book1.ch12.text.block-341","segment.r017.book1.ch12.text.block-342","segment.r017.book1.ch12.text.block-343","segment.r017.book1.ch12.text.block-344","segment.r017.book1.ch12.text.block-345","segment.r017.book1.ch12.text.block-346","segment.r017.book1.ch12.text.block-347","segment.r017.book1.ch12.text.block-348","segment.r017.book1.ch12.text.block-349","segment.r017.book1.ch12.text.block-350","segment.r017.book1.ch12.text.block-351","segment.r017.book1.ch12.text.block-352","segment.r017.book1.ch12.text.block-353","segment.r017.book1.ch12.text.block-354","segment.r017.book1.ch12.text.block-355","segment.r017.book1.ch12.text.block-356","segment.r017.book1.ch12.text.block-357","segment.r017.book1.ch12.text.block-358","segment.r017.book1.ch12.text.block-359"],"native":{"concept_id":"concept.open-source-solver","evidence":"O018 README and attribution","id":"term.open-source-solver.id","preferred":"pemecah sumber terbuka","recorded_at":"2026-08-23T00:00:00+02:00","register":"technical","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"O018 computational laboratory","source_locale":"en","source_term":"open-source solver","status":"source_frozen","supersedes_id":null,"target_locale":"id-ID","variants":["solver sumber terbuka"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-024","segment.r017.book1.ch01.text.block-039"],"native":{"concept_id":"concept.operations-research","evidence":"first-boundary editorial terminology decision","id":"term.operations-research.id","preferred":"riset operasi","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"discipline","source_locale":"en","source_term":"operations research","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["penelitian operasi"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch01.text.block-004","segment.r017.book1.ch01.text.block-030","segment.r017.book1.ch01.text.block-032"],"native":{"concept_id":"concept.optimization-model","evidence":"Final id-ID corpus terminology audit","id":"term.optimization-model.id","preferred":"model optimisasi","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"optimization model","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.optimization","evidence":"first-boundary editorial decision; 2026-08-22 Indonesian field-usage QA confirmed both forms in mathematical usage and did not justify a mass replacement","id":"term.optimization.id","preferred":"optimisasi","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"general","source_locale":"en","source_term":"optimization","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["optimasi"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch13.attribution.block-001","segment.o018.lab.ch13.attribution.block-002","segment.o018.lab.ch13.attribution.block-003","segment.o018.lab.ch13.attribution.block-004","segment.o018.lab.ch13.attribution.block-005","segment.o018.lab.ch13.attribution.block-006","segment.o018.lab.ch13.attribution.block-007","segment.o018.lab.ch13.attribution.block-008","segment.o018.lab.ch13.attribution.block-009","segment.o018.lab.ch13.attribution.block-010","segment.o018.lab.ch13.attribution.block-011","segment.o018.lab.ch13.attribution.block-012","segment.o018.lab.ch13.attribution.block-013","segment.o018.lab.ch13.attribution.block-014","segment.o018.lab.ch13.attribution.block-015","segment.o018.lab.ch13.attribution.block-016","segment.o018.lab.ch13.attribution.block-017","segment.o018.lab.ch13.attribution.block-018","segment.o018.lab.ch13.readme.block-001","segment.o018.lab.ch13.readme.block-002","segment.o018.lab.ch13.readme.block-003","segment.o018.lab.ch13.readme.block-004","segment.o018.lab.ch13.readme.block-005","segment.o018.lab.ch13.readme.block-006","segment.o018.lab.ch13.readme.block-007","segment.o018.lab.ch13.readme.block-008","segment.o018.lab.ch13.readme.block-009","segment.o018.lab.ch13.readme.block-010","segment.r017.book1.ch13.solutions-manual.block-001","segment.r017.book1.ch13.solutions-manual.block-002","segment.r017.book1.ch13.solutions-manual.block-003","segment.r017.book1.ch13.solutions-manual.block-004","segment.r017.book1.ch13.solutions-manual.block-005","segment.r017.book1.ch13.solutions-manual.block-006","segment.r017.book1.ch13.solutions-manual.block-007","segment.r017.book1.ch13.solutions-manual.block-008","segment.r017.book1.ch13.solutions-manual.block-009","segment.r017.book1.ch13.solutions-manual.block-010","segment.r017.book1.ch13.solutions-manual.block-011","segment.r017.book1.ch13.solutions-manual.block-012","segment.r017.book1.ch13.solutions-manual.block-013","segment.r017.book1.ch13.solutions-manual.block-014","segment.r017.book1.ch13.solutions-manual.block-015","segment.r017.book1.ch13.solutions-manual.block-016","segment.r017.book1.ch13.solutions-manual.block-017","segment.r017.book1.ch13.solutions-manual.block-018","segment.r017.book1.ch13.solutions-manual.block-019","segment.r017.book1.ch13.solutions-manual.block-020","segment.r017.book1.ch13.solutions-manual.block-021","segment.r017.book1.ch13.solutions-manual.block-022","segment.r017.book1.ch13.solutions-manual.block-023","segment.r017.book1.ch13.solutions-manual.block-024","segment.r017.book1.ch13.solutions-manual.block-025","segment.r017.book1.ch13.solutions-manual.block-026","segment.r017.book1.ch13.solutions-manual.block-027","segment.r017.book1.ch13.solutions-manual.block-028","segment.r017.book1.ch13.solutions-manual.block-029","segment.r017.book1.ch13.solutions-manual.block-030","segment.r017.book1.ch13.solutions-manual.block-031","segment.r017.book1.ch13.solutions-manual.block-032","segment.r017.book1.ch13.text.block-001","segment.r017.book1.ch13.text.block-002","segment.r017.book1.ch13.text.block-003","segment.r017.book1.ch13.text.block-004","segment.r017.book1.ch13.text.block-005","segment.r017.book1.ch13.text.block-006","segment.r017.book1.ch13.text.block-007","segment.r017.book1.ch13.text.block-008","segment.r017.book1.ch13.text.block-009","segment.r017.book1.ch13.text.block-010","segment.r017.book1.ch13.text.block-011","segment.r017.book1.ch13.text.block-012","segment.r017.book1.ch13.text.block-013","segment.r017.book1.ch13.text.block-014","segment.r017.book1.ch13.text.block-015","segment.r017.book1.ch13.text.block-016","segment.r017.book1.ch13.text.block-017","segment.r017.book1.ch13.text.block-018","segment.r017.book1.ch13.text.block-019","segment.r017.book1.ch13.text.block-020","segment.r017.book1.ch13.text.block-021","segment.r017.book1.ch13.text.block-022","segment.r017.book1.ch13.text.block-023","segment.r017.book1.ch13.text.block-024","segment.r017.book1.ch13.text.block-025","segment.r017.book1.ch13.text.block-026","segment.r017.book1.ch13.text.block-027","segment.r017.book1.ch13.text.block-028","segment.r017.book1.ch13.text.block-029","segment.r017.book1.ch13.text.block-030","segment.r017.book1.ch13.text.block-031","segment.r017.book1.ch13.text.block-032","segment.r017.book1.ch13.text.block-033","segment.r017.book1.ch13.text.block-034","segment.r017.book1.ch13.text.block-035","segment.r017.book1.ch13.text.block-036","segment.r017.book1.ch13.text.block-037","segment.r017.book1.ch13.text.block-038","segment.r017.book1.ch13.text.block-039","segment.r017.book1.ch13.text.block-040","segment.r017.book1.ch13.text.block-041","segment.r017.book1.ch13.text.block-042","segment.r017.book1.ch13.text.block-043","segment.r017.book1.ch13.text.block-044","segment.r017.book1.ch13.text.block-045","segment.r017.book1.ch13.text.block-046","segment.r017.book1.ch13.text.block-047","segment.r017.book1.ch13.text.block-048","segment.r017.book1.ch13.text.block-049","segment.r017.book1.ch13.text.block-050","segment.r017.book1.ch13.text.block-051","segment.r017.book1.ch13.text.block-052","segment.r017.book1.ch13.text.block-053","segment.r017.book1.ch13.text.block-054","segment.r017.book1.ch13.text.block-055","segment.r017.book1.ch13.text.block-056","segment.r017.book1.ch13.text.block-057","segment.r017.book1.ch13.text.block-058","segment.r017.book1.ch13.text.block-059","segment.r017.book1.ch13.text.block-060","segment.r017.book1.ch13.text.block-061","segment.r017.book1.ch13.text.block-062","segment.r017.book1.ch13.text.block-063","segment.r017.book1.ch13.text.block-064","segment.r017.book1.ch13.text.block-065","segment.r017.book1.ch13.text.block-066","segment.r017.book1.ch13.text.block-067","segment.r017.book1.ch13.text.block-068","segment.r017.book1.ch13.text.block-069","segment.r017.book1.ch13.text.block-070","segment.r017.book1.ch13.text.block-071","segment.r017.book1.ch13.text.block-072","segment.r017.book1.ch13.text.block-073","segment.r017.book1.ch13.text.block-074","segment.r017.book1.ch13.text.block-075","segment.r017.book1.ch13.text.block-076","segment.r017.book1.ch13.text.block-077","segment.r017.book1.ch13.text.block-078","segment.r017.book1.ch13.text.block-079","segment.r017.book1.ch13.text.block-080","segment.r017.book1.ch13.text.block-081","segment.r017.book1.ch13.text.block-082","segment.r017.book1.ch13.text.block-083","segment.r017.book1.ch13.text.block-084","segment.r017.book1.ch13.text.block-085","segment.r017.book1.ch13.text.block-086","segment.r017.book1.ch13.text.block-087","segment.r017.book1.ch13.text.block-088","segment.r017.book1.ch13.text.block-089","segment.r017.book1.ch13.text.block-090","segment.r017.book1.ch13.text.block-091","segment.r017.book1.ch13.text.block-092","segment.r017.book1.ch13.text.block-093","segment.r017.book1.ch13.text.block-094","segment.r017.book1.ch13.text.block-095","segment.r017.book1.ch13.text.block-096","segment.r017.book1.ch13.text.block-097","segment.r017.book1.ch13.text.block-098","segment.r017.book1.ch13.text.block-099","segment.r017.book1.ch13.text.block-100","segment.r017.book1.ch13.text.block-101","segment.r017.book1.ch13.text.block-102","segment.r017.book1.ch13.text.block-103","segment.r017.book1.ch13.text.block-104","segment.r017.book1.ch13.text.block-105","segment.r017.book1.ch13.text.block-106","segment.r017.book1.ch13.text.block-107","segment.r017.book1.ch13.text.block-108","segment.r017.book1.ch13.text.block-109","segment.r017.book1.ch13.text.block-110","segment.r017.book1.ch13.text.block-111","segment.r017.book1.ch13.text.block-112","segment.r017.book1.ch13.text.block-113","segment.r017.book1.ch13.text.block-114","segment.r017.book1.ch13.text.block-115","segment.r017.book1.ch13.text.block-116","segment.r017.book1.ch13.text.block-117","segment.r017.book1.ch13.text.block-118","segment.r017.book1.ch13.text.block-119","segment.r017.book1.ch13.text.block-120","segment.r017.book1.ch13.text.block-121","segment.r017.book1.ch13.text.block-122"],"native":{"concept_id":"concept.pareto-optimality","evidence":"Full-corpus id-ID terminology audit","id":"term.pareto-optimality.id","preferred":"optimalitas Pareto","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"Pareto optimality","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.partitioned-variables","evidence":"Final id-ID corpus terminology audit","id":"term.partitioned-variables.id","preferred":"pemartisian variabel basis dan nonbasis","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"basic and nonbasic variable partition","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.phase-one","evidence":"Chapter 7 terminology decision","id":"term.phase-one.id","preferred":"Fase I","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"simplex initialization","source_locale":"en","source_term":"Phase I","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["fase pertama"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.pivot-operation","evidence":"Chapters 7--9 terminology decision","id":"term.pivot.id","preferred":"pivot","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"simplex method","source_locale":"en","source_term":"pivot","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["operasi pivot"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch06.text.block-045","segment.r017.book1.ch06.text.block-069","segment.r017.book1.ch06.text.block-124","segment.r017.book1.ch06.text.block-149"],"native":{"concept_id":"concept.polyhedron","evidence":"Chapter 6 terminology decision","id":"term.polyhedron.id","preferred":"polihedron","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"polyhedral geometry","source_locale":"en","source_term":"polyhedron","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch14.attribution.block-001","segment.o018.lab.ch14.attribution.block-002","segment.o018.lab.ch14.attribution.block-003","segment.o018.lab.ch14.attribution.block-004","segment.o018.lab.ch14.attribution.block-005","segment.o018.lab.ch14.attribution.block-006","segment.o018.lab.ch14.attribution.block-007","segment.o018.lab.ch14.attribution.block-008","segment.o018.lab.ch14.attribution.block-009","segment.o018.lab.ch14.attribution.block-010","segment.o018.lab.ch14.attribution.block-011","segment.o018.lab.ch14.attribution.block-012","segment.o018.lab.ch14.attribution.block-013","segment.o018.lab.ch14.attribution.block-014","segment.o018.lab.ch14.attribution.block-015","segment.o018.lab.ch14.attribution.block-016","segment.o018.lab.ch14.readme.block-001","segment.o018.lab.ch14.readme.block-002","segment.o018.lab.ch14.readme.block-003","segment.o018.lab.ch14.readme.block-004","segment.o018.lab.ch14.readme.block-005","segment.o018.lab.ch14.readme.block-006","segment.o018.lab.ch14.readme.block-007","segment.o018.lab.ch14.readme.block-008","segment.o018.lab.ch14.readme.block-009","segment.o018.lab.ch14.readme.block-010","segment.r017.book1.ch14.text.block-001","segment.r017.book1.ch14.text.block-002","segment.r017.book1.ch14.text.block-003","segment.r017.book1.ch14.text.block-004","segment.r017.book1.ch14.text.block-005","segment.r017.book1.ch14.text.block-006","segment.r017.book1.ch14.text.block-007","segment.r017.book1.ch14.text.block-008","segment.r017.book1.ch14.text.block-009","segment.r017.book1.ch14.text.block-010","segment.r017.book1.ch14.text.block-011","segment.r017.book1.ch14.text.block-012","segment.r017.book1.ch14.text.block-013","segment.r017.book1.ch14.text.block-014","segment.r017.book1.ch14.text.block-015","segment.r017.book1.ch14.text.block-016","segment.r017.book1.ch14.text.block-017","segment.r017.book1.ch14.text.block-018","segment.r017.book1.ch14.text.block-019","segment.r017.book1.ch14.text.block-020","segment.r017.book1.ch14.text.block-021","segment.r017.book1.ch14.text.block-022","segment.r017.book1.ch14.text.block-023","segment.r017.book1.ch14.text.block-024","segment.r017.book1.ch14.text.block-025","segment.r017.book1.ch14.text.block-026","segment.r017.book1.ch14.text.block-027","segment.r017.book1.ch14.text.block-028","segment.r017.book1.ch14.text.block-029","segment.r017.book1.ch14.text.block-030","segment.r017.book1.ch14.text.block-031","segment.r017.book1.ch14.text.block-032","segment.r017.book1.ch14.text.block-033","segment.r017.book1.ch14.text.block-034","segment.r017.book1.ch14.text.block-035","segment.r017.book1.ch14.text.block-036","segment.r017.book1.ch14.text.block-037","segment.r017.book1.ch14.text.block-038","segment.r017.book1.ch14.text.block-039","segment.r017.book1.ch14.text.block-040","segment.r017.book1.ch14.text.block-041","segment.r017.book1.ch14.text.block-042","segment.r017.book1.ch14.text.block-043","segment.r017.book1.ch14.text.block-044","segment.r017.book1.ch14.text.block-045","segment.r017.book1.ch14.text.block-046","segment.r017.book1.ch14.text.block-047","segment.r017.book1.ch14.text.block-048","segment.r017.book1.ch14.text.block-049","segment.r017.book1.ch14.text.block-050","segment.r017.book1.ch14.text.block-051","segment.r017.book1.ch14.text.block-052","segment.r017.book1.ch14.text.block-053","segment.r017.book1.ch14.text.block-054","segment.r017.book1.ch14.text.block-055","segment.r017.book1.ch14.text.block-056","segment.r017.book1.ch14.text.block-057","segment.r017.book1.ch14.text.block-058","segment.r017.book1.ch14.text.block-059","segment.r017.book1.ch14.text.block-060","segment.r017.book1.ch14.text.block-061","segment.r017.book1.ch14.text.block-062","segment.r017.book1.ch14.text.block-063","segment.r017.book1.ch14.text.block-064","segment.r017.book1.ch14.text.block-065","segment.r017.book1.ch14.text.block-066","segment.r017.book1.ch14.text.block-067","segment.r017.book1.ch14.text.block-068","segment.r017.book1.ch14.text.block-069","segment.r017.book1.ch14.text.block-070","segment.r017.book1.ch14.text.block-071","segment.r017.book1.ch14.text.block-072","segment.r017.book1.ch14.text.block-073","segment.r017.book1.ch14.text.block-074","segment.r017.book1.ch14.text.block-075","segment.r017.book1.ch14.text.block-076","segment.r017.book1.ch14.text.block-077","segment.r017.book1.ch14.text.block-078","segment.r017.book1.ch14.text.block-079","segment.r017.book1.ch14.text.block-080","segment.r017.book1.ch14.text.block-081","segment.r017.book1.ch14.text.block-082","segment.r017.book1.ch14.text.block-083","segment.r017.book1.ch14.text.block-084","segment.r017.book1.ch14.text.block-085","segment.r017.book1.ch14.text.block-086","segment.r017.book1.ch14.text.block-087","segment.r017.book1.ch14.text.block-088","segment.r017.book1.ch14.text.block-089","segment.r017.book1.ch14.text.block-090","segment.r017.book1.ch14.text.block-091","segment.r017.book1.ch14.text.block-092","segment.r017.book1.ch14.text.block-093","segment.r017.book1.ch14.text.block-094","segment.r017.book1.ch14.text.block-095","segment.r017.book1.ch14.text.block-096","segment.r017.book1.ch14.text.block-097","segment.r017.book1.ch14.text.block-098","segment.r017.book1.ch14.text.block-099","segment.r017.book1.ch14.text.block-100","segment.r017.book1.ch14.text.block-101","segment.r017.book1.ch14.text.block-102","segment.r017.book1.ch14.text.block-103","segment.r017.book1.ch14.text.block-104","segment.r017.book1.ch14.text.block-105","segment.r017.book1.ch14.text.block-106","segment.r017.book1.ch14.text.block-107","segment.r017.book1.ch14.text.block-108","segment.r017.book1.ch14.text.block-109","segment.r017.book1.ch14.text.block-110","segment.r017.book1.ch14.text.block-111","segment.r017.book1.ch14.text.block-112","segment.r017.book1.ch14.text.block-113","segment.r017.book1.ch14.text.block-114","segment.r017.book1.ch14.text.block-115","segment.r017.book1.ch14.text.block-116","segment.r017.book1.ch14.text.block-117","segment.r017.book1.ch14.text.block-118","segment.r017.book1.ch14.text.block-119","segment.r017.book1.ch14.text.block-120","segment.r017.book1.ch14.text.block-121","segment.r017.book1.ch14.text.block-122","segment.r017.book1.ch14.text.block-123","segment.r017.book1.ch14.text.block-124","segment.r017.book1.ch14.text.block-125","segment.r017.book1.ch14.text.block-126","segment.r017.book1.ch14.text.block-127","segment.r017.book1.ch14.text.block-128","segment.r017.book1.ch14.text.block-129","segment.r017.book1.ch14.text.block-130","segment.r017.book1.ch14.text.block-131","segment.r017.book1.ch14.text.block-132","segment.r017.book1.ch14.text.block-133","segment.r017.book1.ch14.text.block-134","segment.r017.book1.ch14.text.block-135","segment.r017.book1.ch14.text.block-136","segment.r017.book1.ch14.text.block-137","segment.r017.book1.ch14.text.block-138","segment.r017.book1.ch14.text.block-139","segment.r017.book1.ch14.text.block-140","segment.r017.book1.ch14.text.block-141","segment.r017.book1.ch14.text.block-142","segment.r017.book1.ch14.text.block-143","segment.r017.book1.ch14.text.block-144","segment.r017.book1.ch14.text.block-145","segment.r017.book1.ch14.text.block-146","segment.r017.book1.ch14.text.block-147","segment.r017.book1.ch14.text.block-148","segment.r017.book1.ch14.text.block-149","segment.r017.book1.ch14.text.block-150","segment.r017.book1.ch14.text.block-151","segment.r017.book1.ch14.text.block-152","segment.r017.book1.ch14.text.block-153","segment.r017.book1.ch14.text.block-154","segment.r017.book1.ch14.text.block-155","segment.r017.book1.ch14.text.block-156","segment.r017.book1.ch14.text.block-157","segment.r017.book1.ch14.text.block-158","segment.r017.book1.ch14.text.block-159","segment.r017.book1.ch14.text.block-160","segment.r017.book1.ch14.text.block-161","segment.r017.book1.ch14.text.block-162","segment.r017.book1.ch14.text.block-163","segment.r017.book1.ch14.text.block-164","segment.r017.book1.ch14.text.block-165","segment.r017.book1.ch14.text.block-166","segment.r017.book1.ch14.text.block-167","segment.r017.book1.ch14.text.block-168","segment.r017.book1.ch14.text.block-169","segment.r017.book1.ch14.text.block-170","segment.r017.book1.ch14.text.block-171","segment.r017.book1.ch14.text.block-172","segment.r017.book1.ch14.text.block-173","segment.r017.book1.ch14.text.block-174","segment.r017.book1.ch14.text.block-175","segment.r017.book1.ch14.text.block-176","segment.r017.book1.ch14.text.block-177","segment.r017.book1.ch14.text.block-178","segment.r017.book1.ch14.text.block-179","segment.r017.book1.ch14.text.block-180","segment.r017.book1.ch14.text.block-181","segment.r017.book1.ch14.text.block-182","segment.r017.book1.ch14.text.block-183","segment.r017.book1.ch14.text.block-184","segment.r017.book1.ch14.text.block-185","segment.r017.book1.ch14.text.block-186","segment.r017.book1.ch14.text.block-187","segment.r017.book1.ch14.text.block-188","segment.r017.book1.ch14.text.block-189","segment.r017.book1.ch14.text.block-190","segment.r017.book1.ch14.text.block-191","segment.r017.book1.ch14.text.block-192","segment.r017.book1.ch14.text.block-193","segment.r017.book1.ch14.text.block-194","segment.r017.book1.ch14.text.block-195","segment.r017.book1.ch14.text.block-196","segment.r017.book1.ch14.text.block-197","segment.r017.book1.ch14.text.block-198","segment.r017.book1.ch14.text.block-199","segment.r017.book1.ch14.text.block-200","segment.r017.book1.ch14.text.block-201","segment.r017.book1.ch14.text.block-202","segment.r017.book1.ch14.text.block-203","segment.r017.book1.ch14.text.block-204","segment.r017.book1.ch14.text.block-205","segment.r017.book1.ch14.text.block-206","segment.r017.book1.ch14.text.block-207","segment.r017.book1.ch14.text.block-208","segment.r017.book1.ch14.text.block-209","segment.r017.book1.ch14.text.block-210","segment.r017.book1.ch14.text.block-211","segment.r017.book1.ch14.text.block-212","segment.r017.book1.ch14.text.block-213","segment.r017.book1.ch14.text.block-214","segment.r017.book1.ch14.text.block-215","segment.r017.book1.ch14.text.block-216","segment.r017.book1.ch14.text.block-217","segment.r017.book1.ch14.text.block-218","segment.r017.book1.ch14.text.block-219","segment.r017.book1.ch14.text.block-220","segment.r017.book1.ch14.text.block-221","segment.r017.book1.ch14.text.block-222","segment.r017.book1.ch14.text.block-223","segment.r017.book1.ch14.text.block-224","segment.r017.book1.ch14.text.block-225","segment.r017.book1.ch14.text.block-226","segment.r017.book1.ch14.text.block-227","segment.r017.book1.ch14.text.block-228","segment.r017.book1.ch14.text.block-229","segment.r017.book1.ch14.text.block-230","segment.r017.book1.ch14.text.block-231","segment.r017.book1.ch14.text.block-232","segment.r017.book1.ch14.text.block-233","segment.r017.book1.ch14.text.block-234","segment.r017.book1.ch14.text.block-235","segment.r017.book1.ch14.text.block-236","segment.r017.book1.ch14.text.block-237","segment.r017.book1.ch14.text.block-238","segment.r017.book1.ch14.text.block-239","segment.r017.book1.ch14.text.block-240","segment.r017.book1.ch14.text.block-241","segment.r017.book1.ch14.text.block-242","segment.r017.book1.ch14.text.block-243","segment.r017.book1.ch14.text.block-244","segment.r017.book1.ch14.text.block-245","segment.r017.book1.ch14.text.block-246","segment.r017.book1.ch14.text.block-247","segment.r017.book1.ch14.text.block-248","segment.r017.book1.ch14.text.block-249","segment.r017.book1.ch14.text.block-250","segment.r017.book1.ch14.text.block-251","segment.r017.book1.ch14.text.block-252","segment.r017.book1.ch14.text.block-253","segment.r017.book1.ch14.text.block-254","segment.r017.book1.ch14.text.block-255","segment.r017.book1.ch14.text.block-256","segment.r017.book1.ch14.text.block-257","segment.r017.book1.ch14.text.block-258","segment.r017.book1.ch14.text.block-259","segment.r017.book1.ch14.text.block-260","segment.r017.book1.ch14.text.block-261","segment.r017.book1.ch14.text.block-262","segment.r017.book1.ch14.text.block-263","segment.r017.book1.ch14.text.block-264","segment.r017.book1.ch14.text.block-265","segment.r017.book1.ch14.text.block-266","segment.r017.book1.ch14.text.block-267","segment.r017.book1.ch14.text.block-268","segment.r017.book1.ch14.text.block-269","segment.r017.book1.ch14.text.block-270","segment.r017.book1.ch14.text.block-271","segment.r017.book1.ch14.text.block-272","segment.r017.book1.ch14.text.block-273","segment.r017.book1.ch14.text.block-274","segment.r017.book1.ch14.text.block-275","segment.r017.book1.ch14.text.block-276","segment.r017.book1.ch14.text.block-277","segment.r017.book1.ch14.text.block-278","segment.r017.book1.ch14.text.block-279","segment.r017.book1.ch14.text.block-280","segment.r017.book1.ch14.text.block-281","segment.r017.book1.ch14.text.block-282","segment.r017.book1.ch14.text.block-283","segment.r017.book1.ch14.text.block-284","segment.r017.book1.ch14.text.block-285","segment.r017.book1.ch14.text.block-286","segment.r017.book1.ch14.text.block-287","segment.r017.book1.ch14.text.block-288","segment.r017.book1.ch14.text.block-289","segment.r017.book1.ch14.text.block-290","segment.r017.book1.ch14.text.block-291","segment.r017.book1.ch14.text.block-292","segment.r017.book1.ch14.text.block-293","segment.r017.book1.ch14.text.block-294","segment.r017.book1.ch14.text.block-295","segment.r017.book1.ch14.text.block-296","segment.r017.book1.ch14.text.block-297","segment.r017.book1.ch14.text.block-298","segment.r017.book1.ch14.text.block-299","segment.r017.book1.ch14.text.block-300","segment.r017.book1.ch14.text.block-301","segment.r017.book1.ch14.text.block-302","segment.r017.book1.ch14.text.block-303","segment.r017.book1.ch14.text.block-304","segment.r017.book1.ch14.text.block-305","segment.r017.book1.ch14.text.block-306","segment.r017.book1.ch14.text.block-307","segment.r017.book1.ch14.text.block-308","segment.r017.book1.ch14.text.block-309","segment.r017.book1.ch14.text.block-310","segment.r017.book1.ch14.text.block-311","segment.r017.book1.ch14.text.block-312","segment.r017.book1.ch14.text.block-313","segment.r017.book1.ch14.text.block-314","segment.r017.book1.ch14.text.block-315","segment.r017.book1.ch14.text.block-316","segment.r017.book1.ch14.text.block-317","segment.r017.book1.ch14.text.block-318","segment.r017.book1.ch14.text.block-319","segment.r017.book1.ch14.text.block-320","segment.r017.book1.ch14.text.block-321","segment.r017.book1.ch14.text.block-322","segment.r017.book1.ch14.text.block-323","segment.r017.book1.ch14.text.block-324","segment.r017.book1.ch14.text.block-325","segment.r017.book1.ch14.text.block-326","segment.r017.book1.ch14.text.block-327","segment.r017.book1.ch14.text.block-328","segment.r017.book1.ch14.text.block-329","segment.r017.book1.ch14.text.block-330","segment.r017.book1.ch14.text.block-331","segment.r017.book1.ch14.text.block-332","segment.r017.book1.ch14.text.block-333","segment.r017.book1.ch14.text.block-334","segment.r017.book1.ch14.text.block-335","segment.r017.book1.ch14.text.block-336","segment.r017.book1.ch14.text.block-337","segment.r017.book1.ch14.text.block-338","segment.r017.book1.ch14.text.block-339","segment.r017.book1.ch14.text.block-340","segment.r017.book1.ch14.text.block-341","segment.r017.book1.ch14.text.block-342","segment.r017.book1.ch14.text.block-343","segment.r017.book1.ch14.text.block-344","segment.r017.book1.ch14.text.block-345","segment.r017.book1.ch14.text.block-346","segment.r017.book1.ch14.text.block-347","segment.r017.book1.ch14.text.block-348","segment.r017.book1.ch14.text.block-349","segment.r017.book1.ch14.text.block-350","segment.r017.book1.ch14.text.block-351","segment.r017.book1.ch14.text.block-352","segment.r017.book1.ch14.text.block-353","segment.r017.book1.ch14.text.block-354","segment.r017.book1.ch14.text.block-355","segment.r017.book1.ch14.text.block-356","segment.r017.book1.ch14.text.block-357","segment.r017.book1.ch14.text.block-358","segment.r017.book1.ch14.text.block-359","segment.r017.book1.ch14.text.block-360","segment.r017.book1.ch14.text.block-361","segment.r017.book1.ch14.text.block-362","segment.r017.book1.ch14.text.block-363","segment.r017.book1.ch14.text.block-364","segment.r017.book1.ch14.text.block-365","segment.r017.book1.ch14.text.block-366","segment.r017.book1.ch14.text.block-367","segment.r017.book1.ch14.text.block-368","segment.r017.book1.ch14.text.block-369","segment.r017.book1.ch14.text.block-370","segment.r017.book1.ch14.text.block-371","segment.r017.book1.ch14.text.block-372","segment.r017.book1.ch14.text.block-373","segment.r017.book1.ch14.text.block-374","segment.r017.book1.ch14.text.block-375","segment.r017.book1.ch14.text.block-376","segment.r017.book1.ch14.text.block-377","segment.r017.book1.ch14.text.block-378","segment.r017.book1.ch14.text.block-379","segment.r017.book1.ch14.text.block-380","segment.r017.book1.ch14.text.block-381","segment.r017.book1.ch14.text.block-382","segment.r017.book1.ch14.text.block-383","segment.r017.book1.ch14.text.block-384","segment.r017.book1.ch14.text.block-385","segment.r017.book1.ch14.text.block-386","segment.r017.book1.ch14.text.block-387","segment.r017.book1.ch14.text.block-388","segment.r017.book1.ch14.text.block-389","segment.r017.book1.ch14.text.block-390","segment.r017.book1.ch14.text.block-391","segment.r017.book1.ch14.text.block-392","segment.r017.book1.ch14.text.block-393","segment.r017.book1.ch14.text.block-394","segment.r017.book1.ch14.text.block-395","segment.r017.book1.ch14.text.block-396","segment.r017.book1.ch14.text.block-397","segment.r017.book1.ch14.text.block-398","segment.r017.book1.ch14.text.block-399","segment.r017.book1.ch14.text.block-400","segment.r017.book1.ch14.text.block-401","segment.r017.book1.ch14.text.block-402","segment.r017.book1.ch14.text.block-403","segment.r017.book1.ch14.text.block-404","segment.r017.book1.ch14.text.block-405","segment.r017.book1.ch14.text.block-406","segment.r017.book1.ch14.text.block-407","segment.r017.book1.ch14.text.block-408","segment.r017.book1.ch14.text.block-409","segment.r017.book1.ch14.text.block-410","segment.r017.book1.ch14.text.block-411","segment.r017.book1.ch14.text.block-412","segment.r017.book1.ch14.text.block-413","segment.r017.book1.ch14.text.block-414","segment.r017.book1.ch14.text.block-415","segment.r017.book1.ch14.text.block-416","segment.r017.book1.ch14.text.block-417","segment.r017.book1.ch14.text.block-418","segment.r017.book1.ch14.text.block-419","segment.r017.book1.ch14.text.block-420","segment.r017.book1.ch14.text.block-421","segment.r017.book1.ch14.text.block-422","segment.r017.book1.ch14.text.block-423","segment.r017.book1.ch14.text.block-424","segment.r017.book1.ch14.text.block-425","segment.r017.book1.ch14.text.block-426","segment.r017.book1.ch14.text.block-427","segment.r017.book1.ch14.text.block-428"],"native":{"concept_id":"concept.prim-algorithm","evidence":"Full-corpus id-ID terminology audit","id":"term.prim-algorithm.id","preferred":"algoritme Prim","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"Prim algorithm","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch04.readme.block-001","segment.o018.lab.ch04.readme.block-002","segment.o018.lab.ch04.readme.block-003","segment.o018.lab.ch04.readme.block-004","segment.o018.lab.ch04.readme.block-005","segment.o018.lab.ch04.readme.block-006","segment.o018.lab.ch04.readme.block-007","segment.o018.lab.ch04.readme.block-008","segment.o018.lab.ch04.readme.block-009","segment.o018.lab.ch04.readme.block-010","segment.o018.lab.ch04.readme.block-011","segment.o018.lab.ch04.readme.block-012","segment.o018.lab.ch04.readme.block-013","segment.o018.lab.ch04.readme.block-014","segment.o018.lab.ch04.readme.block-015","segment.o018.lab.ch04.readme.block-016","segment.o018.lab.ch04.readme.block-017","segment.o018.lab.ch04.readme.block-018","segment.o018.lab.ch04.readme.block-019","segment.o018.lab.ch04.readme.block-020","segment.o018.lab.ch04.readme.block-021","segment.o018.lab.ch04.readme.block-022","segment.o018.lab.ch04.readme.block-023","segment.o018.lab.ch04.readme.block-024","segment.o018.lab.ch04.readme.block-025","segment.o018.lab.ch04.readme.block-026","segment.r017.book1.ch02.text.block-045","segment.r017.book1.ch03.text.block-045","segment.r017.book1.ch03.text.block-050","segment.r017.book1.ch04.text-a.block-017","segment.r017.book1.ch04.text-a.block-030","segment.r017.book1.ch04.text-b.block-181","segment.r017.book1.ch04.text-b.block-209"],"native":{"concept_id":"concept.production-planning","evidence":"Final id-ID corpus terminology audit","id":"term.production-planning.id","preferred":"model perencanaan produksi","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"production-planning model","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch02.text.block-031"],"native":{"concept_id":"concept.lp-modeling-assumptions","evidence":"Chapter 2 Assumptions section","id":"term.proportionality.id","preferred":"proporsionalitas","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear-programming modeling assumption","source_locale":"en","source_term":"proportionality","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch12.attribution.block-001","segment.o018.lab.ch12.attribution.block-002","segment.o018.lab.ch12.attribution.block-003","segment.o018.lab.ch12.attribution.block-004","segment.o018.lab.ch12.attribution.block-005","segment.o018.lab.ch12.attribution.block-006","segment.o018.lab.ch12.attribution.block-007","segment.o018.lab.ch12.attribution.block-008","segment.o018.lab.ch12.attribution.block-009","segment.o018.lab.ch12.attribution.block-010","segment.o018.lab.ch12.attribution.block-011","segment.o018.lab.ch12.attribution.block-012","segment.o018.lab.ch12.attribution.block-013","segment.o018.lab.ch12.attribution.block-014","segment.o018.lab.ch12.readme.block-001","segment.o018.lab.ch12.readme.block-002","segment.o018.lab.ch12.readme.block-003","segment.o018.lab.ch12.readme.block-004","segment.o018.lab.ch12.readme.block-005","segment.o018.lab.ch12.readme.block-006","segment.o018.lab.ch12.readme.block-007","segment.o018.lab.ch12.readme.block-008","segment.o018.lab.ch12.readme.block-009","segment.o018.lab.ch12.readme.block-010","segment.o018.lab.ch12.readme.block-011","segment.o018.lab.ch12.readme.block-012","segment.o018.lab.ch12.readme.block-013","segment.r017.book1.ch12.solutions-manual.block-001","segment.r017.book1.ch12.solutions-manual.block-002","segment.r017.book1.ch12.solutions-manual.block-003","segment.r017.book1.ch12.solutions-manual.block-004","segment.r017.book1.ch12.solutions-manual.block-005","segment.r017.book1.ch12.solutions-manual.block-006","segment.r017.book1.ch12.solutions-manual.block-007","segment.r017.book1.ch12.solutions-manual.block-008","segment.r017.book1.ch12.solutions-manual.block-009","segment.r017.book1.ch12.solutions-manual.block-010","segment.r017.book1.ch12.solutions-manual.block-011","segment.r017.book1.ch12.solutions-manual.block-012","segment.r017.book1.ch12.solutions-manual.block-013","segment.r017.book1.ch12.solutions-manual.block-014","segment.r017.book1.ch12.solutions-manual.block-015","segment.r017.book1.ch12.solutions-manual.block-016","segment.r017.book1.ch12.solutions-manual.block-017","segment.r017.book1.ch12.solutions-manual.block-018","segment.r017.book1.ch12.solutions-manual.block-019","segment.r017.book1.ch12.solutions-manual.block-020","segment.r017.book1.ch12.solutions-manual.block-021","segment.r017.book1.ch12.solutions-manual.block-022","segment.r017.book1.ch12.solutions-manual.block-023","segment.r017.book1.ch12.solutions-manual.block-024","segment.r017.book1.ch12.solutions-manual.block-025","segment.r017.book1.ch12.solutions-manual.block-026","segment.r017.book1.ch12.solutions-manual.block-027","segment.r017.book1.ch12.solutions-manual.block-028","segment.r017.book1.ch12.solutions-manual.block-029","segment.r017.book1.ch12.solutions-manual.block-030","segment.r017.book1.ch12.solutions-manual.block-031","segment.r017.book1.ch12.solutions-manual.block-032","segment.r017.book1.ch12.solutions-manual.block-033","segment.r017.book1.ch12.solutions-manual.block-034","segment.r017.book1.ch12.solutions-manual.block-035","segment.r017.book1.ch12.solutions-manual.block-036","segment.r017.book1.ch12.solutions-manual.block-037","segment.r017.book1.ch12.solutions-manual.block-038","segment.r017.book1.ch12.solutions-manual.block-039","segment.r017.book1.ch12.solutions-manual.block-040","segment.r017.book1.ch12.solutions-manual.block-041","segment.r017.book1.ch12.solutions-manual.block-042","segment.r017.book1.ch12.solutions-manual.block-043","segment.r017.book1.ch12.solutions-manual.block-044","segment.r017.book1.ch12.solutions-manual.block-045","segment.r017.book1.ch12.solutions-manual.block-046","segment.r017.book1.ch12.solutions-manual.block-047","segment.r017.book1.ch12.solutions-manual.block-048","segment.r017.book1.ch12.solutions-manual.block-049","segment.r017.book1.ch12.solutions-manual.block-050","segment.r017.book1.ch12.solutions-manual.block-051","segment.r017.book1.ch12.solutions-manual.block-052","segment.r017.book1.ch12.solutions-manual.block-053","segment.r017.book1.ch12.solutions-manual.block-054","segment.r017.book1.ch12.solutions-manual.block-055","segment.r017.book1.ch12.solutions-manual.block-056","segment.r017.book1.ch12.solutions-manual.block-057","segment.r017.book1.ch12.solutions-manual.block-058","segment.r017.book1.ch12.solutions-manual.block-059","segment.r017.book1.ch12.solutions-manual.block-060","segment.r017.book1.ch12.solutions-manual.block-061","segment.r017.book1.ch12.solutions-manual.block-062","segment.r017.book1.ch12.solutions-manual.block-063","segment.r017.book1.ch12.solutions-manual.block-064","segment.r017.book1.ch12.solutions-manual.block-065","segment.r017.book1.ch12.solutions-manual.block-066","segment.r017.book1.ch12.solutions-manual.block-067","segment.r017.book1.ch12.solutions-manual.block-068","segment.r017.book1.ch12.solutions-manual.block-069","segment.r017.book1.ch12.solutions-manual.block-070","segment.r017.book1.ch12.solutions-manual.block-071","segment.r017.book1.ch12.solutions-manual.block-072","segment.r017.book1.ch12.solutions-manual.block-073","segment.r017.book1.ch12.solutions-manual.block-074","segment.r017.book1.ch12.solutions-manual.block-075","segment.r017.book1.ch12.solutions-manual.block-076","segment.r017.book1.ch12.solutions-manual.block-077","segment.r017.book1.ch12.solutions-manual.block-078","segment.r017.book1.ch12.solutions-manual.block-079","segment.r017.book1.ch12.solutions-manual.block-080","segment.r017.book1.ch12.text.block-001","segment.r017.book1.ch12.text.block-002","segment.r017.book1.ch12.text.block-003","segment.r017.book1.ch12.text.block-004","segment.r017.book1.ch12.text.block-005","segment.r017.book1.ch12.text.block-006","segment.r017.book1.ch12.text.block-007","segment.r017.book1.ch12.text.block-008","segment.r017.book1.ch12.text.block-009","segment.r017.book1.ch12.text.block-010","segment.r017.book1.ch12.text.block-011","segment.r017.book1.ch12.text.block-012","segment.r017.book1.ch12.text.block-013","segment.r017.book1.ch12.text.block-014","segment.r017.book1.ch12.text.block-015","segment.r017.book1.ch12.text.block-016","segment.r017.book1.ch12.text.block-017","segment.r017.book1.ch12.text.block-018","segment.r017.book1.ch12.text.block-019","segment.r017.book1.ch12.text.block-020","segment.r017.book1.ch12.text.block-021","segment.r017.book1.ch12.text.block-022","segment.r017.book1.ch12.text.block-023","segment.r017.book1.ch12.text.block-024","segment.r017.book1.ch12.text.block-025","segment.r017.book1.ch12.text.block-026","segment.r017.book1.ch12.text.block-027","segment.r017.book1.ch12.text.block-028","segment.r017.book1.ch12.text.block-029","segment.r017.book1.ch12.text.block-030","segment.r017.book1.ch12.text.block-031","segment.r017.book1.ch12.text.block-032","segment.r017.book1.ch12.text.block-033","segment.r017.book1.ch12.text.block-034","segment.r017.book1.ch12.text.block-035","segment.r017.book1.ch12.text.block-036","segment.r017.book1.ch12.text.block-037","segment.r017.book1.ch12.text.block-038","segment.r017.book1.ch12.text.block-039","segment.r017.book1.ch12.text.block-040","segment.r017.book1.ch12.text.block-041","segment.r017.book1.ch12.text.block-042","segment.r017.book1.ch12.text.block-043","segment.r017.book1.ch12.text.block-044","segment.r017.book1.ch12.text.block-045","segment.r017.book1.ch12.text.block-046","segment.r017.book1.ch12.text.block-047","segment.r017.book1.ch12.text.block-048","segment.r017.book1.ch12.text.block-049","segment.r017.book1.ch12.text.block-050","segment.r017.book1.ch12.text.block-051","segment.r017.book1.ch12.text.block-052","segment.r017.book1.ch12.text.block-053","segment.r017.book1.ch12.text.block-054","segment.r017.book1.ch12.text.block-055","segment.r017.book1.ch12.text.block-056","segment.r017.book1.ch12.text.block-057","segment.r017.book1.ch12.text.block-058","segment.r017.book1.ch12.text.block-059","segment.r017.book1.ch12.text.block-060","segment.r017.book1.ch12.text.block-061","segment.r017.book1.ch12.text.block-062","segment.r017.book1.ch12.text.block-063","segment.r017.book1.ch12.text.block-064","segment.r017.book1.ch12.text.block-065","segment.r017.book1.ch12.text.block-066","segment.r017.book1.ch12.text.block-067","segment.r017.book1.ch12.text.block-068","segment.r017.book1.ch12.text.block-069","segment.r017.book1.ch12.text.block-070","segment.r017.book1.ch12.text.block-071","segment.r017.book1.ch12.text.block-072","segment.r017.book1.ch12.text.block-073","segment.r017.book1.ch12.text.block-074","segment.r017.book1.ch12.text.block-075","segment.r017.book1.ch12.text.block-076","segment.r017.book1.ch12.text.block-077","segment.r017.book1.ch12.text.block-078","segment.r017.book1.ch12.text.block-079","segment.r017.book1.ch12.text.block-080","segment.r017.book1.ch12.text.block-081","segment.r017.book1.ch12.text.block-082","segment.r017.book1.ch12.text.block-083","segment.r017.book1.ch12.text.block-084","segment.r017.book1.ch12.text.block-085","segment.r017.book1.ch12.text.block-086","segment.r017.book1.ch12.text.block-087","segment.r017.book1.ch12.text.block-088","segment.r017.book1.ch12.text.block-089","segment.r017.book1.ch12.text.block-090","segment.r017.book1.ch12.text.block-091","segment.r017.book1.ch12.text.block-092","segment.r017.book1.ch12.text.block-093","segment.r017.book1.ch12.text.block-094","segment.r017.book1.ch12.text.block-095","segment.r017.book1.ch12.text.block-096","segment.r017.book1.ch12.text.block-097","segment.r017.book1.ch12.text.block-098","segment.r017.book1.ch12.text.block-099","segment.r017.book1.ch12.text.block-100","segment.r017.book1.ch12.text.block-101","segment.r017.book1.ch12.text.block-102","segment.r017.book1.ch12.text.block-103","segment.r017.book1.ch12.text.block-104","segment.r017.book1.ch12.text.block-105","segment.r017.book1.ch12.text.block-106","segment.r017.book1.ch12.text.block-107","segment.r017.book1.ch12.text.block-108","segment.r017.book1.ch12.text.block-109","segment.r017.book1.ch12.text.block-110","segment.r017.book1.ch12.text.block-111","segment.r017.book1.ch12.text.block-112","segment.r017.book1.ch12.text.block-113","segment.r017.book1.ch12.text.block-114","segment.r017.book1.ch12.text.block-115","segment.r017.book1.ch12.text.block-116","segment.r017.book1.ch12.text.block-117","segment.r017.book1.ch12.text.block-118","segment.r017.book1.ch12.text.block-119","segment.r017.book1.ch12.text.block-120","segment.r017.book1.ch12.text.block-121","segment.r017.book1.ch12.text.block-122","segment.r017.book1.ch12.text.block-123","segment.r017.book1.ch12.text.block-124","segment.r017.book1.ch12.text.block-125","segment.r017.book1.ch12.text.block-126","segment.r017.book1.ch12.text.block-127","segment.r017.book1.ch12.text.block-128","segment.r017.book1.ch12.text.block-129","segment.r017.book1.ch12.text.block-130","segment.r017.book1.ch12.text.block-131","segment.r017.book1.ch12.text.block-132","segment.r017.book1.ch12.text.block-133","segment.r017.book1.ch12.text.block-134","segment.r017.book1.ch12.text.block-135","segment.r017.book1.ch12.text.block-136","segment.r017.book1.ch12.text.block-137","segment.r017.book1.ch12.text.block-138","segment.r017.book1.ch12.text.block-139","segment.r017.book1.ch12.text.block-140","segment.r017.book1.ch12.text.block-141","segment.r017.book1.ch12.text.block-142","segment.r017.book1.ch12.text.block-143","segment.r017.book1.ch12.text.block-144","segment.r017.book1.ch12.text.block-145","segment.r017.book1.ch12.text.block-146","segment.r017.book1.ch12.text.block-147","segment.r017.book1.ch12.text.block-148","segment.r017.book1.ch12.text.block-149","segment.r017.book1.ch12.text.block-150","segment.r017.book1.ch12.text.block-151","segment.r017.book1.ch12.text.block-152","segment.r017.book1.ch12.text.block-153","segment.r017.book1.ch12.text.block-154","segment.r017.book1.ch12.text.block-155","segment.r017.book1.ch12.text.block-156","segment.r017.book1.ch12.text.block-157","segment.r017.book1.ch12.text.block-158","segment.r017.book1.ch12.text.block-159","segment.r017.book1.ch12.text.block-160","segment.r017.book1.ch12.text.block-161","segment.r017.book1.ch12.text.block-162","segment.r017.book1.ch12.text.block-163","segment.r017.book1.ch12.text.block-164","segment.r017.book1.ch12.text.block-165","segment.r017.book1.ch12.text.block-166","segment.r017.book1.ch12.text.block-167","segment.r017.book1.ch12.text.block-168","segment.r017.book1.ch12.text.block-169","segment.r017.book1.ch12.text.block-170","segment.r017.book1.ch12.text.block-171","segment.r017.book1.ch12.text.block-172","segment.r017.book1.ch12.text.block-173","segment.r017.book1.ch12.text.block-174","segment.r017.book1.ch12.text.block-175","segment.r017.book1.ch12.text.block-176","segment.r017.book1.ch12.text.block-177","segment.r017.book1.ch12.text.block-178","segment.r017.book1.ch12.text.block-179","segment.r017.book1.ch12.text.block-180","segment.r017.book1.ch12.text.block-181","segment.r017.book1.ch12.text.block-182","segment.r017.book1.ch12.text.block-183","segment.r017.book1.ch12.text.block-184","segment.r017.book1.ch12.text.block-185","segment.r017.book1.ch12.text.block-186","segment.r017.book1.ch12.text.block-187","segment.r017.book1.ch12.text.block-188","segment.r017.book1.ch12.text.block-189","segment.r017.book1.ch12.text.block-190","segment.r017.book1.ch12.text.block-191","segment.r017.book1.ch12.text.block-192","segment.r017.book1.ch12.text.block-193","segment.r017.book1.ch12.text.block-194","segment.r017.book1.ch12.text.block-195","segment.r017.book1.ch12.text.block-196","segment.r017.book1.ch12.text.block-197","segment.r017.book1.ch12.text.block-198","segment.r017.book1.ch12.text.block-199","segment.r017.book1.ch12.text.block-200","segment.r017.book1.ch12.text.block-201","segment.r017.book1.ch12.text.block-202","segment.r017.book1.ch12.text.block-203","segment.r017.book1.ch12.text.block-204","segment.r017.book1.ch12.text.block-205","segment.r017.book1.ch12.text.block-206","segment.r017.book1.ch12.text.block-207","segment.r017.book1.ch12.text.block-208","segment.r017.book1.ch12.text.block-209","segment.r017.book1.ch12.text.block-210","segment.r017.book1.ch12.text.block-211","segment.r017.book1.ch12.text.block-212","segment.r017.book1.ch12.text.block-213","segment.r017.book1.ch12.text.block-214","segment.r017.book1.ch12.text.block-215","segment.r017.book1.ch12.text.block-216","segment.r017.book1.ch12.text.block-217","segment.r017.book1.ch12.text.block-218","segment.r017.book1.ch12.text.block-219","segment.r017.book1.ch12.text.block-220","segment.r017.book1.ch12.text.block-221","segment.r017.book1.ch12.text.block-222","segment.r017.book1.ch12.text.block-223","segment.r017.book1.ch12.text.block-224","segment.r017.book1.ch12.text.block-225","segment.r017.book1.ch12.text.block-226","segment.r017.book1.ch12.text.block-227","segment.r017.book1.ch12.text.block-228","segment.r017.book1.ch12.text.block-229","segment.r017.book1.ch12.text.block-230","segment.r017.book1.ch12.text.block-231","segment.r017.book1.ch12.text.block-232","segment.r017.book1.ch12.text.block-233","segment.r017.book1.ch12.text.block-234","segment.r017.book1.ch12.text.block-235","segment.r017.book1.ch12.text.block-236","segment.r017.book1.ch12.text.block-237","segment.r017.book1.ch12.text.block-238","segment.r017.book1.ch12.text.block-239","segment.r017.book1.ch12.text.block-240","segment.r017.book1.ch12.text.block-241","segment.r017.book1.ch12.text.block-242","segment.r017.book1.ch12.text.block-243","segment.r017.book1.ch12.text.block-244","segment.r017.book1.ch12.text.block-245","segment.r017.book1.ch12.text.block-246","segment.r017.book1.ch12.text.block-247","segment.r017.book1.ch12.text.block-248","segment.r017.book1.ch12.text.block-249","segment.r017.book1.ch12.text.block-250","segment.r017.book1.ch12.text.block-251","segment.r017.book1.ch12.text.block-252","segment.r017.book1.ch12.text.block-253","segment.r017.book1.ch12.text.block-254","segment.r017.book1.ch12.text.block-255","segment.r017.book1.ch12.text.block-256","segment.r017.book1.ch12.text.block-257","segment.r017.book1.ch12.text.block-258","segment.r017.book1.ch12.text.block-259","segment.r017.book1.ch12.text.block-260","segment.r017.book1.ch12.text.block-261","segment.r017.book1.ch12.text.block-262","segment.r017.book1.ch12.text.block-263","segment.r017.book1.ch12.text.block-264","segment.r017.book1.ch12.text.block-265","segment.r017.book1.ch12.text.block-266","segment.r017.book1.ch12.text.block-267","segment.r017.book1.ch12.text.block-268","segment.r017.book1.ch12.text.block-269","segment.r017.book1.ch12.text.block-270","segment.r017.book1.ch12.text.block-271","segment.r017.book1.ch12.text.block-272","segment.r017.book1.ch12.text.block-273","segment.r017.book1.ch12.text.block-274","segment.r017.book1.ch12.text.block-275","segment.r017.book1.ch12.text.block-276","segment.r017.book1.ch12.text.block-277","segment.r017.book1.ch12.text.block-278","segment.r017.book1.ch12.text.block-279","segment.r017.book1.ch12.text.block-280","segment.r017.book1.ch12.text.block-281","segment.r017.book1.ch12.text.block-282","segment.r017.book1.ch12.text.block-283","segment.r017.book1.ch12.text.block-284","segment.r017.book1.ch12.text.block-285","segment.r017.book1.ch12.text.block-286","segment.r017.book1.ch12.text.block-287","segment.r017.book1.ch12.text.block-288","segment.r017.book1.ch12.text.block-289","segment.r017.book1.ch12.text.block-290","segment.r017.book1.ch12.text.block-291","segment.r017.book1.ch12.text.block-292","segment.r017.book1.ch12.text.block-293","segment.r017.book1.ch12.text.block-294","segment.r017.book1.ch12.text.block-295","segment.r017.book1.ch12.text.block-296","segment.r017.book1.ch12.text.block-297","segment.r017.book1.ch12.text.block-298","segment.r017.book1.ch12.text.block-299","segment.r017.book1.ch12.text.block-300","segment.r017.book1.ch12.text.block-301","segment.r017.book1.ch12.text.block-302","segment.r017.book1.ch12.text.block-303","segment.r017.book1.ch12.text.block-304","segment.r017.book1.ch12.text.block-305","segment.r017.book1.ch12.text.block-306","segment.r017.book1.ch12.text.block-307","segment.r017.book1.ch12.text.block-308","segment.r017.book1.ch12.text.block-309","segment.r017.book1.ch12.text.block-310","segment.r017.book1.ch12.text.block-311","segment.r017.book1.ch12.text.block-312","segment.r017.book1.ch12.text.block-313","segment.r017.book1.ch12.text.block-314","segment.r017.book1.ch12.text.block-315","segment.r017.book1.ch12.text.block-316","segment.r017.book1.ch12.text.block-317","segment.r017.book1.ch12.text.block-318","segment.r017.book1.ch12.text.block-319","segment.r017.book1.ch12.text.block-320","segment.r017.book1.ch12.text.block-321","segment.r017.book1.ch12.text.block-322","segment.r017.book1.ch12.text.block-323","segment.r017.book1.ch12.text.block-324","segment.r017.book1.ch12.text.block-325","segment.r017.book1.ch12.text.block-326","segment.r017.book1.ch12.text.block-327","segment.r017.book1.ch12.text.block-328","segment.r017.book1.ch12.text.block-329","segment.r017.book1.ch12.text.block-330","segment.r017.book1.ch12.text.block-331","segment.r017.book1.ch12.text.block-332","segment.r017.book1.ch12.text.block-333","segment.r017.book1.ch12.text.block-334","segment.r017.book1.ch12.text.block-335","segment.r017.book1.ch12.text.block-336","segment.r017.book1.ch12.text.block-337","segment.r017.book1.ch12.text.block-338","segment.r017.book1.ch12.text.block-339","segment.r017.book1.ch12.text.block-340","segment.r017.book1.ch12.text.block-341","segment.r017.book1.ch12.text.block-342","segment.r017.book1.ch12.text.block-343","segment.r017.book1.ch12.text.block-344","segment.r017.book1.ch12.text.block-345","segment.r017.book1.ch12.text.block-346","segment.r017.book1.ch12.text.block-347","segment.r017.book1.ch12.text.block-348","segment.r017.book1.ch12.text.block-349","segment.r017.book1.ch12.text.block-350","segment.r017.book1.ch12.text.block-351","segment.r017.book1.ch12.text.block-352","segment.r017.book1.ch12.text.block-353","segment.r017.book1.ch12.text.block-354","segment.r017.book1.ch12.text.block-355","segment.r017.book1.ch12.text.block-356","segment.r017.book1.ch12.text.block-357","segment.r017.book1.ch12.text.block-358","segment.r017.book1.ch12.text.block-359"],"native":{"concept_id":"concept.pyomo-modeling","evidence":"Full-corpus id-ID terminology audit","id":"term.pyomo-modeling.id","preferred":"pemodelan Pyomo","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"Pyomo modeling","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch12.attribution.block-001","segment.o018.lab.ch12.attribution.block-002","segment.o018.lab.ch12.attribution.block-003","segment.o018.lab.ch12.attribution.block-004","segment.o018.lab.ch12.attribution.block-005","segment.o018.lab.ch12.attribution.block-006","segment.o018.lab.ch12.attribution.block-007","segment.o018.lab.ch12.attribution.block-008","segment.o018.lab.ch12.attribution.block-009","segment.o018.lab.ch12.attribution.block-010","segment.o018.lab.ch12.attribution.block-011","segment.o018.lab.ch12.attribution.block-012","segment.o018.lab.ch12.attribution.block-013","segment.o018.lab.ch12.attribution.block-014","segment.o018.lab.ch12.readme.block-001","segment.o018.lab.ch12.readme.block-002","segment.o018.lab.ch12.readme.block-003","segment.o018.lab.ch12.readme.block-004","segment.o018.lab.ch12.readme.block-005","segment.o018.lab.ch12.readme.block-006","segment.o018.lab.ch12.readme.block-007","segment.o018.lab.ch12.readme.block-008","segment.o018.lab.ch12.readme.block-009","segment.o018.lab.ch12.readme.block-010","segment.o018.lab.ch12.readme.block-011","segment.o018.lab.ch12.readme.block-012","segment.o018.lab.ch12.readme.block-013","segment.r017.book1.ch12.solutions-manual.block-001","segment.r017.book1.ch12.solutions-manual.block-002","segment.r017.book1.ch12.solutions-manual.block-003","segment.r017.book1.ch12.solutions-manual.block-004","segment.r017.book1.ch12.solutions-manual.block-005","segment.r017.book1.ch12.solutions-manual.block-006","segment.r017.book1.ch12.solutions-manual.block-007","segment.r017.book1.ch12.solutions-manual.block-008","segment.r017.book1.ch12.solutions-manual.block-009","segment.r017.book1.ch12.solutions-manual.block-010","segment.r017.book1.ch12.solutions-manual.block-011","segment.r017.book1.ch12.solutions-manual.block-012","segment.r017.book1.ch12.solutions-manual.block-013","segment.r017.book1.ch12.solutions-manual.block-014","segment.r017.book1.ch12.solutions-manual.block-015","segment.r017.book1.ch12.solutions-manual.block-016","segment.r017.book1.ch12.solutions-manual.block-017","segment.r017.book1.ch12.solutions-manual.block-018","segment.r017.book1.ch12.solutions-manual.block-019","segment.r017.book1.ch12.solutions-manual.block-020","segment.r017.book1.ch12.solutions-manual.block-021","segment.r017.book1.ch12.solutions-manual.block-022","segment.r017.book1.ch12.solutions-manual.block-023","segment.r017.book1.ch12.solutions-manual.block-024","segment.r017.book1.ch12.solutions-manual.block-025","segment.r017.book1.ch12.solutions-manual.block-026","segment.r017.book1.ch12.solutions-manual.block-027","segment.r017.book1.ch12.solutions-manual.block-028","segment.r017.book1.ch12.solutions-manual.block-029","segment.r017.book1.ch12.solutions-manual.block-030","segment.r017.book1.ch12.solutions-manual.block-031","segment.r017.book1.ch12.solutions-manual.block-032","segment.r017.book1.ch12.solutions-manual.block-033","segment.r017.book1.ch12.solutions-manual.block-034","segment.r017.book1.ch12.solutions-manual.block-035","segment.r017.book1.ch12.solutions-manual.block-036","segment.r017.book1.ch12.solutions-manual.block-037","segment.r017.book1.ch12.solutions-manual.block-038","segment.r017.book1.ch12.solutions-manual.block-039","segment.r017.book1.ch12.solutions-manual.block-040","segment.r017.book1.ch12.solutions-manual.block-041","segment.r017.book1.ch12.solutions-manual.block-042","segment.r017.book1.ch12.solutions-manual.block-043","segment.r017.book1.ch12.solutions-manual.block-044","segment.r017.book1.ch12.solutions-manual.block-045","segment.r017.book1.ch12.solutions-manual.block-046","segment.r017.book1.ch12.solutions-manual.block-047","segment.r017.book1.ch12.solutions-manual.block-048","segment.r017.book1.ch12.solutions-manual.block-049","segment.r017.book1.ch12.solutions-manual.block-050","segment.r017.book1.ch12.solutions-manual.block-051","segment.r017.book1.ch12.solutions-manual.block-052","segment.r017.book1.ch12.solutions-manual.block-053","segment.r017.book1.ch12.solutions-manual.block-054","segment.r017.book1.ch12.solutions-manual.block-055","segment.r017.book1.ch12.solutions-manual.block-056","segment.r017.book1.ch12.solutions-manual.block-057","segment.r017.book1.ch12.solutions-manual.block-058","segment.r017.book1.ch12.solutions-manual.block-059","segment.r017.book1.ch12.solutions-manual.block-060","segment.r017.book1.ch12.solutions-manual.block-061","segment.r017.book1.ch12.solutions-manual.block-062","segment.r017.book1.ch12.solutions-manual.block-063","segment.r017.book1.ch12.solutions-manual.block-064","segment.r017.book1.ch12.solutions-manual.block-065","segment.r017.book1.ch12.solutions-manual.block-066","segment.r017.book1.ch12.solutions-manual.block-067","segment.r017.book1.ch12.solutions-manual.block-068","segment.r017.book1.ch12.solutions-manual.block-069","segment.r017.book1.ch12.solutions-manual.block-070","segment.r017.book1.ch12.solutions-manual.block-071","segment.r017.book1.ch12.solutions-manual.block-072","segment.r017.book1.ch12.solutions-manual.block-073","segment.r017.book1.ch12.solutions-manual.block-074","segment.r017.book1.ch12.solutions-manual.block-075","segment.r017.book1.ch12.solutions-manual.block-076","segment.r017.book1.ch12.solutions-manual.block-077","segment.r017.book1.ch12.solutions-manual.block-078","segment.r017.book1.ch12.solutions-manual.block-079","segment.r017.book1.ch12.solutions-manual.block-080","segment.r017.book1.ch12.text.block-001","segment.r017.book1.ch12.text.block-002","segment.r017.book1.ch12.text.block-003","segment.r017.book1.ch12.text.block-004","segment.r017.book1.ch12.text.block-005","segment.r017.book1.ch12.text.block-006","segment.r017.book1.ch12.text.block-007","segment.r017.book1.ch12.text.block-008","segment.r017.book1.ch12.text.block-009","segment.r017.book1.ch12.text.block-010","segment.r017.book1.ch12.text.block-011","segment.r017.book1.ch12.text.block-012","segment.r017.book1.ch12.text.block-013","segment.r017.book1.ch12.text.block-014","segment.r017.book1.ch12.text.block-015","segment.r017.book1.ch12.text.block-016","segment.r017.book1.ch12.text.block-017","segment.r017.book1.ch12.text.block-018","segment.r017.book1.ch12.text.block-019","segment.r017.book1.ch12.text.block-020","segment.r017.book1.ch12.text.block-021","segment.r017.book1.ch12.text.block-022","segment.r017.book1.ch12.text.block-023","segment.r017.book1.ch12.text.block-024","segment.r017.book1.ch12.text.block-025","segment.r017.book1.ch12.text.block-026","segment.r017.book1.ch12.text.block-027","segment.r017.book1.ch12.text.block-028","segment.r017.book1.ch12.text.block-029","segment.r017.book1.ch12.text.block-030","segment.r017.book1.ch12.text.block-031","segment.r017.book1.ch12.text.block-032","segment.r017.book1.ch12.text.block-033","segment.r017.book1.ch12.text.block-034","segment.r017.book1.ch12.text.block-035","segment.r017.book1.ch12.text.block-036","segment.r017.book1.ch12.text.block-037","segment.r017.book1.ch12.text.block-038","segment.r017.book1.ch12.text.block-039","segment.r017.book1.ch12.text.block-040","segment.r017.book1.ch12.text.block-041","segment.r017.book1.ch12.text.block-042","segment.r017.book1.ch12.text.block-043","segment.r017.book1.ch12.text.block-044","segment.r017.book1.ch12.text.block-045","segment.r017.book1.ch12.text.block-046","segment.r017.book1.ch12.text.block-047","segment.r017.book1.ch12.text.block-048","segment.r017.book1.ch12.text.block-049","segment.r017.book1.ch12.text.block-050","segment.r017.book1.ch12.text.block-051","segment.r017.book1.ch12.text.block-052","segment.r017.book1.ch12.text.block-053","segment.r017.book1.ch12.text.block-054","segment.r017.book1.ch12.text.block-055","segment.r017.book1.ch12.text.block-056","segment.r017.book1.ch12.text.block-057","segment.r017.book1.ch12.text.block-058","segment.r017.book1.ch12.text.block-059","segment.r017.book1.ch12.text.block-060","segment.r017.book1.ch12.text.block-061","segment.r017.book1.ch12.text.block-062","segment.r017.book1.ch12.text.block-063","segment.r017.book1.ch12.text.block-064","segment.r017.book1.ch12.text.block-065","segment.r017.book1.ch12.text.block-066","segment.r017.book1.ch12.text.block-067","segment.r017.book1.ch12.text.block-068","segment.r017.book1.ch12.text.block-069","segment.r017.book1.ch12.text.block-070","segment.r017.book1.ch12.text.block-071","segment.r017.book1.ch12.text.block-072","segment.r017.book1.ch12.text.block-073","segment.r017.book1.ch12.text.block-074","segment.r017.book1.ch12.text.block-075","segment.r017.book1.ch12.text.block-076","segment.r017.book1.ch12.text.block-077","segment.r017.book1.ch12.text.block-078","segment.r017.book1.ch12.text.block-079","segment.r017.book1.ch12.text.block-080","segment.r017.book1.ch12.text.block-081","segment.r017.book1.ch12.text.block-082","segment.r017.book1.ch12.text.block-083","segment.r017.book1.ch12.text.block-084","segment.r017.book1.ch12.text.block-085","segment.r017.book1.ch12.text.block-086","segment.r017.book1.ch12.text.block-087","segment.r017.book1.ch12.text.block-088","segment.r017.book1.ch12.text.block-089","segment.r017.book1.ch12.text.block-090","segment.r017.book1.ch12.text.block-091","segment.r017.book1.ch12.text.block-092","segment.r017.book1.ch12.text.block-093","segment.r017.book1.ch12.text.block-094","segment.r017.book1.ch12.text.block-095","segment.r017.book1.ch12.text.block-096","segment.r017.book1.ch12.text.block-097","segment.r017.book1.ch12.text.block-098","segment.r017.book1.ch12.text.block-099","segment.r017.book1.ch12.text.block-100","segment.r017.book1.ch12.text.block-101","segment.r017.book1.ch12.text.block-102","segment.r017.book1.ch12.text.block-103","segment.r017.book1.ch12.text.block-104","segment.r017.book1.ch12.text.block-105","segment.r017.book1.ch12.text.block-106","segment.r017.book1.ch12.text.block-107","segment.r017.book1.ch12.text.block-108","segment.r017.book1.ch12.text.block-109","segment.r017.book1.ch12.text.block-110","segment.r017.book1.ch12.text.block-111","segment.r017.book1.ch12.text.block-112","segment.r017.book1.ch12.text.block-113","segment.r017.book1.ch12.text.block-114","segment.r017.book1.ch12.text.block-115","segment.r017.book1.ch12.text.block-116","segment.r017.book1.ch12.text.block-117","segment.r017.book1.ch12.text.block-118","segment.r017.book1.ch12.text.block-119","segment.r017.book1.ch12.text.block-120","segment.r017.book1.ch12.text.block-121","segment.r017.book1.ch12.text.block-122","segment.r017.book1.ch12.text.block-123","segment.r017.book1.ch12.text.block-124","segment.r017.book1.ch12.text.block-125","segment.r017.book1.ch12.text.block-126","segment.r017.book1.ch12.text.block-127","segment.r017.book1.ch12.text.block-128","segment.r017.book1.ch12.text.block-129","segment.r017.book1.ch12.text.block-130","segment.r017.book1.ch12.text.block-131","segment.r017.book1.ch12.text.block-132","segment.r017.book1.ch12.text.block-133","segment.r017.book1.ch12.text.block-134","segment.r017.book1.ch12.text.block-135","segment.r017.book1.ch12.text.block-136","segment.r017.book1.ch12.text.block-137","segment.r017.book1.ch12.text.block-138","segment.r017.book1.ch12.text.block-139","segment.r017.book1.ch12.text.block-140","segment.r017.book1.ch12.text.block-141","segment.r017.book1.ch12.text.block-142","segment.r017.book1.ch12.text.block-143","segment.r017.book1.ch12.text.block-144","segment.r017.book1.ch12.text.block-145","segment.r017.book1.ch12.text.block-146","segment.r017.book1.ch12.text.block-147","segment.r017.book1.ch12.text.block-148","segment.r017.book1.ch12.text.block-149","segment.r017.book1.ch12.text.block-150","segment.r017.book1.ch12.text.block-151","segment.r017.book1.ch12.text.block-152","segment.r017.book1.ch12.text.block-153","segment.r017.book1.ch12.text.block-154","segment.r017.book1.ch12.text.block-155","segment.r017.book1.ch12.text.block-156","segment.r017.book1.ch12.text.block-157","segment.r017.book1.ch12.text.block-158","segment.r017.book1.ch12.text.block-159","segment.r017.book1.ch12.text.block-160","segment.r017.book1.ch12.text.block-161","segment.r017.book1.ch12.text.block-162","segment.r017.book1.ch12.text.block-163","segment.r017.book1.ch12.text.block-164","segment.r017.book1.ch12.text.block-165","segment.r017.book1.ch12.text.block-166","segment.r017.book1.ch12.text.block-167","segment.r017.book1.ch12.text.block-168","segment.r017.book1.ch12.text.block-169","segment.r017.book1.ch12.text.block-170","segment.r017.book1.ch12.text.block-171","segment.r017.book1.ch12.text.block-172","segment.r017.book1.ch12.text.block-173","segment.r017.book1.ch12.text.block-174","segment.r017.book1.ch12.text.block-175","segment.r017.book1.ch12.text.block-176","segment.r017.book1.ch12.text.block-177","segment.r017.book1.ch12.text.block-178","segment.r017.book1.ch12.text.block-179","segment.r017.book1.ch12.text.block-180","segment.r017.book1.ch12.text.block-181","segment.r017.book1.ch12.text.block-182","segment.r017.book1.ch12.text.block-183","segment.r017.book1.ch12.text.block-184","segment.r017.book1.ch12.text.block-185","segment.r017.book1.ch12.text.block-186","segment.r017.book1.ch12.text.block-187","segment.r017.book1.ch12.text.block-188","segment.r017.book1.ch12.text.block-189","segment.r017.book1.ch12.text.block-190","segment.r017.book1.ch12.text.block-191","segment.r017.book1.ch12.text.block-192","segment.r017.book1.ch12.text.block-193","segment.r017.book1.ch12.text.block-194","segment.r017.book1.ch12.text.block-195","segment.r017.book1.ch12.text.block-196","segment.r017.book1.ch12.text.block-197","segment.r017.book1.ch12.text.block-198","segment.r017.book1.ch12.text.block-199","segment.r017.book1.ch12.text.block-200","segment.r017.book1.ch12.text.block-201","segment.r017.book1.ch12.text.block-202","segment.r017.book1.ch12.text.block-203","segment.r017.book1.ch12.text.block-204","segment.r017.book1.ch12.text.block-205","segment.r017.book1.ch12.text.block-206","segment.r017.book1.ch12.text.block-207","segment.r017.book1.ch12.text.block-208","segment.r017.book1.ch12.text.block-209","segment.r017.book1.ch12.text.block-210","segment.r017.book1.ch12.text.block-211","segment.r017.book1.ch12.text.block-212","segment.r017.book1.ch12.text.block-213","segment.r017.book1.ch12.text.block-214","segment.r017.book1.ch12.text.block-215","segment.r017.book1.ch12.text.block-216","segment.r017.book1.ch12.text.block-217","segment.r017.book1.ch12.text.block-218","segment.r017.book1.ch12.text.block-219","segment.r017.book1.ch12.text.block-220","segment.r017.book1.ch12.text.block-221","segment.r017.book1.ch12.text.block-222","segment.r017.book1.ch12.text.block-223","segment.r017.book1.ch12.text.block-224","segment.r017.book1.ch12.text.block-225","segment.r017.book1.ch12.text.block-226","segment.r017.book1.ch12.text.block-227","segment.r017.book1.ch12.text.block-228","segment.r017.book1.ch12.text.block-229","segment.r017.book1.ch12.text.block-230","segment.r017.book1.ch12.text.block-231","segment.r017.book1.ch12.text.block-232","segment.r017.book1.ch12.text.block-233","segment.r017.book1.ch12.text.block-234","segment.r017.book1.ch12.text.block-235","segment.r017.book1.ch12.text.block-236","segment.r017.book1.ch12.text.block-237","segment.r017.book1.ch12.text.block-238","segment.r017.book1.ch12.text.block-239","segment.r017.book1.ch12.text.block-240","segment.r017.book1.ch12.text.block-241","segment.r017.book1.ch12.text.block-242","segment.r017.book1.ch12.text.block-243","segment.r017.book1.ch12.text.block-244","segment.r017.book1.ch12.text.block-245","segment.r017.book1.ch12.text.block-246","segment.r017.book1.ch12.text.block-247","segment.r017.book1.ch12.text.block-248","segment.r017.book1.ch12.text.block-249","segment.r017.book1.ch12.text.block-250","segment.r017.book1.ch12.text.block-251","segment.r017.book1.ch12.text.block-252","segment.r017.book1.ch12.text.block-253","segment.r017.book1.ch12.text.block-254","segment.r017.book1.ch12.text.block-255","segment.r017.book1.ch12.text.block-256","segment.r017.book1.ch12.text.block-257","segment.r017.book1.ch12.text.block-258","segment.r017.book1.ch12.text.block-259","segment.r017.book1.ch12.text.block-260","segment.r017.book1.ch12.text.block-261","segment.r017.book1.ch12.text.block-262","segment.r017.book1.ch12.text.block-263","segment.r017.book1.ch12.text.block-264","segment.r017.book1.ch12.text.block-265","segment.r017.book1.ch12.text.block-266","segment.r017.book1.ch12.text.block-267","segment.r017.book1.ch12.text.block-268","segment.r017.book1.ch12.text.block-269","segment.r017.book1.ch12.text.block-270","segment.r017.book1.ch12.text.block-271","segment.r017.book1.ch12.text.block-272","segment.r017.book1.ch12.text.block-273","segment.r017.book1.ch12.text.block-274","segment.r017.book1.ch12.text.block-275","segment.r017.book1.ch12.text.block-276","segment.r017.book1.ch12.text.block-277","segment.r017.book1.ch12.text.block-278","segment.r017.book1.ch12.text.block-279","segment.r017.book1.ch12.text.block-280","segment.r017.book1.ch12.text.block-281","segment.r017.book1.ch12.text.block-282","segment.r017.book1.ch12.text.block-283","segment.r017.book1.ch12.text.block-284","segment.r017.book1.ch12.text.block-285","segment.r017.book1.ch12.text.block-286","segment.r017.book1.ch12.text.block-287","segment.r017.book1.ch12.text.block-288","segment.r017.book1.ch12.text.block-289","segment.r017.book1.ch12.text.block-290","segment.r017.book1.ch12.text.block-291","segment.r017.book1.ch12.text.block-292","segment.r017.book1.ch12.text.block-293","segment.r017.book1.ch12.text.block-294","segment.r017.book1.ch12.text.block-295","segment.r017.book1.ch12.text.block-296","segment.r017.book1.ch12.text.block-297","segment.r017.book1.ch12.text.block-298","segment.r017.book1.ch12.text.block-299","segment.r017.book1.ch12.text.block-300","segment.r017.book1.ch12.text.block-301","segment.r017.book1.ch12.text.block-302","segment.r017.book1.ch12.text.block-303","segment.r017.book1.ch12.text.block-304","segment.r017.book1.ch12.text.block-305","segment.r017.book1.ch12.text.block-306","segment.r017.book1.ch12.text.block-307","segment.r017.book1.ch12.text.block-308","segment.r017.book1.ch12.text.block-309","segment.r017.book1.ch12.text.block-310","segment.r017.book1.ch12.text.block-311","segment.r017.book1.ch12.text.block-312","segment.r017.book1.ch12.text.block-313","segment.r017.book1.ch12.text.block-314","segment.r017.book1.ch12.text.block-315","segment.r017.book1.ch12.text.block-316","segment.r017.book1.ch12.text.block-317","segment.r017.book1.ch12.text.block-318","segment.r017.book1.ch12.text.block-319","segment.r017.book1.ch12.text.block-320","segment.r017.book1.ch12.text.block-321","segment.r017.book1.ch12.text.block-322","segment.r017.book1.ch12.text.block-323","segment.r017.book1.ch12.text.block-324","segment.r017.book1.ch12.text.block-325","segment.r017.book1.ch12.text.block-326","segment.r017.book1.ch12.text.block-327","segment.r017.book1.ch12.text.block-328","segment.r017.book1.ch12.text.block-329","segment.r017.book1.ch12.text.block-330","segment.r017.book1.ch12.text.block-331","segment.r017.book1.ch12.text.block-332","segment.r017.book1.ch12.text.block-333","segment.r017.book1.ch12.text.block-334","segment.r017.book1.ch12.text.block-335","segment.r017.book1.ch12.text.block-336","segment.r017.book1.ch12.text.block-337","segment.r017.book1.ch12.text.block-338","segment.r017.book1.ch12.text.block-339","segment.r017.book1.ch12.text.block-340","segment.r017.book1.ch12.text.block-341","segment.r017.book1.ch12.text.block-342","segment.r017.book1.ch12.text.block-343","segment.r017.book1.ch12.text.block-344","segment.r017.book1.ch12.text.block-345","segment.r017.book1.ch12.text.block-346","segment.r017.book1.ch12.text.block-347","segment.r017.book1.ch12.text.block-348","segment.r017.book1.ch12.text.block-349","segment.r017.book1.ch12.text.block-350","segment.r017.book1.ch12.text.block-351","segment.r017.book1.ch12.text.block-352","segment.r017.book1.ch12.text.block-353","segment.r017.book1.ch12.text.block-354","segment.r017.book1.ch12.text.block-355","segment.r017.book1.ch12.text.block-356","segment.r017.book1.ch12.text.block-357","segment.r017.book1.ch12.text.block-358","segment.r017.book1.ch12.text.block-359"],"native":{"concept_id":"concept.python-optimization-workflow","evidence":"Full-corpus id-ID terminology audit","id":"term.python-optimization-workflow.id","preferred":"alur kerja optimisasi Python","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"Python optimization workflow","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch03.readme.block-001","segment.o018.lab.ch03.readme.block-002","segment.o018.lab.ch03.readme.block-003","segment.o018.lab.ch03.readme.block-004","segment.o018.lab.ch03.readme.block-005","segment.o018.lab.ch03.readme.block-006","segment.o018.lab.ch03.readme.block-007","segment.o018.lab.ch03.readme.block-008","segment.o018.lab.ch03.readme.block-009","segment.o018.lab.ch03.readme.block-010","segment.o018.lab.ch03.readme.block-011","segment.o018.lab.ch03.readme.block-012","segment.o018.lab.ch03.readme.block-013","segment.o018.lab.ch03.readme.block-014","segment.o018.lab.ch03.readme.block-015","segment.o018.lab.ch03.readme.block-016","segment.o018.lab.ch03.readme.block-017","segment.o018.lab.ch03.readme.block-018","segment.r017.book1.ch03.text.block-003","segment.r017.book1.ch04.text-a.block-030","segment.r017.book1.ch04.text-a.block-074"],"native":{"concept_id":"concept.spreadsheet-modeling","evidence":"Chapter 3 terminology decision","id":"term.range.id","preferred":"rentang","recorded_at":"2026-08-23T00:00:00+02:00","register":"technical","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"spreadsheet interface","source_locale":"en","source_term":"range","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch05.text.block-142","segment.r017.book1.ch05.text.block-143"],"native":{"concept_id":"concept.recession-direction","evidence":"Chapter 5 terminology decision","id":"term.recession-direction.id","preferred":"arah resesi","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"unbounded polyhedra","source_locale":"en","source_term":"recession direction","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["arah ekstrem"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch06.text.block-124"],"native":{"concept_id":"concept.recession-ray","evidence":"Chapter 6 terminology decision","id":"term.recession-ray.id","preferred":"sinar","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"unbounded polyhedra","source_locale":"en","source_term":"ray","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["sinar resesi"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch10.attribution.block-001","segment.o018.lab.ch10.attribution.block-002","segment.o018.lab.ch10.attribution.block-003","segment.o018.lab.ch10.attribution.block-004","segment.o018.lab.ch10.attribution.block-005","segment.o018.lab.ch10.attribution.block-006","segment.o018.lab.ch10.attribution.block-007","segment.o018.lab.ch10.attribution.block-008","segment.o018.lab.ch10.attribution.block-009","segment.o018.lab.ch10.attribution.block-010","segment.o018.lab.ch10.attribution.block-011","segment.o018.lab.ch10.attribution.block-012","segment.o018.lab.ch10.attribution.block-013","segment.o018.lab.ch10.attribution.block-014","segment.o018.lab.ch10.attribution.block-015","segment.o018.lab.ch10.attribution.block-016","segment.o018.lab.ch10.attribution.block-017","segment.o018.lab.ch10.readme.block-001","segment.o018.lab.ch10.readme.block-002","segment.o018.lab.ch10.readme.block-003","segment.o018.lab.ch10.readme.block-004","segment.o018.lab.ch10.readme.block-005","segment.o018.lab.ch10.readme.block-006","segment.o018.lab.ch10.readme.block-007","segment.o018.lab.ch10.readme.block-008","segment.o018.lab.ch10.readme.block-009","segment.o018.lab.ch10.readme.block-010","segment.o018.lab.simplex.readme.block-001","segment.o018.lab.simplex.readme.block-002","segment.o018.lab.simplex.readme.block-003","segment.o018.lab.simplex.readme.block-004","segment.o018.lab.simplex.readme.block-005","segment.o018.lab.simplex.readme.block-006","segment.o018.lab.simplex.readme.block-007","segment.o018.lab.simplex.readme.block-008","segment.o018.lab.simplex.readme.block-009","segment.o018.lab.simplex.readme.block-010","segment.r017.book1.ch03.text.block-059","segment.r017.book1.ch10.solutions-manual.block-001","segment.r017.book1.ch10.solutions-manual.block-002","segment.r017.book1.ch10.solutions-manual.block-003","segment.r017.book1.ch10.solutions-manual.block-004","segment.r017.book1.ch10.solutions-manual.block-005","segment.r017.book1.ch10.solutions-manual.block-006","segment.r017.book1.ch10.solutions-manual.block-007","segment.r017.book1.ch10.solutions-manual.block-008","segment.r017.book1.ch10.solutions-manual.block-009","segment.r017.book1.ch10.solutions-manual.block-010","segment.r017.book1.ch10.solutions-manual.block-011","segment.r017.book1.ch10.solutions-manual.block-012","segment.r017.book1.ch10.solutions-manual.block-013","segment.r017.book1.ch10.solutions-manual.block-014","segment.r017.book1.ch10.solutions-manual.block-015","segment.r017.book1.ch10.solutions-manual.block-016","segment.r017.book1.ch10.solutions-manual.block-017","segment.r017.book1.ch10.solutions-manual.block-018","segment.r017.book1.ch10.solutions-manual.block-019","segment.r017.book1.ch10.solutions-manual.block-020","segment.r017.book1.ch10.solutions-manual.block-021","segment.r017.book1.ch10.solutions-manual.block-022","segment.r017.book1.ch10.solutions-manual.block-023","segment.r017.book1.ch10.solutions-manual.block-024","segment.r017.book1.ch10.solutions-manual.block-025","segment.r017.book1.ch10.solutions-manual.block-026","segment.r017.book1.ch10.solutions-manual.block-027","segment.r017.book1.ch10.solutions-manual.block-028","segment.r017.book1.ch10.solutions-manual.block-029","segment.r017.book1.ch10.solutions-manual.block-030","segment.r017.book1.ch10.solutions-manual.block-031","segment.r017.book1.ch10.solutions-manual.block-032","segment.r017.book1.ch10.solutions-manual.block-033","segment.r017.book1.ch10.solutions-manual.block-034","segment.r017.book1.ch10.solutions-manual.block-035","segment.r017.book1.ch10.solutions-manual.block-036","segment.r017.book1.ch10.solutions-manual.block-037","segment.r017.book1.ch10.solutions-manual.block-038","segment.r017.book1.ch10.solutions-manual.block-039","segment.r017.book1.ch10.solutions-manual.block-040","segment.r017.book1.ch10.solutions-manual.block-041","segment.r017.book1.ch10.solutions-manual.block-042","segment.r017.book1.ch10.solutions-manual.block-043","segment.r017.book1.ch10.text.block-001","segment.r017.book1.ch10.text.block-002","segment.r017.book1.ch10.text.block-003","segment.r017.book1.ch10.text.block-004","segment.r017.book1.ch10.text.block-005","segment.r017.book1.ch10.text.block-006","segment.r017.book1.ch10.text.block-007","segment.r017.book1.ch10.text.block-008","segment.r017.book1.ch10.text.block-009","segment.r017.book1.ch10.text.block-010","segment.r017.book1.ch10.text.block-011","segment.r017.book1.ch10.text.block-012","segment.r017.book1.ch10.text.block-013","segment.r017.book1.ch10.text.block-014","segment.r017.book1.ch10.text.block-015","segment.r017.book1.ch10.text.block-016","segment.r017.book1.ch10.text.block-017","segment.r017.book1.ch10.text.block-018","segment.r017.book1.ch10.text.block-019","segment.r017.book1.ch10.text.block-020","segment.r017.book1.ch10.text.block-021","segment.r017.book1.ch10.text.block-022","segment.r017.book1.ch10.text.block-023","segment.r017.book1.ch10.text.block-024","segment.r017.book1.ch10.text.block-025","segment.r017.book1.ch10.text.block-026","segment.r017.book1.ch10.text.block-027","segment.r017.book1.ch10.text.block-028","segment.r017.book1.ch10.text.block-029","segment.r017.book1.ch10.text.block-030","segment.r017.book1.ch10.text.block-031","segment.r017.book1.ch10.text.block-032","segment.r017.book1.ch10.text.block-033","segment.r017.book1.ch10.text.block-034","segment.r017.book1.ch10.text.block-035","segment.r017.book1.ch10.text.block-036","segment.r017.book1.ch10.text.block-037","segment.r017.book1.ch10.text.block-038","segment.r017.book1.ch10.text.block-039","segment.r017.book1.ch10.text.block-040","segment.r017.book1.ch10.text.block-041","segment.r017.book1.ch10.text.block-042","segment.r017.book1.ch10.text.block-043","segment.r017.book1.ch10.text.block-044","segment.r017.book1.ch10.text.block-045","segment.r017.book1.ch10.text.block-046","segment.r017.book1.ch10.text.block-047","segment.r017.book1.ch10.text.block-048","segment.r017.book1.ch10.text.block-049","segment.r017.book1.ch10.text.block-050","segment.r017.book1.ch10.text.block-051","segment.r017.book1.ch10.text.block-052","segment.r017.book1.ch10.text.block-053","segment.r017.book1.ch10.text.block-054","segment.r017.book1.ch10.text.block-055","segment.r017.book1.ch10.text.block-056","segment.r017.book1.ch10.text.block-057","segment.r017.book1.ch10.text.block-058","segment.r017.book1.ch10.text.block-059","segment.r017.book1.ch10.text.block-060","segment.r017.book1.ch10.text.block-061","segment.r017.book1.ch10.text.block-062","segment.r017.book1.ch10.text.block-063","segment.r017.book1.ch10.text.block-064","segment.r017.book1.ch10.text.block-065","segment.r017.book1.ch10.text.block-066","segment.r017.book1.ch10.text.block-067","segment.r017.book1.ch10.text.block-068","segment.r017.book1.ch10.text.block-069","segment.r017.book1.ch10.text.block-070","segment.r017.book1.ch10.text.block-071","segment.r017.book1.ch10.text.block-072","segment.r017.book1.ch10.text.block-073","segment.r017.book1.ch10.text.block-074","segment.r017.book1.ch10.text.block-075","segment.r017.book1.ch10.text.block-076","segment.r017.book1.ch10.text.block-077","segment.r017.book1.ch10.text.block-078","segment.r017.book1.ch10.text.block-079","segment.r017.book1.ch10.text.block-080","segment.r017.book1.ch10.text.block-081","segment.r017.book1.ch10.text.block-082","segment.r017.book1.ch10.text.block-083","segment.r017.book1.ch10.text.block-084","segment.r017.book1.ch10.text.block-085","segment.r017.book1.ch10.text.block-086","segment.r017.book1.ch10.text.block-087","segment.r017.book1.ch10.text.block-088","segment.r017.book1.ch10.text.block-089","segment.r017.book1.ch10.text.block-090","segment.r017.book1.ch10.text.block-091","segment.r017.book1.ch10.text.block-092","segment.r017.book1.ch10.text.block-093","segment.r017.book1.ch10.text.block-094","segment.r017.book1.ch10.text.block-095","segment.r017.book1.ch10.text.block-096","segment.r017.book1.ch10.text.block-097","segment.r017.book1.ch10.text.block-098","segment.r017.book1.ch10.text.block-099","segment.r017.book1.ch10.text.block-100","segment.r017.book1.ch10.text.block-101","segment.r017.book1.ch10.text.block-102","segment.r017.book1.ch10.text.block-103","segment.r017.book1.ch10.text.block-104","segment.r017.book1.ch10.text.block-105","segment.r017.book1.ch10.text.block-106","segment.r017.book1.ch10.text.block-107","segment.r017.book1.ch10.text.block-108","segment.r017.book1.ch10.text.block-109","segment.r017.book1.ch10.text.block-110","segment.r017.book1.ch10.text.block-111","segment.r017.book1.ch10.text.block-112","segment.r017.book1.ch10.text.block-113","segment.r017.book1.ch10.text.block-114","segment.r017.book1.ch10.text.block-115","segment.r017.book1.ch10.text.block-116","segment.r017.book1.ch10.text.block-117","segment.r017.book1.ch10.text.block-118","segment.r017.book1.ch10.text.block-119","segment.r017.book1.ch10.text.block-120","segment.r017.book1.ch10.text.block-121","segment.r017.book1.ch10.text.block-122","segment.r017.book1.ch10.text.block-123","segment.r017.book1.ch10.text.block-124","segment.r017.book1.ch10.text.block-125","segment.r017.book1.ch10.text.block-126","segment.r017.book1.ch10.text.block-127","segment.r017.book1.ch10.text.block-128","segment.r017.book1.ch10.text.block-129","segment.r017.book1.ch10.text.block-130","segment.r017.book1.ch10.text.block-131","segment.r017.book1.ch10.text.block-132","segment.r017.book1.ch10.text.block-133","segment.r017.book1.ch10.text.block-134"],"native":{"concept_id":"concept.reduced-cost","evidence":"Chapters 3 and 8 terminology decision","id":"term.reduced-cost.id","preferred":"biaya tereduksi","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear-programming sensitivity and simplex optimality","source_locale":"en","source_term":"reduced cost","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.appendix.linear-systems.rref.block-001","segment.r017.book1.appendix.linear-systems.rref.block-002","segment.r017.book1.appendix.linear-systems.rref.block-003","segment.r017.book1.appendix.linear-systems.rref.block-004","segment.r017.book1.appendix.linear-systems.rref.block-005","segment.r017.book1.appendix.linear-systems.rref.block-006","segment.r017.book1.appendix.linear-systems.rref.block-007","segment.r017.book1.appendix.linear-systems.rref.block-008","segment.r017.book1.appendix.linear-systems.rref.block-009","segment.r017.book1.appendix.linear-systems.rref.block-010","segment.r017.book1.appendix.linear-systems.rref.block-011","segment.r017.book1.appendix.linear-systems.rref.block-012","segment.r017.book1.appendix.linear-systems.rref.block-013","segment.r017.book1.appendix.linear-systems.rref.block-014","segment.r017.book1.appendix.linear-systems.rref.block-015","segment.r017.book1.appendix.linear-systems.rref.block-016","segment.r017.book1.appendix.linear-systems.rref.block-017","segment.r017.book1.appendix.linear-systems.rref.block-018","segment.r017.book1.appendix.linear-systems.rref.block-019","segment.r017.book1.appendix.linear-systems.rref.block-020"],"native":{"concept_id":"concept.reduced-row-echelon-form","evidence":"Full-corpus id-ID terminology audit","id":"term.reduced-row-echelon-form.id","preferred":"bentuk eselon baris tereduksi","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"reduced row echelon form","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["RREF"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch06.text.block-124","segment.r017.book1.ch06.text.block-146"],"native":{"concept_id":"concept.representation-theorem","evidence":"Final id-ID corpus terminology audit","id":"term.representation-theorem.id","preferred":"teorema representasi polihedral","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"polyhedral representation theorem","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.attribution.block-001","segment.o018.lab.attribution.block-002","segment.o018.lab.attribution.block-003","segment.o018.lab.attribution.block-004","segment.o018.lab.attribution.block-005","segment.o018.lab.attribution.block-006","segment.o018.lab.attribution.block-007","segment.o018.lab.attribution.block-008","segment.o018.lab.attribution.block-009","segment.o018.lab.attribution.block-010","segment.o018.lab.ch03.attribution.block-001","segment.o018.lab.ch03.attribution.block-002","segment.o018.lab.ch03.attribution.block-003","segment.o018.lab.ch03.attribution.block-004","segment.o018.lab.ch03.attribution.block-005","segment.o018.lab.ch03.attribution.block-006","segment.o018.lab.ch03.attribution.block-007","segment.o018.lab.ch03.attribution.block-008","segment.o018.lab.ch03.attribution.block-009","segment.o018.lab.ch03.attribution.block-010","segment.o018.lab.ch03.attribution.block-011","segment.o018.lab.ch03.attribution.block-012","segment.o018.lab.ch03.attribution.block-013","segment.o018.lab.ch03.readme.block-001","segment.o018.lab.ch03.readme.block-002","segment.o018.lab.ch03.readme.block-003","segment.o018.lab.ch03.readme.block-004","segment.o018.lab.ch03.readme.block-005","segment.o018.lab.ch03.readme.block-006","segment.o018.lab.ch03.readme.block-007","segment.o018.lab.ch03.readme.block-008","segment.o018.lab.ch03.readme.block-009","segment.o018.lab.ch03.readme.block-010","segment.o018.lab.ch03.readme.block-011","segment.o018.lab.ch03.readme.block-012","segment.o018.lab.ch03.readme.block-013","segment.o018.lab.ch03.readme.block-014","segment.o018.lab.ch03.readme.block-015","segment.o018.lab.ch03.readme.block-016","segment.o018.lab.ch03.readme.block-017","segment.o018.lab.ch03.readme.block-018","segment.o018.lab.ch04.attribution.block-001","segment.o018.lab.ch04.attribution.block-002","segment.o018.lab.ch04.attribution.block-003","segment.o018.lab.ch04.attribution.block-004","segment.o018.lab.ch04.attribution.block-005","segment.o018.lab.ch04.attribution.block-006","segment.o018.lab.ch04.attribution.block-007","segment.o018.lab.ch04.attribution.block-008","segment.o018.lab.ch04.attribution.block-009","segment.o018.lab.ch04.attribution.block-010","segment.o018.lab.ch04.attribution.block-011","segment.o018.lab.ch04.attribution.block-012","segment.o018.lab.ch04.attribution.block-013","segment.o018.lab.ch04.attribution.block-014","segment.o018.lab.ch04.attribution.block-015","segment.o018.lab.ch04.attribution.block-016","segment.o018.lab.ch04.attribution.block-017","segment.o018.lab.ch04.attribution.block-018","segment.o018.lab.ch04.readme.block-001","segment.o018.lab.ch04.readme.block-002","segment.o018.lab.ch04.readme.block-003","segment.o018.lab.ch04.readme.block-004","segment.o018.lab.ch04.readme.block-005","segment.o018.lab.ch04.readme.block-006","segment.o018.lab.ch04.readme.block-007","segment.o018.lab.ch04.readme.block-008","segment.o018.lab.ch04.readme.block-009","segment.o018.lab.ch04.readme.block-010","segment.o018.lab.ch04.readme.block-011","segment.o018.lab.ch04.readme.block-012","segment.o018.lab.ch04.readme.block-013","segment.o018.lab.ch04.readme.block-014","segment.o018.lab.ch04.readme.block-015","segment.o018.lab.ch04.readme.block-016","segment.o018.lab.ch04.readme.block-017","segment.o018.lab.ch04.readme.block-018","segment.o018.lab.ch04.readme.block-019","segment.o018.lab.ch04.readme.block-020","segment.o018.lab.ch04.readme.block-021","segment.o018.lab.ch04.readme.block-022","segment.o018.lab.ch04.readme.block-023","segment.o018.lab.ch04.readme.block-024","segment.o018.lab.ch04.readme.block-025","segment.o018.lab.ch04.readme.block-026","segment.o018.lab.ch05.attribution.block-001","segment.o018.lab.ch05.attribution.block-002","segment.o018.lab.ch05.attribution.block-003","segment.o018.lab.ch05.attribution.block-004","segment.o018.lab.ch05.attribution.block-005","segment.o018.lab.ch05.attribution.block-006","segment.o018.lab.ch05.attribution.block-007","segment.o018.lab.ch05.attribution.block-008","segment.o018.lab.ch05.attribution.block-009","segment.o018.lab.ch05.attribution.block-010","segment.o018.lab.ch05.attribution.block-011","segment.o018.lab.ch05.attribution.block-012","segment.o018.lab.ch05.attribution.block-013","segment.o018.lab.ch05.attribution.block-014","segment.o018.lab.ch05.attribution.block-015","segment.o018.lab.ch05.attribution.block-016","segment.o018.lab.ch05.attribution.block-017","segment.o018.lab.ch05.attribution.block-018","segment.o018.lab.ch05.readme.block-001","segment.o018.lab.ch05.readme.block-002","segment.o018.lab.ch05.readme.block-003","segment.o018.lab.ch05.readme.block-004","segment.o018.lab.ch05.readme.block-005","segment.o018.lab.ch05.readme.block-006","segment.o018.lab.ch05.readme.block-007","segment.o018.lab.ch05.readme.block-008","segment.o018.lab.ch05.readme.block-009","segment.o018.lab.ch05.readme.block-010","segment.o018.lab.ch05.readme.block-011","segment.o018.lab.ch05.readme.block-012","segment.o018.lab.ch05.readme.block-013","segment.o018.lab.ch05.readme.block-014","segment.o018.lab.ch06.attribution.block-001","segment.o018.lab.ch06.attribution.block-002","segment.o018.lab.ch06.attribution.block-003","segment.o018.lab.ch06.attribution.block-004","segment.o018.lab.ch06.attribution.block-005","segment.o018.lab.ch06.attribution.block-006","segment.o018.lab.ch06.attribution.block-007","segment.o018.lab.ch06.attribution.block-008","segment.o018.lab.ch06.attribution.block-009","segment.o018.lab.ch06.attribution.block-010","segment.o018.lab.ch06.attribution.block-011","segment.o018.lab.ch06.attribution.block-012","segment.o018.lab.ch06.attribution.block-013","segment.o018.lab.ch06.attribution.block-014","segment.o018.lab.ch06.attribution.block-015","segment.o018.lab.ch06.readme.block-001","segment.o018.lab.ch06.readme.block-002","segment.o018.lab.ch06.readme.block-003","segment.o018.lab.ch06.readme.block-004","segment.o018.lab.ch06.readme.block-005","segment.o018.lab.ch06.readme.block-006","segment.o018.lab.ch06.readme.block-007","segment.o018.lab.ch06.readme.block-008","segment.o018.lab.ch06.readme.block-009","segment.o018.lab.ch06.readme.block-010","segment.o018.lab.ch10.attribution.block-001","segment.o018.lab.ch10.attribution.block-002","segment.o018.lab.ch10.attribution.block-003","segment.o018.lab.ch10.attribution.block-004","segment.o018.lab.ch10.attribution.block-005","segment.o018.lab.ch10.attribution.block-006","segment.o018.lab.ch10.attribution.block-007","segment.o018.lab.ch10.attribution.block-008","segment.o018.lab.ch10.attribution.block-009","segment.o018.lab.ch10.attribution.block-010","segment.o018.lab.ch10.attribution.block-011","segment.o018.lab.ch10.attribution.block-012","segment.o018.lab.ch10.attribution.block-013","segment.o018.lab.ch10.attribution.block-014","segment.o018.lab.ch10.attribution.block-015","segment.o018.lab.ch10.attribution.block-016","segment.o018.lab.ch10.attribution.block-017","segment.o018.lab.ch10.readme.block-001","segment.o018.lab.ch10.readme.block-002","segment.o018.lab.ch10.readme.block-003","segment.o018.lab.ch10.readme.block-004","segment.o018.lab.ch10.readme.block-005","segment.o018.lab.ch10.readme.block-006","segment.o018.lab.ch10.readme.block-007","segment.o018.lab.ch10.readme.block-008","segment.o018.lab.ch10.readme.block-009","segment.o018.lab.ch10.readme.block-010","segment.o018.lab.ch11.attribution.block-001","segment.o018.lab.ch11.attribution.block-002","segment.o018.lab.ch11.attribution.block-003","segment.o018.lab.ch11.attribution.block-004","segment.o018.lab.ch11.attribution.block-005","segment.o018.lab.ch11.attribution.block-006","segment.o018.lab.ch11.attribution.block-007","segment.o018.lab.ch11.attribution.block-008","segment.o018.lab.ch11.attribution.block-009","segment.o018.lab.ch11.attribution.block-010","segment.o018.lab.ch11.attribution.block-011","segment.o018.lab.ch11.attribution.block-012","segment.o018.lab.ch11.attribution.block-013","segment.o018.lab.ch11.attribution.block-014","segment.o018.lab.ch11.attribution.block-015","segment.o018.lab.ch11.attribution.block-016","segment.o018.lab.ch11.attribution.block-017","segment.o018.lab.ch11.attribution.block-018","segment.o018.lab.ch11.readme.block-001","segment.o018.lab.ch11.readme.block-002","segment.o018.lab.ch11.readme.block-003","segment.o018.lab.ch11.readme.block-004","segment.o018.lab.ch11.readme.block-005","segment.o018.lab.ch11.readme.block-006","segment.o018.lab.ch11.readme.block-007","segment.o018.lab.ch11.readme.block-008","segment.o018.lab.ch11.readme.block-009","segment.o018.lab.ch11.readme.block-010","segment.o018.lab.ch12.attribution.block-001","segment.o018.lab.ch12.attribution.block-002","segment.o018.lab.ch12.attribution.block-003","segment.o018.lab.ch12.attribution.block-004","segment.o018.lab.ch12.attribution.block-005","segment.o018.lab.ch12.attribution.block-006","segment.o018.lab.ch12.attribution.block-007","segment.o018.lab.ch12.attribution.block-008","segment.o018.lab.ch12.attribution.block-009","segment.o018.lab.ch12.attribution.block-010","segment.o018.lab.ch12.attribution.block-011","segment.o018.lab.ch12.attribution.block-012","segment.o018.lab.ch12.attribution.block-013","segment.o018.lab.ch12.attribution.block-014","segment.o018.lab.ch12.readme.block-001","segment.o018.lab.ch12.readme.block-002","segment.o018.lab.ch12.readme.block-003","segment.o018.lab.ch12.readme.block-004","segment.o018.lab.ch12.readme.block-005","segment.o018.lab.ch12.readme.block-006","segment.o018.lab.ch12.readme.block-007","segment.o018.lab.ch12.readme.block-008","segment.o018.lab.ch12.readme.block-009","segment.o018.lab.ch12.readme.block-010","segment.o018.lab.ch12.readme.block-011","segment.o018.lab.ch12.readme.block-012","segment.o018.lab.ch12.readme.block-013","segment.o018.lab.ch13.attribution.block-001","segment.o018.lab.ch13.attribution.block-002","segment.o018.lab.ch13.attribution.block-003","segment.o018.lab.ch13.attribution.block-004","segment.o018.lab.ch13.attribution.block-005","segment.o018.lab.ch13.attribution.block-006","segment.o018.lab.ch13.attribution.block-007","segment.o018.lab.ch13.attribution.block-008","segment.o018.lab.ch13.attribution.block-009","segment.o018.lab.ch13.attribution.block-010","segment.o018.lab.ch13.attribution.block-011","segment.o018.lab.ch13.attribution.block-012","segment.o018.lab.ch13.attribution.block-013","segment.o018.lab.ch13.attribution.block-014","segment.o018.lab.ch13.attribution.block-015","segment.o018.lab.ch13.attribution.block-016","segment.o018.lab.ch13.attribution.block-017","segment.o018.lab.ch13.attribution.block-018","segment.o018.lab.ch13.readme.block-001","segment.o018.lab.ch13.readme.block-002","segment.o018.lab.ch13.readme.block-003","segment.o018.lab.ch13.readme.block-004","segment.o018.lab.ch13.readme.block-005","segment.o018.lab.ch13.readme.block-006","segment.o018.lab.ch13.readme.block-007","segment.o018.lab.ch13.readme.block-008","segment.o018.lab.ch13.readme.block-009","segment.o018.lab.ch13.readme.block-010","segment.o018.lab.ch14.attribution.block-001","segment.o018.lab.ch14.attribution.block-002","segment.o018.lab.ch14.attribution.block-003","segment.o018.lab.ch14.attribution.block-004","segment.o018.lab.ch14.attribution.block-005","segment.o018.lab.ch14.attribution.block-006","segment.o018.lab.ch14.attribution.block-007","segment.o018.lab.ch14.attribution.block-008","segment.o018.lab.ch14.attribution.block-009","segment.o018.lab.ch14.attribution.block-010","segment.o018.lab.ch14.attribution.block-011","segment.o018.lab.ch14.attribution.block-012","segment.o018.lab.ch14.attribution.block-013","segment.o018.lab.ch14.attribution.block-014","segment.o018.lab.ch14.attribution.block-015","segment.o018.lab.ch14.attribution.block-016","segment.o018.lab.ch14.readme.block-001","segment.o018.lab.ch14.readme.block-002","segment.o018.lab.ch14.readme.block-003","segment.o018.lab.ch14.readme.block-004","segment.o018.lab.ch14.readme.block-005","segment.o018.lab.ch14.readme.block-006","segment.o018.lab.ch14.readme.block-007","segment.o018.lab.ch14.readme.block-008","segment.o018.lab.ch14.readme.block-009","segment.o018.lab.ch14.readme.block-010","segment.o018.lab.ch15.attribution.block-001","segment.o018.lab.ch15.attribution.block-002","segment.o018.lab.ch15.attribution.block-003","segment.o018.lab.ch15.attribution.block-004","segment.o018.lab.ch15.attribution.block-005","segment.o018.lab.ch15.attribution.block-006","segment.o018.lab.ch15.attribution.block-007","segment.o018.lab.ch15.attribution.block-008","segment.o018.lab.ch15.attribution.block-009","segment.o018.lab.ch15.attribution.block-010","segment.o018.lab.ch15.attribution.block-011","segment.o018.lab.ch15.attribution.block-012","segment.o018.lab.ch15.attribution.block-013","segment.o018.lab.ch15.attribution.block-014","segment.o018.lab.ch15.attribution.block-015","segment.o018.lab.ch15.readme.block-001","segment.o018.lab.ch15.readme.block-002","segment.o018.lab.ch15.readme.block-003","segment.o018.lab.ch15.readme.block-004","segment.o018.lab.ch15.readme.block-005","segment.o018.lab.ch15.readme.block-006","segment.o018.lab.ch15.readme.block-007","segment.o018.lab.ch15.readme.block-008","segment.o018.lab.ch15.readme.block-009","segment.o018.lab.readme.block-001","segment.o018.lab.readme.block-002","segment.o018.lab.readme.block-003","segment.o018.lab.readme.block-004","segment.o018.lab.readme.block-005","segment.o018.lab.readme.block-006","segment.o018.lab.readme.block-007","segment.o018.lab.readme.block-008","segment.o018.lab.readme.block-009","segment.o018.lab.readme.block-010","segment.o018.lab.readme.block-011","segment.o018.lab.simplex.attribution.block-001","segment.o018.lab.simplex.attribution.block-002","segment.o018.lab.simplex.attribution.block-003","segment.o018.lab.simplex.attribution.block-004","segment.o018.lab.simplex.attribution.block-005","segment.o018.lab.simplex.attribution.block-006","segment.o018.lab.simplex.attribution.block-007","segment.o018.lab.simplex.attribution.block-008","segment.o018.lab.simplex.attribution.block-009","segment.o018.lab.simplex.attribution.block-010","segment.o018.lab.simplex.attribution.block-011","segment.o018.lab.simplex.attribution.block-012","segment.o018.lab.simplex.attribution.block-013","segment.o018.lab.simplex.attribution.block-014","segment.o018.lab.simplex.attribution.block-015","segment.o018.lab.simplex.attribution.block-016","segment.o018.lab.simplex.readme.block-001","segment.o018.lab.simplex.readme.block-002","segment.o018.lab.simplex.readme.block-003","segment.o018.lab.simplex.readme.block-004","segment.o018.lab.simplex.readme.block-005","segment.o018.lab.simplex.readme.block-006","segment.o018.lab.simplex.readme.block-007","segment.o018.lab.simplex.readme.block-008","segment.o018.lab.simplex.readme.block-009","segment.o018.lab.simplex.readme.block-010"],"native":{"concept_id":"concept.reproducible-computation","evidence":"O018 runtime receipt and deterministic result contract","id":"term.reproducible-computation.id","preferred":"komputasi yang dapat direproduksi","recorded_at":"2026-08-23T00:00:00+02:00","register":"technical","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"runtime and result receipts","source_locale":"en","source_term":"reproducible computation","status":"source_frozen","supersedes_id":null,"target_locale":"id-ID","variants":["komputasi reproduksibel"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.robust-optimization","evidence":"first-boundary editorial terminology decision","id":"term.robust-optimization.id","preferred":"optimisasi robust","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"model class; terminology review pending","source_locale":"en","source_term":"robust optimization","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["optimisasi tangguh"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.appendix.linear-systems.algebraic.block-001","segment.r017.book1.appendix.linear-systems.algebraic.block-002","segment.r017.book1.appendix.linear-systems.algebraic.block-003","segment.r017.book1.appendix.linear-systems.algebraic.block-004","segment.r017.book1.appendix.linear-systems.algebraic.block-005","segment.r017.book1.appendix.linear-systems.algebraic.block-006","segment.r017.book1.appendix.linear-systems.algebraic.block-007","segment.r017.book1.appendix.linear-systems.algebraic.block-008","segment.r017.book1.appendix.linear-systems.algebraic.block-009","segment.r017.book1.appendix.linear-systems.algebraic.block-010","segment.r017.book1.appendix.linear-systems.algebraic.block-011","segment.r017.book1.appendix.linear-systems.algebraic.block-012","segment.r017.book1.appendix.linear-systems.algebraic.block-013","segment.r017.book1.appendix.linear-systems.algebraic.block-014","segment.r017.book1.appendix.linear-systems.algebraic.block-015","segment.r017.book1.appendix.linear-systems.algebraic.block-016","segment.r017.book1.appendix.linear-systems.algebraic.block-017","segment.r017.book1.appendix.linear-systems.row-operations.block-001","segment.r017.book1.appendix.linear-systems.row-operations.block-002","segment.r017.book1.appendix.linear-systems.row-operations.block-003","segment.r017.book1.appendix.linear-systems.row-operations.block-004","segment.r017.book1.appendix.linear-systems.row-operations.block-005","segment.r017.book1.appendix.linear-systems.row-operations.block-006","segment.r017.book1.appendix.linear-systems.row-operations.block-007","segment.r017.book1.appendix.linear-systems.row-operations.block-008","segment.r017.book1.appendix.linear-systems.row-operations.block-009","segment.r017.book1.appendix.linear-systems.row-operations.block-010","segment.r017.book1.appendix.linear-systems.row-operations.block-011","segment.r017.book1.appendix.linear-systems.row-operations.block-012","segment.r017.book1.appendix.linear-systems.row-operations.block-013","segment.r017.book1.appendix.linear-systems.row-operations.block-014","segment.r017.book1.appendix.linear-systems.row-operations.block-015","segment.r017.book1.appendix.linear-systems.row-operations.block-016","segment.r017.book1.appendix.linear-systems.row-operations.block-017","segment.r017.book1.appendix.linear-systems.row-operations.block-018","segment.r017.book1.appendix.linear-systems.row-operations.block-019","segment.r017.book1.appendix.linear-systems.row-operations.block-020","segment.r017.book1.appendix.linear-systems.row-operations.block-021","segment.r017.book1.appendix.linear-systems.row-operations.block-022","segment.r017.book1.appendix.linear-systems.row-operations.block-023","segment.r017.book1.appendix.linear-systems.row-operations.block-024","segment.r017.book1.appendix.linear-systems.row-operations.block-025","segment.r017.book1.appendix.linear-systems.row-operations.block-026","segment.r017.book1.appendix.linear-systems.row-operations.block-027","segment.r017.book1.appendix.linear-systems.row-operations.block-028","segment.r017.book1.appendix.linear-systems.row-operations.block-029","segment.r017.book1.appendix.linear-systems.row-operations.block-030","segment.r017.book1.appendix.linear-systems.row-operations.block-031","segment.r017.book1.appendix.linear-systems.row-operations.block-032"],"native":{"concept_id":"concept.row-operation","evidence":"Full-corpus id-ID terminology audit","id":"term.row-operation.id","preferred":"operasi baris elementer","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"elementary row operation","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch15.attribution.block-001","segment.o018.lab.ch15.attribution.block-002","segment.o018.lab.ch15.attribution.block-003","segment.o018.lab.ch15.attribution.block-004","segment.o018.lab.ch15.attribution.block-005","segment.o018.lab.ch15.attribution.block-006","segment.o018.lab.ch15.attribution.block-007","segment.o018.lab.ch15.attribution.block-008","segment.o018.lab.ch15.attribution.block-009","segment.o018.lab.ch15.attribution.block-010","segment.o018.lab.ch15.attribution.block-011","segment.o018.lab.ch15.attribution.block-012","segment.o018.lab.ch15.attribution.block-013","segment.o018.lab.ch15.attribution.block-014","segment.o018.lab.ch15.attribution.block-015","segment.o018.lab.ch15.readme.block-001","segment.o018.lab.ch15.readme.block-002","segment.o018.lab.ch15.readme.block-003","segment.o018.lab.ch15.readme.block-004","segment.o018.lab.ch15.readme.block-005","segment.o018.lab.ch15.readme.block-006","segment.o018.lab.ch15.readme.block-007","segment.o018.lab.ch15.readme.block-008","segment.o018.lab.ch15.readme.block-009","segment.r017.book1.ch15.text.block-001","segment.r017.book1.ch15.text.block-002","segment.r017.book1.ch15.text.block-003","segment.r017.book1.ch15.text.block-004","segment.r017.book1.ch15.text.block-005","segment.r017.book1.ch15.text.block-006","segment.r017.book1.ch15.text.block-007","segment.r017.book1.ch15.text.block-008","segment.r017.book1.ch15.text.block-009","segment.r017.book1.ch15.text.block-010","segment.r017.book1.ch15.text.block-011","segment.r017.book1.ch15.text.block-012","segment.r017.book1.ch15.text.block-013","segment.r017.book1.ch15.text.block-014","segment.r017.book1.ch15.text.block-015","segment.r017.book1.ch15.text.block-016","segment.r017.book1.ch15.text.block-017","segment.r017.book1.ch15.text.block-018","segment.r017.book1.ch15.text.block-019","segment.r017.book1.ch15.text.block-020","segment.r017.book1.ch15.text.block-021","segment.r017.book1.ch15.text.block-022","segment.r017.book1.ch15.text.block-023","segment.r017.book1.ch15.text.block-024","segment.r017.book1.ch15.text.block-025","segment.r017.book1.ch15.text.block-026","segment.r017.book1.ch15.text.block-027","segment.r017.book1.ch15.text.block-028","segment.r017.book1.ch15.text.block-029","segment.r017.book1.ch15.text.block-030","segment.r017.book1.ch15.text.block-031","segment.r017.book1.ch15.text.block-032","segment.r017.book1.ch15.text.block-033","segment.r017.book1.ch15.text.block-034","segment.r017.book1.ch15.text.block-035","segment.r017.book1.ch15.text.block-036","segment.r017.book1.ch15.text.block-037","segment.r017.book1.ch15.text.block-038","segment.r017.book1.ch15.text.block-039","segment.r017.book1.ch15.text.block-040","segment.r017.book1.ch15.text.block-041","segment.r017.book1.ch15.text.block-042","segment.r017.book1.ch15.text.block-043","segment.r017.book1.ch15.text.block-044","segment.r017.book1.ch15.text.block-045","segment.r017.book1.ch15.text.block-046","segment.r017.book1.ch15.text.block-047","segment.r017.book1.ch15.text.block-048","segment.r017.book1.ch15.text.block-049","segment.r017.book1.ch15.text.block-050","segment.r017.book1.ch15.text.block-051","segment.r017.book1.ch15.text.block-052","segment.r017.book1.ch15.text.block-053","segment.r017.book1.ch15.text.block-054","segment.r017.book1.ch15.text.block-055","segment.r017.book1.ch15.text.block-056","segment.r017.book1.ch15.text.block-057","segment.r017.book1.ch15.text.block-058","segment.r017.book1.ch15.text.block-059","segment.r017.book1.ch15.text.block-060","segment.r017.book1.ch15.text.block-061","segment.r017.book1.ch15.text.block-062","segment.r017.book1.ch15.text.block-063","segment.r017.book1.ch15.text.block-064","segment.r017.book1.ch15.text.block-065","segment.r017.book1.ch15.text.block-066","segment.r017.book1.ch15.text.block-067","segment.r017.book1.ch15.text.block-068","segment.r017.book1.ch15.text.block-069","segment.r017.book1.ch15.text.block-070","segment.r017.book1.ch15.text.block-071","segment.r017.book1.ch15.text.block-072","segment.r017.book1.ch15.text.block-073","segment.r017.book1.ch15.text.block-074","segment.r017.book1.ch15.text.block-075","segment.r017.book1.ch15.text.block-076","segment.r017.book1.ch15.text.block-077","segment.r017.book1.ch15.text.block-078","segment.r017.book1.ch15.text.block-079","segment.r017.book1.ch15.text.block-080","segment.r017.book1.ch15.text.block-081","segment.r017.book1.ch15.text.block-082","segment.r017.book1.ch15.text.block-083","segment.r017.book1.ch15.text.block-084","segment.r017.book1.ch15.text.block-085","segment.r017.book1.ch15.text.block-086","segment.r017.book1.ch15.text.block-087","segment.r017.book1.ch15.text.block-088","segment.r017.book1.ch15.text.block-089","segment.r017.book1.ch15.text.block-090","segment.r017.book1.ch15.text.block-091","segment.r017.book1.ch15.text.block-092","segment.r017.book1.ch15.text.block-093","segment.r017.book1.ch15.text.block-094","segment.r017.book1.ch15.text.block-095","segment.r017.book1.ch15.text.block-096","segment.r017.book1.ch15.text.block-097","segment.r017.book1.ch15.text.block-098","segment.r017.book1.ch15.text.block-099","segment.r017.book1.ch15.text.block-100","segment.r017.book1.ch15.text.block-101","segment.r017.book1.ch15.text.block-102","segment.r017.book1.ch15.text.block-103","segment.r017.book1.ch15.text.block-104","segment.r017.book1.ch15.text.block-105","segment.r017.book1.ch15.text.block-106","segment.r017.book1.ch15.text.block-107","segment.r017.book1.ch15.text.block-108","segment.r017.book1.ch15.text.block-109","segment.r017.book1.ch15.text.block-110","segment.r017.book1.ch15.text.block-111","segment.r017.book1.ch15.text.block-112","segment.r017.book1.ch15.text.block-113","segment.r017.book1.ch15.text.block-114","segment.r017.book1.ch15.text.block-115","segment.r017.book1.ch15.text.block-116","segment.r017.book1.ch15.text.block-117","segment.r017.book1.ch15.text.block-118","segment.r017.book1.ch15.text.block-119","segment.r017.book1.ch15.text.block-120","segment.r017.book1.ch15.text.block-121","segment.r017.book1.ch15.text.block-122","segment.r017.book1.ch15.text.block-123","segment.r017.book1.ch15.text.block-124","segment.r017.book1.ch15.text.block-125","segment.r017.book1.ch15.text.block-126","segment.r017.book1.ch15.text.block-127","segment.r017.book1.ch15.text.block-128","segment.r017.book1.ch15.text.block-129","segment.r017.book1.ch15.text.block-130","segment.r017.book1.ch15.text.block-131","segment.r017.book1.ch15.text.block-132","segment.r017.book1.ch15.text.block-133","segment.r017.book1.ch15.text.block-134","segment.r017.book1.ch15.text.block-135","segment.r017.book1.ch15.text.block-136","segment.r017.book1.ch15.text.block-137","segment.r017.book1.ch15.text.block-138","segment.r017.book1.ch15.text.block-139","segment.r017.book1.ch15.text.block-140","segment.r017.book1.ch15.text.block-141","segment.r017.book1.ch15.text.block-142","segment.r017.book1.ch15.text.block-143","segment.r017.book1.ch15.text.block-144","segment.r017.book1.ch15.text.block-145","segment.r017.book1.ch15.text.block-146","segment.r017.book1.ch15.text.block-147","segment.r017.book1.ch15.text.block-148","segment.r017.book1.ch15.text.block-149","segment.r017.book1.ch15.text.block-150","segment.r017.book1.ch15.text.block-151","segment.r017.book1.ch15.text.block-152","segment.r017.book1.ch15.text.block-153","segment.r017.book1.ch15.text.block-154","segment.r017.book1.ch15.text.block-155","segment.r017.book1.ch15.text.block-156","segment.r017.book1.ch15.text.block-157","segment.r017.book1.ch15.text.block-158","segment.r017.book1.ch15.text.block-159","segment.r017.book1.ch15.text.block-160","segment.r017.book1.ch15.text.block-161","segment.r017.book1.ch15.text.block-162","segment.r017.book1.ch15.text.block-163","segment.r017.book1.ch15.text.block-164","segment.r017.book1.ch15.text.block-165","segment.r017.book1.ch15.text.block-166","segment.r017.book1.ch15.text.block-167","segment.r017.book1.ch15.text.block-168","segment.r017.book1.ch15.text.block-169","segment.r017.book1.ch15.text.block-170","segment.r017.book1.ch15.text.block-171","segment.r017.book1.ch15.text.block-172","segment.r017.book1.ch15.text.block-173","segment.r017.book1.ch15.text.block-174","segment.r017.book1.ch15.text.block-175","segment.r017.book1.ch15.text.block-176","segment.r017.book1.ch15.text.block-177","segment.r017.book1.ch15.text.block-178","segment.r017.book1.ch15.text.block-179","segment.r017.book1.ch15.text.block-180","segment.r017.book1.ch15.text.block-181","segment.r017.book1.ch15.text.block-182","segment.r017.book1.ch15.text.block-183","segment.r017.book1.ch15.text.block-184","segment.r017.book1.ch15.text.block-185","segment.r017.book1.ch15.text.block-186","segment.r017.book1.ch15.text.block-187","segment.r017.book1.ch15.text.block-188","segment.r017.book1.ch15.text.block-189","segment.r017.book1.ch15.text.block-190","segment.r017.book1.ch15.text.block-191","segment.r017.book1.ch15.text.block-192","segment.r017.book1.ch15.text.block-193","segment.r017.book1.ch15.text.block-194","segment.r017.book1.ch15.text.block-195","segment.r017.book1.ch15.text.block-196","segment.r017.book1.ch15.text.block-197","segment.r017.book1.ch15.text.block-198","segment.r017.book1.ch15.text.block-199","segment.r017.book1.ch15.text.block-200","segment.r017.book1.ch15.text.block-201","segment.r017.book1.ch15.text.block-202","segment.r017.book1.ch15.text.block-203","segment.r017.book1.ch15.text.block-204","segment.r017.book1.ch15.text.block-205","segment.r017.book1.ch15.text.block-206","segment.r017.book1.ch15.text.block-207","segment.r017.book1.ch15.text.block-208","segment.r017.book1.ch15.text.block-209","segment.r017.book1.ch15.text.block-210","segment.r017.book1.ch15.text.block-211","segment.r017.book1.ch15.text.block-212","segment.r017.book1.ch15.text.block-213","segment.r017.book1.ch15.text.block-214","segment.r017.book1.ch15.text.block-215","segment.r017.book1.ch15.text.block-216","segment.r017.book1.ch15.text.block-217","segment.r017.book1.ch15.text.block-218","segment.r017.book1.ch15.text.block-219","segment.r017.book1.ch15.text.block-220","segment.r017.book1.ch15.text.block-221","segment.r017.book1.ch15.text.block-222","segment.r017.book1.ch15.text.block-223","segment.r017.book1.ch15.text.block-224","segment.r017.book1.ch15.text.block-225","segment.r017.book1.ch15.text.block-226","segment.r017.book1.ch15.text.block-227","segment.r017.book1.ch15.text.block-228","segment.r017.book1.ch15.text.block-229","segment.r017.book1.ch15.text.block-230","segment.r017.book1.ch15.text.block-231","segment.r017.book1.ch15.text.block-232","segment.r017.book1.ch15.text.block-233","segment.r017.book1.ch15.text.block-234","segment.r017.book1.ch15.text.block-235","segment.r017.book1.ch15.text.block-236","segment.r017.book1.ch15.text.block-237","segment.r017.book1.ch15.text.block-238","segment.r017.book1.ch15.text.block-239","segment.r017.book1.ch15.text.block-240","segment.r017.book1.ch15.text.block-241","segment.r017.book1.ch15.text.block-242","segment.r017.book1.ch15.text.block-243","segment.r017.book1.ch15.text.block-244","segment.r017.book1.ch15.text.block-245","segment.r017.book1.ch15.text.block-246","segment.r017.book1.ch15.text.block-247","segment.r017.book1.ch15.text.block-248","segment.r017.book1.ch15.text.block-249","segment.r017.book1.ch15.text.block-250","segment.r017.book1.ch15.text.block-251","segment.r017.book1.ch15.text.block-252","segment.r017.book1.ch15.text.block-253","segment.r017.book1.ch15.text.block-254","segment.r017.book1.ch15.text.block-255","segment.r017.book1.ch15.text.block-256","segment.r017.book1.ch15.text.block-257","segment.r017.book1.ch15.text.block-258","segment.r017.book1.ch15.text.block-259","segment.r017.book1.ch15.text.block-260","segment.r017.book1.ch15.text.block-261","segment.r017.book1.ch15.text.block-262","segment.r017.book1.ch15.text.block-263","segment.r017.book1.ch15.text.block-264","segment.r017.book1.ch15.text.block-265","segment.r017.book1.ch15.text.block-266","segment.r017.book1.ch15.text.block-267","segment.r017.book1.ch15.text.block-268","segment.r017.book1.ch15.text.block-269","segment.r017.book1.ch15.text.block-270","segment.r017.book1.ch15.text.block-271","segment.r017.book1.ch15.text.block-272","segment.r017.book1.ch15.text.block-273","segment.r017.book1.ch15.text.block-274","segment.r017.book1.ch15.text.block-275","segment.r017.book1.ch15.text.block-276","segment.r017.book1.ch15.text.block-277","segment.r017.book1.ch15.text.block-278","segment.r017.book1.ch15.text.block-279","segment.r017.book1.ch15.text.block-280","segment.r017.book1.ch15.text.block-281","segment.r017.book1.ch15.text.block-282","segment.r017.book1.ch15.text.block-283","segment.r017.book1.ch15.text.block-284","segment.r017.book1.ch15.text.block-285","segment.r017.book1.ch15.text.block-286","segment.r017.book1.ch15.text.block-287","segment.r017.book1.ch15.text.block-288","segment.r017.book1.ch15.text.block-289","segment.r017.book1.ch15.text.block-290","segment.r017.book1.ch15.text.block-291","segment.r017.book1.ch15.text.block-292","segment.r017.book1.ch15.text.block-293","segment.r017.book1.ch15.text.block-294","segment.r017.book1.ch15.text.block-295","segment.r017.book1.ch15.text.block-296","segment.r017.book1.ch15.text.block-297","segment.r017.book1.ch15.text.block-298","segment.r017.book1.ch15.text.block-299","segment.r017.book1.ch15.text.block-300","segment.r017.book1.ch15.text.block-301","segment.r017.book1.ch15.text.block-302","segment.r017.book1.ch15.text.block-303","segment.r017.book1.ch15.text.block-304","segment.r017.book1.ch15.text.block-305","segment.r017.book1.ch15.text.block-306","segment.r017.book1.ch15.text.block-307","segment.r017.book1.ch15.text.block-308","segment.r017.book1.ch15.text.block-309","segment.r017.book1.ch15.text.block-310","segment.r017.book1.ch15.text.block-311","segment.r017.book1.ch15.text.block-312","segment.r017.book1.ch15.text.block-313","segment.r017.book1.ch15.text.block-314","segment.r017.book1.ch15.text.block-315","segment.r017.book1.ch15.text.block-316","segment.r017.book1.ch15.text.block-317","segment.r017.book1.ch15.text.block-318","segment.r017.book1.ch15.text.block-319","segment.r017.book1.ch15.text.block-320","segment.r017.book1.ch15.text.block-321","segment.r017.book1.ch15.text.block-322","segment.r017.book1.ch15.text.block-323","segment.r017.book1.ch15.text.block-324","segment.r017.book1.ch15.text.block-325","segment.r017.book1.ch15.text.block-326","segment.r017.book1.ch15.text.block-327","segment.r017.book1.ch15.text.block-328","segment.r017.book1.ch15.text.block-329","segment.r017.book1.ch15.text.block-330","segment.r017.book1.ch15.text.block-331","segment.r017.book1.ch15.text.block-332","segment.r017.book1.ch15.text.block-333","segment.r017.book1.ch15.text.block-334","segment.r017.book1.ch15.text.block-335","segment.r017.book1.ch15.text.block-336","segment.r017.book1.ch15.text.block-337","segment.r017.book1.ch15.text.block-338","segment.r017.book1.ch15.text.block-339","segment.r017.book1.ch15.text.block-340","segment.r017.book1.ch15.text.block-341","segment.r017.book1.ch15.text.block-342"],"native":{"concept_id":"concept.set-cover","evidence":"Full-corpus id-ID terminology audit","id":"term.set-cover.id","preferred":"penutupan himpunan","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"set cover","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch10.attribution.block-001","segment.o018.lab.ch10.attribution.block-002","segment.o018.lab.ch10.attribution.block-003","segment.o018.lab.ch10.attribution.block-004","segment.o018.lab.ch10.attribution.block-005","segment.o018.lab.ch10.attribution.block-006","segment.o018.lab.ch10.attribution.block-007","segment.o018.lab.ch10.attribution.block-008","segment.o018.lab.ch10.attribution.block-009","segment.o018.lab.ch10.attribution.block-010","segment.o018.lab.ch10.attribution.block-011","segment.o018.lab.ch10.attribution.block-012","segment.o018.lab.ch10.attribution.block-013","segment.o018.lab.ch10.attribution.block-014","segment.o018.lab.ch10.attribution.block-015","segment.o018.lab.ch10.attribution.block-016","segment.o018.lab.ch10.attribution.block-017","segment.o018.lab.ch10.readme.block-001","segment.o018.lab.ch10.readme.block-002","segment.o018.lab.ch10.readme.block-003","segment.o018.lab.ch10.readme.block-004","segment.o018.lab.ch10.readme.block-005","segment.o018.lab.ch10.readme.block-006","segment.o018.lab.ch10.readme.block-007","segment.o018.lab.ch10.readme.block-008","segment.o018.lab.ch10.readme.block-009","segment.o018.lab.ch10.readme.block-010","segment.r017.book1.ch03.text.block-059","segment.r017.book1.ch10.solutions-manual.block-001","segment.r017.book1.ch10.solutions-manual.block-002","segment.r017.book1.ch10.solutions-manual.block-003","segment.r017.book1.ch10.solutions-manual.block-004","segment.r017.book1.ch10.solutions-manual.block-005","segment.r017.book1.ch10.solutions-manual.block-006","segment.r017.book1.ch10.solutions-manual.block-007","segment.r017.book1.ch10.solutions-manual.block-008","segment.r017.book1.ch10.solutions-manual.block-009","segment.r017.book1.ch10.solutions-manual.block-010","segment.r017.book1.ch10.solutions-manual.block-011","segment.r017.book1.ch10.solutions-manual.block-012","segment.r017.book1.ch10.solutions-manual.block-013","segment.r017.book1.ch10.solutions-manual.block-014","segment.r017.book1.ch10.solutions-manual.block-015","segment.r017.book1.ch10.solutions-manual.block-016","segment.r017.book1.ch10.solutions-manual.block-017","segment.r017.book1.ch10.solutions-manual.block-018","segment.r017.book1.ch10.solutions-manual.block-019","segment.r017.book1.ch10.solutions-manual.block-020","segment.r017.book1.ch10.solutions-manual.block-021","segment.r017.book1.ch10.solutions-manual.block-022","segment.r017.book1.ch10.solutions-manual.block-023","segment.r017.book1.ch10.solutions-manual.block-024","segment.r017.book1.ch10.solutions-manual.block-025","segment.r017.book1.ch10.solutions-manual.block-026","segment.r017.book1.ch10.solutions-manual.block-027","segment.r017.book1.ch10.solutions-manual.block-028","segment.r017.book1.ch10.solutions-manual.block-029","segment.r017.book1.ch10.solutions-manual.block-030","segment.r017.book1.ch10.solutions-manual.block-031","segment.r017.book1.ch10.solutions-manual.block-032","segment.r017.book1.ch10.solutions-manual.block-033","segment.r017.book1.ch10.solutions-manual.block-034","segment.r017.book1.ch10.solutions-manual.block-035","segment.r017.book1.ch10.solutions-manual.block-036","segment.r017.book1.ch10.solutions-manual.block-037","segment.r017.book1.ch10.solutions-manual.block-038","segment.r017.book1.ch10.solutions-manual.block-039","segment.r017.book1.ch10.solutions-manual.block-040","segment.r017.book1.ch10.solutions-manual.block-041","segment.r017.book1.ch10.solutions-manual.block-042","segment.r017.book1.ch10.solutions-manual.block-043","segment.r017.book1.ch10.text.block-001","segment.r017.book1.ch10.text.block-002","segment.r017.book1.ch10.text.block-003","segment.r017.book1.ch10.text.block-004","segment.r017.book1.ch10.text.block-005","segment.r017.book1.ch10.text.block-006","segment.r017.book1.ch10.text.block-007","segment.r017.book1.ch10.text.block-008","segment.r017.book1.ch10.text.block-009","segment.r017.book1.ch10.text.block-010","segment.r017.book1.ch10.text.block-011","segment.r017.book1.ch10.text.block-012","segment.r017.book1.ch10.text.block-013","segment.r017.book1.ch10.text.block-014","segment.r017.book1.ch10.text.block-015","segment.r017.book1.ch10.text.block-016","segment.r017.book1.ch10.text.block-017","segment.r017.book1.ch10.text.block-018","segment.r017.book1.ch10.text.block-019","segment.r017.book1.ch10.text.block-020","segment.r017.book1.ch10.text.block-021","segment.r017.book1.ch10.text.block-022","segment.r017.book1.ch10.text.block-023","segment.r017.book1.ch10.text.block-024","segment.r017.book1.ch10.text.block-025","segment.r017.book1.ch10.text.block-026","segment.r017.book1.ch10.text.block-027","segment.r017.book1.ch10.text.block-028","segment.r017.book1.ch10.text.block-029","segment.r017.book1.ch10.text.block-030","segment.r017.book1.ch10.text.block-031","segment.r017.book1.ch10.text.block-032","segment.r017.book1.ch10.text.block-033","segment.r017.book1.ch10.text.block-034","segment.r017.book1.ch10.text.block-035","segment.r017.book1.ch10.text.block-036","segment.r017.book1.ch10.text.block-037","segment.r017.book1.ch10.text.block-038","segment.r017.book1.ch10.text.block-039","segment.r017.book1.ch10.text.block-040","segment.r017.book1.ch10.text.block-041","segment.r017.book1.ch10.text.block-042","segment.r017.book1.ch10.text.block-043","segment.r017.book1.ch10.text.block-044","segment.r017.book1.ch10.text.block-045","segment.r017.book1.ch10.text.block-046","segment.r017.book1.ch10.text.block-047","segment.r017.book1.ch10.text.block-048","segment.r017.book1.ch10.text.block-049","segment.r017.book1.ch10.text.block-050","segment.r017.book1.ch10.text.block-051","segment.r017.book1.ch10.text.block-052","segment.r017.book1.ch10.text.block-053","segment.r017.book1.ch10.text.block-054","segment.r017.book1.ch10.text.block-055","segment.r017.book1.ch10.text.block-056","segment.r017.book1.ch10.text.block-057","segment.r017.book1.ch10.text.block-058","segment.r017.book1.ch10.text.block-059","segment.r017.book1.ch10.text.block-060","segment.r017.book1.ch10.text.block-061","segment.r017.book1.ch10.text.block-062","segment.r017.book1.ch10.text.block-063","segment.r017.book1.ch10.text.block-064","segment.r017.book1.ch10.text.block-065","segment.r017.book1.ch10.text.block-066","segment.r017.book1.ch10.text.block-067","segment.r017.book1.ch10.text.block-068","segment.r017.book1.ch10.text.block-069","segment.r017.book1.ch10.text.block-070","segment.r017.book1.ch10.text.block-071","segment.r017.book1.ch10.text.block-072","segment.r017.book1.ch10.text.block-073","segment.r017.book1.ch10.text.block-074","segment.r017.book1.ch10.text.block-075","segment.r017.book1.ch10.text.block-076","segment.r017.book1.ch10.text.block-077","segment.r017.book1.ch10.text.block-078","segment.r017.book1.ch10.text.block-079","segment.r017.book1.ch10.text.block-080","segment.r017.book1.ch10.text.block-081","segment.r017.book1.ch10.text.block-082","segment.r017.book1.ch10.text.block-083","segment.r017.book1.ch10.text.block-084","segment.r017.book1.ch10.text.block-085","segment.r017.book1.ch10.text.block-086","segment.r017.book1.ch10.text.block-087","segment.r017.book1.ch10.text.block-088","segment.r017.book1.ch10.text.block-089","segment.r017.book1.ch10.text.block-090","segment.r017.book1.ch10.text.block-091","segment.r017.book1.ch10.text.block-092","segment.r017.book1.ch10.text.block-093","segment.r017.book1.ch10.text.block-094","segment.r017.book1.ch10.text.block-095","segment.r017.book1.ch10.text.block-096","segment.r017.book1.ch10.text.block-097","segment.r017.book1.ch10.text.block-098","segment.r017.book1.ch10.text.block-099","segment.r017.book1.ch10.text.block-100","segment.r017.book1.ch10.text.block-101","segment.r017.book1.ch10.text.block-102","segment.r017.book1.ch10.text.block-103","segment.r017.book1.ch10.text.block-104","segment.r017.book1.ch10.text.block-105","segment.r017.book1.ch10.text.block-106","segment.r017.book1.ch10.text.block-107","segment.r017.book1.ch10.text.block-108","segment.r017.book1.ch10.text.block-109","segment.r017.book1.ch10.text.block-110","segment.r017.book1.ch10.text.block-111","segment.r017.book1.ch10.text.block-112","segment.r017.book1.ch10.text.block-113","segment.r017.book1.ch10.text.block-114","segment.r017.book1.ch10.text.block-115","segment.r017.book1.ch10.text.block-116","segment.r017.book1.ch10.text.block-117","segment.r017.book1.ch10.text.block-118","segment.r017.book1.ch10.text.block-119","segment.r017.book1.ch10.text.block-120","segment.r017.book1.ch10.text.block-121","segment.r017.book1.ch10.text.block-122","segment.r017.book1.ch10.text.block-123","segment.r017.book1.ch10.text.block-124","segment.r017.book1.ch10.text.block-125","segment.r017.book1.ch10.text.block-126","segment.r017.book1.ch10.text.block-127","segment.r017.book1.ch10.text.block-128","segment.r017.book1.ch10.text.block-129","segment.r017.book1.ch10.text.block-130","segment.r017.book1.ch10.text.block-131","segment.r017.book1.ch10.text.block-132","segment.r017.book1.ch10.text.block-133","segment.r017.book1.ch10.text.block-134"],"native":{"concept_id":"concept.shadow-price","evidence":"Chapter 3 terminology decision","id":"term.shadow-price.id","preferred":"harga bayangan","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear-programming sensitivity report","source_locale":"en","source_term":"shadow price","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch14.attribution.block-001","segment.o018.lab.ch14.attribution.block-002","segment.o018.lab.ch14.attribution.block-003","segment.o018.lab.ch14.attribution.block-004","segment.o018.lab.ch14.attribution.block-005","segment.o018.lab.ch14.attribution.block-006","segment.o018.lab.ch14.attribution.block-007","segment.o018.lab.ch14.attribution.block-008","segment.o018.lab.ch14.attribution.block-009","segment.o018.lab.ch14.attribution.block-010","segment.o018.lab.ch14.attribution.block-011","segment.o018.lab.ch14.attribution.block-012","segment.o018.lab.ch14.attribution.block-013","segment.o018.lab.ch14.attribution.block-014","segment.o018.lab.ch14.attribution.block-015","segment.o018.lab.ch14.attribution.block-016","segment.o018.lab.ch14.readme.block-001","segment.o018.lab.ch14.readme.block-002","segment.o018.lab.ch14.readme.block-003","segment.o018.lab.ch14.readme.block-004","segment.o018.lab.ch14.readme.block-005","segment.o018.lab.ch14.readme.block-006","segment.o018.lab.ch14.readme.block-007","segment.o018.lab.ch14.readme.block-008","segment.o018.lab.ch14.readme.block-009","segment.o018.lab.ch14.readme.block-010","segment.r017.book1.ch14.solutions-manual.block-001","segment.r017.book1.ch14.solutions-manual.block-002","segment.r017.book1.ch14.solutions-manual.block-003","segment.r017.book1.ch14.solutions-manual.block-004","segment.r017.book1.ch14.solutions-manual.block-005","segment.r017.book1.ch14.solutions-manual.block-006","segment.r017.book1.ch14.solutions-manual.block-007","segment.r017.book1.ch14.solutions-manual.block-008","segment.r017.book1.ch14.solutions-manual.block-009","segment.r017.book1.ch14.solutions-manual.block-010","segment.r017.book1.ch14.solutions-manual.block-011","segment.r017.book1.ch14.solutions-manual.block-012","segment.r017.book1.ch14.solutions-manual.block-013","segment.r017.book1.ch14.solutions-manual.block-014","segment.r017.book1.ch14.solutions-manual.block-015","segment.r017.book1.ch14.solutions-manual.block-016","segment.r017.book1.ch14.solutions-manual.block-017","segment.r017.book1.ch14.solutions-manual.block-018","segment.r017.book1.ch14.solutions-manual.block-019","segment.r017.book1.ch14.solutions-manual.block-020","segment.r017.book1.ch14.solutions-manual.block-021","segment.r017.book1.ch14.solutions-manual.block-022","segment.r017.book1.ch14.solutions-manual.block-023","segment.r017.book1.ch14.solutions-manual.block-024","segment.r017.book1.ch14.solutions-manual.block-025","segment.r017.book1.ch14.solutions-manual.block-026","segment.r017.book1.ch14.solutions-manual.block-027","segment.r017.book1.ch14.solutions-manual.block-028","segment.r017.book1.ch14.solutions-manual.block-029","segment.r017.book1.ch14.solutions-manual.block-030","segment.r017.book1.ch14.solutions-manual.block-031","segment.r017.book1.ch14.solutions-manual.block-032","segment.r017.book1.ch14.solutions-manual.block-033","segment.r017.book1.ch14.solutions-manual.block-034","segment.r017.book1.ch14.solutions-manual.block-035","segment.r017.book1.ch14.solutions-manual.block-036","segment.r017.book1.ch14.solutions-manual.block-037","segment.r017.book1.ch14.solutions-manual.block-038","segment.r017.book1.ch14.solutions-manual.block-039","segment.r017.book1.ch14.solutions-manual.block-040","segment.r017.book1.ch14.solutions-manual.block-041","segment.r017.book1.ch14.solutions-manual.block-042","segment.r017.book1.ch14.solutions-manual.block-043","segment.r017.book1.ch14.solutions-manual.block-044","segment.r017.book1.ch14.solutions-manual.block-045","segment.r017.book1.ch14.solutions-manual.block-046","segment.r017.book1.ch14.solutions-manual.block-047","segment.r017.book1.ch14.solutions-manual.block-048","segment.r017.book1.ch14.solutions-manual.block-049","segment.r017.book1.ch14.solutions-manual.block-050","segment.r017.book1.ch14.solutions-manual.block-051","segment.r017.book1.ch14.solutions-manual.block-052","segment.r017.book1.ch14.solutions-manual.block-053","segment.r017.book1.ch14.solutions-manual.block-054","segment.r017.book1.ch14.solutions-manual.block-055","segment.r017.book1.ch14.solutions-manual.block-056","segment.r017.book1.ch14.solutions-manual.block-057","segment.r017.book1.ch14.solutions-manual.block-058","segment.r017.book1.ch14.solutions-manual.block-059","segment.r017.book1.ch14.text.block-001","segment.r017.book1.ch14.text.block-002","segment.r017.book1.ch14.text.block-003","segment.r017.book1.ch14.text.block-004","segment.r017.book1.ch14.text.block-005","segment.r017.book1.ch14.text.block-006","segment.r017.book1.ch14.text.block-007","segment.r017.book1.ch14.text.block-008","segment.r017.book1.ch14.text.block-009","segment.r017.book1.ch14.text.block-010","segment.r017.book1.ch14.text.block-011","segment.r017.book1.ch14.text.block-012","segment.r017.book1.ch14.text.block-013","segment.r017.book1.ch14.text.block-014","segment.r017.book1.ch14.text.block-015","segment.r017.book1.ch14.text.block-016","segment.r017.book1.ch14.text.block-017","segment.r017.book1.ch14.text.block-018","segment.r017.book1.ch14.text.block-019","segment.r017.book1.ch14.text.block-020","segment.r017.book1.ch14.text.block-021","segment.r017.book1.ch14.text.block-022","segment.r017.book1.ch14.text.block-023","segment.r017.book1.ch14.text.block-024","segment.r017.book1.ch14.text.block-025","segment.r017.book1.ch14.text.block-026","segment.r017.book1.ch14.text.block-027","segment.r017.book1.ch14.text.block-028","segment.r017.book1.ch14.text.block-029","segment.r017.book1.ch14.text.block-030","segment.r017.book1.ch14.text.block-031","segment.r017.book1.ch14.text.block-032","segment.r017.book1.ch14.text.block-033","segment.r017.book1.ch14.text.block-034","segment.r017.book1.ch14.text.block-035","segment.r017.book1.ch14.text.block-036","segment.r017.book1.ch14.text.block-037","segment.r017.book1.ch14.text.block-038","segment.r017.book1.ch14.text.block-039","segment.r017.book1.ch14.text.block-040","segment.r017.book1.ch14.text.block-041","segment.r017.book1.ch14.text.block-042","segment.r017.book1.ch14.text.block-043","segment.r017.book1.ch14.text.block-044","segment.r017.book1.ch14.text.block-045","segment.r017.book1.ch14.text.block-046","segment.r017.book1.ch14.text.block-047","segment.r017.book1.ch14.text.block-048","segment.r017.book1.ch14.text.block-049","segment.r017.book1.ch14.text.block-050","segment.r017.book1.ch14.text.block-051","segment.r017.book1.ch14.text.block-052","segment.r017.book1.ch14.text.block-053","segment.r017.book1.ch14.text.block-054","segment.r017.book1.ch14.text.block-055","segment.r017.book1.ch14.text.block-056","segment.r017.book1.ch14.text.block-057","segment.r017.book1.ch14.text.block-058","segment.r017.book1.ch14.text.block-059","segment.r017.book1.ch14.text.block-060","segment.r017.book1.ch14.text.block-061","segment.r017.book1.ch14.text.block-062","segment.r017.book1.ch14.text.block-063","segment.r017.book1.ch14.text.block-064","segment.r017.book1.ch14.text.block-065","segment.r017.book1.ch14.text.block-066","segment.r017.book1.ch14.text.block-067","segment.r017.book1.ch14.text.block-068","segment.r017.book1.ch14.text.block-069","segment.r017.book1.ch14.text.block-070","segment.r017.book1.ch14.text.block-071","segment.r017.book1.ch14.text.block-072","segment.r017.book1.ch14.text.block-073","segment.r017.book1.ch14.text.block-074","segment.r017.book1.ch14.text.block-075","segment.r017.book1.ch14.text.block-076","segment.r017.book1.ch14.text.block-077","segment.r017.book1.ch14.text.block-078","segment.r017.book1.ch14.text.block-079","segment.r017.book1.ch14.text.block-080","segment.r017.book1.ch14.text.block-081","segment.r017.book1.ch14.text.block-082","segment.r017.book1.ch14.text.block-083","segment.r017.book1.ch14.text.block-084","segment.r017.book1.ch14.text.block-085","segment.r017.book1.ch14.text.block-086","segment.r017.book1.ch14.text.block-087","segment.r017.book1.ch14.text.block-088","segment.r017.book1.ch14.text.block-089","segment.r017.book1.ch14.text.block-090","segment.r017.book1.ch14.text.block-091","segment.r017.book1.ch14.text.block-092","segment.r017.book1.ch14.text.block-093","segment.r017.book1.ch14.text.block-094","segment.r017.book1.ch14.text.block-095","segment.r017.book1.ch14.text.block-096","segment.r017.book1.ch14.text.block-097","segment.r017.book1.ch14.text.block-098","segment.r017.book1.ch14.text.block-099","segment.r017.book1.ch14.text.block-100","segment.r017.book1.ch14.text.block-101","segment.r017.book1.ch14.text.block-102","segment.r017.book1.ch14.text.block-103","segment.r017.book1.ch14.text.block-104","segment.r017.book1.ch14.text.block-105","segment.r017.book1.ch14.text.block-106","segment.r017.book1.ch14.text.block-107","segment.r017.book1.ch14.text.block-108","segment.r017.book1.ch14.text.block-109","segment.r017.book1.ch14.text.block-110","segment.r017.book1.ch14.text.block-111","segment.r017.book1.ch14.text.block-112","segment.r017.book1.ch14.text.block-113","segment.r017.book1.ch14.text.block-114","segment.r017.book1.ch14.text.block-115","segment.r017.book1.ch14.text.block-116","segment.r017.book1.ch14.text.block-117","segment.r017.book1.ch14.text.block-118","segment.r017.book1.ch14.text.block-119","segment.r017.book1.ch14.text.block-120","segment.r017.book1.ch14.text.block-121","segment.r017.book1.ch14.text.block-122","segment.r017.book1.ch14.text.block-123","segment.r017.book1.ch14.text.block-124","segment.r017.book1.ch14.text.block-125","segment.r017.book1.ch14.text.block-126","segment.r017.book1.ch14.text.block-127","segment.r017.book1.ch14.text.block-128","segment.r017.book1.ch14.text.block-129","segment.r017.book1.ch14.text.block-130","segment.r017.book1.ch14.text.block-131","segment.r017.book1.ch14.text.block-132","segment.r017.book1.ch14.text.block-133","segment.r017.book1.ch14.text.block-134","segment.r017.book1.ch14.text.block-135","segment.r017.book1.ch14.text.block-136","segment.r017.book1.ch14.text.block-137","segment.r017.book1.ch14.text.block-138","segment.r017.book1.ch14.text.block-139","segment.r017.book1.ch14.text.block-140","segment.r017.book1.ch14.text.block-141","segment.r017.book1.ch14.text.block-142","segment.r017.book1.ch14.text.block-143","segment.r017.book1.ch14.text.block-144","segment.r017.book1.ch14.text.block-145","segment.r017.book1.ch14.text.block-146","segment.r017.book1.ch14.text.block-147","segment.r017.book1.ch14.text.block-148","segment.r017.book1.ch14.text.block-149","segment.r017.book1.ch14.text.block-150","segment.r017.book1.ch14.text.block-151","segment.r017.book1.ch14.text.block-152","segment.r017.book1.ch14.text.block-153","segment.r017.book1.ch14.text.block-154","segment.r017.book1.ch14.text.block-155","segment.r017.book1.ch14.text.block-156","segment.r017.book1.ch14.text.block-157","segment.r017.book1.ch14.text.block-158","segment.r017.book1.ch14.text.block-159","segment.r017.book1.ch14.text.block-160","segment.r017.book1.ch14.text.block-161","segment.r017.book1.ch14.text.block-162","segment.r017.book1.ch14.text.block-163","segment.r017.book1.ch14.text.block-164","segment.r017.book1.ch14.text.block-165","segment.r017.book1.ch14.text.block-166","segment.r017.book1.ch14.text.block-167","segment.r017.book1.ch14.text.block-168","segment.r017.book1.ch14.text.block-169","segment.r017.book1.ch14.text.block-170","segment.r017.book1.ch14.text.block-171","segment.r017.book1.ch14.text.block-172","segment.r017.book1.ch14.text.block-173","segment.r017.book1.ch14.text.block-174","segment.r017.book1.ch14.text.block-175","segment.r017.book1.ch14.text.block-176","segment.r017.book1.ch14.text.block-177","segment.r017.book1.ch14.text.block-178","segment.r017.book1.ch14.text.block-179","segment.r017.book1.ch14.text.block-180","segment.r017.book1.ch14.text.block-181","segment.r017.book1.ch14.text.block-182","segment.r017.book1.ch14.text.block-183","segment.r017.book1.ch14.text.block-184","segment.r017.book1.ch14.text.block-185","segment.r017.book1.ch14.text.block-186","segment.r017.book1.ch14.text.block-187","segment.r017.book1.ch14.text.block-188","segment.r017.book1.ch14.text.block-189","segment.r017.book1.ch14.text.block-190","segment.r017.book1.ch14.text.block-191","segment.r017.book1.ch14.text.block-192","segment.r017.book1.ch14.text.block-193","segment.r017.book1.ch14.text.block-194","segment.r017.book1.ch14.text.block-195","segment.r017.book1.ch14.text.block-196","segment.r017.book1.ch14.text.block-197","segment.r017.book1.ch14.text.block-198","segment.r017.book1.ch14.text.block-199","segment.r017.book1.ch14.text.block-200","segment.r017.book1.ch14.text.block-201","segment.r017.book1.ch14.text.block-202","segment.r017.book1.ch14.text.block-203","segment.r017.book1.ch14.text.block-204","segment.r017.book1.ch14.text.block-205","segment.r017.book1.ch14.text.block-206","segment.r017.book1.ch14.text.block-207","segment.r017.book1.ch14.text.block-208","segment.r017.book1.ch14.text.block-209","segment.r017.book1.ch14.text.block-210","segment.r017.book1.ch14.text.block-211","segment.r017.book1.ch14.text.block-212","segment.r017.book1.ch14.text.block-213","segment.r017.book1.ch14.text.block-214","segment.r017.book1.ch14.text.block-215","segment.r017.book1.ch14.text.block-216","segment.r017.book1.ch14.text.block-217","segment.r017.book1.ch14.text.block-218","segment.r017.book1.ch14.text.block-219","segment.r017.book1.ch14.text.block-220","segment.r017.book1.ch14.text.block-221","segment.r017.book1.ch14.text.block-222","segment.r017.book1.ch14.text.block-223","segment.r017.book1.ch14.text.block-224","segment.r017.book1.ch14.text.block-225","segment.r017.book1.ch14.text.block-226","segment.r017.book1.ch14.text.block-227","segment.r017.book1.ch14.text.block-228","segment.r017.book1.ch14.text.block-229","segment.r017.book1.ch14.text.block-230","segment.r017.book1.ch14.text.block-231","segment.r017.book1.ch14.text.block-232","segment.r017.book1.ch14.text.block-233","segment.r017.book1.ch14.text.block-234","segment.r017.book1.ch14.text.block-235","segment.r017.book1.ch14.text.block-236","segment.r017.book1.ch14.text.block-237","segment.r017.book1.ch14.text.block-238","segment.r017.book1.ch14.text.block-239","segment.r017.book1.ch14.text.block-240","segment.r017.book1.ch14.text.block-241","segment.r017.book1.ch14.text.block-242","segment.r017.book1.ch14.text.block-243","segment.r017.book1.ch14.text.block-244","segment.r017.book1.ch14.text.block-245","segment.r017.book1.ch14.text.block-246","segment.r017.book1.ch14.text.block-247","segment.r017.book1.ch14.text.block-248","segment.r017.book1.ch14.text.block-249","segment.r017.book1.ch14.text.block-250","segment.r017.book1.ch14.text.block-251","segment.r017.book1.ch14.text.block-252","segment.r017.book1.ch14.text.block-253","segment.r017.book1.ch14.text.block-254","segment.r017.book1.ch14.text.block-255","segment.r017.book1.ch14.text.block-256","segment.r017.book1.ch14.text.block-257","segment.r017.book1.ch14.text.block-258","segment.r017.book1.ch14.text.block-259","segment.r017.book1.ch14.text.block-260","segment.r017.book1.ch14.text.block-261","segment.r017.book1.ch14.text.block-262","segment.r017.book1.ch14.text.block-263","segment.r017.book1.ch14.text.block-264","segment.r017.book1.ch14.text.block-265","segment.r017.book1.ch14.text.block-266","segment.r017.book1.ch14.text.block-267","segment.r017.book1.ch14.text.block-268","segment.r017.book1.ch14.text.block-269","segment.r017.book1.ch14.text.block-270","segment.r017.book1.ch14.text.block-271","segment.r017.book1.ch14.text.block-272","segment.r017.book1.ch14.text.block-273","segment.r017.book1.ch14.text.block-274","segment.r017.book1.ch14.text.block-275","segment.r017.book1.ch14.text.block-276","segment.r017.book1.ch14.text.block-277","segment.r017.book1.ch14.text.block-278","segment.r017.book1.ch14.text.block-279","segment.r017.book1.ch14.text.block-280","segment.r017.book1.ch14.text.block-281","segment.r017.book1.ch14.text.block-282","segment.r017.book1.ch14.text.block-283","segment.r017.book1.ch14.text.block-284","segment.r017.book1.ch14.text.block-285","segment.r017.book1.ch14.text.block-286","segment.r017.book1.ch14.text.block-287","segment.r017.book1.ch14.text.block-288","segment.r017.book1.ch14.text.block-289","segment.r017.book1.ch14.text.block-290","segment.r017.book1.ch14.text.block-291","segment.r017.book1.ch14.text.block-292","segment.r017.book1.ch14.text.block-293","segment.r017.book1.ch14.text.block-294","segment.r017.book1.ch14.text.block-295","segment.r017.book1.ch14.text.block-296","segment.r017.book1.ch14.text.block-297","segment.r017.book1.ch14.text.block-298","segment.r017.book1.ch14.text.block-299","segment.r017.book1.ch14.text.block-300","segment.r017.book1.ch14.text.block-301","segment.r017.book1.ch14.text.block-302","segment.r017.book1.ch14.text.block-303","segment.r017.book1.ch14.text.block-304","segment.r017.book1.ch14.text.block-305","segment.r017.book1.ch14.text.block-306","segment.r017.book1.ch14.text.block-307","segment.r017.book1.ch14.text.block-308","segment.r017.book1.ch14.text.block-309","segment.r017.book1.ch14.text.block-310","segment.r017.book1.ch14.text.block-311","segment.r017.book1.ch14.text.block-312","segment.r017.book1.ch14.text.block-313","segment.r017.book1.ch14.text.block-314","segment.r017.book1.ch14.text.block-315","segment.r017.book1.ch14.text.block-316","segment.r017.book1.ch14.text.block-317","segment.r017.book1.ch14.text.block-318","segment.r017.book1.ch14.text.block-319","segment.r017.book1.ch14.text.block-320","segment.r017.book1.ch14.text.block-321","segment.r017.book1.ch14.text.block-322","segment.r017.book1.ch14.text.block-323","segment.r017.book1.ch14.text.block-324","segment.r017.book1.ch14.text.block-325","segment.r017.book1.ch14.text.block-326","segment.r017.book1.ch14.text.block-327","segment.r017.book1.ch14.text.block-328","segment.r017.book1.ch14.text.block-329","segment.r017.book1.ch14.text.block-330","segment.r017.book1.ch14.text.block-331","segment.r017.book1.ch14.text.block-332","segment.r017.book1.ch14.text.block-333","segment.r017.book1.ch14.text.block-334","segment.r017.book1.ch14.text.block-335","segment.r017.book1.ch14.text.block-336","segment.r017.book1.ch14.text.block-337","segment.r017.book1.ch14.text.block-338","segment.r017.book1.ch14.text.block-339","segment.r017.book1.ch14.text.block-340","segment.r017.book1.ch14.text.block-341","segment.r017.book1.ch14.text.block-342","segment.r017.book1.ch14.text.block-343","segment.r017.book1.ch14.text.block-344","segment.r017.book1.ch14.text.block-345","segment.r017.book1.ch14.text.block-346","segment.r017.book1.ch14.text.block-347","segment.r017.book1.ch14.text.block-348","segment.r017.book1.ch14.text.block-349","segment.r017.book1.ch14.text.block-350","segment.r017.book1.ch14.text.block-351","segment.r017.book1.ch14.text.block-352","segment.r017.book1.ch14.text.block-353","segment.r017.book1.ch14.text.block-354","segment.r017.book1.ch14.text.block-355","segment.r017.book1.ch14.text.block-356","segment.r017.book1.ch14.text.block-357","segment.r017.book1.ch14.text.block-358","segment.r017.book1.ch14.text.block-359","segment.r017.book1.ch14.text.block-360","segment.r017.book1.ch14.text.block-361","segment.r017.book1.ch14.text.block-362","segment.r017.book1.ch14.text.block-363","segment.r017.book1.ch14.text.block-364","segment.r017.book1.ch14.text.block-365","segment.r017.book1.ch14.text.block-366","segment.r017.book1.ch14.text.block-367","segment.r017.book1.ch14.text.block-368","segment.r017.book1.ch14.text.block-369","segment.r017.book1.ch14.text.block-370","segment.r017.book1.ch14.text.block-371","segment.r017.book1.ch14.text.block-372","segment.r017.book1.ch14.text.block-373","segment.r017.book1.ch14.text.block-374","segment.r017.book1.ch14.text.block-375","segment.r017.book1.ch14.text.block-376","segment.r017.book1.ch14.text.block-377","segment.r017.book1.ch14.text.block-378","segment.r017.book1.ch14.text.block-379","segment.r017.book1.ch14.text.block-380","segment.r017.book1.ch14.text.block-381","segment.r017.book1.ch14.text.block-382","segment.r017.book1.ch14.text.block-383","segment.r017.book1.ch14.text.block-384","segment.r017.book1.ch14.text.block-385","segment.r017.book1.ch14.text.block-386","segment.r017.book1.ch14.text.block-387","segment.r017.book1.ch14.text.block-388","segment.r017.book1.ch14.text.block-389","segment.r017.book1.ch14.text.block-390","segment.r017.book1.ch14.text.block-391","segment.r017.book1.ch14.text.block-392","segment.r017.book1.ch14.text.block-393","segment.r017.book1.ch14.text.block-394","segment.r017.book1.ch14.text.block-395","segment.r017.book1.ch14.text.block-396","segment.r017.book1.ch14.text.block-397","segment.r017.book1.ch14.text.block-398","segment.r017.book1.ch14.text.block-399","segment.r017.book1.ch14.text.block-400","segment.r017.book1.ch14.text.block-401","segment.r017.book1.ch14.text.block-402","segment.r017.book1.ch14.text.block-403","segment.r017.book1.ch14.text.block-404","segment.r017.book1.ch14.text.block-405","segment.r017.book1.ch14.text.block-406","segment.r017.book1.ch14.text.block-407","segment.r017.book1.ch14.text.block-408","segment.r017.book1.ch14.text.block-409","segment.r017.book1.ch14.text.block-410","segment.r017.book1.ch14.text.block-411","segment.r017.book1.ch14.text.block-412","segment.r017.book1.ch14.text.block-413","segment.r017.book1.ch14.text.block-414","segment.r017.book1.ch14.text.block-415","segment.r017.book1.ch14.text.block-416","segment.r017.book1.ch14.text.block-417","segment.r017.book1.ch14.text.block-418","segment.r017.book1.ch14.text.block-419","segment.r017.book1.ch14.text.block-420","segment.r017.book1.ch14.text.block-421","segment.r017.book1.ch14.text.block-422","segment.r017.book1.ch14.text.block-423","segment.r017.book1.ch14.text.block-424","segment.r017.book1.ch14.text.block-425","segment.r017.book1.ch14.text.block-426","segment.r017.book1.ch14.text.block-427","segment.r017.book1.ch14.text.block-428"],"native":{"concept_id":"concept.shortest-path","evidence":"Full-corpus id-ID terminology audit","id":"term.shortest-path.id","preferred":"lintasan terpendek","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"shortest path","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.simplex.readme.block-001","segment.o018.lab.simplex.readme.block-002","segment.o018.lab.simplex.readme.block-003","segment.o018.lab.simplex.readme.block-004","segment.o018.lab.simplex.readme.block-005","segment.o018.lab.simplex.readme.block-006","segment.o018.lab.simplex.readme.block-007","segment.o018.lab.simplex.readme.block-008","segment.o018.lab.simplex.readme.block-009","segment.o018.lab.simplex.readme.block-010"],"native":{"concept_id":"concept.simplex-algorithm","evidence":"Chapter 7 terminology decision; 2026-08-22 Indonesian field-usage QA confirmed metode simpleks as the established retrieval variant","id":"term.simplex-algorithm.id","preferred":"algoritma simpleks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear programming","source_locale":"en","source_term":"simplex algorithm","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["metode simpleks"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.simplex-optimality-condition","evidence":"Final id-ID corpus terminology audit","id":"term.simplex-optimality-condition.id","preferred":"syarat optimalitas biaya tereduksi simpleks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"simplex reduced-cost optimality condition","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.simplex.readme.block-001","segment.o018.lab.simplex.readme.block-002","segment.o018.lab.simplex.readme.block-003","segment.o018.lab.simplex.readme.block-004","segment.o018.lab.simplex.readme.block-005","segment.o018.lab.simplex.readme.block-006","segment.o018.lab.simplex.readme.block-007","segment.o018.lab.simplex.readme.block-008","segment.o018.lab.simplex.readme.block-009","segment.o018.lab.simplex.readme.block-010"],"native":{"concept_id":"concept.simplex-tableau","evidence":"Chapter 9 terminology decision","id":"term.simplex-tableau.id","preferred":"tableau simpleks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"tableau simplex","source_locale":"en","source_term":"simplex tableau","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["bentuk tableau"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch03.readme.block-001","segment.o018.lab.ch03.readme.block-002","segment.o018.lab.ch03.readme.block-003","segment.o018.lab.ch03.readme.block-004","segment.o018.lab.ch03.readme.block-005","segment.o018.lab.ch03.readme.block-006","segment.o018.lab.ch03.readme.block-007","segment.o018.lab.ch03.readme.block-008","segment.o018.lab.ch03.readme.block-009","segment.o018.lab.ch03.readme.block-010","segment.o018.lab.ch03.readme.block-011","segment.o018.lab.ch03.readme.block-012","segment.o018.lab.ch03.readme.block-013","segment.o018.lab.ch03.readme.block-014","segment.o018.lab.ch03.readme.block-015","segment.o018.lab.ch03.readme.block-016","segment.o018.lab.ch03.readme.block-017","segment.o018.lab.ch03.readme.block-018","segment.o018.lab.ch10.attribution.block-001","segment.o018.lab.ch10.attribution.block-002","segment.o018.lab.ch10.attribution.block-003","segment.o018.lab.ch10.attribution.block-004","segment.o018.lab.ch10.attribution.block-005","segment.o018.lab.ch10.attribution.block-006","segment.o018.lab.ch10.attribution.block-007","segment.o018.lab.ch10.attribution.block-008","segment.o018.lab.ch10.attribution.block-009","segment.o018.lab.ch10.attribution.block-010","segment.o018.lab.ch10.attribution.block-011","segment.o018.lab.ch10.attribution.block-012","segment.o018.lab.ch10.attribution.block-013","segment.o018.lab.ch10.attribution.block-014","segment.o018.lab.ch10.attribution.block-015","segment.o018.lab.ch10.attribution.block-016","segment.o018.lab.ch10.attribution.block-017","segment.o018.lab.ch10.readme.block-001","segment.o018.lab.ch10.readme.block-002","segment.o018.lab.ch10.readme.block-003","segment.o018.lab.ch10.readme.block-004","segment.o018.lab.ch10.readme.block-005","segment.o018.lab.ch10.readme.block-006","segment.o018.lab.ch10.readme.block-007","segment.o018.lab.ch10.readme.block-008","segment.o018.lab.ch10.readme.block-009","segment.o018.lab.ch10.readme.block-010","segment.r017.book1.ch03.text.block-059","segment.r017.book1.ch03.text.block-063","segment.r017.book1.ch10.solutions-manual.block-001","segment.r017.book1.ch10.solutions-manual.block-002","segment.r017.book1.ch10.solutions-manual.block-003","segment.r017.book1.ch10.solutions-manual.block-004","segment.r017.book1.ch10.solutions-manual.block-005","segment.r017.book1.ch10.solutions-manual.block-006","segment.r017.book1.ch10.solutions-manual.block-007","segment.r017.book1.ch10.solutions-manual.block-008","segment.r017.book1.ch10.solutions-manual.block-009","segment.r017.book1.ch10.solutions-manual.block-010","segment.r017.book1.ch10.solutions-manual.block-011","segment.r017.book1.ch10.solutions-manual.block-012","segment.r017.book1.ch10.solutions-manual.block-013","segment.r017.book1.ch10.solutions-manual.block-014","segment.r017.book1.ch10.solutions-manual.block-015","segment.r017.book1.ch10.solutions-manual.block-016","segment.r017.book1.ch10.solutions-manual.block-017","segment.r017.book1.ch10.solutions-manual.block-018","segment.r017.book1.ch10.solutions-manual.block-019","segment.r017.book1.ch10.solutions-manual.block-020","segment.r017.book1.ch10.solutions-manual.block-021","segment.r017.book1.ch10.solutions-manual.block-022","segment.r017.book1.ch10.solutions-manual.block-023","segment.r017.book1.ch10.solutions-manual.block-024","segment.r017.book1.ch10.solutions-manual.block-025","segment.r017.book1.ch10.solutions-manual.block-026","segment.r017.book1.ch10.solutions-manual.block-027","segment.r017.book1.ch10.solutions-manual.block-028","segment.r017.book1.ch10.solutions-manual.block-029","segment.r017.book1.ch10.solutions-manual.block-030","segment.r017.book1.ch10.solutions-manual.block-031","segment.r017.book1.ch10.solutions-manual.block-032","segment.r017.book1.ch10.solutions-manual.block-033","segment.r017.book1.ch10.solutions-manual.block-034","segment.r017.book1.ch10.solutions-manual.block-035","segment.r017.book1.ch10.solutions-manual.block-036","segment.r017.book1.ch10.solutions-manual.block-037","segment.r017.book1.ch10.solutions-manual.block-038","segment.r017.book1.ch10.solutions-manual.block-039","segment.r017.book1.ch10.solutions-manual.block-040","segment.r017.book1.ch10.solutions-manual.block-041","segment.r017.book1.ch10.solutions-manual.block-042","segment.r017.book1.ch10.solutions-manual.block-043","segment.r017.book1.ch10.text.block-001","segment.r017.book1.ch10.text.block-002","segment.r017.book1.ch10.text.block-003","segment.r017.book1.ch10.text.block-004","segment.r017.book1.ch10.text.block-005","segment.r017.book1.ch10.text.block-006","segment.r017.book1.ch10.text.block-007","segment.r017.book1.ch10.text.block-008","segment.r017.book1.ch10.text.block-009","segment.r017.book1.ch10.text.block-010","segment.r017.book1.ch10.text.block-011","segment.r017.book1.ch10.text.block-012","segment.r017.book1.ch10.text.block-013","segment.r017.book1.ch10.text.block-014","segment.r017.book1.ch10.text.block-015","segment.r017.book1.ch10.text.block-016","segment.r017.book1.ch10.text.block-017","segment.r017.book1.ch10.text.block-018","segment.r017.book1.ch10.text.block-019","segment.r017.book1.ch10.text.block-020","segment.r017.book1.ch10.text.block-021","segment.r017.book1.ch10.text.block-022","segment.r017.book1.ch10.text.block-023","segment.r017.book1.ch10.text.block-024","segment.r017.book1.ch10.text.block-025","segment.r017.book1.ch10.text.block-026","segment.r017.book1.ch10.text.block-027","segment.r017.book1.ch10.text.block-028","segment.r017.book1.ch10.text.block-029","segment.r017.book1.ch10.text.block-030","segment.r017.book1.ch10.text.block-031","segment.r017.book1.ch10.text.block-032","segment.r017.book1.ch10.text.block-033","segment.r017.book1.ch10.text.block-034","segment.r017.book1.ch10.text.block-035","segment.r017.book1.ch10.text.block-036","segment.r017.book1.ch10.text.block-037","segment.r017.book1.ch10.text.block-038","segment.r017.book1.ch10.text.block-039","segment.r017.book1.ch10.text.block-040","segment.r017.book1.ch10.text.block-041","segment.r017.book1.ch10.text.block-042","segment.r017.book1.ch10.text.block-043","segment.r017.book1.ch10.text.block-044","segment.r017.book1.ch10.text.block-045","segment.r017.book1.ch10.text.block-046","segment.r017.book1.ch10.text.block-047","segment.r017.book1.ch10.text.block-048","segment.r017.book1.ch10.text.block-049","segment.r017.book1.ch10.text.block-050","segment.r017.book1.ch10.text.block-051","segment.r017.book1.ch10.text.block-052","segment.r017.book1.ch10.text.block-053","segment.r017.book1.ch10.text.block-054","segment.r017.book1.ch10.text.block-055","segment.r017.book1.ch10.text.block-056","segment.r017.book1.ch10.text.block-057","segment.r017.book1.ch10.text.block-058","segment.r017.book1.ch10.text.block-059","segment.r017.book1.ch10.text.block-060","segment.r017.book1.ch10.text.block-061","segment.r017.book1.ch10.text.block-062","segment.r017.book1.ch10.text.block-063","segment.r017.book1.ch10.text.block-064","segment.r017.book1.ch10.text.block-065","segment.r017.book1.ch10.text.block-066","segment.r017.book1.ch10.text.block-067","segment.r017.book1.ch10.text.block-068","segment.r017.book1.ch10.text.block-069","segment.r017.book1.ch10.text.block-070","segment.r017.book1.ch10.text.block-071","segment.r017.book1.ch10.text.block-072","segment.r017.book1.ch10.text.block-073","segment.r017.book1.ch10.text.block-074","segment.r017.book1.ch10.text.block-075","segment.r017.book1.ch10.text.block-076","segment.r017.book1.ch10.text.block-077","segment.r017.book1.ch10.text.block-078","segment.r017.book1.ch10.text.block-079","segment.r017.book1.ch10.text.block-080","segment.r017.book1.ch10.text.block-081","segment.r017.book1.ch10.text.block-082","segment.r017.book1.ch10.text.block-083","segment.r017.book1.ch10.text.block-084","segment.r017.book1.ch10.text.block-085","segment.r017.book1.ch10.text.block-086","segment.r017.book1.ch10.text.block-087","segment.r017.book1.ch10.text.block-088","segment.r017.book1.ch10.text.block-089","segment.r017.book1.ch10.text.block-090","segment.r017.book1.ch10.text.block-091","segment.r017.book1.ch10.text.block-092","segment.r017.book1.ch10.text.block-093","segment.r017.book1.ch10.text.block-094","segment.r017.book1.ch10.text.block-095","segment.r017.book1.ch10.text.block-096","segment.r017.book1.ch10.text.block-097","segment.r017.book1.ch10.text.block-098","segment.r017.book1.ch10.text.block-099","segment.r017.book1.ch10.text.block-100","segment.r017.book1.ch10.text.block-101","segment.r017.book1.ch10.text.block-102","segment.r017.book1.ch10.text.block-103","segment.r017.book1.ch10.text.block-104","segment.r017.book1.ch10.text.block-105","segment.r017.book1.ch10.text.block-106","segment.r017.book1.ch10.text.block-107","segment.r017.book1.ch10.text.block-108","segment.r017.book1.ch10.text.block-109","segment.r017.book1.ch10.text.block-110","segment.r017.book1.ch10.text.block-111","segment.r017.book1.ch10.text.block-112","segment.r017.book1.ch10.text.block-113","segment.r017.book1.ch10.text.block-114","segment.r017.book1.ch10.text.block-115","segment.r017.book1.ch10.text.block-116","segment.r017.book1.ch10.text.block-117","segment.r017.book1.ch10.text.block-118","segment.r017.book1.ch10.text.block-119","segment.r017.book1.ch10.text.block-120","segment.r017.book1.ch10.text.block-121","segment.r017.book1.ch10.text.block-122","segment.r017.book1.ch10.text.block-123","segment.r017.book1.ch10.text.block-124","segment.r017.book1.ch10.text.block-125","segment.r017.book1.ch10.text.block-126","segment.r017.book1.ch10.text.block-127","segment.r017.book1.ch10.text.block-128","segment.r017.book1.ch10.text.block-129","segment.r017.book1.ch10.text.block-130","segment.r017.book1.ch10.text.block-131","segment.r017.book1.ch10.text.block-132","segment.r017.book1.ch10.text.block-133","segment.r017.book1.ch10.text.block-134"],"native":{"concept_id":"concept.sensitivity-analysis","evidence":"Chapter 3 terminology decision","id":"term.slack.id","preferred":"kelonggaran","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"constraint status","source_locale":"en","source_term":"slack","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["slack"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.solver","evidence":"first-boundary editorial terminology decision","id":"term.solver.id","preferred":"solver","recorded_at":"2026-08-23T00:00:00+02:00","register":"technical","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"software","source_locale":"en","source_term":"solver","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["perangkat pemecah"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch03.text.block-003"],"native":{"concept_id":"concept.spreadsheet-formula","evidence":"Final id-ID corpus terminology audit","id":"term.spreadsheet-formula.id","preferred":"rumus lembar kerja","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"spreadsheet formula","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.standard-form","evidence":"Chapter 7 terminology decision; 2026-08-22 Indonesian field-usage QA added bentuk baku as a scoped retrieval alias without conflating it with bentuk kanonik","id":"term.standard-form.id","preferred":"bentuk standar","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear programming","source_locale":"en","source_term":"standard form","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["bentuk baku"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.stochastic-optimization","evidence":"first-boundary editorial terminology decision","id":"term.stochastic-optimization.id","preferred":"optimisasi stokastik","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"model class","source_locale":"en","source_term":"stochastic optimization","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch11.attribution.block-001","segment.o018.lab.ch11.attribution.block-002","segment.o018.lab.ch11.attribution.block-003","segment.o018.lab.ch11.attribution.block-004","segment.o018.lab.ch11.attribution.block-005","segment.o018.lab.ch11.attribution.block-006","segment.o018.lab.ch11.attribution.block-007","segment.o018.lab.ch11.attribution.block-008","segment.o018.lab.ch11.attribution.block-009","segment.o018.lab.ch11.attribution.block-010","segment.o018.lab.ch11.attribution.block-011","segment.o018.lab.ch11.attribution.block-012","segment.o018.lab.ch11.attribution.block-013","segment.o018.lab.ch11.attribution.block-014","segment.o018.lab.ch11.attribution.block-015","segment.o018.lab.ch11.attribution.block-016","segment.o018.lab.ch11.attribution.block-017","segment.o018.lab.ch11.attribution.block-018","segment.o018.lab.ch11.readme.block-001","segment.o018.lab.ch11.readme.block-002","segment.o018.lab.ch11.readme.block-003","segment.o018.lab.ch11.readme.block-004","segment.o018.lab.ch11.readme.block-005","segment.o018.lab.ch11.readme.block-006","segment.o018.lab.ch11.readme.block-007","segment.o018.lab.ch11.readme.block-008","segment.o018.lab.ch11.readme.block-009","segment.o018.lab.ch11.readme.block-010","segment.r017.book1.ch11.text-a.block-001","segment.r017.book1.ch11.text-a.block-002","segment.r017.book1.ch11.text-a.block-003","segment.r017.book1.ch11.text-a.block-004","segment.r017.book1.ch11.text-a.block-005","segment.r017.book1.ch11.text-a.block-006","segment.r017.book1.ch11.text-a.block-007","segment.r017.book1.ch11.text-a.block-008","segment.r017.book1.ch11.text-a.block-009","segment.r017.book1.ch11.text-a.block-010","segment.r017.book1.ch11.text-a.block-011","segment.r017.book1.ch11.text-a.block-012","segment.r017.book1.ch11.text-a.block-013","segment.r017.book1.ch11.text-a.block-014","segment.r017.book1.ch11.text-a.block-015","segment.r017.book1.ch11.text-a.block-016","segment.r017.book1.ch11.text-a.block-017","segment.r017.book1.ch11.text-a.block-018","segment.r017.book1.ch11.text-a.block-019","segment.r017.book1.ch11.text-a.block-020","segment.r017.book1.ch11.text-a.block-021","segment.r017.book1.ch11.text-a.block-022","segment.r017.book1.ch11.text-a.block-023","segment.r017.book1.ch11.text-a.block-024","segment.r017.book1.ch11.text-a.block-025","segment.r017.book1.ch11.text-a.block-026","segment.r017.book1.ch11.text-a.block-027","segment.r017.book1.ch11.text-a.block-028","segment.r017.book1.ch11.text-a.block-029","segment.r017.book1.ch11.text-a.block-030","segment.r017.book1.ch11.text-a.block-031","segment.r017.book1.ch11.text-a.block-032","segment.r017.book1.ch11.text-a.block-033","segment.r017.book1.ch11.text-a.block-034","segment.r017.book1.ch11.text-a.block-035","segment.r017.book1.ch11.text-a.block-036","segment.r017.book1.ch11.text-a.block-037","segment.r017.book1.ch11.text-a.block-038","segment.r017.book1.ch11.text-a.block-039","segment.r017.book1.ch11.text-a.block-040","segment.r017.book1.ch11.text-a.block-041","segment.r017.book1.ch11.text-a.block-042","segment.r017.book1.ch11.text-a.block-043","segment.r017.book1.ch11.text-a.block-044","segment.r017.book1.ch11.text-a.block-045","segment.r017.book1.ch11.text-a.block-046","segment.r017.book1.ch11.text-a.block-047","segment.r017.book1.ch11.text-a.block-048","segment.r017.book1.ch11.text-a.block-049","segment.r017.book1.ch11.text-a.block-050","segment.r017.book1.ch11.text-a.block-051","segment.r017.book1.ch11.text-a.block-052","segment.r017.book1.ch11.text-a.block-053","segment.r017.book1.ch11.text-a.block-054","segment.r017.book1.ch11.text-a.block-055","segment.r017.book1.ch11.text-a.block-056","segment.r017.book1.ch11.text-a.block-057","segment.r017.book1.ch11.text-a.block-058","segment.r017.book1.ch11.text-a.block-059","segment.r017.book1.ch11.text-a.block-060","segment.r017.book1.ch11.text-a.block-061","segment.r017.book1.ch11.text-a.block-062","segment.r017.book1.ch11.text-a.block-063","segment.r017.book1.ch11.text-a.block-064","segment.r017.book1.ch11.text-a.block-065","segment.r017.book1.ch11.text-a.block-066","segment.r017.book1.ch11.text-a.block-067","segment.r017.book1.ch11.text-a.block-068","segment.r017.book1.ch11.text-a.block-069","segment.r017.book1.ch11.text-a.block-070","segment.r017.book1.ch11.text-a.block-071","segment.r017.book1.ch11.text-a.block-072","segment.r017.book1.ch11.text-a.block-073","segment.r017.book1.ch11.text-a.block-074","segment.r017.book1.ch11.text-a.block-075","segment.r017.book1.ch11.text-a.block-076","segment.r017.book1.ch11.text-a.block-077","segment.r017.book1.ch11.text-a.block-078","segment.r017.book1.ch11.text-a.block-079","segment.r017.book1.ch11.text-a.block-080","segment.r017.book1.ch11.text-a.block-081","segment.r017.book1.ch11.text-a.block-082","segment.r017.book1.ch11.text-a.block-083","segment.r017.book1.ch11.text-a.block-084","segment.r017.book1.ch11.text-a.block-085","segment.r017.book1.ch11.text-a.block-086","segment.r017.book1.ch11.text-a.block-087","segment.r017.book1.ch11.text-a.block-088","segment.r017.book1.ch11.text-a.block-089","segment.r017.book1.ch11.text-a.block-090","segment.r017.book1.ch11.text-a.block-091","segment.r017.book1.ch11.text-a.block-092","segment.r017.book1.ch11.text-a.block-093","segment.r017.book1.ch11.text-a.block-094","segment.r017.book1.ch11.text-a.block-095","segment.r017.book1.ch11.text-a.block-096","segment.r017.book1.ch11.text-a.block-097","segment.r017.book1.ch11.text-a.block-098","segment.r017.book1.ch11.text-a.block-099","segment.r017.book1.ch11.text-a.block-100","segment.r017.book1.ch11.text-a.block-101","segment.r017.book1.ch11.text-a.block-102","segment.r017.book1.ch11.text-a.block-103","segment.r017.book1.ch11.text-a.block-104","segment.r017.book1.ch11.text-a.block-105","segment.r017.book1.ch11.text-a.block-106","segment.r017.book1.ch11.text-a.block-107","segment.r017.book1.ch11.text-a.block-108","segment.r017.book1.ch11.text-a.block-109","segment.r017.book1.ch11.text-a.block-110","segment.r017.book1.ch11.text-a.block-111","segment.r017.book1.ch11.text-a.block-112","segment.r017.book1.ch11.text-a.block-113","segment.r017.book1.ch11.text-a.block-114","segment.r017.book1.ch11.text-a.block-115","segment.r017.book1.ch11.text-a.block-116","segment.r017.book1.ch11.text-a.block-117","segment.r017.book1.ch11.text-a.block-118","segment.r017.book1.ch11.text-a.block-119","segment.r017.book1.ch11.text-a.block-120","segment.r017.book1.ch11.text-a.block-121","segment.r017.book1.ch11.text-a.block-122","segment.r017.book1.ch11.text-a.block-123","segment.r017.book1.ch11.text-a.block-124","segment.r017.book1.ch11.text-a.block-125","segment.r017.book1.ch11.text-a.block-126","segment.r017.book1.ch11.text-a.block-127","segment.r017.book1.ch11.text-a.block-128","segment.r017.book1.ch11.text-a.block-129","segment.r017.book1.ch11.text-a.block-130","segment.r017.book1.ch11.text-a.block-131","segment.r017.book1.ch11.text-a.block-132","segment.r017.book1.ch11.text-a.block-133","segment.r017.book1.ch11.text-a.block-134","segment.r017.book1.ch11.text-a.block-135","segment.r017.book1.ch11.text-a.block-136","segment.r017.book1.ch11.text-a.block-137","segment.r017.book1.ch11.text-a.block-138","segment.r017.book1.ch11.text-a.block-139","segment.r017.book1.ch11.text-a.block-140","segment.r017.book1.ch11.text-a.block-141","segment.r017.book1.ch11.text-a.block-142","segment.r017.book1.ch11.text-a.block-143","segment.r017.book1.ch11.text-a.block-144","segment.r017.book1.ch11.text-a.block-145","segment.r017.book1.ch11.text-a.block-146","segment.r017.book1.ch11.text-a.block-147","segment.r017.book1.ch11.text-a.block-148","segment.r017.book1.ch11.text-a.block-149","segment.r017.book1.ch11.text-a.block-150","segment.r017.book1.ch11.text-a.block-151","segment.r017.book1.ch11.text-a.block-152","segment.r017.book1.ch11.text-a.block-153","segment.r017.book1.ch11.text-a.block-154","segment.r017.book1.ch11.text-a.block-155","segment.r017.book1.ch11.text-a.block-156","segment.r017.book1.ch11.text-a.block-157","segment.r017.book1.ch11.text-a.block-158","segment.r017.book1.ch11.text-a.block-159","segment.r017.book1.ch11.text-a.block-160","segment.r017.book1.ch11.text-a.block-161","segment.r017.book1.ch11.text-a.block-162","segment.r017.book1.ch11.text-a.block-163","segment.r017.book1.ch11.text-a.block-164","segment.r017.book1.ch11.text-a.block-165","segment.r017.book1.ch11.text-a.block-166","segment.r017.book1.ch11.text-a.block-167","segment.r017.book1.ch11.text-a.block-168","segment.r017.book1.ch11.text-a.block-169","segment.r017.book1.ch11.text-a.block-170","segment.r017.book1.ch11.text-a.block-171","segment.r017.book1.ch11.text-a.block-172","segment.r017.book1.ch11.text-a.block-173","segment.r017.book1.ch11.text-a.block-174","segment.r017.book1.ch11.text-a.block-175","segment.r017.book1.ch11.text-a.block-176","segment.r017.book1.ch11.text-a.block-177","segment.r017.book1.ch11.text-a.block-178","segment.r017.book1.ch11.text-a.block-179","segment.r017.book1.ch11.text-a.block-180","segment.r017.book1.ch11.text-a.block-181","segment.r017.book1.ch11.text-a.block-182","segment.r017.book1.ch11.text-a.block-183","segment.r017.book1.ch11.text-a.block-184","segment.r017.book1.ch11.text-a.block-185","segment.r017.book1.ch11.text-a.block-186","segment.r017.book1.ch11.text-a.block-187","segment.r017.book1.ch11.text-a.block-188","segment.r017.book1.ch11.text-a.block-189","segment.r017.book1.ch11.text-a.block-190","segment.r017.book1.ch11.text-a.block-191","segment.r017.book1.ch11.text-a.block-192","segment.r017.book1.ch11.text-a.block-193","segment.r017.book1.ch11.text-a.block-194","segment.r017.book1.ch11.text-a.block-195","segment.r017.book1.ch11.text-a.block-196","segment.r017.book1.ch11.text-a.block-197","segment.r017.book1.ch11.text-a.block-198","segment.r017.book1.ch11.text-a.block-199","segment.r017.book1.ch11.text-a.block-200","segment.r017.book1.ch11.text-a.block-201","segment.r017.book1.ch11.text-a.block-202","segment.r017.book1.ch11.text-b.block-001","segment.r017.book1.ch11.text-b.block-002","segment.r017.book1.ch11.text-b.block-003","segment.r017.book1.ch11.text-b.block-004","segment.r017.book1.ch11.text-b.block-005","segment.r017.book1.ch11.text-b.block-006","segment.r017.book1.ch11.text-b.block-007","segment.r017.book1.ch11.text-b.block-008","segment.r017.book1.ch11.text-b.block-009","segment.r017.book1.ch11.text-b.block-010","segment.r017.book1.ch11.text-b.block-011","segment.r017.book1.ch11.text-b.block-012","segment.r017.book1.ch11.text-b.block-013","segment.r017.book1.ch11.text-b.block-014","segment.r017.book1.ch11.text-b.block-015","segment.r017.book1.ch11.text-b.block-016","segment.r017.book1.ch11.text-b.block-017","segment.r017.book1.ch11.text-b.block-018","segment.r017.book1.ch11.text-b.block-019","segment.r017.book1.ch11.text-b.block-020","segment.r017.book1.ch11.text-b.block-021","segment.r017.book1.ch11.text-b.block-022","segment.r017.book1.ch11.text-b.block-023","segment.r017.book1.ch11.text-b.block-024","segment.r017.book1.ch11.text-b.block-025","segment.r017.book1.ch11.text-b.block-026","segment.r017.book1.ch11.text-b.block-027","segment.r017.book1.ch11.text-b.block-028","segment.r017.book1.ch11.text-b.block-029","segment.r017.book1.ch11.text-b.block-030","segment.r017.book1.ch11.text-b.block-031","segment.r017.book1.ch11.text-b.block-032","segment.r017.book1.ch11.text-b.block-033","segment.r017.book1.ch11.text-b.block-034","segment.r017.book1.ch11.text-b.block-035","segment.r017.book1.ch11.text-b.block-036","segment.r017.book1.ch11.text-b.block-037","segment.r017.book1.ch11.text-b.block-038","segment.r017.book1.ch11.text-b.block-039","segment.r017.book1.ch11.text-b.block-040","segment.r017.book1.ch11.text-b.block-041","segment.r017.book1.ch11.text-b.block-042","segment.r017.book1.ch11.text-b.block-043","segment.r017.book1.ch11.text-b.block-044","segment.r017.book1.ch11.text-b.block-045","segment.r017.book1.ch11.text-b.block-046","segment.r017.book1.ch11.text-b.block-047","segment.r017.book1.ch11.text-b.block-048","segment.r017.book1.ch11.text-b.block-049","segment.r017.book1.ch11.text-b.block-050","segment.r017.book1.ch11.text-b.block-051","segment.r017.book1.ch11.text-b.block-052","segment.r017.book1.ch11.text-b.block-053","segment.r017.book1.ch11.text-b.block-054","segment.r017.book1.ch11.text-b.block-055","segment.r017.book1.ch11.text-b.block-056","segment.r017.book1.ch11.text-b.block-057","segment.r017.book1.ch11.text-b.block-058","segment.r017.book1.ch11.text-b.block-059","segment.r017.book1.ch11.text-b.block-060","segment.r017.book1.ch11.text-b.block-061","segment.r017.book1.ch11.text-b.block-062","segment.r017.book1.ch11.text-b.block-063","segment.r017.book1.ch11.text-b.block-064","segment.r017.book1.ch11.text-b.block-065","segment.r017.book1.ch11.text-b.block-066","segment.r017.book1.ch11.text-b.block-067","segment.r017.book1.ch11.text-b.block-068","segment.r017.book1.ch11.text-b.block-069","segment.r017.book1.ch11.text-b.block-070","segment.r017.book1.ch11.text-b.block-071","segment.r017.book1.ch11.text-b.block-072","segment.r017.book1.ch11.text-b.block-073","segment.r017.book1.ch11.text-b.block-074","segment.r017.book1.ch11.text-b.block-075","segment.r017.book1.ch11.text-b.block-076","segment.r017.book1.ch11.text-b.block-077","segment.r017.book1.ch11.text-b.block-078","segment.r017.book1.ch11.text-b.block-079","segment.r017.book1.ch11.text-b.block-080","segment.r017.book1.ch11.text-b.block-081","segment.r017.book1.ch11.text-b.block-082","segment.r017.book1.ch11.text-b.block-083","segment.r017.book1.ch11.text-b.block-084","segment.r017.book1.ch11.text-b.block-085","segment.r017.book1.ch11.text-b.block-086","segment.r017.book1.ch11.text-b.block-087","segment.r017.book1.ch11.text-b.block-088","segment.r017.book1.ch11.text-b.block-089","segment.r017.book1.ch11.text-b.block-090","segment.r017.book1.ch11.text-b.block-091","segment.r017.book1.ch11.text-b.block-092","segment.r017.book1.ch11.text-b.block-093","segment.r017.book1.ch11.text-b.block-094","segment.r017.book1.ch11.text-b.block-095","segment.r017.book1.ch11.text-b.block-096","segment.r017.book1.ch11.text-b.block-097","segment.r017.book1.ch11.text-b.block-098","segment.r017.book1.ch11.text-b.block-099","segment.r017.book1.ch11.text-b.block-100","segment.r017.book1.ch11.text-b.block-101","segment.r017.book1.ch11.text-b.block-102","segment.r017.book1.ch11.text-b.block-103","segment.r017.book1.ch11.text-b.block-104","segment.r017.book1.ch11.text-b.block-105","segment.r017.book1.ch11.text-b.block-106","segment.r017.book1.ch11.text-b.block-107","segment.r017.book1.ch11.text-b.block-108","segment.r017.book1.ch11.text-b.block-109","segment.r017.book1.ch11.text-b.block-110","segment.r017.book1.ch11.text-b.block-111","segment.r017.book1.ch11.text-b.block-112","segment.r017.book1.ch11.text-b.block-113","segment.r017.book1.ch11.text-b.block-114","segment.r017.book1.ch11.text-b.block-115","segment.r017.book1.ch11.text-b.block-116","segment.r017.book1.ch11.text-b.block-117","segment.r017.book1.ch11.text-b.block-118","segment.r017.book1.ch11.text-b.block-119","segment.r017.book1.ch11.text-b.block-120","segment.r017.book1.ch11.text-b.block-121","segment.r017.book1.ch11.text-b.block-122","segment.r017.book1.ch11.text-b.block-123","segment.r017.book1.ch11.text-b.block-124","segment.r017.book1.ch11.text-b.block-125","segment.r017.book1.ch11.text-b.block-126","segment.r017.book1.ch11.text-b.block-127","segment.r017.book1.ch11.text-b.block-128","segment.r017.book1.ch11.text-b.block-129","segment.r017.book1.ch11.text-b.block-130","segment.r017.book1.ch11.text-b.block-131","segment.r017.book1.ch11.text-b.block-132","segment.r017.book1.ch11.text-b.block-133","segment.r017.book1.ch11.text-b.block-134","segment.r017.book1.ch11.text-b.block-135","segment.r017.book1.ch11.text-b.block-136","segment.r017.book1.ch11.text-b.block-137"],"native":{"concept_id":"concept.strong-duality","evidence":"Full-corpus id-ID terminology audit","id":"term.strong-duality.id","preferred":"dualitas kuat","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"strong duality","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch04.text-a.block-017"],"native":{"concept_id":"concept.summation-notation","evidence":"Chapter 4 terminology decision","id":"term.summation-notation.id","preferred":"notasi penjumlahan","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"compact indexed optimization models","source_locale":"en","source_term":"summation notation","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch04.text-a.block-055","segment.r017.book1.ch04.text-b.block-212"],"native":{"concept_id":"concept.total-unimodularity","evidence":"Chapter 4 terminology decision","id":"term.total-unimodularity.id","preferred":"unimodularitas total","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"integral network and assignment polyhedra","source_locale":"en","source_term":"total unimodularity","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch02.text.block-130","segment.r017.book1.ch03.text.block-055","segment.r017.book1.ch03.text.block-063","segment.r017.book1.ch04.text-b.block-018","segment.r017.book1.ch04.text-b.block-142"],"native":{"concept_id":"concept.transportation-model","evidence":"Chapter 2 Transportation Problem subsection","id":"term.transportation.id","preferred":"masalah transportasi","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"network linear-programming model class","source_locale":"en","source_term":"transportation problem","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["model transportasi"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch04.text-b.block-037","segment.r017.book1.ch04.text-b.block-206"],"native":{"concept_id":"concept.transshipment","evidence":"Chapter 4 terminology decision","id":"term.transshipment.id","preferred":"transshipment","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"intermediate-node network models","source_locale":"en","source_term":"transshipment","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["alih muat"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch14.text.block-001","segment.r017.book1.ch14.text.block-002","segment.r017.book1.ch14.text.block-003","segment.r017.book1.ch14.text.block-004","segment.r017.book1.ch14.text.block-005","segment.r017.book1.ch14.text.block-006","segment.r017.book1.ch14.text.block-007","segment.r017.book1.ch14.text.block-008","segment.r017.book1.ch14.text.block-009","segment.r017.book1.ch14.text.block-010","segment.r017.book1.ch14.text.block-011","segment.r017.book1.ch14.text.block-012","segment.r017.book1.ch14.text.block-013","segment.r017.book1.ch14.text.block-014","segment.r017.book1.ch14.text.block-015","segment.r017.book1.ch14.text.block-016","segment.r017.book1.ch14.text.block-017","segment.r017.book1.ch14.text.block-018","segment.r017.book1.ch14.text.block-019","segment.r017.book1.ch14.text.block-020","segment.r017.book1.ch14.text.block-021","segment.r017.book1.ch14.text.block-022","segment.r017.book1.ch14.text.block-023","segment.r017.book1.ch14.text.block-024","segment.r017.book1.ch14.text.block-025","segment.r017.book1.ch14.text.block-026","segment.r017.book1.ch14.text.block-027","segment.r017.book1.ch14.text.block-028","segment.r017.book1.ch14.text.block-029","segment.r017.book1.ch14.text.block-030","segment.r017.book1.ch14.text.block-031","segment.r017.book1.ch14.text.block-032","segment.r017.book1.ch14.text.block-033","segment.r017.book1.ch14.text.block-034","segment.r017.book1.ch14.text.block-035","segment.r017.book1.ch14.text.block-036","segment.r017.book1.ch14.text.block-037","segment.r017.book1.ch14.text.block-038","segment.r017.book1.ch14.text.block-039","segment.r017.book1.ch14.text.block-040","segment.r017.book1.ch14.text.block-041","segment.r017.book1.ch14.text.block-042","segment.r017.book1.ch14.text.block-043","segment.r017.book1.ch14.text.block-044","segment.r017.book1.ch14.text.block-045","segment.r017.book1.ch14.text.block-046","segment.r017.book1.ch14.text.block-047","segment.r017.book1.ch14.text.block-048","segment.r017.book1.ch14.text.block-049","segment.r017.book1.ch14.text.block-050","segment.r017.book1.ch14.text.block-051","segment.r017.book1.ch14.text.block-052","segment.r017.book1.ch14.text.block-053","segment.r017.book1.ch14.text.block-054","segment.r017.book1.ch14.text.block-055","segment.r017.book1.ch14.text.block-056","segment.r017.book1.ch14.text.block-057","segment.r017.book1.ch14.text.block-058","segment.r017.book1.ch14.text.block-059","segment.r017.book1.ch14.text.block-060","segment.r017.book1.ch14.text.block-061","segment.r017.book1.ch14.text.block-062","segment.r017.book1.ch14.text.block-063","segment.r017.book1.ch14.text.block-064","segment.r017.book1.ch14.text.block-065","segment.r017.book1.ch14.text.block-066","segment.r017.book1.ch14.text.block-067","segment.r017.book1.ch14.text.block-068","segment.r017.book1.ch14.text.block-069","segment.r017.book1.ch14.text.block-070","segment.r017.book1.ch14.text.block-071","segment.r017.book1.ch14.text.block-072","segment.r017.book1.ch14.text.block-073","segment.r017.book1.ch14.text.block-074","segment.r017.book1.ch14.text.block-075","segment.r017.book1.ch14.text.block-076","segment.r017.book1.ch14.text.block-077","segment.r017.book1.ch14.text.block-078","segment.r017.book1.ch14.text.block-079","segment.r017.book1.ch14.text.block-080","segment.r017.book1.ch14.text.block-081","segment.r017.book1.ch14.text.block-082","segment.r017.book1.ch14.text.block-083","segment.r017.book1.ch14.text.block-084","segment.r017.book1.ch14.text.block-085","segment.r017.book1.ch14.text.block-086","segment.r017.book1.ch14.text.block-087","segment.r017.book1.ch14.text.block-088","segment.r017.book1.ch14.text.block-089","segment.r017.book1.ch14.text.block-090","segment.r017.book1.ch14.text.block-091","segment.r017.book1.ch14.text.block-092","segment.r017.book1.ch14.text.block-093","segment.r017.book1.ch14.text.block-094","segment.r017.book1.ch14.text.block-095","segment.r017.book1.ch14.text.block-096","segment.r017.book1.ch14.text.block-097","segment.r017.book1.ch14.text.block-098","segment.r017.book1.ch14.text.block-099","segment.r017.book1.ch14.text.block-100","segment.r017.book1.ch14.text.block-101","segment.r017.book1.ch14.text.block-102","segment.r017.book1.ch14.text.block-103","segment.r017.book1.ch14.text.block-104","segment.r017.book1.ch14.text.block-105","segment.r017.book1.ch14.text.block-106","segment.r017.book1.ch14.text.block-107","segment.r017.book1.ch14.text.block-108","segment.r017.book1.ch14.text.block-109","segment.r017.book1.ch14.text.block-110","segment.r017.book1.ch14.text.block-111","segment.r017.book1.ch14.text.block-112","segment.r017.book1.ch14.text.block-113","segment.r017.book1.ch14.text.block-114","segment.r017.book1.ch14.text.block-115","segment.r017.book1.ch14.text.block-116","segment.r017.book1.ch14.text.block-117","segment.r017.book1.ch14.text.block-118","segment.r017.book1.ch14.text.block-119","segment.r017.book1.ch14.text.block-120","segment.r017.book1.ch14.text.block-121","segment.r017.book1.ch14.text.block-122","segment.r017.book1.ch14.text.block-123","segment.r017.book1.ch14.text.block-124","segment.r017.book1.ch14.text.block-125","segment.r017.book1.ch14.text.block-126","segment.r017.book1.ch14.text.block-127","segment.r017.book1.ch14.text.block-128","segment.r017.book1.ch14.text.block-129","segment.r017.book1.ch14.text.block-130","segment.r017.book1.ch14.text.block-131","segment.r017.book1.ch14.text.block-132","segment.r017.book1.ch14.text.block-133","segment.r017.book1.ch14.text.block-134","segment.r017.book1.ch14.text.block-135","segment.r017.book1.ch14.text.block-136","segment.r017.book1.ch14.text.block-137","segment.r017.book1.ch14.text.block-138","segment.r017.book1.ch14.text.block-139","segment.r017.book1.ch14.text.block-140","segment.r017.book1.ch14.text.block-141","segment.r017.book1.ch14.text.block-142","segment.r017.book1.ch14.text.block-143","segment.r017.book1.ch14.text.block-144","segment.r017.book1.ch14.text.block-145","segment.r017.book1.ch14.text.block-146","segment.r017.book1.ch14.text.block-147","segment.r017.book1.ch14.text.block-148","segment.r017.book1.ch14.text.block-149","segment.r017.book1.ch14.text.block-150","segment.r017.book1.ch14.text.block-151","segment.r017.book1.ch14.text.block-152","segment.r017.book1.ch14.text.block-153","segment.r017.book1.ch14.text.block-154","segment.r017.book1.ch14.text.block-155","segment.r017.book1.ch14.text.block-156","segment.r017.book1.ch14.text.block-157","segment.r017.book1.ch14.text.block-158","segment.r017.book1.ch14.text.block-159","segment.r017.book1.ch14.text.block-160","segment.r017.book1.ch14.text.block-161","segment.r017.book1.ch14.text.block-162","segment.r017.book1.ch14.text.block-163","segment.r017.book1.ch14.text.block-164","segment.r017.book1.ch14.text.block-165","segment.r017.book1.ch14.text.block-166","segment.r017.book1.ch14.text.block-167","segment.r017.book1.ch14.text.block-168","segment.r017.book1.ch14.text.block-169","segment.r017.book1.ch14.text.block-170","segment.r017.book1.ch14.text.block-171","segment.r017.book1.ch14.text.block-172","segment.r017.book1.ch14.text.block-173","segment.r017.book1.ch14.text.block-174","segment.r017.book1.ch14.text.block-175","segment.r017.book1.ch14.text.block-176","segment.r017.book1.ch14.text.block-177","segment.r017.book1.ch14.text.block-178","segment.r017.book1.ch14.text.block-179","segment.r017.book1.ch14.text.block-180","segment.r017.book1.ch14.text.block-181","segment.r017.book1.ch14.text.block-182","segment.r017.book1.ch14.text.block-183","segment.r017.book1.ch14.text.block-184","segment.r017.book1.ch14.text.block-185","segment.r017.book1.ch14.text.block-186","segment.r017.book1.ch14.text.block-187","segment.r017.book1.ch14.text.block-188","segment.r017.book1.ch14.text.block-189","segment.r017.book1.ch14.text.block-190","segment.r017.book1.ch14.text.block-191","segment.r017.book1.ch14.text.block-192","segment.r017.book1.ch14.text.block-193","segment.r017.book1.ch14.text.block-194","segment.r017.book1.ch14.text.block-195","segment.r017.book1.ch14.text.block-196","segment.r017.book1.ch14.text.block-197","segment.r017.book1.ch14.text.block-198","segment.r017.book1.ch14.text.block-199","segment.r017.book1.ch14.text.block-200","segment.r017.book1.ch14.text.block-201","segment.r017.book1.ch14.text.block-202","segment.r017.book1.ch14.text.block-203","segment.r017.book1.ch14.text.block-204","segment.r017.book1.ch14.text.block-205","segment.r017.book1.ch14.text.block-206","segment.r017.book1.ch14.text.block-207","segment.r017.book1.ch14.text.block-208","segment.r017.book1.ch14.text.block-209","segment.r017.book1.ch14.text.block-210","segment.r017.book1.ch14.text.block-211","segment.r017.book1.ch14.text.block-212","segment.r017.book1.ch14.text.block-213","segment.r017.book1.ch14.text.block-214","segment.r017.book1.ch14.text.block-215","segment.r017.book1.ch14.text.block-216","segment.r017.book1.ch14.text.block-217","segment.r017.book1.ch14.text.block-218","segment.r017.book1.ch14.text.block-219","segment.r017.book1.ch14.text.block-220","segment.r017.book1.ch14.text.block-221","segment.r017.book1.ch14.text.block-222","segment.r017.book1.ch14.text.block-223","segment.r017.book1.ch14.text.block-224","segment.r017.book1.ch14.text.block-225","segment.r017.book1.ch14.text.block-226","segment.r017.book1.ch14.text.block-227","segment.r017.book1.ch14.text.block-228","segment.r017.book1.ch14.text.block-229","segment.r017.book1.ch14.text.block-230","segment.r017.book1.ch14.text.block-231","segment.r017.book1.ch14.text.block-232","segment.r017.book1.ch14.text.block-233","segment.r017.book1.ch14.text.block-234","segment.r017.book1.ch14.text.block-235","segment.r017.book1.ch14.text.block-236","segment.r017.book1.ch14.text.block-237","segment.r017.book1.ch14.text.block-238","segment.r017.book1.ch14.text.block-239","segment.r017.book1.ch14.text.block-240","segment.r017.book1.ch14.text.block-241","segment.r017.book1.ch14.text.block-242","segment.r017.book1.ch14.text.block-243","segment.r017.book1.ch14.text.block-244","segment.r017.book1.ch14.text.block-245","segment.r017.book1.ch14.text.block-246","segment.r017.book1.ch14.text.block-247","segment.r017.book1.ch14.text.block-248","segment.r017.book1.ch14.text.block-249","segment.r017.book1.ch14.text.block-250","segment.r017.book1.ch14.text.block-251","segment.r017.book1.ch14.text.block-252","segment.r017.book1.ch14.text.block-253","segment.r017.book1.ch14.text.block-254","segment.r017.book1.ch14.text.block-255","segment.r017.book1.ch14.text.block-256","segment.r017.book1.ch14.text.block-257","segment.r017.book1.ch14.text.block-258","segment.r017.book1.ch14.text.block-259","segment.r017.book1.ch14.text.block-260","segment.r017.book1.ch14.text.block-261","segment.r017.book1.ch14.text.block-262","segment.r017.book1.ch14.text.block-263","segment.r017.book1.ch14.text.block-264","segment.r017.book1.ch14.text.block-265","segment.r017.book1.ch14.text.block-266","segment.r017.book1.ch14.text.block-267","segment.r017.book1.ch14.text.block-268","segment.r017.book1.ch14.text.block-269","segment.r017.book1.ch14.text.block-270","segment.r017.book1.ch14.text.block-271","segment.r017.book1.ch14.text.block-272","segment.r017.book1.ch14.text.block-273","segment.r017.book1.ch14.text.block-274","segment.r017.book1.ch14.text.block-275","segment.r017.book1.ch14.text.block-276","segment.r017.book1.ch14.text.block-277","segment.r017.book1.ch14.text.block-278","segment.r017.book1.ch14.text.block-279","segment.r017.book1.ch14.text.block-280","segment.r017.book1.ch14.text.block-281","segment.r017.book1.ch14.text.block-282","segment.r017.book1.ch14.text.block-283","segment.r017.book1.ch14.text.block-284","segment.r017.book1.ch14.text.block-285","segment.r017.book1.ch14.text.block-286","segment.r017.book1.ch14.text.block-287","segment.r017.book1.ch14.text.block-288","segment.r017.book1.ch14.text.block-289","segment.r017.book1.ch14.text.block-290","segment.r017.book1.ch14.text.block-291","segment.r017.book1.ch14.text.block-292","segment.r017.book1.ch14.text.block-293","segment.r017.book1.ch14.text.block-294","segment.r017.book1.ch14.text.block-295","segment.r017.book1.ch14.text.block-296","segment.r017.book1.ch14.text.block-297","segment.r017.book1.ch14.text.block-298","segment.r017.book1.ch14.text.block-299","segment.r017.book1.ch14.text.block-300","segment.r017.book1.ch14.text.block-301","segment.r017.book1.ch14.text.block-302","segment.r017.book1.ch14.text.block-303","segment.r017.book1.ch14.text.block-304","segment.r017.book1.ch14.text.block-305","segment.r017.book1.ch14.text.block-306","segment.r017.book1.ch14.text.block-307","segment.r017.book1.ch14.text.block-308","segment.r017.book1.ch14.text.block-309","segment.r017.book1.ch14.text.block-310","segment.r017.book1.ch14.text.block-311","segment.r017.book1.ch14.text.block-312","segment.r017.book1.ch14.text.block-313","segment.r017.book1.ch14.text.block-314","segment.r017.book1.ch14.text.block-315","segment.r017.book1.ch14.text.block-316","segment.r017.book1.ch14.text.block-317","segment.r017.book1.ch14.text.block-318","segment.r017.book1.ch14.text.block-319","segment.r017.book1.ch14.text.block-320","segment.r017.book1.ch14.text.block-321","segment.r017.book1.ch14.text.block-322","segment.r017.book1.ch14.text.block-323","segment.r017.book1.ch14.text.block-324","segment.r017.book1.ch14.text.block-325","segment.r017.book1.ch14.text.block-326","segment.r017.book1.ch14.text.block-327","segment.r017.book1.ch14.text.block-328","segment.r017.book1.ch14.text.block-329","segment.r017.book1.ch14.text.block-330","segment.r017.book1.ch14.text.block-331","segment.r017.book1.ch14.text.block-332","segment.r017.book1.ch14.text.block-333","segment.r017.book1.ch14.text.block-334","segment.r017.book1.ch14.text.block-335","segment.r017.book1.ch14.text.block-336","segment.r017.book1.ch14.text.block-337","segment.r017.book1.ch14.text.block-338","segment.r017.book1.ch14.text.block-339","segment.r017.book1.ch14.text.block-340","segment.r017.book1.ch14.text.block-341","segment.r017.book1.ch14.text.block-342","segment.r017.book1.ch14.text.block-343","segment.r017.book1.ch14.text.block-344","segment.r017.book1.ch14.text.block-345","segment.r017.book1.ch14.text.block-346","segment.r017.book1.ch14.text.block-347","segment.r017.book1.ch14.text.block-348","segment.r017.book1.ch14.text.block-349","segment.r017.book1.ch14.text.block-350","segment.r017.book1.ch14.text.block-351","segment.r017.book1.ch14.text.block-352","segment.r017.book1.ch14.text.block-353","segment.r017.book1.ch14.text.block-354","segment.r017.book1.ch14.text.block-355","segment.r017.book1.ch14.text.block-356","segment.r017.book1.ch14.text.block-357","segment.r017.book1.ch14.text.block-358","segment.r017.book1.ch14.text.block-359","segment.r017.book1.ch14.text.block-360","segment.r017.book1.ch14.text.block-361","segment.r017.book1.ch14.text.block-362","segment.r017.book1.ch14.text.block-363","segment.r017.book1.ch14.text.block-364","segment.r017.book1.ch14.text.block-365","segment.r017.book1.ch14.text.block-366","segment.r017.book1.ch14.text.block-367","segment.r017.book1.ch14.text.block-368","segment.r017.book1.ch14.text.block-369","segment.r017.book1.ch14.text.block-370","segment.r017.book1.ch14.text.block-371","segment.r017.book1.ch14.text.block-372","segment.r017.book1.ch14.text.block-373","segment.r017.book1.ch14.text.block-374","segment.r017.book1.ch14.text.block-375","segment.r017.book1.ch14.text.block-376","segment.r017.book1.ch14.text.block-377","segment.r017.book1.ch14.text.block-378","segment.r017.book1.ch14.text.block-379","segment.r017.book1.ch14.text.block-380","segment.r017.book1.ch14.text.block-381","segment.r017.book1.ch14.text.block-382","segment.r017.book1.ch14.text.block-383","segment.r017.book1.ch14.text.block-384","segment.r017.book1.ch14.text.block-385","segment.r017.book1.ch14.text.block-386","segment.r017.book1.ch14.text.block-387","segment.r017.book1.ch14.text.block-388","segment.r017.book1.ch14.text.block-389","segment.r017.book1.ch14.text.block-390","segment.r017.book1.ch14.text.block-391","segment.r017.book1.ch14.text.block-392","segment.r017.book1.ch14.text.block-393","segment.r017.book1.ch14.text.block-394","segment.r017.book1.ch14.text.block-395","segment.r017.book1.ch14.text.block-396","segment.r017.book1.ch14.text.block-397","segment.r017.book1.ch14.text.block-398","segment.r017.book1.ch14.text.block-399","segment.r017.book1.ch14.text.block-400","segment.r017.book1.ch14.text.block-401","segment.r017.book1.ch14.text.block-402","segment.r017.book1.ch14.text.block-403","segment.r017.book1.ch14.text.block-404","segment.r017.book1.ch14.text.block-405","segment.r017.book1.ch14.text.block-406","segment.r017.book1.ch14.text.block-407","segment.r017.book1.ch14.text.block-408","segment.r017.book1.ch14.text.block-409","segment.r017.book1.ch14.text.block-410","segment.r017.book1.ch14.text.block-411","segment.r017.book1.ch14.text.block-412","segment.r017.book1.ch14.text.block-413","segment.r017.book1.ch14.text.block-414","segment.r017.book1.ch14.text.block-415","segment.r017.book1.ch14.text.block-416","segment.r017.book1.ch14.text.block-417","segment.r017.book1.ch14.text.block-418","segment.r017.book1.ch14.text.block-419","segment.r017.book1.ch14.text.block-420","segment.r017.book1.ch14.text.block-421","segment.r017.book1.ch14.text.block-422","segment.r017.book1.ch14.text.block-423","segment.r017.book1.ch14.text.block-424","segment.r017.book1.ch14.text.block-425","segment.r017.book1.ch14.text.block-426","segment.r017.book1.ch14.text.block-427","segment.r017.book1.ch14.text.block-428"],"native":{"concept_id":"concept.traveling-salesperson","evidence":"Full-corpus id-ID terminology audit","id":"term.traveling-salesperson.id","preferred":"masalah wiraniaga keliling","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"traveling salesperson problem","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":[],"native":{"concept_id":"concept.unbounded-simplex","evidence":"Final id-ID corpus terminology audit","id":"term.unbounded-simplex.id","preferred":"sertifikat ketakterbatasan simpleks","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"simplex unboundedness certificate","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch05.readme.block-001","segment.o018.lab.ch05.readme.block-002","segment.o018.lab.ch05.readme.block-003","segment.o018.lab.ch05.readme.block-004","segment.o018.lab.ch05.readme.block-005","segment.o018.lab.ch05.readme.block-006","segment.o018.lab.ch05.readme.block-007","segment.o018.lab.ch05.readme.block-008","segment.o018.lab.ch05.readme.block-009","segment.o018.lab.ch05.readme.block-010","segment.o018.lab.ch05.readme.block-011","segment.o018.lab.ch05.readme.block-012","segment.o018.lab.ch05.readme.block-013","segment.o018.lab.ch05.readme.block-014","segment.r017.book1.ch05.text.block-142","segment.r017.book1.ch05.text.block-143"],"native":{"concept_id":"concept.unbounded-linear-program","evidence":"Chapter 5 terminology decision","id":"term.unbounded.id","preferred":"tak berbatas","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"linear programming status","source_locale":"en","source_term":"unbounded","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":["tidak berbatas"]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.appendix.vectors.length.block-001","segment.r017.book1.appendix.vectors.length.block-002","segment.r017.book1.appendix.vectors.length.block-003","segment.r017.book1.appendix.vectors.length.block-004","segment.r017.book1.appendix.vectors.length.block-005","segment.r017.book1.appendix.vectors.length.block-006","segment.r017.book1.appendix.vectors.length.block-007","segment.r017.book1.appendix.vectors.length.block-008","segment.r017.book1.appendix.vectors.length.block-009","segment.r017.book1.appendix.vectors.length.block-010","segment.r017.book1.appendix.vectors.length.block-011","segment.r017.book1.appendix.vectors.length.block-012","segment.r017.book1.appendix.vectors.length.block-013","segment.r017.book1.appendix.vectors.length.block-014","segment.r017.book1.appendix.vectors.length.block-015","segment.r017.book1.appendix.vectors.length.block-016","segment.r017.book1.appendix.vectors.length.block-017","segment.r017.book1.appendix.vectors.length.block-018","segment.r017.book1.appendix.vectors.length.block-019","segment.r017.book1.appendix.vectors.length.block-020","segment.r017.book1.appendix.vectors.length.block-021","segment.r017.book1.appendix.vectors.length.block-022","segment.r017.book1.appendix.vectors.length.block-023","segment.r017.book1.appendix.vectors.length.block-024","segment.r017.book1.appendix.vectors.length.block-025","segment.r017.book1.appendix.vectors.length.block-026","segment.r017.book1.appendix.vectors.length.block-027","segment.r017.book1.appendix.vectors.length.block-028","segment.r017.book1.appendix.vectors.length.block-029","segment.r017.book1.appendix.vectors.length.block-030","segment.r017.book1.appendix.vectors.length.block-031","segment.r017.book1.appendix.vectors.length.block-032","segment.r017.book1.appendix.vectors.length.block-033","segment.r017.book1.appendix.vectors.length.block-034","segment.r017.book1.appendix.vectors.length.block-035","segment.r017.book1.appendix.vectors.length.block-036","segment.r017.book1.appendix.vectors.length.block-037"],"native":{"concept_id":"concept.vector-norm","evidence":"Full-corpus id-ID terminology audit","id":"term.vector-norm.id","preferred":"norma vektor","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"vector norm","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch06.readme.block-001","segment.o018.lab.ch06.readme.block-002","segment.o018.lab.ch06.readme.block-003","segment.o018.lab.ch06.readme.block-004","segment.o018.lab.ch06.readme.block-005","segment.o018.lab.ch06.readme.block-006","segment.o018.lab.ch06.readme.block-007","segment.o018.lab.ch06.readme.block-008","segment.o018.lab.ch06.readme.block-009","segment.o018.lab.ch06.readme.block-010","segment.r017.book1.appendix.vectors.addition-meaning.block-001","segment.r017.book1.appendix.vectors.addition-meaning.block-002","segment.r017.book1.appendix.vectors.addition-meaning.block-003","segment.r017.book1.appendix.vectors.addition-meaning.block-004","segment.r017.book1.appendix.vectors.addition-meaning.block-005","segment.r017.book1.appendix.vectors.addition-meaning.block-006","segment.r017.book1.appendix.vectors.addition-meaning.block-007","segment.r017.book1.appendix.vectors.addition-meaning.block-008","segment.r017.book1.appendix.vectors.addition-meaning.block-009","segment.r017.book1.appendix.vectors.addition-meaning.block-010","segment.r017.book1.appendix.vectors.addition-meaning.block-011","segment.r017.book1.appendix.vectors.addition-meaning.block-012","segment.r017.book1.appendix.vectors.addition-meaning.block-013","segment.r017.book1.appendix.vectors.addition-meaning.block-014","segment.r017.book1.appendix.vectors.addition-meaning.block-015","segment.r017.book1.appendix.vectors.addition-meaning.block-016","segment.r017.book1.appendix.vectors.addition-meaning.block-017","segment.r017.book1.appendix.vectors.addition-meaning.block-018","segment.r017.book1.appendix.vectors.addition-meaning.block-019","segment.r017.book1.appendix.vectors.addition-meaning.block-020","segment.r017.book1.appendix.vectors.addition-meaning.block-021","segment.r017.book1.appendix.vectors.addition-meaning.block-022","segment.r017.book1.appendix.vectors.addition-meaning.block-023","segment.r017.book1.appendix.vectors.addition-meaning.block-024","segment.r017.book1.appendix.vectors.addition.block-001","segment.r017.book1.appendix.vectors.addition.block-002","segment.r017.book1.appendix.vectors.addition.block-003","segment.r017.book1.appendix.vectors.addition.block-004","segment.r017.book1.appendix.vectors.addition.block-005","segment.r017.book1.appendix.vectors.addition.block-006","segment.r017.book1.appendix.vectors.addition.block-007","segment.r017.book1.appendix.vectors.algebra.block-001","segment.r017.book1.appendix.vectors.algebra.block-002","segment.r017.book1.appendix.vectors.algebra.block-003","segment.r017.book1.appendix.vectors.controller.block-001","segment.r017.book1.appendix.vectors.rn.block-001","segment.r017.book1.appendix.vectors.rn.block-002","segment.r017.book1.appendix.vectors.rn.block-003","segment.r017.book1.appendix.vectors.rn.block-004","segment.r017.book1.appendix.vectors.rn.block-005","segment.r017.book1.appendix.vectors.rn.block-006","segment.r017.book1.appendix.vectors.rn.block-007","segment.r017.book1.appendix.vectors.rn.block-008","segment.r017.book1.appendix.vectors.rn.block-009","segment.r017.book1.appendix.vectors.rn.block-010","segment.r017.book1.appendix.vectors.rn.block-011","segment.r017.book1.appendix.vectors.rn.block-012","segment.r017.book1.appendix.vectors.rn.block-013","segment.r017.book1.appendix.vectors.rn.block-014","segment.r017.book1.appendix.vectors.rn.block-015","segment.r017.book1.appendix.vectors.rn.block-016","segment.r017.book1.appendix.vectors.rn.block-017","segment.r017.book1.appendix.vectors.rn.block-018","segment.r017.book1.appendix.vectors.rn.block-019","segment.r017.book1.appendix.vectors.rn.block-020","segment.r017.book1.appendix.vectors.rn.block-021","segment.r017.book1.appendix.vectors.rn.block-022","segment.r017.book1.appendix.vectors.rn.block-023","segment.r017.book1.appendix.vectors.rn.block-024","segment.r017.book1.appendix.vectors.rn.block-025","segment.r017.book1.appendix.vectors.rn.block-026","segment.r017.book1.appendix.vectors.rn.block-027","segment.r017.book1.appendix.vectors.rn.block-028","segment.r017.book1.appendix.vectors.rn.block-029","segment.r017.book1.appendix.vectors.rn.block-030","segment.r017.book1.appendix.vectors.rn.block-031","segment.r017.book1.appendix.vectors.scalar-meaning.block-001","segment.r017.book1.appendix.vectors.scalar-meaning.block-002","segment.r017.book1.appendix.vectors.scalar-meaning.block-003","segment.r017.book1.appendix.vectors.scalar-meaning.block-004","segment.r017.book1.appendix.vectors.scalar-meaning.block-005","segment.r017.book1.appendix.vectors.scalar-meaning.block-006","segment.r017.book1.appendix.vectors.scalar-meaning.block-007","segment.r017.book1.appendix.vectors.scalar-meaning.block-008","segment.r017.book1.appendix.vectors.scalar-meaning.block-009","segment.r017.book1.appendix.vectors.scalar-meaning.block-010","segment.r017.book1.appendix.vectors.scalar-meaning.block-011","segment.r017.book1.appendix.vectors.scalar-meaning.block-012","segment.r017.book1.appendix.vectors.scalar-meaning.block-013","segment.r017.book1.appendix.vectors.scalar-meaning.block-014","segment.r017.book1.appendix.vectors.scalar-meaning.block-015","segment.r017.book1.appendix.vectors.scalar-meaning.block-016","segment.r017.book1.appendix.vectors.scalar-meaning.block-017","segment.r017.book1.appendix.vectors.scalar-meaning.block-018","segment.r017.book1.appendix.vectors.scalar-meaning.block-019","segment.r017.book1.appendix.vectors.scalar-meaning.block-020","segment.r017.book1.appendix.vectors.scalar-meaning.block-021","segment.r017.book1.appendix.vectors.scalar-meaning.block-022","segment.r017.book1.appendix.vectors.scalar-meaning.block-023","segment.r017.book1.appendix.vectors.scalar-meaning.block-024","segment.r017.book1.appendix.vectors.scalar-meaning.block-025","segment.r017.book1.appendix.vectors.scalar-meaning.block-026","segment.r017.book1.appendix.vectors.scalar-meaning.block-027","segment.r017.book1.appendix.vectors.scalar-meaning.block-028","segment.r017.book1.appendix.vectors.scalar.block-001","segment.r017.book1.appendix.vectors.scalar.block-002","segment.r017.book1.appendix.vectors.scalar.block-003","segment.r017.book1.appendix.vectors.scalar.block-004","segment.r017.book1.appendix.vectors.scalar.block-005","segment.r017.book1.appendix.vectors.scalar.block-006","segment.r017.book1.appendix.vectors.scalar.block-007","segment.r017.book1.appendix.vectors.scalar.block-008","segment.r017.book1.ch06.text.block-005","segment.r017.book1.ch06.text.block-136"],"native":{"concept_id":"concept.vector-operations","evidence":"Final id-ID corpus terminology audit","id":"term.vector-operations.id","preferred":"operasi vektor","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"vector operations","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch11.attribution.block-001","segment.o018.lab.ch11.attribution.block-002","segment.o018.lab.ch11.attribution.block-003","segment.o018.lab.ch11.attribution.block-004","segment.o018.lab.ch11.attribution.block-005","segment.o018.lab.ch11.attribution.block-006","segment.o018.lab.ch11.attribution.block-007","segment.o018.lab.ch11.attribution.block-008","segment.o018.lab.ch11.attribution.block-009","segment.o018.lab.ch11.attribution.block-010","segment.o018.lab.ch11.attribution.block-011","segment.o018.lab.ch11.attribution.block-012","segment.o018.lab.ch11.attribution.block-013","segment.o018.lab.ch11.attribution.block-014","segment.o018.lab.ch11.attribution.block-015","segment.o018.lab.ch11.attribution.block-016","segment.o018.lab.ch11.attribution.block-017","segment.o018.lab.ch11.attribution.block-018","segment.o018.lab.ch11.readme.block-001","segment.o018.lab.ch11.readme.block-002","segment.o018.lab.ch11.readme.block-003","segment.o018.lab.ch11.readme.block-004","segment.o018.lab.ch11.readme.block-005","segment.o018.lab.ch11.readme.block-006","segment.o018.lab.ch11.readme.block-007","segment.o018.lab.ch11.readme.block-008","segment.o018.lab.ch11.readme.block-009","segment.o018.lab.ch11.readme.block-010","segment.r017.book1.ch11.text-a.block-001","segment.r017.book1.ch11.text-a.block-002","segment.r017.book1.ch11.text-a.block-003","segment.r017.book1.ch11.text-a.block-004","segment.r017.book1.ch11.text-a.block-005","segment.r017.book1.ch11.text-a.block-006","segment.r017.book1.ch11.text-a.block-007","segment.r017.book1.ch11.text-a.block-008","segment.r017.book1.ch11.text-a.block-009","segment.r017.book1.ch11.text-a.block-010","segment.r017.book1.ch11.text-a.block-011","segment.r017.book1.ch11.text-a.block-012","segment.r017.book1.ch11.text-a.block-013","segment.r017.book1.ch11.text-a.block-014","segment.r017.book1.ch11.text-a.block-015","segment.r017.book1.ch11.text-a.block-016","segment.r017.book1.ch11.text-a.block-017","segment.r017.book1.ch11.text-a.block-018","segment.r017.book1.ch11.text-a.block-019","segment.r017.book1.ch11.text-a.block-020","segment.r017.book1.ch11.text-a.block-021","segment.r017.book1.ch11.text-a.block-022","segment.r017.book1.ch11.text-a.block-023","segment.r017.book1.ch11.text-a.block-024","segment.r017.book1.ch11.text-a.block-025","segment.r017.book1.ch11.text-a.block-026","segment.r017.book1.ch11.text-a.block-027","segment.r017.book1.ch11.text-a.block-028","segment.r017.book1.ch11.text-a.block-029","segment.r017.book1.ch11.text-a.block-030","segment.r017.book1.ch11.text-a.block-031","segment.r017.book1.ch11.text-a.block-032","segment.r017.book1.ch11.text-a.block-033","segment.r017.book1.ch11.text-a.block-034","segment.r017.book1.ch11.text-a.block-035","segment.r017.book1.ch11.text-a.block-036","segment.r017.book1.ch11.text-a.block-037","segment.r017.book1.ch11.text-a.block-038","segment.r017.book1.ch11.text-a.block-039","segment.r017.book1.ch11.text-a.block-040","segment.r017.book1.ch11.text-a.block-041","segment.r017.book1.ch11.text-a.block-042","segment.r017.book1.ch11.text-a.block-043","segment.r017.book1.ch11.text-a.block-044","segment.r017.book1.ch11.text-a.block-045","segment.r017.book1.ch11.text-a.block-046","segment.r017.book1.ch11.text-a.block-047","segment.r017.book1.ch11.text-a.block-048","segment.r017.book1.ch11.text-a.block-049","segment.r017.book1.ch11.text-a.block-050","segment.r017.book1.ch11.text-a.block-051","segment.r017.book1.ch11.text-a.block-052","segment.r017.book1.ch11.text-a.block-053","segment.r017.book1.ch11.text-a.block-054","segment.r017.book1.ch11.text-a.block-055","segment.r017.book1.ch11.text-a.block-056","segment.r017.book1.ch11.text-a.block-057","segment.r017.book1.ch11.text-a.block-058","segment.r017.book1.ch11.text-a.block-059","segment.r017.book1.ch11.text-a.block-060","segment.r017.book1.ch11.text-a.block-061","segment.r017.book1.ch11.text-a.block-062","segment.r017.book1.ch11.text-a.block-063","segment.r017.book1.ch11.text-a.block-064","segment.r017.book1.ch11.text-a.block-065","segment.r017.book1.ch11.text-a.block-066","segment.r017.book1.ch11.text-a.block-067","segment.r017.book1.ch11.text-a.block-068","segment.r017.book1.ch11.text-a.block-069","segment.r017.book1.ch11.text-a.block-070","segment.r017.book1.ch11.text-a.block-071","segment.r017.book1.ch11.text-a.block-072","segment.r017.book1.ch11.text-a.block-073","segment.r017.book1.ch11.text-a.block-074","segment.r017.book1.ch11.text-a.block-075","segment.r017.book1.ch11.text-a.block-076","segment.r017.book1.ch11.text-a.block-077","segment.r017.book1.ch11.text-a.block-078","segment.r017.book1.ch11.text-a.block-079","segment.r017.book1.ch11.text-a.block-080","segment.r017.book1.ch11.text-a.block-081","segment.r017.book1.ch11.text-a.block-082","segment.r017.book1.ch11.text-a.block-083","segment.r017.book1.ch11.text-a.block-084","segment.r017.book1.ch11.text-a.block-085","segment.r017.book1.ch11.text-a.block-086","segment.r017.book1.ch11.text-a.block-087","segment.r017.book1.ch11.text-a.block-088","segment.r017.book1.ch11.text-a.block-089","segment.r017.book1.ch11.text-a.block-090","segment.r017.book1.ch11.text-a.block-091","segment.r017.book1.ch11.text-a.block-092","segment.r017.book1.ch11.text-a.block-093","segment.r017.book1.ch11.text-a.block-094","segment.r017.book1.ch11.text-a.block-095","segment.r017.book1.ch11.text-a.block-096","segment.r017.book1.ch11.text-a.block-097","segment.r017.book1.ch11.text-a.block-098","segment.r017.book1.ch11.text-a.block-099","segment.r017.book1.ch11.text-a.block-100","segment.r017.book1.ch11.text-a.block-101","segment.r017.book1.ch11.text-a.block-102","segment.r017.book1.ch11.text-a.block-103","segment.r017.book1.ch11.text-a.block-104","segment.r017.book1.ch11.text-a.block-105","segment.r017.book1.ch11.text-a.block-106","segment.r017.book1.ch11.text-a.block-107","segment.r017.book1.ch11.text-a.block-108","segment.r017.book1.ch11.text-a.block-109","segment.r017.book1.ch11.text-a.block-110","segment.r017.book1.ch11.text-a.block-111","segment.r017.book1.ch11.text-a.block-112","segment.r017.book1.ch11.text-a.block-113","segment.r017.book1.ch11.text-a.block-114","segment.r017.book1.ch11.text-a.block-115","segment.r017.book1.ch11.text-a.block-116","segment.r017.book1.ch11.text-a.block-117","segment.r017.book1.ch11.text-a.block-118","segment.r017.book1.ch11.text-a.block-119","segment.r017.book1.ch11.text-a.block-120","segment.r017.book1.ch11.text-a.block-121","segment.r017.book1.ch11.text-a.block-122","segment.r017.book1.ch11.text-a.block-123","segment.r017.book1.ch11.text-a.block-124","segment.r017.book1.ch11.text-a.block-125","segment.r017.book1.ch11.text-a.block-126","segment.r017.book1.ch11.text-a.block-127","segment.r017.book1.ch11.text-a.block-128","segment.r017.book1.ch11.text-a.block-129","segment.r017.book1.ch11.text-a.block-130","segment.r017.book1.ch11.text-a.block-131","segment.r017.book1.ch11.text-a.block-132","segment.r017.book1.ch11.text-a.block-133","segment.r017.book1.ch11.text-a.block-134","segment.r017.book1.ch11.text-a.block-135","segment.r017.book1.ch11.text-a.block-136","segment.r017.book1.ch11.text-a.block-137","segment.r017.book1.ch11.text-a.block-138","segment.r017.book1.ch11.text-a.block-139","segment.r017.book1.ch11.text-a.block-140","segment.r017.book1.ch11.text-a.block-141","segment.r017.book1.ch11.text-a.block-142","segment.r017.book1.ch11.text-a.block-143","segment.r017.book1.ch11.text-a.block-144","segment.r017.book1.ch11.text-a.block-145","segment.r017.book1.ch11.text-a.block-146","segment.r017.book1.ch11.text-a.block-147","segment.r017.book1.ch11.text-a.block-148","segment.r017.book1.ch11.text-a.block-149","segment.r017.book1.ch11.text-a.block-150","segment.r017.book1.ch11.text-a.block-151","segment.r017.book1.ch11.text-a.block-152","segment.r017.book1.ch11.text-a.block-153","segment.r017.book1.ch11.text-a.block-154","segment.r017.book1.ch11.text-a.block-155","segment.r017.book1.ch11.text-a.block-156","segment.r017.book1.ch11.text-a.block-157","segment.r017.book1.ch11.text-a.block-158","segment.r017.book1.ch11.text-a.block-159","segment.r017.book1.ch11.text-a.block-160","segment.r017.book1.ch11.text-a.block-161","segment.r017.book1.ch11.text-a.block-162","segment.r017.book1.ch11.text-a.block-163","segment.r017.book1.ch11.text-a.block-164","segment.r017.book1.ch11.text-a.block-165","segment.r017.book1.ch11.text-a.block-166","segment.r017.book1.ch11.text-a.block-167","segment.r017.book1.ch11.text-a.block-168","segment.r017.book1.ch11.text-a.block-169","segment.r017.book1.ch11.text-a.block-170","segment.r017.book1.ch11.text-a.block-171","segment.r017.book1.ch11.text-a.block-172","segment.r017.book1.ch11.text-a.block-173","segment.r017.book1.ch11.text-a.block-174","segment.r017.book1.ch11.text-a.block-175","segment.r017.book1.ch11.text-a.block-176","segment.r017.book1.ch11.text-a.block-177","segment.r017.book1.ch11.text-a.block-178","segment.r017.book1.ch11.text-a.block-179","segment.r017.book1.ch11.text-a.block-180","segment.r017.book1.ch11.text-a.block-181","segment.r017.book1.ch11.text-a.block-182","segment.r017.book1.ch11.text-a.block-183","segment.r017.book1.ch11.text-a.block-184","segment.r017.book1.ch11.text-a.block-185","segment.r017.book1.ch11.text-a.block-186","segment.r017.book1.ch11.text-a.block-187","segment.r017.book1.ch11.text-a.block-188","segment.r017.book1.ch11.text-a.block-189","segment.r017.book1.ch11.text-a.block-190","segment.r017.book1.ch11.text-a.block-191","segment.r017.book1.ch11.text-a.block-192","segment.r017.book1.ch11.text-a.block-193","segment.r017.book1.ch11.text-a.block-194","segment.r017.book1.ch11.text-a.block-195","segment.r017.book1.ch11.text-a.block-196","segment.r017.book1.ch11.text-a.block-197","segment.r017.book1.ch11.text-a.block-198","segment.r017.book1.ch11.text-a.block-199","segment.r017.book1.ch11.text-a.block-200","segment.r017.book1.ch11.text-a.block-201","segment.r017.book1.ch11.text-a.block-202"],"native":{"concept_id":"concept.weak-duality","evidence":"Full-corpus id-ID terminology audit","id":"term.weak-duality.id","preferred":"dualitas lemah","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"weak duality","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch13.attribution.block-001","segment.o018.lab.ch13.attribution.block-002","segment.o018.lab.ch13.attribution.block-003","segment.o018.lab.ch13.attribution.block-004","segment.o018.lab.ch13.attribution.block-005","segment.o018.lab.ch13.attribution.block-006","segment.o018.lab.ch13.attribution.block-007","segment.o018.lab.ch13.attribution.block-008","segment.o018.lab.ch13.attribution.block-009","segment.o018.lab.ch13.attribution.block-010","segment.o018.lab.ch13.attribution.block-011","segment.o018.lab.ch13.attribution.block-012","segment.o018.lab.ch13.attribution.block-013","segment.o018.lab.ch13.attribution.block-014","segment.o018.lab.ch13.attribution.block-015","segment.o018.lab.ch13.attribution.block-016","segment.o018.lab.ch13.attribution.block-017","segment.o018.lab.ch13.attribution.block-018","segment.o018.lab.ch13.readme.block-001","segment.o018.lab.ch13.readme.block-002","segment.o018.lab.ch13.readme.block-003","segment.o018.lab.ch13.readme.block-004","segment.o018.lab.ch13.readme.block-005","segment.o018.lab.ch13.readme.block-006","segment.o018.lab.ch13.readme.block-007","segment.o018.lab.ch13.readme.block-008","segment.o018.lab.ch13.readme.block-009","segment.o018.lab.ch13.readme.block-010","segment.r017.book1.ch13.text.block-001","segment.r017.book1.ch13.text.block-002","segment.r017.book1.ch13.text.block-003","segment.r017.book1.ch13.text.block-004","segment.r017.book1.ch13.text.block-005","segment.r017.book1.ch13.text.block-006","segment.r017.book1.ch13.text.block-007","segment.r017.book1.ch13.text.block-008","segment.r017.book1.ch13.text.block-009","segment.r017.book1.ch13.text.block-010","segment.r017.book1.ch13.text.block-011","segment.r017.book1.ch13.text.block-012","segment.r017.book1.ch13.text.block-013","segment.r017.book1.ch13.text.block-014","segment.r017.book1.ch13.text.block-015","segment.r017.book1.ch13.text.block-016","segment.r017.book1.ch13.text.block-017","segment.r017.book1.ch13.text.block-018","segment.r017.book1.ch13.text.block-019","segment.r017.book1.ch13.text.block-020","segment.r017.book1.ch13.text.block-021","segment.r017.book1.ch13.text.block-022","segment.r017.book1.ch13.text.block-023","segment.r017.book1.ch13.text.block-024","segment.r017.book1.ch13.text.block-025","segment.r017.book1.ch13.text.block-026","segment.r017.book1.ch13.text.block-027","segment.r017.book1.ch13.text.block-028","segment.r017.book1.ch13.text.block-029","segment.r017.book1.ch13.text.block-030","segment.r017.book1.ch13.text.block-031","segment.r017.book1.ch13.text.block-032","segment.r017.book1.ch13.text.block-033","segment.r017.book1.ch13.text.block-034","segment.r017.book1.ch13.text.block-035","segment.r017.book1.ch13.text.block-036","segment.r017.book1.ch13.text.block-037","segment.r017.book1.ch13.text.block-038","segment.r017.book1.ch13.text.block-039","segment.r017.book1.ch13.text.block-040","segment.r017.book1.ch13.text.block-041","segment.r017.book1.ch13.text.block-042","segment.r017.book1.ch13.text.block-043","segment.r017.book1.ch13.text.block-044","segment.r017.book1.ch13.text.block-045","segment.r017.book1.ch13.text.block-046","segment.r017.book1.ch13.text.block-047","segment.r017.book1.ch13.text.block-048","segment.r017.book1.ch13.text.block-049","segment.r017.book1.ch13.text.block-050","segment.r017.book1.ch13.text.block-051","segment.r017.book1.ch13.text.block-052","segment.r017.book1.ch13.text.block-053","segment.r017.book1.ch13.text.block-054","segment.r017.book1.ch13.text.block-055","segment.r017.book1.ch13.text.block-056","segment.r017.book1.ch13.text.block-057","segment.r017.book1.ch13.text.block-058","segment.r017.book1.ch13.text.block-059","segment.r017.book1.ch13.text.block-060","segment.r017.book1.ch13.text.block-061","segment.r017.book1.ch13.text.block-062","segment.r017.book1.ch13.text.block-063","segment.r017.book1.ch13.text.block-064","segment.r017.book1.ch13.text.block-065","segment.r017.book1.ch13.text.block-066","segment.r017.book1.ch13.text.block-067","segment.r017.book1.ch13.text.block-068","segment.r017.book1.ch13.text.block-069","segment.r017.book1.ch13.text.block-070","segment.r017.book1.ch13.text.block-071","segment.r017.book1.ch13.text.block-072","segment.r017.book1.ch13.text.block-073","segment.r017.book1.ch13.text.block-074","segment.r017.book1.ch13.text.block-075","segment.r017.book1.ch13.text.block-076","segment.r017.book1.ch13.text.block-077","segment.r017.book1.ch13.text.block-078","segment.r017.book1.ch13.text.block-079","segment.r017.book1.ch13.text.block-080","segment.r017.book1.ch13.text.block-081","segment.r017.book1.ch13.text.block-082","segment.r017.book1.ch13.text.block-083","segment.r017.book1.ch13.text.block-084","segment.r017.book1.ch13.text.block-085","segment.r017.book1.ch13.text.block-086","segment.r017.book1.ch13.text.block-087","segment.r017.book1.ch13.text.block-088","segment.r017.book1.ch13.text.block-089","segment.r017.book1.ch13.text.block-090","segment.r017.book1.ch13.text.block-091","segment.r017.book1.ch13.text.block-092","segment.r017.book1.ch13.text.block-093","segment.r017.book1.ch13.text.block-094","segment.r017.book1.ch13.text.block-095","segment.r017.book1.ch13.text.block-096","segment.r017.book1.ch13.text.block-097","segment.r017.book1.ch13.text.block-098","segment.r017.book1.ch13.text.block-099","segment.r017.book1.ch13.text.block-100","segment.r017.book1.ch13.text.block-101","segment.r017.book1.ch13.text.block-102","segment.r017.book1.ch13.text.block-103","segment.r017.book1.ch13.text.block-104","segment.r017.book1.ch13.text.block-105","segment.r017.book1.ch13.text.block-106","segment.r017.book1.ch13.text.block-107","segment.r017.book1.ch13.text.block-108","segment.r017.book1.ch13.text.block-109","segment.r017.book1.ch13.text.block-110","segment.r017.book1.ch13.text.block-111","segment.r017.book1.ch13.text.block-112","segment.r017.book1.ch13.text.block-113","segment.r017.book1.ch13.text.block-114","segment.r017.book1.ch13.text.block-115","segment.r017.book1.ch13.text.block-116","segment.r017.book1.ch13.text.block-117","segment.r017.book1.ch13.text.block-118","segment.r017.book1.ch13.text.block-119","segment.r017.book1.ch13.text.block-120","segment.r017.book1.ch13.text.block-121","segment.r017.book1.ch13.text.block-122"],"native":{"concept_id":"concept.weighted-sum-method","evidence":"Full-corpus id-ID terminology audit","id":"term.weighted-sum-method.id","preferred":"metode jumlah berbobot","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"weighted-sum method","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.r017.book1.ch02.text.block-101"],"native":{"concept_id":"concept.workforce-scheduling","evidence":"Final id-ID corpus terminology audit","id":"term.workforce-scheduling.id","preferred":"model penjadwalan tenaga kerja","recorded_at":"2026-08-23T00:00:00+02:00","register":"academic","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"R017/O018 Book 1 full-corpus edition","source_locale":"en","source_term":"workforce-scheduling model","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}},{"audit":{"evidence_scope":"verbatim_native_claim_not_independent_attestation","mapping_scope":"native_concept_relation_not_lexical_occurrence","semantic_canon_review":false},"concept_segment_ids":["segment.o018.lab.ch03.readme.block-001","segment.o018.lab.ch03.readme.block-002","segment.o018.lab.ch03.readme.block-003","segment.o018.lab.ch03.readme.block-004","segment.o018.lab.ch03.readme.block-005","segment.o018.lab.ch03.readme.block-006","segment.o018.lab.ch03.readme.block-007","segment.o018.lab.ch03.readme.block-008","segment.o018.lab.ch03.readme.block-009","segment.o018.lab.ch03.readme.block-010","segment.o018.lab.ch03.readme.block-011","segment.o018.lab.ch03.readme.block-012","segment.o018.lab.ch03.readme.block-013","segment.o018.lab.ch03.readme.block-014","segment.o018.lab.ch03.readme.block-015","segment.o018.lab.ch03.readme.block-016","segment.o018.lab.ch03.readme.block-017","segment.o018.lab.ch03.readme.block-018","segment.r017.book1.ch03.text.block-003","segment.r017.book1.ch04.text-a.block-030","segment.r017.book1.ch04.text-a.block-074"],"native":{"concept_id":"concept.spreadsheet-modeling","evidence":"Chapter 3 terminology decision","id":"term.worksheet.id","preferred":"lembar kerja","recorded_at":"2026-08-23T00:00:00+02:00","register":"technical","rejected":[],"responsible_workflow":"codex-r017-o018-id-production","schema_name":"interlanguage.term","schema_version":"0.1.0","scope":"spreadsheet interface","source_locale":"en","source_term":"worksheet","status":"approved","supersedes_id":null,"target_locale":"id-ID","variants":[]}}],"units":[{"canonical_native_record_sha256":"6a3c4c007a4afa25076f77674ad768166a06b0d58cdaedc639cfab8354ec111d","edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab","locale":"id-ID","order":1,"parent_id":null,"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Free/Open-Solver Laboratory","title_target":"Laboratorium Pemecah Terbuka O018","unit_type":"laboratory"},{"canonical_native_record_sha256":"3908fa76f0e3c7979ce236e20ef14ce46fba35c70fe8428ba66d761c46c97fb0","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"e69619819e73e527d175a45608abacfc1dce70cb4dae7e347d31e99a5799e8f1","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"f13e386ad7f63da4e6141f353f2e75dc06c4c389b49cc45d22baf518834a2d4a","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal dan model sumber","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"a0632d9fb8eb150b7949e777da57d1b508d105ee2c04904524116b2e0b1c5f22","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode laboratorium","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"f11004fbed3b1d2ebad24754025a5a4e5cbe6f5c6b0a35b0f1556fe9e006000d","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Runtime pihak ketiga","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"d6a91450038c7e83a28a1b1ac5a32f8feda23cf3ea0b2cbd124126df196325f1","concept_ids":["concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming","concept.reproducible-computation","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch01-shirt-ordering","locale":"id-ID","order":3,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Shirt ordering model","title_target":"Model pemesanan kaus","unit_type":"computational_lab"},{"canonical_native_record_sha256":"120c402a50ad92978352fc99d7f663aa240b124983b947633ac5304c5c1e1056","concept_ids":["concept.integer-linear-programming","concept.inventory-balance","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch01-shirt-ordering.integer","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch01-shirt-ordering","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.code","status":"source_frozen","supersedes_id":null,"title_source":"Nonnegative-integer mode","title_target":"Mode bilangan bulat nonnegatif","unit_type":"executable_mode"},{"canonical_native_record_sha256":"042eba66c5149e5923e2f041a7f242f0e4828950ba7b12df1d6c0ab8ec7fbdc4","concept_ids":["concept.linear-programming","concept.inventory-balance","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch01-shirt-ordering.lp","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch01-shirt-ordering","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.code","status":"source_frozen","supersedes_id":null,"title_source":"Continuous linear-programming mode","title_target":"Mode pemrograman linear kontinu","unit_type":"executable_mode"},{"canonical_native_record_sha256":"ce4b8b455a52ce1f94e8a8595a4100b54c4017dc68f1db6cd1adbca341d32ef3","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03-spreadsheet-replacements","locale":"id-ID","order":4,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_source":"Chapter 3 spreadsheet replacement laboratory","title_target":"Laboratorium pengganti lembar kerja Bab 3","unit_type":"computational_lab_collection"},{"canonical_native_record_sha256":"f800116926d008470c016c90fb2d79d0fea9299b33fa2606335fe71fb3f0a9e0","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch03-spreadsheet-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"2a2d6fcd55f0588e86ff68a33a9fa47e3e7da6c5067459d5eac18070f13b5413","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch03.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"f73b1e9f4cb23573076e8f2e2df3838541cbb2ea72050e08ba58f8c4791217b2","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch03.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal, prosa, dan data adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"b1ba0c90be69f25b128e845dd7c3223875adefaeb00778fa9e8db77978d1a49c","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch03.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode laboratorium","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"7496bc350c11729fba5e9c3a3cd23c2f048f0d55107ad5599d379c732b109f97","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch03.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pemisahan dari perangkat lunak proprieter","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"51b75b4d715088430453b90219a2964096afcfbb7fbfed5756a545d6b76bf03d","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.attribution.heading-005","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch03.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Runtime pihak ketiga yang dibekukan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"4e2a428b6685d52ca2c4d6dd37c344a35fc06eb7db21c520c892a1bcc8b34578","concept_ids":["concept.network-flow","concept.linear-programming","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.ex01","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch03-spreadsheet-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Jaringan biaya minimum","unit_type":"computational_lab"},{"canonical_native_record_sha256":"179d713ee11be91cbe9976a9a1862b0b5397f9563e3afdb2675764fd66e426e1","concept_ids":["concept.production-planning","concept.inventory-balance","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.ex02","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch03-spreadsheet-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Perencanaan produksi sepuluh periode","unit_type":"computational_lab"},{"canonical_native_record_sha256":"9e3ac8d85406f8b14db123bb38b9575e7714bf916863516993812f835c945231","concept_ids":["concept.diet-problem","concept.linear-programming","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.ex03","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch03-spreadsheet-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Diet kontinu","unit_type":"computational_lab"},{"canonical_native_record_sha256":"78cd0d39651f5a5be34f3865627759583cab7bd5e294375a7af73b2ad9bfeeb3","concept_ids":["concept.production-planning","concept.sensitivity-analysis","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.ex04","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch03-spreadsheet-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Produksi dua produk dan sensitivitas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"49f615777e62a3d06cd5b4ab68c7fafdf2a54136ac323a692b0912f37dcb67a5","concept_ids":["concept.transportation-model","concept.linear-programming","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.ex05","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch03-spreadsheet-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Transportasi seimbang","unit_type":"computational_lab"},{"canonical_native_record_sha256":"d80d0ed340eeaaacab2cd8f638029c6d471c4a6e94412b7791b27556f1ca4759","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.ex06","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch03-spreadsheet-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Produksi furnitur dan sensitivitas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"f9d9f06d67f2173c0f37653a2f167324c29cf55359e8e491a6710da11ab3370c","concept_ids":["concept.transportation-model","concept.sensitivity-analysis","concept.shadow-price","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.ex07","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch03-spreadsheet-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Transportasi tak seimbang dan sensitivitas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"5db84fff034b19a4481e8e246f4abbd28db4b4136d3b25e04225906fcec5adb7","concept_ids":["concept.linear-programming","concept.nonlinear-programming","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.ex08","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch03-spreadsheet-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Perbandingan metode pemecah","unit_type":"conceptual_lab"},{"canonical_native_record_sha256":"fc6b64638541cc37d5bcd6fcfbd4ec7a46cd89cacd3d2948e6bbf28aad21fa56","concept_ids":["concept.short-selling","concept.linear-programming","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.ex09","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch03-spreadsheet-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Variabel bebas dan short selling","unit_type":"computational_lab"},{"canonical_native_record_sha256":"7a22bf8e0b78ff4d9c08a5e1fdf6ba5e7ff2cc7522c59cf12e10d92e55c138bb","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch03-spreadsheet-replacements","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"b4424ac3c0e0630e76cb07fdc861554258b0eec7f5751dd57136c34f332a194a","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch03.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pendamping terbuka Bab 3: pengganti lembar kerja","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"cd80fa75ff3ec8996e0687c3186e1baacfa18a84b8207bab020a01664da9f6b9","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch03.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cakupan dan hasil acuan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"f65f8704ccc65f47ca8b4c53aa2597098e7a91af1606ef91d585b0addb16eb20","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch03.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Asumsi pemodelan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"7ed9a1e376ec3047c77cae828ec61d73ba92da84f78ad040cb72924ece1460fc","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.readme.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch03.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Latihan 3.8 secara ringkas","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"37505ad7d5f1eb8f0bd6d805b6feddca527c37915c262aeb7d4398d60ec05d6a","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.readme.heading-005","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch03.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Menjalankan secara offline","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"935ff4b59eee4d218d231f23980e1c743cbab73c3943d0dc9fd8b35081424b65","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.spreadsheet-modeling","concept.sensitivity-analysis"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch03.readme.heading-006","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch03.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Catatan koreksi terhadap authority","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"2d62420f0ee735714be72f6d11c7b66360bf0d1ca65973d03ccfd6f387b9eec1","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04-compact-modeling-replacements","locale":"id-ID","order":5,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_source":"Chapter 4 compact-modeling replacement laboratory","title_target":"Laboratorium pengganti pemodelan ringkas Bab 4","unit_type":"computational_lab_collection"},{"canonical_native_record_sha256":"8509a58aae483312ae5f34485bfc1f1ba1305139e9960a060ef1e6dd1b503633","concept_ids":["concept.absolute-value-linearization","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.absolute-deviation","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Deviasi mutlak minimum","unit_type":"computational_lab"},{"canonical_native_record_sha256":"5ec3c04bee905fbbfb09a6b8bbc8136067cfd8b6f911e8ac033438e1b0173872","concept_ids":["concept.maximum-flow","concept.minimum-cut","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.airline-max-flow","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Aliran maksimum jaringan transit maskapai","unit_type":"computational_lab"},{"canonical_native_record_sha256":"50342c804938ad10e099315dd306a3e269f4a27e5de26567793389f2baa112d0","concept_ids":["concept.assignment-model","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.assignment-generic","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Penugasan orang ke tugas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"18d952f5e4198d39aa7aa07349a4d58e5e39169e567a21f0a30fd0bc79a296eb","concept_ids":["concept.assignment-model","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.assignment-machine","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Penugasan mesin","unit_type":"computational_lab"},{"canonical_native_record_sha256":"3f883292ac3e2750c54ad19115cdd8d7b956213de6b5bfc9fce7bdcd13f72cce","concept_ids":["concept.assignment-model","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.assignment-school-bus","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Penugasan bus sekolah","unit_type":"computational_lab"},{"canonical_native_record_sha256":"0ce294a69cc6300f79dbd638813ce9469727a7b5324ec1195c3ea2bf699474d3","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"9cbbdaa47254dc6ddad0348119e9468c26e9ebb2cf0d4ebe8693a5d7051b1a04","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch04.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"99c7da5a5bf6414f3dea51404efba65ecc8e04019cf4b4ef4fbf632a03c23f56","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch04.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal, prosa, dan data adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"7b4669fb3d709c3f54e35a5841c1caaa16491de645a7b4872f60308ca564a443","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch04.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode laboratorium","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"68a395a8369a59c2a2db02e148b74380d57fe47b9a99b77c303e5bd6fe63d84b","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch04.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pemisahan dari perangkat lunak lain","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"3c60f601f6a9e8b18f844557010ba429fdb5116783d0142084066419d4c814e0","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.attribution.heading-005","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch04.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Runtime pihak ketiga yang dibekukan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"11e64627934f45bc56b3189105a9bde758f70352a2d47b507a1a1612ccd621dc","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.attribution.heading-006","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch04.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Catatan koreksi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"a8d2519ae47439014b23a723abdadbfece97341647e6e28264695e839b86fac6","concept_ids":["concept.multi-period-investment","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.investment-multi-period","locale":"id-ID","order":12,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"design_unresolved","supersedes_id":null,"title_target":"Investasi modal multiperiodik","unit_type":"design_unresolved_lab"},{"canonical_native_record_sha256":"f513e06c62153bddddbea956b7e494bed51a88d87cf04c310000d8b7d0143354","concept_ids":["concept.network-flow","concept.flow-balance-sign-convention","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.min-cost-flow-unstructured","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Aliran biaya minimum tak terstruktur","unit_type":"computational_witness"},{"canonical_native_record_sha256":"0dcf2122b2ca3eb0637c72b34b8ad4a6ba6a66a192fa6b00880dbff9cd289d4d","concept_ids":["concept.network-flow","concept.flow-conservation","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.min-cost-flow-warehouses","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Aliran biaya minimum gudang-ke-toko","unit_type":"computational_lab"},{"canonical_native_record_sha256":"3e386004c626ef9b386cb2491ac6d922b5584df919bfa023b35ed33600a09702","concept_ids":["concept.multicommodity-flow","concept.linear-programming","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.multicommodity-fractional","locale":"id-ID","order":11,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Aliran multikomoditas pecahan sumber-tujuan","unit_type":"computational_lab"},{"canonical_native_record_sha256":"bba5060810f6215ca65b266a229250105596fe0f9e33347193fa596632bcfdc9","concept_ids":["concept.multicommodity-flow","concept.integer-linear-programming","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.multicommodity-integer","locale":"id-ID","order":10,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Aliran multikomoditas bilangan bulat","unit_type":"computational_lab"},{"canonical_native_record_sha256":"9e176e306a5c6835af0f72c08ec90647297286b173d670ca531c3143905b1352","concept_ids":["concept.production-planning","concept.inventory-balance","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.production-10period","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Perencanaan produksi sepuluh periode","unit_type":"computational_lab"},{"canonical_native_record_sha256":"e13f6073caa245cd6da95ad4dd760315f023537181779b9c908bd589f03e1c7b","concept_ids":["concept.production-planning","concept.inventory-balance","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.production-overtime","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"parameter_required","supersedes_id":null,"title_target":"Perencanaan produksi dengan lembur","unit_type":"parameter_required_lab"},{"canonical_native_record_sha256":"79e5b0ba3d8d812509eebd136cf25f5da0b73ea7aea17a1bce454e7590cdd75c","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch04-compact-modeling-replacements","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"cb649d2dcd622e5db5a801eddde68d98801baa94d933674cffa798697757047c","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch04.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pendamping terbuka Bab 4: pemodelan ringkas","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"ef8002a4f4f9e7b1489b6e2fae303bf522ce2e339d957c2830244555d1379d41","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch04.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cakupan dan hasil acuan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"b19aa29d9479ef48185c4eb28d8b3540b7754ca2bdaa609bd0a28dfae13ac147","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch04.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Dua konvensi tanda yang tidak boleh dicampur","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"200bcd9e3cbeded0e744cdfe98ab2a8f8c7c8e0a7f3cb2fd7105cd293d4e4203","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.readme.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch04.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kasus yang sengaja gagal tertutup","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"e24d59b959737f41e8fee96095c707caaa1613f7a3b51c08e414c99834515bdb","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.readme.heading-005","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch04.readme.heading-004","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Produksi dengan lembur","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"690c735a92f162f1935280d623989dd8c03fb9d11181d589dc3883fa1622d743","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.readme.heading-006","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch04.readme.heading-004","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Investasi multiperiodik","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"72e9a5efb92d6053c88b5c3ad0e6d6101eddbb08d38db79f9aabce744b07c7bc","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.readme.heading-007","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch04.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Koreksi dan divergensi terikat","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"2892583963ad663c12f1bb333b744d0e6ef1215992513699f18aa95dcba56922","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.readme.heading-008","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch04.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Solusi degenerat","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"5e31821bb69d66dc059f374eccc7c1ec9a136535669a8dad987763cdde8b7387","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.multi-period-investment"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch04.readme.heading-009","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch04.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Menjalankan secara offline","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"84057e63a2c65f42813f517875a83e4ae103041a59fb2aff57d94b9294d09816","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.feasible-region","concept.extreme-point-optimality","concept.alternate-optima","concept.infeasible-linear-program","concept.unbounded-linear-program","concept.recession-direction"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05-graphical-lp","locale":"id-ID","order":6,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_source":"Chapter 5 graphical-LP laboratory","title_target":"Laboratorium program linier grafis Bab 5","unit_type":"computational_lab_collection"},{"canonical_native_record_sha256":"c77dbf1066bcb187b548af05728ce0a9b1a92b3483fe3c27f46e57d517c45040","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"f4dae4acca8a6165198f952d79fb4fe8a76245538f8f95f22860fa2c422ceb8a","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch05.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"912180dd334bbcabdd595fb21e93297837233004aa921f9812ff97c12df1b211","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch05.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal, prosa, dan data adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"13367c2ec6c96f25a592f3736050e911e88d7e045f335d626c99e71af2b190ab","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch05.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode laboratorium","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"853eea557c9abe9097c4e9bb9cc9543c2519ed91315d70760074a44914753140","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch05.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Runtime pihak ketiga yang dibekukan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"4f93be22603734bfc74da07801dcf93d079632d2542a962e65d074696f3288eb","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.attribution.heading-005","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch05.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pemisahan dan catatan koreksi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"95156b09507012e337f49b7daeb9d1cfd90434a778145da8f4f44bbb750267a7","concept_ids":["concept.feasible-region","concept.unbounded-linear-program","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex01","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Analisis Daerah Layak","unit_type":"computational_lab"},{"canonical_native_record_sha256":"7a2f013a8d3008b5dea39340c7fa2c91c2d31fbbc8179842a18a4b2d49201f8c","concept_ids":["concept.feasible-region","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex02","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Sketsa Daerah Layak","unit_type":"computational_lab"},{"canonical_native_record_sha256":"dd3522486c1602ec8bde836e53f725e6c8f1c8a8f85a4688b4559838ac1937f6","concept_ids":["concept.graphical-lp-method","concept.extreme-point-optimality","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex03","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Latihan Metode Grafis 1","unit_type":"computational_lab"},{"canonical_native_record_sha256":"4e89bf891fe36bb023ec0373c7151dc08b2af810fa110008f539779e8973b14d","concept_ids":["concept.graphical-lp-method","concept.extreme-point-optimality","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex04","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Metode Grafis untuk Penjual Limun","unit_type":"computational_lab"},{"canonical_native_record_sha256":"eb4bc8c459ffb1265a3cdd849c35931827d7972d57ef9d8fb465d6d20909624b","concept_ids":["concept.graphical-lp-method","concept.alternate-optima","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex05","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Metode Grafis","unit_type":"computational_lab"},{"canonical_native_record_sha256":"b514bc23ffaa0afbedfa17e4168aa0fe43b8b32c2f9d771925ad9472ccf43780","concept_ids":["concept.infeasible-linear-program","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex06","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Grafik Daerah Tak Layak","unit_type":"computational_lab"},{"canonical_native_record_sha256":"600faf1bccf2b6abf6e1a1a98f09f5354339fb9697e74b88113261d85fd2b52e","concept_ids":["concept.graphical-lp-method","concept.extreme-point-optimality","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex07","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menentukan Nilai Optimal","unit_type":"computational_lab"},{"canonical_native_record_sha256":"66e1caacba0e74d0ea6720ccd7b0cef9523e13eee379e8933d9f1180b1d38ce0","concept_ids":["concept.unbounded-linear-program","concept.recession-direction","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex08","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menunjukkan Masalah Tak Berbatas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"14d28770591e567ff343fe6379e59a716b9e69d511047efa628a251a11163644","concept_ids":["concept.unbounded-linear-program","concept.recession-direction","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex09","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Berhingga atau Tak Berbatas?","unit_type":"computational_lab"},{"canonical_native_record_sha256":"b89ca31c2291e7f563010eb4496dc99e4c90ccefd5d85137c14a14d8bc4634bb","concept_ids":["concept.diet-problem","concept.linear-programming","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex10","locale":"id-ID","order":10,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Masalah Diet","unit_type":"computational_lab"},{"canonical_native_record_sha256":"f5121790ed2d9474f4a3e79da57abbe7c4e5ef1dc672f6bab6d810d7447624e2","concept_ids":["concept.extreme-point-optimality","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex11","locale":"id-ID","order":11,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"parameter_required","supersedes_id":null,"title_target":"Mengapa Optimum Harus Berada di Titik Ekstrem?","unit_type":"parameter_required_lab"},{"canonical_native_record_sha256":"2d6bc295b154ec134d0c490a376d180c83c624b3a88597b35a69fc1393c1eaec","concept_ids":["concept.alternate-optima","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex12","locale":"id-ID","order":12,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Tak Hingga Banyak Solusi Optimal","unit_type":"computational_lab"},{"canonical_native_record_sha256":"33733ed58bbf6cbb491c6c6a9649e923c24e4e7414932ac3ea1fd291b3108267","concept_ids":["concept.alternate-optima","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex13","locale":"id-ID","order":13,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Tak Hingga Banyak Solusi Optimal","unit_type":"computational_lab"},{"canonical_native_record_sha256":"ff2b55cb1d8bcd6ad79a41f9eb44b66d0bed2d20c85a99c95995053332be2d12","concept_ids":["concept.unbounded-linear-program","concept.extreme-point-optimality","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex14","locale":"id-ID","order":14,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Optimum Berhingga pada Daerah Tak Berbatas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"e3e8a39023486c9692b484dc35659513bcf12caa6dfd560f15983941f0d4a397","concept_ids":["concept.recession-direction","concept.unbounded-linear-program","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex15","locale":"id-ID","order":15,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Arah Fungsi Tujuan Tak Berbatas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"6ef66cba059b384fd68fa322311446597f4bb1e1e26f6871e4b47cd8addbf460","concept_ids":["concept.recession-direction","concept.unbounded-linear-program","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex16","locale":"id-ID","order":16,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Optimisasi Terbatas dan Tak Berbatas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"a1604f1807a72aa1dcbf74ddbae0f02fbc6797f3c21e96c9ebb9e5e26c1e6be8","concept_ids":["concept.alternate-optima","concept.extreme-point-optimality","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.ex17","locale":"id-ID","order":17,"parent_id":"unit.o018.lab.ch05-graphical-lp","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Dari Rusuk Optimal ke Optimum Tunggal","unit_type":"computational_lab"},{"canonical_native_record_sha256":"75a719e8396657e15593b2b240a3d8b4957c70f33f12f731a8a1eb3e1fef9ab5","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch05-graphical-lp","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"386bc307233e3b4c9bc958264c05887b4a85a11fb17adb81a6310ca381ca6a7b","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch05.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pendamping terbuka Bab 5: program linier grafis","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"b9538f3c80d36c5c69c762a48d90a22c9b868eca9912d5398e29fb5c7afc173d","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch05.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cakupan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"4462aed0686141c0b1ce5fcfb1c04ba89649f1747bce4b3daab1b7c7fb93921e","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch05.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Hasil utama yang dikunci","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"4d4a3b5960f718a071255e71c59762d6f6119402a17adefa0ba8fa2a9c9c8f60","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.graphical-lp-method","concept.extreme-point-optimality","concept.alternate-optima","concept.unbounded-linear-program"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch05.readme.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch05.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Menjalankan secara offline","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"588f612b40f56933a9686c8f3e8e7e894c3fc2aa5b5687903ac38c4e9bb1462d","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.linear-combination","concept.linear-independence","concept.matrix-rank","concept.convex-combination","concept.convex-set","concept.halfspace","concept.corner-point","concept.representation-theorem"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06-formal-mathematics","locale":"id-ID","order":7,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Laboratorium pernyataan matematis formal Bab 6","unit_type":"computational_lab_cluster"},{"canonical_native_record_sha256":"62a74baaa0a03393887f6edef7f7a09f817925dfaea1c788a59e3e51be74b1cd","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"87e3cdc4ed702f7e345f6a8742773ad90c8c1f7ee46678df05c1461e125762f6","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch06.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"39fc618b7645f255d12cfa7d66309a144822d351b07c8e36949cdf01bd4658e7","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch06.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal, prosa, dan data adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"7c78d595dedb2c8182bfd53ea50a8c63b23dba7dbbb2aa2193f535af228d94ad","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch06.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode laboratorium","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"e6843ea567493d23b4b8d4aac28a478a5be1097649d3cc0d9cfd4cded11a1554","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch06.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Runtime pihak ketiga yang dibekukan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"c4bb6b9b20c4d0b675c7b78d9cb1c388a50f9db76a9bea1a21fe76a528fa55f0","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.attribution.heading-005","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch06.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Koreksi dan batas interpretasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"18403c9b03286e35383c397309b062781322f76017784068cbcca05cc317f6e0","concept_ids":["concept.vector-operations"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex01","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Operasi Vektor","unit_type":"computational_lab"},{"canonical_native_record_sha256":"34ef25df2ccad9d43d0243745cf10611a4eac8dca506d0f59b7c562f6fe43133","concept_ids":["concept.linear-combination","concept.convex-combination"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex02","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Kombinasi Linier dan Konveks","unit_type":"computational_lab"},{"canonical_native_record_sha256":"6028e0b34ccdfc211443b4eb9df8ca18aad429c6710c9ccc16bb87a38ec4ef91","concept_ids":["concept.linear-independence","concept.matrix-rank"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex03","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Kebebasan Linier dan Rank Matriks","unit_type":"computational_lab"},{"canonical_native_record_sha256":"ea6efd829f2e259f8cc45069a3635a2f4e217e5be9d54658e737a423daa8c600","concept_ids":["concept.convex-set","concept.convex-combination"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex04","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Konveks atau Tidak?","unit_type":"computational_lab"},{"canonical_native_record_sha256":"7492ef03289cf9e27ac26fa8f494d17b2c353b2fdffe39d58f4cb2c4425e1cd3","concept_ids":["concept.linear-programming","concept.matrix-rank","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex05","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menulis Program Linier dalam Notasi Matriks","unit_type":"computational_lab"},{"canonical_native_record_sha256":"a3adb81ee35996b6c355d0b5a2991ba183b6bb028eb07b08d841c16077fb0f61","concept_ids":["concept.convex-combination","concept.convex-set","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex06","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Kombinasi Konveks dan Geometri","unit_type":"computational_lab"},{"canonical_native_record_sha256":"ac398a119e8130ef4de3a34e1312c30f6bbb76ff0661d217ed708a632718cb7b","concept_ids":["concept.halfspace","concept.convex-set"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex07","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Geometri dan Konveksitas Setengah Ruang","unit_type":"computational_lab"},{"canonical_native_record_sha256":"707fa2009994876b87a3b7b80173f42e4e0109358c6181a033a52702323a246c","concept_ids":["concept.corner-point","concept.extreme-point-optimality","concept.matrix-rank"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex08","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Memeriksa Titik Ekstrem","unit_type":"computational_lab"},{"canonical_native_record_sha256":"bedf64b91b9a0108d7edf0edfc8a64eff7f2afd75adad40232416f994c1a23aa","concept_ids":["concept.representation-theorem","concept.convex-combination","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex09","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Kombinasi Konveks Titik-Titik Ekstrem","unit_type":"computational_lab"},{"canonical_native_record_sha256":"fb510bec8930b8f499f6a77dbf1efe2286e744530f9544bf2054259b4a717a00","concept_ids":["concept.convex-set","concept.convex-combination"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex10","locale":"id-ID","order":10,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Apakah Gabungan Himpunan Konveks Bersifat Konveks?","unit_type":"computational_lab"},{"canonical_native_record_sha256":"57afbf08e8358b9c964f293e7db2fe6b0687d69c8de2e63344da6bf5e1e51de6","concept_ids":["concept.corner-point","concept.extreme-point-optimality","concept.polyhedron","concept.open-source-solver"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex11","locale":"id-ID","order":11,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Letak Penggunaan Keterbatasan dalam Teorema Titik Sudut","unit_type":"computational_lab"},{"canonical_native_record_sha256":"57063f7bb1dab61fb6f88c7e2dc6f1bb7f21fcd7b3703410a3f786a64658874e","concept_ids":["concept.convex-set","concept.halfspace","concept.polyhedron"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.ex12","locale":"id-ID","order":12,"parent_id":"unit.o018.lab.ch06-formal-mathematics","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Irisan Keluarga Himpunan Konveks Sembarang","unit_type":"computational_lab"},{"canonical_native_record_sha256":"0e9cee67c5e2c9a3d6ac9e23308b725322141aef1bf30961876af1d2a9799d6f","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch06-formal-mathematics","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"782a5ab71ce2872e420ea3961108bf2c2dc1d175de80be107a99b2bfa25430ae","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch06.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pendamping terbuka Bab 6: pernyataan matematis formal","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"47c59440d08c6723568def0bbe4452e25f3d8e8c89bf3e2e01739952e4190ec7","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch06.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cakupan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"8e997fc257915d1113e9fc6bf223bd1e23a0548d0b49b2fb83b6a0655df2e868","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.vector-operations","concept.matrix-rank","concept.convex-set","concept.corner-point"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch06.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch06.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Menjalankan secara offline","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"5235f51b2d1ed47fefa77d7c288d4c2b8db111e702ec0a482d6660fd2c1fc4d3","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.standard-form","concept.basic-feasible-solution","concept.pivot-operation","concept.simplex-algorithm","concept.big-m-method","concept.basis-matrix","concept.reduced-cost","concept.simplex-tableau","concept.unbounded-simplex"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch07-ch09-simplex","locale":"id-ID","order":8,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Laboratorium metode simpleks Bab 7--9","unit_type":"computational_lab_cluster"},{"canonical_native_record_sha256":"00cd92aecd86bc67554d650afebea0653c93d20c2688bea12bbcee567ec251c1","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10","locale":"id-ID","order":9,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Laboratorium Analisis Sensitivitas","unit_type":"computational_lab_collection"},{"canonical_native_record_sha256":"1da831488842d94d24fdae353c4dab9319a2d9763a09c9f47e0b96c4e9a0902c","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch10","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"9b1845d108e453dda25c3b7862ed034b2799216b0fea16422ca5f2dc8a4fe9a4","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch10.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi, provenance, koreksi, dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"913658b080c1c3d739c4d0ec4bb10532113ae4be8ca9cfe22afc1ba73defa565","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch10.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal, manual, prosa, dan data adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"b97c10b2832ce8369213fc9650fa9988a0e13f402b0003ce835abefc52bf735a","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch10.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Tiga koreksi target yang dipertahankan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"ef3c248937ed3e26daba0c3c5c4782289d0dae6ef7a463c2b5b8e87a5310ba5c","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch10.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Batas data Latihan 10.7","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"d513595d00aee660cabcce6930241b35315cd6c035b44c76be5c01345ef8d1ff","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.attribution.heading-005","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch10.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode dan runtime pihak ketiga","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"a003d5f03cc2d03c3c8a4576e160e726990bb19c3c7a29161014aae385e8b8e4","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-1","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Harga Bayangan dari Kamus Akhir","unit_type":"computational_lab"},{"canonical_native_record_sha256":"7b2c86ffbf38e53569b7d7a79bc31214e43ed38c2347fd9354d9601eb2b1b5f2","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-10","locale":"id-ID","order":12,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mengapa Rentang Itu Ada","unit_type":"computational_lab"},{"canonical_native_record_sha256":"19c4bf0eabbb37081d8704557721bd48851f4b418f187af2b38eb180353473e1","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-11","locale":"id-ID","order":13,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Ketika Prediksi Harga Bayangan Gagal","unit_type":"computational_lab"},{"canonical_native_record_sha256":"8e2ec9051de32071dd6061fc2db6f3f82c34f707dbcd24fd0beb8330f555f3d0","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-12","locale":"id-ID","order":14,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Melampaui Rentang","unit_type":"computational_lab"},{"canonical_native_record_sha256":"d52d1c544168902a9859171fc2c1f466092c9890cbd013072c1f39e2ef16bbc5","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-2","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Rentang Sensitivitas Ruas Kanan","unit_type":"computational_lab"},{"canonical_native_record_sha256":"6ea6186b111bab2da6d95ce64a08bbf043ddbc89728c757141acf36089f844a4","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-3","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Sensitivitas Koefisien Objektif","unit_type":"computational_lab"},{"canonical_native_record_sha256":"3a0f324dc7608ebc7bbea4190af9169d27599a68dc28a0dfaa0871fea51aa53c","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-4","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Analisis Sensitivitas Lengkap","unit_type":"computational_lab"},{"canonical_native_record_sha256":"44d97132d9c4aff449f306d9edb6488a16108145513b454ac4b535c3fb38335d","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-5","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menentukan Rentang Koefisien Basis dan Nonbasis","unit_type":"computational_lab"},{"canonical_native_record_sha256":"386b58c10ace539652734a5e3d60ab405184118c876fa05ba6f2b898a79483d4","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-6","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Sensitivitas dari Invers Basis","unit_type":"computational_lab"},{"canonical_native_record_sha256":"e878ce0b6de4b36554afad4d7467eaca2bc5b7bbbba30a8d2ee67a5d58dba38f","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-7","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified_fail_closed","supersedes_id":null,"title_target":"Membaca Laporan Sensitivitas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"8bf682478ea43eca0ad28d14163b76d4b3d9dce4aec451105ca14b60e0e8fc63","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-8","locale":"id-ID","order":10,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Penafsiran Harga Bayangan","unit_type":"computational_lab"},{"canonical_native_record_sha256":"13d5a0a9dfa1ba807abe520dc13ef613cd7a074743412be9e2a303f91efc85ed","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.ex-10-9","locale":"id-ID","order":11,"parent_id":"unit.o018.lab.ch10","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mengapa Kendala Berslack Berharga Nol","unit_type":"computational_lab"},{"canonical_native_record_sha256":"4c3d3b505d8dcfe5e81ced5adb62a91adab81201bf17b0b37f01015ce044789e","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch10","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"a80585f05381d050b53a3fa04c73d29c38e63804dfbbefd8a80ac14f4d75e18a","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch10.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pendamping terbuka Bab 10: analisis sensitivitas","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"1d7af94d5c526da3fa0867296f85d4ca7dfcca133a4d0fb0702c32ba0239b7c9","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch10.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cakupan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"f2c20410eeb2be31bb187074ff8689049975b1b551fbc835c8bc6dba63ac147d","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch10.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch10.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Menjalankan secara offline","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"912108a9d8a9fb4889747241607a6db639701052ead72d80ecd16e21d18abd5d","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11","locale":"id-ID","order":10,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Laboratorium Dualitas","unit_type":"computational_lab_collection"},{"canonical_native_record_sha256":"438f64590a378af961c146a02e87758d76a7d7c2d614a2e63c23a111f67ec3f2","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch11","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"5c1b3f495b1b23d153733b22f6bb33e07f0acf84d30f112f20d1829dbf9bbdcf","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch11.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi, provenance, koreksi, dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"66fcab20a61040a1ddcbd5c140279d8af22f9bbf03c674c8dda6dfcac659a3ca","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch11.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal, manual, prosa, dan data adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"572e9a9f5a76770c59c14a52eafdf6fac3809dd90966f7a9dda7e305713f10db","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch11.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Tiga koreksi sumber yang dipertahankan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"ae806b81f5325f38c3adbc5eaee1da9edacdf3cede99f6a63622cbee8435e676","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch11.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cacat hulu berkeyakinan tinggi yang tidak diubah","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"5317da53160660908276fd9e696a40165cd818b7c52e1f64bf10398588acb1e2","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.attribution.heading-005","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch11.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode dan runtime pihak ketiga","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"3964a554feb63b2b2dad37ec47a8bdc72f2c995249e4bee711d39852b535c2ed","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-1","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Masalah Dual Toko Roti Kecil","unit_type":"computational_lab"},{"canonical_native_record_sha256":"b9869be6c8a6780b39e9dee4923204ebfd1a43b8ecb0c6f168f37c9e630f1769","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-10","locale":"id-ID","order":12,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Memeriksa Syarat-syarat","unit_type":"computational_lab"},{"canonical_native_record_sha256":"40f6b04b47ae30744d5f2f1f42b0513e17f569633112d41c69b9cca0ac8a16d9","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-11","locale":"id-ID","order":13,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Produksi Toko Roti dan Interpretasi Dualitas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"cbe3d7c0cc15db242add839aa32acf41f560b5211d15788dd4714129e47e2f12","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-12","locale":"id-ID","order":14,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Kendala Kotak dan Sertifikat Dual","unit_type":"computational_lab"},{"canonical_native_record_sha256":"4e67cdd09ddc7d9485969a3c3a8cc9703631260a773005ef51d10dcf97379df6","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-13","locale":"id-ID","order":15,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menurunkan Solusi Primal dari Tebakan Dual","unit_type":"computational_lab"},{"canonical_native_record_sha256":"bc71d2434f90ce19fa273faff8c9d2450dbcc6aa1203f138e2969e551c98312f","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-14","locale":"id-ID","order":16,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified_proof","supersedes_id":null,"title_target":"Harga Positif pada Kendala yang Longgar","unit_type":"computational_lab"},{"canonical_native_record_sha256":"d3f46dc948686e6b4a4e35d1e25a116690c14e1361c57420040d41a67bcd06ac","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-15","locale":"id-ID","order":17,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menyangkal Klaim Solusi Optimal","unit_type":"computational_lab"},{"canonical_native_record_sha256":"91f9d07e054a1cc48daf110c0eef626bd11bf1104c497e24615758b42ca4a3e3","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-16","locale":"id-ID","order":18,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Optimisasi Paket Makanan dan Dualitas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"ed5b89dff49b71f1008a12334f9d521bda411e79b591276f4b72b321235e3c9c","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-17","locale":"id-ID","order":19,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Dualitas dengan Jenis Kendala Campuran: Perusahaan Rintisan Kemasan Ramah Lingkungan","unit_type":"computational_lab"},{"canonical_native_record_sha256":"02be3df50fa6e703fc94c3af516a30abf46a781cb700f47a66a20c943ce0b1e5","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-2","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Rumuskan Masalah Dual","unit_type":"computational_lab"},{"canonical_native_record_sha256":"7bc495eb50a4656448d24ab89acf8c9bc0533712cc0719cf6431db7a38882c7e","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-3","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Memverifikasi Dualitas Lemah","unit_type":"computational_lab"},{"canonical_native_record_sha256":"779fa3784669533a8e972519cf1ce063906f42820cf2e92c556054d04e02737e","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-4","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Batas Dualitas Lemah","unit_type":"computational_lab"},{"canonical_native_record_sha256":"b8fe14f75a76daad6bd891295153822ce83824370bcac24a52df786a3a5bd9ab","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-5","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Masalah Dual dengan Kendala Campuran","unit_type":"computational_lab"},{"canonical_native_record_sha256":"a515cd9eba8ed4a3bdeb825c4364352aad8ab5100a59848f59a80311096add22","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-6","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Harga Bayangan dan Variabel Dual","unit_type":"computational_lab"},{"canonical_native_record_sha256":"d2e583aae157d8be3eac04419aca54a0c30e24608c212604f33f1281d829b877","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-7","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified_proof","supersedes_id":null,"title_target":"Sertifikat dengan Kata-kata Anda Sendiri","unit_type":"computational_lab"},{"canonical_native_record_sha256":"ad300ffea088d46a60c8bd3c7ef548139e69bf0459de9cd2cba0b7e3a00b9b52","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-8","locale":"id-ID","order":10,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Dualitas Kuat dan Ketaklayakan","unit_type":"computational_lab"},{"canonical_native_record_sha256":"e203cfe64ad1281411ab9ad30b7f2de63942584c44f061a863e2e0d26b278329","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.ex-11-9","locale":"id-ID","order":11,"parent_id":"unit.o018.lab.ch11","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified_proof","supersedes_id":null,"title_target":"Dual dari Dual adalah Primal","unit_type":"computational_lab"},{"canonical_native_record_sha256":"ca2e08f0828305a08fa54271ab434b070c88f13390e5467c86a7cd958cc66b09","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch11","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"40fe680dfe1997b56126e7f5e835c655374b30046d2a026732d31f885cb115a9","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch11.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pendamping terbuka Bab 11: dualitas dan kelonggaran komplementer","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"664a0d643777445b001c7176cc21479211fc1d130868a02e28c158ed1c301120","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch11.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cakupan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"1207274615435ff1217d6ec402cc4529e7de2648debe9ab1741281a6bfb9f79e","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch11.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch11.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Menjalankan secara offline","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"df16e98ee38e64809404a558cf1d4bd48cea6dbee8050cc193dfeff348f49f04","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12","locale":"id-ID","order":11,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Laboratorium Alur Kerja Python dengan Pyomo dan HiGHS","unit_type":"computational_lab_collection"},{"canonical_native_record_sha256":"2dd9cd23b168663249cd302aef5f446f791d5d77e4070ed73da0bc21e0be46d7","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch12","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"091790ed9a7122098ba094403d2fea0ab53380ebefc71ffbf248458c746257c9","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch12.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi, provenance, dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"cccb6d3841b926a9affa9e2dfff1a2413ec8870d67a91ba29c0bc82dce615555","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch12.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal, manual, prosa, dan data adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"c02759958f82f8dc69ed615a8f65346cb7ffc82abf503079c558c9ecec4ff58d","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch12.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Batas adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"298b71c7cbc5a5c6ff712b9bf232498b28747d1ddb2797f68c612e49e30a8c7a","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch12.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode dan runtime pihak ketiga","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"bacbc3db550ac8f28efef4eae1d650302865b3e5e4e278ed6972ef9dcfd6197d","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.ex-12-1","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch12","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Margin Laba Baru","unit_type":"computational_lab"},{"canonical_native_record_sha256":"465cfe6b78efc3037dace280de38c878cdc03b6115a949a9f07bf8019a92f4f9","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.ex-12-2","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch12","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Dari Matematika ke Python","unit_type":"computational_lab"},{"canonical_native_record_sha256":"09c7036cfac5b6a4323cb011a8eaa6264b0fda7d2512279d7d223fe0a5d9ee4f","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.ex-12-3","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch12","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Data Permintaan Baru","unit_type":"computational_lab"},{"canonical_native_record_sha256":"80f81ffaef106014e06c96f711d10a3b88098487288fe71c7b5876d8fecca564","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.ex-12-4","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch12","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Model Transportasi Tiga Pabrik","unit_type":"computational_lab"},{"canonical_native_record_sha256":"360cc04b1ef19f53cba1f8fd99c83f64723c5e996d0503ece7ed1c7bf772a93e","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.ex-12-5","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch12","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Dual dan Slack dari Model yang Telah Diselesaikan","unit_type":"computational_lab"},{"canonical_native_record_sha256":"bfe0214b15cee1e3271d595055d110aaf78772629bc3c167bda92a370cfd5370","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.ex-12-6","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch12","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Sapuan Kendala Epsilon","unit_type":"computational_lab"},{"canonical_native_record_sha256":"24b31b4066737df47563e7a03ae64949cb770179c4d5e84aea134d1e42492130","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.ex-12-7","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch12","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Kendala yang Tidak Ada","unit_type":"computational_lab"},{"canonical_native_record_sha256":"951bf8823db8aaf99bbb34026ee70e614a424e39cbf9053632bcbf3adc2b4e60","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.ex-12-8","locale":"id-ID","order":10,"parent_id":"unit.o018.lab.ch12","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Meminimumkan atau Memaksimumkan?","unit_type":"computational_lab"},{"canonical_native_record_sha256":"116a6377c311485ea84112ea63931f5aa76f0ccfd6ded92bb1d85ba0858a3c90","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.ex-12-9","locale":"id-ID","order":11,"parent_id":"unit.o018.lab.ch12","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Laba sebagai Fungsi Tenaga Kerja","unit_type":"computational_lab"},{"canonical_native_record_sha256":"42509f413fe80c39bb5e350a3a2035b337717b38da865b651e7732dd0ab5cb5c","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch12","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"b39d7bae39834eb8baa81e1efeff42bd097949db221b584fff03f980f8e6228f","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch12.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pendamping terbuka Bab 12: alur kerja Python","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"031c4e7b3582de8afbb6aa2c2e1b3bd1afd8da4af7f979295d8807c278105053","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch12.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Alur kerja enam langkah","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"f47ec12e97736a563ebf6e2b088dbbfde4c7cd14b1ccf65edc43ef3ac0fcf18d","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch12.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cakupan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"b2ba913b1d303d45cb3c891235eb7bfaeda13c3baf83fdbac7a7d9d5a2d2ab83","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch12.readme.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch12.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Menjalankan secara offline","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"fc67bcaae4c27bb5392a9de3fb12fe9535dee7be4cfb207f21f8abf3c520d4da","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13","locale":"id-ID","order":12,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Laboratorium Optimisasi Multiobjektif","unit_type":"computational_lab_collection"},{"canonical_native_record_sha256":"3c6a7951b392efa20a9ceee0c942f35162f42b4b2b4160c5e51cc95dabe3aec5","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch13","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"0b6dd028462eadc1d59eeb577f760307fe3e16720b429c8555611f8a969d461a","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch13.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi, provenance, ketidakselarasan sumber, dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"f32a153cbdc00164f12015ddf5dbb909db6ff8df49f09b58527dafc949c85c7f","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch13.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal, manual, prosa, dan data adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"240607a7fb2faa1938b702d69641ea1675af9bc512cea2ce77de3e3cded97212","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch13.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pemetaan buku--manual yang tidak boleh disamarkan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"b935eed36f204d29d135bd2656f50f6ed2181cf3fc1fb53b2f5f2bad96695165","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch13.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cacat sumber berkeyakinan tinggi yang dipertahankan sebagai provenance","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"894dd3705a1d5783a7646f4a419febdeb7631dc8c809a8e51e44a8b1682362bb","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.attribution.heading-005","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch13.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode dan runtime pihak ketiga","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"94fa7e9701240fcffce83be25ec626806b3023f2dbd75bb69d333d8dd1296284","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.ex-13-1","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch13","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mendefinisikan Optimalitas Pareto","unit_type":"computational_lab"},{"canonical_native_record_sha256":"bb6460c2a0244a4b5aaf6caa4e6dba3402f7b003791ca666dc412351f4fc7d37","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.ex-13-10","locale":"id-ID","order":12,"parent_id":"unit.o018.lab.ch13","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified_without_manual_solution","supersedes_id":null,"title_target":"Leksikografis versus Jumlah Berbobot","unit_type":"computational_lab"},{"canonical_native_record_sha256":"54d13e9c8386b2b8e8686506abf23cd2fbc86b149694e1de2d68a08f61e7d933","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.ex-13-11","locale":"id-ID","order":13,"parent_id":"unit.o018.lab.ch13","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Bobot yang Memilih Setiap Titik Sudut","unit_type":"computational_lab"},{"canonical_native_record_sha256":"1051c842f944c710811bde45a4a9fa3e4bf39859894676185c2655f32da3830d","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.ex-13-2","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch13","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menemukan Desain Terdominasi","unit_type":"computational_lab"},{"canonical_native_record_sha256":"1fdb06698ad65434997ab7d1b57121796e580caa1f323206be465be6d2e7c5a0","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.ex-13-3","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch13","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menghitung Skor Jumlah Berbobot","unit_type":"computational_lab"},{"canonical_native_record_sha256":"c218084213dc3bf2c34955094c051450038edcbc042cc5268c3e42aa8c967d4b","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.ex-13-4","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch13","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Batas Pareto, Jumlah Berbobot, dan Kendala-ε","unit_type":"computational_lab"},{"canonical_native_record_sha256":"d73cca40b56588c6a23902a299c02e62e1e1a46d8aa4fa25292a2eadf0bcca2f","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.ex-13-5","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch13","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Metode Jumlah Berbobot","unit_type":"computational_lab"},{"canonical_native_record_sha256":"4aa7dec78929d7c4563f7ea103df88a2def6f5abaa41e30db9ed53c95c7bebd1","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.ex-13-6","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch13","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Metode Kendala-Epsilon","unit_type":"computational_lab"},{"canonical_native_record_sha256":"153ac03242b953f852c2bd269433b70cb9643ecfad779e9f8f45f7e35cb42744","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.ex-13-7","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch13","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Kendala-Epsilon secara Manual","unit_type":"computational_lab"},{"canonical_native_record_sha256":"4fe28a087e933c31710238a857ee31067fdfcef1f8c3e70923879740e781c093","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.ex-13-8","locale":"id-ID","order":10,"parent_id":"unit.o018.lab.ch13","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Analisis Kompromi","unit_type":"computational_lab"},{"canonical_native_record_sha256":"ed2e66beada2f0fbc429b05b508e8179c7db0811b82fb9a1d5e2c5dc6b507f58","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.ex-13-9","locale":"id-ID","order":11,"parent_id":"unit.o018.lab.ch13","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Hal yang Tidak Dapat Dilihat oleh Jumlah Berbobot","unit_type":"computational_lab"},{"canonical_native_record_sha256":"b26144d1639fe9e4ce2e657366f33898af7c4cfd8156e42b08f11096b3db47ef","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch13","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"8fae962dd643355dcefa1e98600304ec0e5a7dfc2f3512285e2b61e66bdc8a25","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch13.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pendamping terbuka Bab 13: optimisasi multiobjektif","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"9c08643e36160afb7f92fec00613ec2b9c1ac15ae21115c1fd317cf95da8c748","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch13.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cakupan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"4ce0f69c1db5f64e71fa757fd2d3daa9f8019b068a330aa84da0d61b997a8230","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch13.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch13.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Menjalankan secara offline","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"91f743368df0be0fd24fce2c0d9e721a0510ca46b7fe48ee200ece25ad1ba599","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14","locale":"id-ID","order":13,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Laboratorium Algoritme Graf","unit_type":"computational_lab_collection"},{"canonical_native_record_sha256":"031b5e03b21cae13f8f01e9bbcc34209f2ef7729fddd21f0aba5d86ade22cde9","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch14","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"c47152f6b41e7ef6c7e86f434757547254b2e784ef28ea0dae83299af67c5b73","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch14.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi, provenance, dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"b1943d3efdb20c81c5f485145667dff7b36e1360917e143e2cc313f888a9b184","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch14.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal, manual, prosa, dan data adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"162a62def8ac3690414fdb6c26147491d2dc8e244a507f1be7e2def61de19eee","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch14.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Batas adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"76c4c6597a3646b2769c9d287c192fa2f16bcac92aa52d34396c206967c04a5e","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch14.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode dan runtime","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"ef475af00065854d809601ae311378db727c6f24f0ded37c68375afb1cb5a341","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-1","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Pohon Merentang Biaya Minimum (Kruskal)","unit_type":"computational_lab"},{"canonical_native_record_sha256":"ab85b80f38abef1b977840e3398c9b1cc4a7f5093b1b622ea869a5b288648e63","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-2","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Pendamping Python Terbuka","unit_type":"computational_lab"},{"canonical_native_record_sha256":"8c25328c1137a8e14cc5a5ecbe2122dbb6e6684bd61cbcd52d7c76b0a23b4a2e","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-3","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Algoritme Prim","unit_type":"computational_lab"},{"canonical_native_record_sha256":"9f74ad59491b7ad503fabc74593ba6b6b01af3e514419d020a95c5e482f64e0c","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-4","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Masalah Lintasan Terpendek","unit_type":"computational_lab"},{"canonical_native_record_sha256":"391fdc4d5832b1578e8163847903e39e3b2d026b04c73ea5a378419ef750f2b9","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-concept-15","locale":"id-ID","order":21,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Simpul Berderajat Ganjil","unit_type":"computational_lab"},{"canonical_native_record_sha256":"3a46cfaf4d52b0065b374a803700d27c254f6030475804d84f54bb525938fc12","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-concept-16","locale":"id-ID","order":22,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mengapa Kruskal Bersifat Optimal","unit_type":"computational_lab"},{"canonical_native_record_sha256":"d94c308621f1f1ac7ca67c7f2a20b882ce6e3bdd24c3d6977479c372f11f244e","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-concept-17","locale":"id-ID","order":23,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mengapa Dijkstra Memerlukan Bobot Tak Negatif","unit_type":"computational_lab"},{"canonical_native_record_sha256":"331f6ab07ee9a3d5f6a4ce286cbe78182a435f16c982530487fbc5e3cbed8c8c","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-exploration-18","locale":"id-ID","order":24,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Jejaring Sosial","unit_type":"computational_lab"},{"canonical_native_record_sha256":"615b4d35be1a7f73b24c10351f803317e922ecbfde01c619929e8c0eb4c0ef60","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-exploration-19","locale":"id-ID","order":25,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Jarak Levenshtein","unit_type":"computational_lab"},{"canonical_native_record_sha256":"4c657ed7a086b256373ef95d25ec330609f1fb0a839f0992d325eaaf10f36d75","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-1","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Graf Petugas Pos","unit_type":"computational_lab"},{"canonical_native_record_sha256":"341cae97ee524bd2ea01dfb92cd93b2386fe1bdff0e592952aa2f634e936c4d2","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-10","locale":"id-ID","order":16,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Eurail: Paris ke München","unit_type":"computational_lab"},{"canonical_native_record_sha256":"aa4300615b90429521b8f8d74fb3029fb8e9792fe66e002cbaeb398d9d0c2de1","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-11","locale":"id-ID","order":17,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"MST Graf Dallas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"87d6c6ff58c9111ba69e6181401e760a5183a273a82d316d97262f9fcfce9b7a","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-12","locale":"id-ID","order":18,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"MST Lima Bangunan","unit_type":"computational_lab"},{"canonical_native_record_sha256":"2aef2815cceb517a59fbaedd65d2356c67d847aae8c3c5ede2a78b84662e77a3","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-13","locale":"id-ID","order":19,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Kereta Virginia","unit_type":"computational_lab"},{"canonical_native_record_sha256":"293c734ff370d2b49aee58c30225931a97ba2d4b45f50f67d35ad16b5ab2a8b2","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-14","locale":"id-ID","order":20,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"MST Harga Tiket Pesawat","unit_type":"computational_lab"},{"canonical_native_record_sha256":"18381fb657ec280ed9db3f2e3755028fcf5996247cd188f6ce50d3f923cc54b6","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-2","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Graf Tujuh Jembatan","unit_type":"computational_lab"},{"canonical_native_record_sha256":"d86137db3b145f099a31b5e866869ba8cb5a8a7ce43fec95af7fda42869a0e90","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-3","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Graf Waktu Berkendara Dallas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"a0e45e751585cd470b6a2d71efd8704ce5c69aeddae48f57c4402e5628dafb56","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-4","locale":"id-ID","order":10,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Graf Harga Tiket Pesawat","unit_type":"computational_lab"},{"canonical_native_record_sha256":"878f6f3907c50c14413d954287c3cb8873ef4f00e2f02187dd04bd0c4e36e3ca","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-5","locale":"id-ID","order":11,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Derajat pada Graf Pertama","unit_type":"computational_lab"},{"canonical_native_record_sha256":"4f3082d28de128bc907b133cf1a50cbe6c557f50f6e311f723545a3584ac2bdf","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-6","locale":"id-ID","order":12,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Derajat pada Graf Kedua","unit_type":"computational_lab"},{"canonical_native_record_sha256":"82599d316443d94645f56d4fb6bc98bf7e799b6935911a72598eb2d392e76a61","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-7","locale":"id-ID","order":13,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Keterhubungan Graf Lima Simpul","unit_type":"computational_lab"},{"canonical_native_record_sha256":"93b17a0fd4f2d6257b473504010eae119d60afe2e7a699209eb59d7ac8a1d9d8","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-8","locale":"id-ID","order":14,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Keterhubungan Graf Delapan Simpul","unit_type":"computational_lab"},{"canonical_native_record_sha256":"1017e1df7b98039b87f99c71fd861e38601b1f0558ff7d7f415ebb5e12d47411","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.ex-14-skill-9","locale":"id-ID","order":15,"parent_id":"unit.o018.lab.ch14","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Eurail: Bern ke Berlin","unit_type":"computational_lab"},{"canonical_native_record_sha256":"f19c134e349b4fc583d18919f0ea1b5a5703868332d071cb71c62d115a479dd2","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch14","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"4fa5954133390b414e76ea2ab16978836990b29ad6d187e470265c7aa12bffb0","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch14.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pendamping terbuka Bab 14: algoritme graf","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"47289a800763b028d27bd83ee494299bc7f9d6799fcdc2aee5b54a747bafe289","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch14.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cakupan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"9e0519c61aed6c9ba951a154a61e31ee1d4d1419bf44c4e49668f1e877e5f49c","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch14.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch14.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Menjalankan secara offline","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"6fa15fcc58bb10864ab72ed6af0f6a873bafe623ff442a4907899a7d10690954","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15","locale":"id-ID","order":14,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Laboratorium Pemrograman Bilangan Bulat","unit_type":"computational_lab_collection"},{"canonical_native_record_sha256":"7f5c8143f455adcfa06bc2b3fa674778ffc879fe8d278500308d840c918b0288","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch15","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"6a90cbd7a31ebb20d283960349d993133a67501f80ecec31bc041f88a6aa5ee4","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch15.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi, provenance, catatan sumber, dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"37f15391935d9b4fb1cff6afcc69d038229fef160d74155d7c5839ada3fe74ee","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch15.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal, manual, prosa, dan data adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"c1629cfc2df87ec87aa7b14927e6adcb844f74038eb4f4593cad4a82beadc2d6","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch15.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pemetaan buku--manual dan catatan yang tidak disamarkan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"07e475667e943e93564f51f5e34d328498cef324124ead230c798a2a31caf5d5","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch15.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode dan runtime pihak ketiga","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"6554b88d35e4b83d9904fa1860e98fe3424b885a3e189cdfeef8996da4433f10","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-1","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Masalah Ransel","unit_type":"computational_lab"},{"canonical_native_record_sha256":"f53f352f6757b3425b554ac0951dd2437ade753f797be7787ea0436329b0ca37","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-10","locale":"id-ID","order":12,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Kendala Salah Satu","unit_type":"computational_lab"},{"canonical_native_record_sha256":"8357f9035ffdf8c4dc063788ea0c60caa0d205521a95a331e937c2094ad8c909","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-11","locale":"id-ID","order":13,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Produksi dengan Biaya Tetap","unit_type":"computational_lab"},{"canonical_native_record_sha256":"940c5a415923e3b03cb8a1d34ceb16ce6cb11827002e3622459aa7c6c3e7bc4d","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-12","locale":"id-ID","order":14,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mengapa Pembulatan Relaksasi Gagal","unit_type":"computational_lab"},{"canonical_native_record_sha256":"fd79d182400574aae7b4fea267c5ecee6128694e6b8b7c5e8239a049644538b6","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-13","locale":"id-ID","order":15,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Kapan Big-M Terlalu Besar?","unit_type":"computational_lab"},{"canonical_native_record_sha256":"ae17539cc8cc557741b994ccd4ca0ec6a0ea4667d99dade9b44de62796fc9598","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-14","locale":"id-ID","order":16,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Membaca Model Pertukaran Ginjal","unit_type":"computational_lab"},{"canonical_native_record_sha256":"e9fbc4ad129c73600f4c4f17ce93c118a3ead6841f1db814ef4701883a570955","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-15","locale":"id-ID","order":17,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Biaya Produksi Linier Sepenggal","unit_type":"computational_lab"},{"canonical_native_record_sha256":"4901532aaab78c7af93c48410d38dac0b008474ec2ef658ca674f91d036f5d65","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-16","locale":"id-ID","order":18,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Dua Pekerjaan, Tiga Mesin","unit_type":"computational_lab"},{"canonical_native_record_sha256":"6ffb75254982963c30a28c629257b838728b91e9313b3c0dba783cb527e3eada","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-2","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Ransel Mobil Kurir","unit_type":"computational_lab"},{"canonical_native_record_sha256":"12222fd26604314aec499f9ef7cbbae41eef5160a4ec34943d9633dbd1ab2cff","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-3","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mencakup Sebuah Kota Kecil","unit_type":"computational_lab"},{"canonical_native_record_sha256":"dabc8d3fbc6570a3d8925ea68b5b28f2d2e62413dd77e60a83df3092de25a4e1","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-4","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Latihan Aktivasi Big-M","unit_type":"computational_lab"},{"canonical_native_record_sha256":"7149077ed443c44e869ae7543125c475782899e13de47a118f795ff39c9353a8","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-5","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menentukan Lokasi Terminal Distribusi","unit_type":"computational_lab"},{"canonical_native_record_sha256":"e97957ff7c3043b35e1adea852d6cfded518c594c6c90894a6959fd0bd7a3245","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-6","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Lokasi Gudang","unit_type":"computational_lab"},{"canonical_native_record_sha256":"5f79a38a4082e023d39a7a1954c1c658cf4faca916fcf96bbb6f7fe31aafc21e","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-7","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Penganggaran Modal dengan Kebergantungan","unit_type":"computational_lab"},{"canonical_native_record_sha256":"6bcfbccce982fe656f83676a4df1e5aec25c6f08b17212032519c2b91fd3cc60","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-8","locale":"id-ID","order":10,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Lokasi Fasilitas: Dua Pusat Distribusi","unit_type":"computational_lab"},{"canonical_native_record_sha256":"0028ae5e040cbe2fc7f7ed40009743430013c86fb0ef64b7b7e13c4fcf62915e","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.ex-15-9","locale":"id-ID","order":11,"parent_id":"unit.o018.lab.ch15","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mewarnai Graf Lima Simpul","unit_type":"computational_lab"},{"canonical_native_record_sha256":"60eef30c8600477eed39d8a70297d3683ce2bf64adfd0deb685b9b4d927c5fdc","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch15","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"f6bd0bc0c8b4029d890c62e1d19bc6fdede85a0021af317bb877e06e38f034fc","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch15.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pendamping terbuka Bab 15: pemrograman bilangan bulat","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"40b79124a94d1d231ef8c6aa146a73129f7148be98c18e7a40ed4a05272f981b","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch15.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cakupan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"1ddce133f4f5fe0f4e2e42fb22687a7b2d28cdcfe379a53d7ee81fdaa2899205","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints","concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.ch15.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch15.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Menjalankan secara offline","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"49e899ef5f1c4431d6167b2456aac5f728c442c8728d0d3a23e085c63186d673","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab","prerequisite_concept_ids":["concept.decision-variable","concept.objective-function","concept.constraint"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"8fc6ceeea949a5f1460b08387a84031c9ac69c8374a3ab9d62a181b3424a7d06","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Laboratorium Pemecah Terbuka O018","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"78b8af7679005c6818ef4180aa4bec8a1c35e0e481f3e22ee2e4b8055e3b69d2","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Laboratorium pertama","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"ceb55199570b19c2dd65864ca5e4c2348def24a180dd47c12e974d47028faef5","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.inventory-balance","concept.linear-programming","concept.integer-linear-programming"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Batas lisensi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"ff23ee473ea91369699466f60e02280a687fe891effbb568348fa7ebd924f9c4","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.attribution","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"6a7c581b60d423814047a6cbb348f16f06dd3521b13ae550aeb03f210dc3edf7","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.attribution.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.simplex.attribution","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Atribusi, provenance, dan hak komponen","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"78872d3548ec4f42a34e56f941cbd27f602f7e737ed546ce46f95a04edb6aabe","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.attribution.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.simplex.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Soal, manual, prosa, dan data adaptasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"462cda0bb955dcae7b06e3504db3494d658375c9a496b16aced1b4360395ff17","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.attribution.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.simplex.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Kode laboratorium","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"67faf8ae7ecab41c6fda0b206ad921d53e5f1ce6a7897820e5b8a461acc031aa","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.attribution.heading-004","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.simplex.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Runtime pihak ketiga yang dibekukan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"8b12eecc5deabf879117fccb5ec2d338dd8dc14579b2bc4af3e3a7bf3dc783c5","concept_ids":["concept.open-source-solver","concept.reproducible-computation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.attribution.heading-005","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.simplex.attribution.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Divergensi dan batas interpretasi","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"34042b6c91316dbe737148c32524d16fa1b75170cf9ba10517f32a2aeccd94b2","concept_ids":["concept.standard-form","concept.canonical-form"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-01","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Bentuk standar dan kamus pertama","unit_type":"computational_lab"},{"canonical_native_record_sha256":"3406b3dafff7741762d175530a0b97a2e44592691ffd17097b5ad9e5d4828f73","concept_ids":["concept.standard-form"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-02","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mengonversi ke bentuk standar","unit_type":"computational_lab"},{"canonical_native_record_sha256":"c81078fa6c188470fa0000367d9da75d0c082ed67bf627e659cdc0220860df64","concept_ids":["concept.standard-form"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-03","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mengonversi ke bentuk standar","unit_type":"computational_lab"},{"canonical_native_record_sha256":"a36523020b63bef727e3ee65b991a04502bc99a10afae1b86ad9e6a8242083e7","concept_ids":["concept.standard-form"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-04","locale":"id-ID","order":4,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mengonversi ke bentuk standar","unit_type":"computational_lab"},{"canonical_native_record_sha256":"f58ed0870db903eb479f6e8bb4de9f290293bb7ee24c99deaa61e7ce08ebfa9d","concept_ids":["concept.standard-form"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-05","locale":"id-ID","order":5,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mengonversi ke bentuk standar","unit_type":"computational_lab"},{"canonical_native_record_sha256":"2c6684a22df60479f2624030d51e44b1c08c87315dc9933cb04bee8992432ef7","concept_ids":["concept.standard-form"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-06","locale":"id-ID","order":6,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mengonversi ke bentuk standar","unit_type":"computational_lab"},{"canonical_native_record_sha256":"deb87fb3579540568e59c675865287495ebc0f22f868b1b65d1301c89863c347","concept_ids":["concept.pivot-operation","concept.canonical-form"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-07","locale":"id-ID","order":7,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Pivot ke arah yang berbeda","unit_type":"computational_lab"},{"canonical_native_record_sha256":"f9f3cd4b9365fe4ad73369b11be2508935993c9ec77df4ed37fcaaeb4c79ad60","concept_ids":["concept.simplex-algorithm","concept.pivot-operation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-08","locale":"id-ID","order":8,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Latihan metode simpleks","unit_type":"computational_lab"},{"canonical_native_record_sha256":"4c3e6bef61744f7b685c5d4f3fcfc9c5593e7022b7ebd65a5bc4a7ca1e6ce5fd","concept_ids":["concept.simplex-algorithm","concept.pivot-operation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-09","locale":"id-ID","order":9,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Latihan metode simpleks","unit_type":"computational_lab"},{"canonical_native_record_sha256":"426850c7ba1e8cdac87caddd0df7e8e54322c2d0dd19d8bd31e8f076c03a186d","concept_ids":["concept.simplex-algorithm","concept.pivot-operation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-10","locale":"id-ID","order":10,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Latihan metode simpleks","unit_type":"computational_lab"},{"canonical_native_record_sha256":"0977eccd7f1c34c7129e3e798503223dec014c02e8188f8f1bac717dc277734d","concept_ids":["concept.simplex-algorithm","concept.pivot-operation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-11","locale":"id-ID","order":11,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Latihan metode simpleks","unit_type":"computational_lab"},{"canonical_native_record_sha256":"81a70700d50d3739b70b33b67b6990e3d7f94f95f11cec2404dbcbc83abc8787","concept_ids":["concept.simplex-algorithm","concept.pivot-operation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-12","locale":"id-ID","order":12,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Latihan metode simpleks","unit_type":"computational_lab"},{"canonical_native_record_sha256":"0e79487122b6c9f8dfd9cd97a606213c4a3727dde0f38c4dd28ecd824c2de535","concept_ids":["concept.simplex-algorithm","concept.pivot-operation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-13","locale":"id-ID","order":13,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Latihan metode simpleks","unit_type":"computational_lab"},{"canonical_native_record_sha256":"bd57f319f8b0b1cf4e6f7663ad1913684fdefe83a04c9410dd848ed7251b3f84","concept_ids":["concept.simplex-optimality-condition","concept.canonical-form"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-14","locale":"id-ID","order":14,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Optimalitas kamus","unit_type":"computational_lab"},{"canonical_native_record_sha256":"e5b755d5053a0afac64f7310481d0cec7adbda916d23e3b5372ad6b279b4ea60","concept_ids":["concept.basic-feasible-solution"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-15","locale":"id-ID","order":15,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Solusi basis layak","unit_type":"computational_lab"},{"canonical_native_record_sha256":"20ecc415b1b58482439f7315ae09e52f1f3da9d987aba384234e62ac98955bb3","concept_ids":["concept.simplex-algorithm","concept.basic-feasible-solution"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-16","locale":"id-ID","order":16,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Apa yang dilindungi oleh uji rasio","unit_type":"computational_lab"},{"canonical_native_record_sha256":"b4378c97648e9a595a30d35a841d1e69e27b273c7684cd8f04bfb62edaf25c27","concept_ids":["concept.degeneracy","concept.pivot-operation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex07-17","locale":"id-ID","order":17,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Hasil imbang dalam uji rasio memaksa degenerasi","unit_type":"computational_lab"},{"canonical_native_record_sha256":"2a4e4a1b1f63f846ea855e6f125ca4b5919e0007797d3667662e55b7bc9bea68","concept_ids":["concept.basis-matrix","concept.basic-feasible-solution"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex08-01","locale":"id-ID","order":18,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Matriks basis dan solusi basis","unit_type":"computational_lab"},{"canonical_native_record_sha256":"5c56d77b4feba2f4fe95f676d523d3e7a52acd76c0d4d97de16274151d502864","concept_ids":["concept.basis-matrix","concept.basic-feasible-solution"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex08-02","locale":"id-ID","order":19,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Solusi basis yang tidak layak","unit_type":"computational_lab"},{"canonical_native_record_sha256":"ce90ed2e35dbc91947fc3a2f3c2899f19291678a0ccbcb1982b5b7b6f9cddeca","concept_ids":["concept.basis-matrix","concept.partitioned-variables"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex08-03","locale":"id-ID","order":20,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Basis keempat untuk contoh tiga basis","unit_type":"computational_lab"},{"canonical_native_record_sha256":"7497c7883c9fac140815fcf507ab1410188c8f924bb76ab772dab333d487280e","concept_ids":["concept.reduced-cost","concept.basis-matrix"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex08-04","locale":"id-ID","order":21,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Biaya tereduksi pada dua basis","unit_type":"computational_lab"},{"canonical_native_record_sha256":"2cca6c070373b0479e6bf6d0398f27badba1976f9fc52dfa0a51683afc394124","concept_ids":["concept.basis-matrix","concept.basic-feasible-solution"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex08-05","locale":"id-ID","order":22,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Basis mana yang layak?","unit_type":"computational_lab"},{"canonical_native_record_sha256":"f4304b445af8e6926535fbf01635ad5b5ba380aeaefebd83c2a9494c38f30626","concept_ids":["concept.basis-matrix","concept.canonical-form"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex08-06","locale":"id-ID","order":23,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Membangun kembali kamus dari rumus","unit_type":"computational_lab"},{"canonical_native_record_sha256":"df2d7b09e8396783b20036968c71bcf49eb001925802435a2bebe8385121ef63","concept_ids":["concept.reduced-cost","concept.basis-matrix"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex08-07","locale":"id-ID","order":24,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Biaya tereduksi variabel basis","unit_type":"computational_lab"},{"canonical_native_record_sha256":"a7df0c76e23a0d995e89ddd8ec59be889208d208b5c204771946f7197b0da24c","concept_ids":["concept.reduced-cost","concept.simplex-optimality-condition"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex08-08","locale":"id-ID","order":25,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Tanda biaya tereduksi dan aturan variabel masuk","unit_type":"computational_lab"},{"canonical_native_record_sha256":"4a3d0e337d701b56510037acbe91693a935653eafc71b31d5b0906e8158460ed","concept_ids":["concept.reduced-cost","concept.simplex-optimality-condition"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex08-09","locale":"id-ID","order":26,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Biaya tereduksi negatif secara ketat menyiratkan optimum unik","unit_type":"computational_lab"},{"canonical_native_record_sha256":"9f2af90a87ef1646ee8b3252c0938e5464d44d9181a865160f9285b267b554a9","concept_ids":["concept.simplex-tableau"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-01","locale":"id-ID","order":27,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Membaca tableau di tengah proses penyelesaian","unit_type":"computational_lab"},{"canonical_native_record_sha256":"5ad36eacf42f4d1271f1356140444fad3a71f0b031dd9b82d465f8dc95aaf3ec","concept_ids":["concept.simplex-tableau"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-02","locale":"id-ID","order":28,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Membaca tableau","unit_type":"computational_lab"},{"canonical_native_record_sha256":"f1b33176191853b595a03033b82d5c7d2744f9d2336bc008fc2606134f44013e","concept_ids":["concept.simplex-tableau","concept.pivot-operation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-03","locale":"id-ID","order":29,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Variabel masuk, uji rasio, dan elemen pivot","unit_type":"computational_lab"},{"canonical_native_record_sha256":"b6b004a0e85c93a9a8e10cd685c4d340a33b7984ff2e64fcdb032fd36d37ee13","concept_ids":["concept.simplex-tableau","concept.pivot-operation"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-04","locale":"id-ID","order":30,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Melakukan satu pivot","unit_type":"computational_lab"},{"canonical_native_record_sha256":"eeb56a6f5bf229e48dd665b7f8e259c57d184d4030b4b8c0195a19fce2af1428","concept_ids":["concept.simplex-tableau","concept.simplex-algorithm"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-05","locale":"id-ID","order":31,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menyelesaikan program linier dalam bentuk tableau","unit_type":"computational_lab"},{"canonical_native_record_sha256":"49ba625bc589a962c556cb45354afcfb2ed136e892c1dc46d4c7bcc146a9dfcb","concept_ids":["concept.simplex-tableau","concept.simplex-algorithm"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-06","locale":"id-ID","order":32,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Penyelesaian lengkap dengan dua pivot","unit_type":"computational_lab"},{"canonical_native_record_sha256":"268b44cda7075d7ed59abf4cf64329d94a3d5e6bb4a3b55fe21bcd10098f7c3c","concept_ids":["concept.simplex-tableau","concept.big-m-method"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-07","locale":"id-ID","order":33,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menyusun tableau Big-M","unit_type":"computational_lab"},{"canonical_native_record_sha256":"5be0f7ccea65ff0f439cbcd6393c3243fa5f37b91edb60acb7dabbe315d02854","concept_ids":["concept.simplex-tableau","concept.simplex-optimality-condition"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-08","locale":"id-ID","order":34,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Konvensi tanda pada baris z","unit_type":"computational_lab"},{"canonical_native_record_sha256":"b187ecd510c83a616cd3796de5579400e51b3bf2d4604133d2dc4cddfd90ca85","concept_ids":["concept.simplex-tableau","concept.canonical-form"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-09","locale":"id-ID","order":35,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Dari tableau ke kamus","unit_type":"computational_lab"},{"canonical_native_record_sha256":"5d0e019926b4a83ee820af7bc9fe9f778104bb5f00d8b8cf824935afe0972739","concept_ids":["concept.simplex-tableau","concept.unbounded-simplex"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-10","locale":"id-ID","order":36,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Mengenali masalah tak terbatas","unit_type":"computational_lab"},{"canonical_native_record_sha256":"7ba03688d7ce5cda5704477331e53add00f2b98089bc02c5e61ab7a85b0501ab","concept_ids":["concept.simplex-tableau","concept.artificial-variable"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-11","locale":"id-ID","order":37,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Membaca ketaklayakan","unit_type":"computational_lab"},{"canonical_native_record_sha256":"6ae120e006ed6a996ab3149a6c353acb70c0519caeeceea75073ed58c6074779","concept_ids":["concept.simplex-tableau","concept.unbounded-simplex"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.ex09-12","locale":"id-ID","order":38,"parent_id":"unit.o018.lab.ch07-ch09-simplex","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"verified","supersedes_id":null,"title_target":"Menyertifikasi ketakterbatasan dari tableau","unit_type":"computational_lab"},{"canonical_native_record_sha256":"eec75c3ada69540b9c1eaabbd6b5c405072b87a879d82a9ad02822f7970fcb24","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.readme","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.ch07-ch09-simplex","prerequisite_concept_ids":["concept.linear-programming","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"unit_type":"laboratory_guide"},{"canonical_native_record_sha256":"8c8e4d5fa8101a4f458bf383d86d02e6dff5178051d93d56ba331161abedd028","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.readme.heading-001","locale":"id-ID","order":1,"parent_id":"unit.o018.lab.simplex.readme","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Pendamping terbuka Bab 7–9: klaster simpleks","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"0c75d48d50551582bc4e96f1933a817f7942d1a2429bc1b12857c59fdda28b4e","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.readme.heading-002","locale":"id-ID","order":2,"parent_id":"unit.o018.lab.simplex.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Cakupan","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"6501939e676a0a49c18035fcb64d5b958009e169f7a05cf4f5e1788a18fb4b5c","concept_ids":["concept.open-source-solver","concept.reproducible-computation","concept.simplex-algorithm","concept.simplex-tableau","concept.basis-matrix","concept.reduced-cost"],"edition_id":"edition.o018.id-id.draft","id":"unit.o018.lab.simplex.readme.heading-003","locale":"id-ID","order":3,"parent_id":"unit.o018.lab.simplex.readme.heading-001","resource_id":"resource.o018.open-solver-lab","rights_component_id":"rights.o018.prose-data","status":"source_frozen","supersedes_id":null,"title_source":"Menjalankan secara offline","title_target":null,"unit_type":"section"},{"canonical_native_record_sha256":"3a9d7462a86e7d60645cbd011d037198e10c314b1369e64e4100c787f07ef5d4","edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1","locale":"mul","order":1,"parent_id":null,"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Mathematical Programming and Operations Research, Book 1","title_target":"Pemrograman Matematis dan Riset Operasi — Buku 1","unit_type":"book"},{"canonical_native_record_sha256":"0a5f8dee4ca28171c97df6779486b3c4e32373980fabe1e14d070d37cdcdb6f1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ai-disclosure","locale":"mul","order":6,"parent_id":"unit.r017.book1.frontmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"disclosure"},{"canonical_native_record_sha256":"aab95d9158f9055774e6d260d087d2364960c83b1c23c329cf9f3fafd97648c2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ai-disclosure.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ai-disclosure","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Use of Generative AI","title_target":"Penggunaan AI Generatif","unit_type":"chapter"},{"canonical_native_record_sha256":"f59d8fa0cc260cc4398b28566cd36f88a300ccbff3dadc58dc7d185982397ee5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ai-disclosure.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ai-disclosure.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Authorship","title_target":"Kepengarangan","unit_type":"section"},{"canonical_native_record_sha256":"2056c9bd1193efd1b8671606ce972fdc7cc9cdc4f54588121f58d539bc99f4fa","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ai-disclosure.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ai-disclosure.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"What AI Was Used For","title_target":"Untuk Apa AI Digunakan","unit_type":"section"},{"canonical_native_record_sha256":"6693196aee9f48d27004d7c89b4c6a4ddad1146755a6140d23050c21b6d22b14","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ai-disclosure.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ai-disclosure.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"What AI Was Not Used For","title_target":"Untuk Apa AI Tidak Digunakan","unit_type":"section"},{"canonical_native_record_sha256":"e4acdd9734fd4e61a9c37a299341d3db567ab09a1acdd922ae921b455ef77769","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ai-disclosure.section-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ai-disclosure.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Example Prompt Types","title_target":"Contoh Jenis Prompt","unit_type":"section"},{"canonical_native_record_sha256":"9100cd40cba3fd2d416c5baeb5d8c23fabc5cbee9ff1b99f8d0d0cbcf3cea603","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ai-disclosure.section-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ai-disclosure.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Verification and Accountability","title_target":"Verifikasi dan Akuntabilitas","unit_type":"section"},{"canonical_native_record_sha256":"304b1137e1b356818bec334867666b9d02b5395a59c7767ddb4a235640a2e606","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ai-disclosure.section-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ai-disclosure.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Disclosure Standard","title_target":"Standar Pengungkapan","unit_type":"section"},{"canonical_native_record_sha256":"db814de691067cf706f3eeadf2374f42835cc4e9d40f8a8b0019f92a24709407","edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendices","locale":"mul","order":19,"parent_id":"unit.r017.book1","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Appendices","title_target":"Lampiran","unit_type":"appendix_collection"},{"canonical_native_record_sha256":"352792d62d4397257293ba6f2496498011b5775d90574884956e1f6f9a867222","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.equations-lines","locale":"mul","order":1,"parent_id":"unit.r017.book1.appendices","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Equations and Lines","title_target":"Persamaan dan Garis","unit_type":"appendix"},{"canonical_native_record_sha256":"56996207869f45c69d13f0fa5ee6156c00ed04c11d6c6094cce7913cbb18013b","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.equations-lines.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.appendix.equations-lines","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"095df2168fe104429075d279670898c6f2de61399f05df06690033f05f78e3dd","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.captionfigure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Plot dua dimensi garis $y = 3x + 2$ pada sumbu $x$--$y$ dengan latar kisi.","unit_type":"figure"},{"canonical_native_record_sha256":"46d483fea03e743bce9b081a3683b8c5559d93cbebcdf88b178db8a928c4292d","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.captionfigure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Plot dua dimensi garis $2x + y = 4$ pada sumbu $x$--$y$ berkisi.","unit_type":"figure"},{"canonical_native_record_sha256":"69196f0070fe46117ebf7bc524380d8f9f58049494f22c79cc371b1557ca1218","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.captionfigure-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Garis yang melalui titik potong sumbu $(0,-2)$ dan $(3,0)$.","unit_type":"figure"},{"canonical_native_record_sha256":"3a9b3538d3185dd2508e6a8edd9ab210b3c18d5075d52e411af6aa8c01739428","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.captionfigure-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Garis yang melalui titik $(3,1)$, $(5,2)$, dan $(7,3)$.","unit_type":"figure"},{"canonical_native_record_sha256":"79984ea260e6fdf4057ef316cafa91baeaa32bde12c59877cec36983a5485777","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.captionfigure-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Plot dua dimensi garis horizontal $y = 3$ pada sumbu $x$--$y$ berkisi.","unit_type":"figure"},{"canonical_native_record_sha256":"00c38f6861a7a8bb1717c8af7f10f003e509cc1e646f8a3bcc7308797debf2f5","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.captionfigure-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Plot dua dimensi garis vertikal $x = -2$ pada sumbu $x$--$y$ berkisi.","unit_type":"figure"},{"canonical_native_record_sha256":"9afe9ffb35f11156e4dd9590b59e36795515e6b2d61d68d9e2fede75ca9f34ba","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.captionfigure-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Plot dua dimensi yang memperlihatkan gradien garis melalui $(-2,3)$ dan $(4,-1)$ pada sumbu $x$--$y$.","unit_type":"figure"},{"canonical_native_record_sha256":"856e76c989b94611f33371d91164f58bd75fe8789364f963a7caab272655a81c","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.captionfigure-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Plot dua dimensi garis yang melalui $(1,2)$ dengan gradien $-3/4$ pada sumbu $x$--$y$ berkisi.","unit_type":"figure"},{"canonical_native_record_sha256":"d63be889fc3947833fb09bafb7d1f159cace46b0cdfbf9ee855f91bc877d7d78","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.captionfigure-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Plot dua dimensi sebuah titik keseimbangan.","unit_type":"figure"},{"canonical_native_record_sha256":"dcfa359233de6d89987653c958822b4e0ceecfc531068c34bd6fa5de811dd828","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.captionfigure-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Plot dua dimensi sebuah titik impas.","unit_type":"figure"},{"canonical_native_record_sha256":"19be80a5d5c3aabe7539b41081c84d6bf222ccfbf3d5b5a44f499fa55b6c47cf","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.equations-lines.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Persamaan Linier","unit_type":"chapter"},{"canonical_native_record_sha256":"586e6a5eeb3e40ad62bd2342b60d5821aaadf4c00cd2dd7eda53ae9fc2f3ab5b","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggambar Sebuah Garis","unit_type":"example"},{"canonical_native_record_sha256":"202747788bfbd66fa3ca53aa2a0c2917ac44cea1b6275dfa36caf1f6b0e4fe6f","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggambar Garis Lain","unit_type":"example"},{"canonical_native_record_sha256":"cfcfedb563a1c4f8c8ce9e77529794168e26ba65f46db5fe5d3529395ac9db7e","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Titik Potong Sumbu","unit_type":"example"},{"canonical_native_record_sha256":"ed5f0129d33c35ea1b5d695cd0fd4b20a274cd412a6f0dfbed04696d24697520","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Persamaan Parametrik","unit_type":"example"},{"canonical_native_record_sha256":"ce8a121e11aba235e336c6a070d8ee88d9663fcda51490c2d78029eb3540493c","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Garis Horizontal dan Vertikal","unit_type":"example"},{"canonical_native_record_sha256":"98e955492f8255512bc5e750d5a9c22ddc9d4daf25587fb8a1b8dad91d80a55e","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Gradien","unit_type":"example"},{"canonical_native_record_sha256":"b4182b0236db710073bfc4757e4b89c5fe1b1f60fa8a488bbd3d16ad749175ac","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Gradien Garis Vertikal dan Horizontal","unit_type":"example"},{"canonical_native_record_sha256":"91e23607a45d4abc727232ef0ac4c813c2b1f7d13d1e1b8ff9b6c567ebd18053","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggambar Garis dari Titik dan Gradien","unit_type":"example"},{"canonical_native_record_sha256":"51727c0c6976799126b8d6468a77f5ed3b5131486ffcc446f4aa4b5b0cc4baee","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Persamaan dari Gradien dan Titik Potong","unit_type":"example"},{"canonical_native_record_sha256":"9f451374cc423e0325fcd1d11f1aa03e195cda818e4542cae061b036ff8088f8","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Persamaan dari Titik dan Gradien","unit_type":"example"},{"canonical_native_record_sha256":"abae3608d47fd7acbad43784b12b5268be00204f657da890b3537093ea9cdd4c","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Persamaan dari Dua Titik","unit_type":"example"},{"canonical_native_record_sha256":"caac3afd0dec9eff0b958f86a4d8e63bff1040f6b3c65d110646884fc5971705","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggunakan Titik Potong Sumbu","unit_type":"example"},{"canonical_native_record_sha256":"0e177486e86228b12c5f419d102e5107c2bda112a5f2df33a033d85367028e5c","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Fungsi Biaya","unit_type":"example"},{"canonical_native_record_sha256":"25d3ea21a1c248edfb12e632329b057aff63f9da1744dca6153aa4dfd5d6a870","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Biaya dari Dua Titik","unit_type":"example"},{"canonical_native_record_sha256":"f670caf70f9439deaae28b9314ea25cf45453e9bc2b4689550c95930cf825f6f","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Konversi Suhu","unit_type":"example"},{"canonical_native_record_sha256":"55aa77c75239f67c4e5b63c00143f4d591e5ea049de61b828f4fe6e5baf9e965","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-016","locale":"id-ID","order":16,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menyelesaikan Sebuah Sistem","unit_type":"example"},{"canonical_native_record_sha256":"bd842bc09c491ec4a7fb74422ed802e4a5a6fd99188aef766ac93c5d45884a80","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-017","locale":"id-ID","order":17,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Titik Keseimbangan","unit_type":"example"},{"canonical_native_record_sha256":"27cac5a9f237a65fa562033a85f190c96b4b17269ccc1d4baf974c25a7e96741","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.example-018","locale":"id-ID","order":18,"parent_id":"unit.r017.book1.appendix.equations-lines.text.subsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Analisis Titik Impas","unit_type":"example"},{"canonical_native_record_sha256":"d3f394055f5409365789e54064a41cea68f2448b6e41cc185de65068f74529ec","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.equations-lines.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"85d7cf28af1f154849c6d747358df1945494352e98ad0754d999e753a53498e6","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.outcome-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"844f3c72b4990f4aa4e8236c509a4152a3bbe1b2826ad1cf4ef59d1fbf9de84b","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.outcome-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"39f3ad36738a96d70c37840510db6a28f978987f748547d629a42681eee0e47e","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.outcome-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"7efb007af6ab8b9deb82194a1ffc747e95ab4937a7a075df897e61f2f4729380","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.outcome-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"8e0b9eacb6086d528f780776632bed2aeb93be73f3c14af9ab74f9a33fb11008","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.outcome-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"d7e2543e023638c47d010d6713adbeda995b2b5ae2352f33806098ac5428e8b3","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.equations-lines.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Ringkasan Bab","unit_type":"section"},{"canonical_native_record_sha256":"ca2f2f9172909d15a3364269f3623996106bf5b808e4a8cf399775d6ce056bef","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.section-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.equations-lines.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggambar Grafik Persamaan Linier","unit_type":"section"},{"canonical_native_record_sha256":"dd874a87dfbde4e1ef8a7356d4e948f1277c87abca7e763b5d2efdefee78dafc","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.section-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.equations-lines.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Gradien Garis","unit_type":"section"},{"canonical_native_record_sha256":"bb134b415b71669c1351bd4ab82bcbf30a80e87b342ddf24d0b4b4ebb2020cfc","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.section-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.equations-lines.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Persamaan Garis","unit_type":"section"},{"canonical_native_record_sha256":"b461e6b5ae8d463ad0038ef34e96051355b94c38aa626041fc237e934b616bc6","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.section-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.equations-lines.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penerapan Persamaan Linier","unit_type":"section"},{"canonical_native_record_sha256":"10e75b6e8d2c9ecdb3a4d9e361bab8bfce06f239f74ab5d22ec91b4df67e5542","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.section-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.appendix.equations-lines.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penerapan Lain: Sistem Persamaan Linier","unit_type":"section"},{"canonical_native_record_sha256":"4c32c7b6329dad7934416c12705b7ec8b820565092b9a9501415538499b0cc48","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.section-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.appendix.equations-lines.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tinjauan Bab","unit_type":"section"},{"canonical_native_record_sha256":"85a6be2315a9b7782b9741fc506d1bf5d9c498128ea8bddb5a2f31c88825c4f8","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Titik Potong Sumbu","unit_type":"subsection"},{"canonical_native_record_sha256":"1198161ea4d8f3a50038cb4aeb72319fd3162d49c8c1539e05e5607356323576","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.subsection-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bentuk Parametrik","unit_type":"subsection"},{"canonical_native_record_sha256":"14f9603ec59653b54f3ef9db3d94fb71ba813f7e6a9aee2f84965eb18cce8a57","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.subsection-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Garis Horizontal dan Vertikal","unit_type":"subsection"},{"canonical_native_record_sha256":"b46e49100f346339346731e1a910b6f0d4ef5fe973dc43fb3a4b5be1ba500c32","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.subsection-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bentuk-Bentuk Persamaan Garis","unit_type":"subsection"},{"canonical_native_record_sha256":"5c08b239f956e6d9fe85b17d59df3a69b6a3d04f9bfc805a221c76b8ee2b3eca","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.subsection-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menyelesaikan Sistem Persamaan","unit_type":"subsection"},{"canonical_native_record_sha256":"c7d7800b57bbe7367af6dd558bf2000a15f2017ab26a44db00ec2e68d838d81f","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.subsection-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penawaran, Permintaan, dan Keseimbangan","unit_type":"subsection"},{"canonical_native_record_sha256":"10cc0eec741497ab4de87a462184e2024f29c6ed9dc4027c9a39d4994a94212f","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.equations-lines.text.subsection-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.appendix.equations-lines.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Titik Impas","unit_type":"subsection"},{"canonical_native_record_sha256":"531e78f4d36818a06300aefdb430644b9115b53a0ac83bdd700db5f91d41f5c6","concept_ids":["concept.linear-system","concept.row-operation","concept.gaussian-elimination","concept.reduced-row-echelon-form"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.linear-systems","locale":"mul","order":2,"parent_id":"unit.r017.book1.appendices","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":"Systems of Linear Equations","title_target":"Sistem Persamaan Linear","unit_type":"appendix"},{"canonical_native_record_sha256":"9b2a27df997639bc46b0970449e812aca11a8ce211058b18fbd3b086307cb614","concept_ids":["concept.linear-system","concept.row-operation"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.linear-systems.algebraic","locale":"mul","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"8ff56b9cc26baae22a71bfdffa74e7a6c5e9548de8a7bb32500bf30eb2a2267e","concept_ids":["concept.linear-system","concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.algebraic.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.algebraic.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sistem Persamaan Linear","unit_type":"definition"},{"canonical_native_record_sha256":"15c391018f4cb81e6b93724ea6825da7593c8ad0b36a506341b121dc827f56af","concept_ids":["concept.linear-system","concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.algebraic.definition-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.algebraic.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sistem Persamaan Homogen","unit_type":"definition"},{"canonical_native_record_sha256":"261c2ca95d9ca5752763cee9cb08203f99d5f3560330f21775b1bb3e54298a1f","concept_ids":["concept.linear-system","concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.algebraic.definition-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.algebraic.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sistem Konsisten dan Tak Konsisten","unit_type":"definition"},{"canonical_native_record_sha256":"236e509a924c935d8f74b0bd8b93658c642e8608a4965f991cbacb831b425071","concept_ids":["concept.linear-system","concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.algebraic.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.algebraic.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"3f4c1945b10a3d0cbb163657e2b46a6ae284763325422a39d6f44307493d5862","concept_ids":["concept.linear-system","concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.algebraic.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.algebraic","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sistem Persamaan, Prosedur Aljabar","unit_type":"section"},{"canonical_native_record_sha256":"6fb054196e94716c88402dfb440a5d8c5c7615ed3f6181097f1608c3cf081274","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.linear-systems.controller","locale":"mul","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"c7dae732630389a4a82111fa2d63bff6604c821e30713bf32519764ceeb9b509","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.controller.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.controller","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sistem Persamaan","unit_type":"chapter"},{"canonical_native_record_sha256":"ad2ab4881e31e08d298c050039d5953367f3c2d8a5c0f0a72c24621248f9078b","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.linear-systems.gaussian","locale":"mul","order":5,"parent_id":"unit.r017.book1.appendix.linear-systems","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"c9d8d586124d49baab173dffe6a815cebb9b4b3836b2662b1e345e880fd0544e","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks Diperbesar Suatu Sistem Linear","unit_type":"definition"},{"canonical_native_record_sha256":"f0c799573acf439a3eb7c6b1a8720a830fe9e4e043b198049f4dd85c65339701","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.definition-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Operasi Baris Elementer","unit_type":"definition"},{"canonical_native_record_sha256":"ea35eba581ac834b585f103b628e82578e57dd3dc15136b47d323bcdf9167fba","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.definition-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"\\EF","unit_type":"definition"},{"canonical_native_record_sha256":"b9a709bc860e2e94f20dc597d3565a93610f6fdbea0a90bfe875f097bdc42d22","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.definition-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"\\RREF","unit_type":"definition"},{"canonical_native_record_sha256":"00fef5ff9953447040846ad32621318df5d93b704cbfc7d97614cb5dfae76bcf","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.definition-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Posisi Pivot dan Kolom Pivot","unit_type":"definition"},{"canonical_native_record_sha256":"98e991634e76d92e5a5172a382da500bc29ca6eababc3148e4f1a9ddb67669e4","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.equation-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"5d9cf17a8369b1fb0a911becb9d78d22a018a495a59fcae1e9bf6b878e8bb256","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.equation-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"82cb1b0c4b4b6c825add35d5a2c214ac8327989984484e19332b679bfdd93c5d","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.equation-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"3dff210171a11517f9f846520c7c71ad1ecd98f0a2eaddbae46c263b44e1b88c","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tidak Berada dalam \\EF","unit_type":"example"},{"canonical_native_record_sha256":"682d1d7f5653c573e51f939f548a60667ee9ca10699516d99c6e8593a566d192","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks dalam \\EF","unit_type":"example"},{"canonical_native_record_sha256":"f56b2ee15a68160c4a55f2f460e7a7f1cf9dcdb15c078d8f3ca7faa427eb9a30","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks dalam \\RREF","unit_type":"example"},{"canonical_native_record_sha256":"6f9444a4df7db8d68c84165974785f578ece5972813d63075b6d424b10f79513","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.example-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Posisi Pivot","unit_type":"example"},{"canonical_native_record_sha256":"a2dbb4fda40a8610d2b6794f19d7a529267eb79db64d81c127706279a17f3098","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.example-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan \\EF{} dan \\\\ \\RREF{} Suatu Matriks","unit_type":"example"},{"canonical_native_record_sha256":"ce4f904703ac3e6ba1a38afb55c7baae58407673bd777ec02ba25698c3fb3b76","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.example-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menemukan Solusi Suatu Sistem","unit_type":"example"},{"canonical_native_record_sha256":"ecb5f3c94736fc84c83d996386bb5108a39a6b87e6605af8f687f1289819993d","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.example-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Himpunan Solusi Tak Berhingga","unit_type":"example"},{"canonical_native_record_sha256":"97c5d51ac297392253386c98546a86d263ded90b4dbfab34a90209d9e4dd68af","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.example-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Himpunan Solusi dengan Dua Parameter","unit_type":"example"},{"canonical_native_record_sha256":"e7fc513792cb5f5670a4340dc99724b4b9e9f2db2b57e462cb9158e22ce1bfbd","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"f3499c78e229af31001e2f8c1ec4dbe82d1b4c79bf6fa55adce435b361747021","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for algo:rrefalgorithm","unit_type":"solution"},{"canonical_native_record_sha256":"720378f04ecd9a03a5f6875151517c1281f5da5afad5a019396e9058955f295a","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for algo:rrefalgorithm","unit_type":"solution"},{"canonical_native_record_sha256":"18efa49d721b411ef70716ce40eca3178f0c66bd4d827dbbe826048c3d4aaf6c","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.solution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for algo:rrefalgorithm","unit_type":"solution"},{"canonical_native_record_sha256":"b0eec5f82c89591680d81ddd85327586e5e63af7286c70ae7e63101913a45f19","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.solution-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for algo:rrefalgorithm","unit_type":"solution"},{"canonical_native_record_sha256":"cc6e741ab4b08a0d8d2c7e42cb03ba0ffa33813ede1bb43fce89ddf0b14869fc","concept_ids":["concept.gaussian-elimination"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.gaussian.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.gaussian","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Eliminasi Gauss","unit_type":"subsection"},{"canonical_native_record_sha256":"ee785e339d4691f01dedcac710008ba3dca6de1b01ee24c8b71710c7a69d7006","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.linear-systems.geometry","locale":"mul","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"6bda8191b172e0e18fd7dc9fb1d5bf3915580fe1139cfffe757efa9bd5ba6558","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.geometry.captionfigure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.geometry.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tiga plot 2D berdampingan yang memperlihatkan cara dua garis dapat berpotongan: 'Satu Solusi' (berpotongan di suatu...","unit_type":"figure"},{"canonical_native_record_sha256":"e50fa96d7e680f8b38ba247382435f8b078fba1df748b6b14ff3cd4357d6470f","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.geometry.captionfigure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.geometry.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Plot dua dimensi dari sistem x+y=3 dan y-x=5: sebuah garis hijau dan sebuah garis biru yang berpotongan di...","unit_type":"figure"},{"canonical_native_record_sha256":"42b95e1de310730365df8be699826ab00e2868a3c3f59877b8213df6bc66532b","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.geometry.captionfigure-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.geometry.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dua plot dua dimensi berdampingan yang memperlihatkan tiga garis pada bidang: di sebelah kiri, tiga garis...","unit_type":"figure"},{"canonical_native_record_sha256":"78127b8e45abb24fa6e681d30a68de9caec78b488f5e2e3658e7178dfeb4b1c7","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.geometry.captionfigure-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.linear-systems.geometry.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dua bidang yang berpotongan pada sebuah garis.","unit_type":"figure"},{"canonical_native_record_sha256":"d3591c17bbeb155605a56f8ab50b27aed8f63a2d05ef1f275fb04df5f5cfd482","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.geometry.captionfigure-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.linear-systems.geometry.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tiga bidang tanpa titik perpotongan bersama.","unit_type":"figure"},{"canonical_native_record_sha256":"271f2b664060dfc56d71cba3c9c683fdd521ca7f49e05fe8bd9faa9479b45ec4","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.geometry.captionfigure-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.appendix.linear-systems.geometry.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tiga bidang yang berpotongan pada satu titik.","unit_type":"figure"},{"canonical_native_record_sha256":"d29be3a4c07002277ad85ac4187be511f85c4672eb8d71f506e061cdb10bc31e","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.geometry.captionfigure-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.appendix.linear-systems.geometry.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bidang ketiga yang melalui garis perpotongan dua bidang.","unit_type":"figure"},{"canonical_native_record_sha256":"98c3997de8a13c584b237ab3523bbacf44080b9cc25d3d18f2443e662e89521c","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.geometry.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.geometry.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi Grafis","unit_type":"example"},{"canonical_native_record_sha256":"4d3f1bf6f0aa304a9d7a50408ed1e5c73ff3847d84c2d04cb90d0a35fa6e2787","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.geometry.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.geometry.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"6c2e7224f91e479fd0d681555f938b965aaca351bad10698474e05e0803f3af7","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.geometry.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.geometry","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sistem Persamaan, Geometri","unit_type":"section"},{"canonical_native_record_sha256":"5cece4f9d75eeb80d6914e3c3291eff80b713163cea39ee3f149deaff5ed7d02","concept_ids":["concept.linear-system"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.geometry.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.geometry.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"50180f42a5f0dbdfd9b4063315194f91912cfd892c53b51681d69198b0d594f7","concept_ids":["concept.linear-system","concept.matrix-rank"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.linear-systems.rank","locale":"mul","order":7,"parent_id":"unit.r017.book1.appendix.linear-systems","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"0c7e84a08c3c92abbce6d708dd186164b53ecc38b2d0747383e1f9e5aa2a45e3","concept_ids":["concept.linear-system","concept.matrix-rank"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rank.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.rank.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi Trivial","unit_type":"definition"},{"canonical_native_record_sha256":"4d969227b69bb5e73980e2afbcfceff8a4c23044153b070a1750fad15cc5c8a2","concept_ids":["concept.linear-system","concept.matrix-rank"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rank.definition-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.rank.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kombinasi Linear","unit_type":"definition"},{"canonical_native_record_sha256":"5894646b068f454c60854cd0e52e347ce12e1ade010755115133526ad1f38bbc","concept_ids":["concept.linear-system","concept.matrix-rank"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rank.definition-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.rank.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Rank Suatu Matriks","unit_type":"definition"},{"canonical_native_record_sha256":"8849d137195c1bc6f5a343d7856ca7444cbf673391f3d57e7a55a60665f5bd74","concept_ids":["concept.linear-system","concept.matrix-rank"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rank.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.rank.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi Sistem Persamaan Homogen","unit_type":"example"},{"canonical_native_record_sha256":"08ef6cd8d1a88e70aeb2d2f82d9d55b8131e7acd6647e5ef256f49a5ef22de97","concept_ids":["concept.linear-system","concept.matrix-rank"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rank.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.rank.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi Dasar Sistem Homogen","unit_type":"example"},{"canonical_native_record_sha256":"c67c478279d36dcc20f21f228e23ac3b350b6d2857096640cbecfa47c1709a2c","concept_ids":["concept.linear-system","concept.matrix-rank"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rank.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.rank.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Rank Suatu Matriks","unit_type":"example"},{"canonical_native_record_sha256":"f357c662e03050d5edd7687115439eb4ed8b000eb258b39beb4c5868b55b59ea","concept_ids":["concept.linear-system","concept.matrix-rank"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rank.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.rank.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"bf9f25e66082aefedf5a988ba1b5c2bb5374827658c586ee07f9589d9d9cf2ef","concept_ids":["concept.linear-system","concept.matrix-rank"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rank.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.rank.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"3ea17174bf822a04092d11cd48f571e703cdc3977c9d74747fdcc829935c4ed7","concept_ids":["concept.linear-system","concept.matrix-rank"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rank.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.rank.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"b96665d3abaabd2ada5fc0453bf6f44df90de9a274dd9c0b2f73a577885b0c46","concept_ids":["concept.linear-system","concept.matrix-rank"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rank.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.rank","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Rank dan Sistem Homogen","unit_type":"subsection"},{"canonical_native_record_sha256":"edf360b86d3745befe0d514e50117605752bdbd7461da0058fb0ada8f94e7abc","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.linear-systems.row-operations","locale":"mul","order":4,"parent_id":"unit.r017.book1.appendix.linear-systems","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"0df14131a19ef72fc2264a3803596feadba96a4354e212fa32cfc40eb2d7e250","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Operasi Elementer","unit_type":"definition"},{"canonical_native_record_sha256":"fb5255a666d4f1143427abdd747e3b4a4834ef0ac21fef43e5c61371011f5242","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.equation-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"bb55b1aa22dde524a8116c73a31c0c987095a8de696b675bd0f4e0d0654e0658","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.equation-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"646c837b91aabfffc623fdb1c82a032cea9031cfb0d9da0f88aa090b91bf933d","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.equation-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"f330c176be90f2437da0ed6f421b7d046ce49345dd270bcbda59d99388d2f458","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.equation-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"af2f82208926e88dbbabd8cf80a574500ad33368bf80791bcc4ace14e7f02c64","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.equation-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"5ec144659f796acd01c5b6b385ab229f41bc998082bda77d4d7ea9f6f1ed9605","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.equation-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"30200e8c7e56913b19dbb71b9ee0b05733e89d108fb229c1ea872af5e3aa5e9a","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.equation-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"10d47bfe2ce94b9c5fc17b99f7a953c431c3c42801c4b7e144ac0547c71a3a75","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memverifikasi bahwa Pasangan Terurut Merupakan Solusi","unit_type":"example"},{"canonical_native_record_sha256":"ef4dc330e8dff1fd9629be9c5c0837370fd89cd023528d9c666bf25973a96da5","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dampak Operasi Elementer","unit_type":"example"},{"canonical_native_record_sha256":"c8a95608d0214af49036987a31653f60f95399c0890bb272b9468246fee9d00b","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":" Menyelesaikan Sistem Persamaan dengan Operasi Elementer","unit_type":"example"},{"canonical_native_record_sha256":"05032eb38ad801515d2e411523372e4fc38e85f35255e0356a57f6aa56425cc2","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"2c8330c01514455144baab65c6aed4eaa71f40db53b9ef61a4fdb1156b879f69","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"86953ef6c7b86afb841d2fd758bcae8231345e82923d19e18035aaa5b8fc842d","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for thm:elementaryoperationsandsolns","unit_type":"solution"},{"canonical_native_record_sha256":"a39991418353a130950316a0c053a7a2e2f5027df905bb27259efa73fe64d07a","concept_ids":["concept.row-operation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.row-operations.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.row-operations","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Operasi Elementer","unit_type":"subsection"},{"canonical_native_record_sha256":"2e04fa80b2f6ed9532fd79ac57130dff6d080666c302476a5366ce9c6b10cfda","concept_ids":["concept.reduced-row-echelon-form"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.linear-systems.rref","locale":"mul","order":6,"parent_id":"unit.r017.book1.appendix.linear-systems","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"4ba233f657ba69c94aa5c794ded1a2609612a0ee020d9bc9506cdbb47f53e16f","concept_ids":["concept.reduced-row-echelon-form"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rref.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.rref.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Variabel Dasar dan Variabel Bebas","unit_type":"example"},{"canonical_native_record_sha256":"ee6cb31d430e99847af7504c5cca0a5ef37057ae36570cc1b0e3998754145f25","concept_ids":["concept.reduced-row-echelon-form"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rref.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.rref.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for exa:twoparametersetofsoln","unit_type":"solution"},{"canonical_native_record_sha256":"c5e25bda393c25f7c571f2e8b509f3449ba13744573bbeee415c802b279d9838","concept_ids":["concept.reduced-row-echelon-form"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.linear-systems.rref.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.linear-systems.rref","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keunikan \\RREF","unit_type":"subsection"},{"canonical_native_record_sha256":"0ad11eab75787d732934f5822bc7dea996aa8bcf705123508648edc2a68e9c7e","concept_ids":["concept.matrix-arithmetic","concept.matrix-inverse"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.matrices","locale":"mul","order":3,"parent_id":"unit.r017.book1.appendices","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":"Matrices","title_target":"Matriks","unit_type":"appendix"},{"canonical_native_record_sha256":"6bfe928a12b751b8897d3a1dbbf793e549fa4ccba7466f04d492147571b558ef","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.matrices.addition","locale":"mul","order":3,"parent_id":"unit.r017.book1.appendix.matrices","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"3fe8279993b19ad36a4edbafcc4321c63c04476339b3ac2dab49d2eb881b9eb1","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.addition.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.addition.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penjumlahan Matriks","unit_type":"definition"},{"canonical_native_record_sha256":"1599f8c818ddd912569a0625b28f7c9241a74543c7432838eb6fd0be99284564","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.addition.equation-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.addition.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"2fcfa6a6f8e8dae13c7162beb9696da95bee4e6f622062af9ae2f48031f65ab8","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.addition.equation-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.addition.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"79ad11a1fa4b37835bc4ef961b970ff832fd007635689d4984b3769c08baa8b7","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.addition.equation-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.matrices.addition.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"f0cbbfd6af2d53918e9ccba49c6b305d45908e2f5f95c4e816426994022b1f24","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.addition.equation-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.matrices.addition.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"bb878513bd5607cde50f35fb2c24bf81e6ee060438decac35a47f92bc460816e","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.addition.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.addition.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penjumlahan Matriks Berukuran Sama","unit_type":"example"},{"canonical_native_record_sha256":"b32661227ba108f98be7404892435f4c7d74f7319fda2acc733af8f99cbbbc18","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.addition.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.addition.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:additionofmatrices","unit_type":"solution"},{"canonical_native_record_sha256":"7171e7c5c4c36fabbe9f36871b186c3966dd2eb1e3965c4a256b036f926b04d1","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.addition.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.addition","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penjumlahan Matriks","unit_type":"subsection"},{"canonical_native_record_sha256":"6c51e714772f262358ebf1dd6bbec272ec7b4179caf5de542e90542670987f84","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.matrices.arithmetic","locale":"mul","order":2,"parent_id":"unit.r017.book1.appendix.matrices","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"9b476814622f9c2beba9bce26de79d10ddf75200d46602cf0158228a254249d0","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.arithmetic.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.arithmetic.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks Persegi","unit_type":"definition"},{"canonical_native_record_sha256":"d5d6222c96409431b000570a070481aa7bc40f0f79db39013efb7f397a1c66c6","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.arithmetic.definition-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.arithmetic.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks Nol","unit_type":"definition"},{"canonical_native_record_sha256":"caa0cbfb53ce857c25c93f0ba231e024cc8c316f6529f59f7cbda5be5696cc1b","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.arithmetic.definition-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.matrices.arithmetic.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kesamaan Matriks","unit_type":"definition"},{"canonical_native_record_sha256":"f98a83d1f6eb24abac29b16ceb058e50fb5fa1b1a097faca27e5b5d413aed45a","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.arithmetic.equation-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.arithmetic.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"915b290c6501f9bcdbd798d665f1f54396f3b7847389bdb7eaaef84498b2ab57","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.arithmetic.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.arithmetic.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks Nol","unit_type":"example"},{"canonical_native_record_sha256":"999c7384ec3d9b56875bac203b3aa8e8bf462f7c5ad5163e972a838a2f758e72","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.arithmetic.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.arithmetic.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"fda627b25621fb096b8830dfbbc1b1db57c5f19fae63f9e4a14766c68beb6bdc","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.arithmetic.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.arithmetic","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Aritmetika Matriks","unit_type":"section"},{"canonical_native_record_sha256":"1f36f2165cbfc6dc9b136eeb15664f4fc984ff33dc19ca55653af11999e8eb69","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.matrices.controller","locale":"mul","order":1,"parent_id":"unit.r017.book1.appendix.matrices","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"a858da8b9d3f2de40db64d688a86e0756b55c20a0bdf5e93a44b7af067c65e84","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.controller.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.controller","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks","unit_type":"chapter"},{"canonical_native_record_sha256":"22979157a5d9fa98698c7066a26bf617283731a6b5df31516f6529843e5b1ce9","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.matrices.finding-inverse","locale":"mul","order":10,"parent_id":"unit.r017.book1.appendix.matrices","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"07362614f648b0a8ab637166f24468046cc58a5fa1665b065e67eb8117f8aae0","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.finding-inverse.equation-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.finding-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"4cb0b859c00ab3728f0eeb06207cad7db604522cc0fcf05c408922cd6d8f8aab","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.finding-inverse.equation-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.finding-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"215dfd70042f873bd666a48a8fcc205cd8e926d11a63a868ec33db3ac8bc46d0","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.finding-inverse.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.finding-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mencari Invers","unit_type":"example"},{"canonical_native_record_sha256":"9c2d23e317df1cd9cc4b7d51b682582a6aa9a7e679cba88bbcf72c27aa62b6aa","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.finding-inverse.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.finding-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks yang Tidak Memiliki Invers","unit_type":"example"},{"canonical_native_record_sha256":"2eb87963f2c16636cfd9282f89586d08c8a5dc76e7c98ee37b2abbc30b537cd0","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.finding-inverse.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.matrices.finding-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggunakan Invers untuk Menyelesaikan Sistem Persamaan","unit_type":"example"},{"canonical_native_record_sha256":"b9f5bb434988f52541d755dbd364cad3e6d5cbcdc3999d0a1c1057370d6b669e","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.finding-inverse.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.finding-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"33def0eb5c8031ad6d91bec87752aa472d5c5f0a099c2d63dab017d9a02e73b0","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.finding-inverse.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.finding-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"a78d349728838f00e237e3c962d3d841174ed5571b1a55a5c850e4d4f68513f4","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.finding-inverse.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.matrices.finding-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for inversesystem1","unit_type":"solution"},{"canonical_native_record_sha256":"61edaa1269714a5f8e8ad371436bee3f80f6a7d5e829925ad6b1ebaf89b6935a","concept_ids":["concept.gaussian-elimination","concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.finding-inverse.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.finding-inverse","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mencari Invers Suatu Matriks","unit_type":"subsection"},{"canonical_native_record_sha256":"490237ab12fc9ad34ccd84711444a95f33a3ac00a16214a8ed39327fce2e75e0","concept_ids":["concept.matrix-inverse"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.matrices.identity-inverse","locale":"mul","order":9,"parent_id":"unit.r017.book1.appendix.matrices","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"07a5758ea045673f83520d7b7f28ad0b04e252b3169c40607450648f71f88b32","concept_ids":["concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.identity-inverse.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.identity-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Invers Suatu Matriks","unit_type":"definition"},{"canonical_native_record_sha256":"b9cff3ea54f921cdf453af56d450beca5e953918be5490db2f22c7f3131f2f4f","concept_ids":["concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.identity-inverse.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.identity-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memeriksa Invers Suatu Matriks","unit_type":"example"},{"canonical_native_record_sha256":"967273ccb328c27fb9b0f3eebb36d920ca29cd4e35509cded6528128cbc636e7","concept_ids":["concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.identity-inverse.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.identity-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks Taknol yang Tidak Memiliki Invers","unit_type":"example"},{"canonical_native_record_sha256":"6c6799b5ecc442333077d529e591e26854140f34ccdb5603472a9c6234b1eceb","concept_ids":["concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.identity-inverse.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.identity-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"fe57937215a41ae3239aa584b4bbb9256cb7819ff8235aff32762a2f23336382","concept_ids":["concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.identity-inverse.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.identity-inverse.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"9ee1e22cc40a88534ff1536bfa476f95151c28995ca2acf3f45b135c22d90f9d","concept_ids":["concept.matrix-inverse"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.identity-inverse.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.identity-inverse","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Identitas dan Invers","unit_type":"subsection"},{"canonical_native_record_sha256":"82c76982c5773e8ec0ccb3452de024745579928973c7e4add8807cf33253e75a","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.matrices.multiplication","locale":"mul","order":5,"parent_id":"unit.r017.book1.appendix.matrices","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"8f8cda3c69b36e121c886bbf3196fbcf93ff06f1b9d9616374fd75e1479dc9e0","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Vektor Baris dan Vektor Kolom","unit_type":"definition"},{"canonical_native_record_sha256":"9dd27935a374fc3f3afddb2fcf362105723e76e08bee0c3abf007aeb2e11b7ba","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.definition-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bentuk Vektor Sistem Persamaan Linear","unit_type":"definition"},{"canonical_native_record_sha256":"01318d54664efcd05795028445be0e3fc5ace6d51102b23b4ddc293bb5c72b5e","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.definition-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian Matriks dengan Vektor","unit_type":"definition"},{"canonical_native_record_sha256":"8fd0ef13e95a44d5b06e4e4fa55b1bc09c1c821c4a35939222db8fd8b66f037a","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.definition-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bentuk Matriks Sistem Persamaan Linear","unit_type":"definition"},{"canonical_native_record_sha256":"bffbb8e17756d728210b13d1df8b9c6daada49b54dae541f2cdf8bdcd9cf0b43","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.definition-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian Dua Matriks","unit_type":"definition"},{"canonical_native_record_sha256":"74c84d0baab1dced5ce99a2c767876b155214c209202b690d44b234a82566107","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian Matriks dengan Vektor","unit_type":"example"},{"canonical_native_record_sha256":"175b81046a3812c69241873643ee89781224dd685a5c9926688e333c836021e3","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengalikan Dua Matriks","unit_type":"example"},{"canonical_native_record_sha256":"d51450972081f078608e71168e8c9dc4c84e99932f128eeae55845f199c95651","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian Vektor dengan Vektor","unit_type":"example"},{"canonical_native_record_sha256":"f705012d756a430c1db55bb5e9b4d7a72160d155176f8a9b6ea9424f3ab607a1","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.example-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian yang Tidak Terdefinisi","unit_type":"example"},{"canonical_native_record_sha256":"589a30eb54233e54abb82981e56fb28c6868ede9e1a9203019acca4c9ee1cfd9","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.example-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian dengan Matriks Nol","unit_type":"example"},{"canonical_native_record_sha256":"84348f926f9c029d175833fb9b485bed06ba6fbe6d0d8ba219b390fd3730b79f","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:multiplicationvectormatrix","unit_type":"solution"},{"canonical_native_record_sha256":"7b85f3d96b9c6be50b79fb98ef8cea41bfdf80426b0b4734dc793cf78433197f","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:multiplicationoftwomatrices","unit_type":"solution"},{"canonical_native_record_sha256":"f113bdbde51b1d07899d139beab67d5f29b23cea17a7225d3e46251d9dd8098f","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:multiplicationoftwomatrices","unit_type":"solution"},{"canonical_native_record_sha256":"84325b443b61ee71dc6316b1562328108fc0d3deb4b38f1ed6e282951012dae9","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.solution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"2586f5fa5e06e68253c02c92406a7561c3e68ffc857cd276aaaaa17cb9ae8c02","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.solution-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"1e75c6c8933827a4aa3ea99b663da1bba3bdfb0c222667d8b1bbfa8c1f59b100","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.multiplication.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.multiplication","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian Matriks","unit_type":"subsection"},{"canonical_native_record_sha256":"f15b3f09f316c6fca88b0c14dccafb3b165883b8dbc324234491c677a8644c75","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.matrices.product-entry","locale":"mul","order":6,"parent_id":"unit.r017.book1.appendix.matrices","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"4717465678fa6b6ae9c81dc0278390a8f397c5bf579126ba443d630033f7513c","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.product-entry.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.product-entry.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Entri $(i,j)$ dari Suatu Hasil Kali","unit_type":"definition"},{"canonical_native_record_sha256":"74c6187051e631759abdb2cb7f89d5d56e0a8c11c470811a756bbd2e6c44da4f","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.product-entry.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.product-entry.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Entri-Entri Suatu Hasil Kali","unit_type":"example"},{"canonical_native_record_sha256":"7e96a6fcc36d4a45eec713b1036609bc8cc0b38089bb4bdfd3de9889a35ac04a","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.product-entry.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.product-entry.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Entri-Entri Suatu Hasil Kali","unit_type":"example"},{"canonical_native_record_sha256":"d77e5fa5e357db57ff72874565183e914e84b79b0d4f22d3ebc3f7aaf5dd48e0","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.product-entry.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.product-entry.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:ijentryofproduct","unit_type":"solution"},{"canonical_native_record_sha256":"7d6e50c49ed9d023a4dca06a5aab3e0bde7de554ea01efe90e4698a056e64fe2","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.product-entry.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.product-entry.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:ijentryofproduct","unit_type":"solution"},{"canonical_native_record_sha256":"13662d65b0b8a7203b844d8a64b2b44ba0e49be74b92b460dd8ce241baecdd4c","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.product-entry.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.product-entry","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Entri \\texorpdfstring{$(i,j)$}{(i,j)} dari Suatu Hasil Kali","unit_type":"subsection"},{"canonical_native_record_sha256":"abd213e4584540a9b597baedc04bba0cb5dae82e884fd254bbd0dffe1875733c","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.matrices.properties","locale":"mul","order":7,"parent_id":"unit.r017.book1.appendix.matrices","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"1ae07528b767c95b9785b3d580ddc335ab99e538135803e8b14150097a486d72","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.properties.equation-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.properties.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"629f20acb96124f96a173aece81d478e587953f571f2620888cbd0b856c0fed5","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.properties.equation-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.properties.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"be0e5eca9ff7973def5c377474985927f4b2d4ad08c0850b37a45d0e82f3a43e","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.properties.equation-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.matrices.properties.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"ab6e5f767d2d0f42fada4d19066f92c6b8f615c37aa391e44379c0bf189c9cdf","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.properties.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.properties.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian Matriks Tidak Komutatif","unit_type":"example"},{"canonical_native_record_sha256":"99f9165bc8c135aec2ad17868168dd5ca6f66c44e2a0eca269a289c800a27f4a","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.properties.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.properties.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"6bc9c2ad8a1286ddc444a80abcde220286822181073dde60e10ff00828e21fa5","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.properties.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.properties","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sifat-Sifat Perkalian Matriks","unit_type":"subsection"},{"canonical_native_record_sha256":"a78d89246ba58504eb061e4047ace22e483f887bda1660747a12dbd45082699c","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.matrices.scalar","locale":"mul","order":4,"parent_id":"unit.r017.book1.appendix.matrices","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"c6a6c310e46989e3ea1a40ff3d721dc1fb2fcd5ff1313c0abbb3d3b590dbdf52","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.scalar.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.scalar.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian Skalar pada Matriks","unit_type":"definition"},{"canonical_native_record_sha256":"efe929aa0575073217f9260aceb25d409c5dc2ab7a25e45a13fe19a419107e7e","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.scalar.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.scalar.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pengaruh Perkalian dengan Skalar","unit_type":"example"},{"canonical_native_record_sha256":"b258ad564088ea0d2a6eed0194563fcf5ab73a1b8d606669f33c9c840536c0ab","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.scalar.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.scalar.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:scalarmultofmatrices","unit_type":"solution"},{"canonical_native_record_sha256":"de08f506e76d8ded8a01343eb25db6917aed134be55179901eaefee84880d249","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.scalar.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.scalar","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian Skalar pada Matriks","unit_type":"subsection"},{"canonical_native_record_sha256":"336c0b7910a1cbe54dd6defdc849dc3499041d403bdb6818ba3dc9c0de0a8823","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.matrices.transpose","locale":"mul","order":8,"parent_id":"unit.r017.book1.appendix.matrices","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"c9984ca8bbb019e7572da239bd97e01aed52659f8b9517e8723714f2e9cfb3ad","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.transpose.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.transpose.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Transpos Suatu Matriks","unit_type":"definition"},{"canonical_native_record_sha256":"9c28d6f8cb0c5503eeb41dfa6f8a5d722378740a616d041be64d2d119af4743f","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.transpose.definition-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.transpose.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks Simetris dan Simetris-Miring","unit_type":"definition"},{"canonical_native_record_sha256":"fdc18934e642b18989766445ce94d8e0084df8b930f6fd8f60cf298d9e5b36d8","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.transpose.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.transpose.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Transpos Suatu Matriks","unit_type":"example"},{"canonical_native_record_sha256":"d0dd4643fc6b9c7daab0d41b6bf1c6c8992d3efe0aeef8e58b9d69489544faf2","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.transpose.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.transpose.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks Simetris","unit_type":"example"},{"canonical_native_record_sha256":"f0e30f3b42b0657c1bd45ae6d384d71b6c6c72d92ec7ab51bc2e06bed723f22a","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.transpose.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.matrices.transpose.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matriks Simetris-Miring","unit_type":"example"},{"canonical_native_record_sha256":"d7e4c5f675a710bc98e4a9332e5befdaf3299f576dbea55b6ec6a859ef811984","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.transpose.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.transpose.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:matrixtranspose","unit_type":"solution"},{"canonical_native_record_sha256":"dc345275249c0d48a80b37412f09bda37c9376363c9e40dd2d5eca14c5a534b3","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.transpose.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.matrices.transpose.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:symmetricandskewsymmetric","unit_type":"solution"},{"canonical_native_record_sha256":"e5888b2bc0b1c942a262ea9f11d3ed710fe5e1bf8e4860924c4ba1087140e2ba","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.transpose.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.matrices.transpose.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:symmetricandskewsymmetric","unit_type":"solution"},{"canonical_native_record_sha256":"a2b7a554a629df0a06ea64b3549ab6bc748787bb88046f2ed3e9f26245a8caf1","concept_ids":["concept.matrix-arithmetic"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.matrices.transpose.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.matrices.transpose","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Transpos","unit_type":"subsection"},{"canonical_native_record_sha256":"9689c61a0c7472c287c3ff897f9bae02e4b7b2c0fded29166f59388cab74a8bf","concept_ids":["concept.vector-operations","concept.vector-norm","concept.dot-product"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors","locale":"mul","order":4,"parent_id":"unit.r017.book1.appendices","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":"Vectors in Rn","title_target":"Vektor di Rn","unit_type":"appendix"},{"canonical_native_record_sha256":"cca3bb75c0baace74db4c15ac87fc5e1874e1f17e902c93a2816028f007ea779","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors.addition","locale":"mul","order":4,"parent_id":"unit.r017.book1.appendix.vectors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"96d57bc36d6c5a7a7b77fe85cdf6b50c77dc313df84ce3864238ccdd38632674","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors.addition-meaning","locale":"mul","order":6,"parent_id":"unit.r017.book1.appendix.vectors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"eb0c87f71be300b1c6893d73167fd3631fa9fad860e25ee9f2946906660b47f4","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition-meaning.captionfigure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.addition-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram vektor dua dimensi yang mengilustrasikan aturan ujung-ke-pangkal untuk penjumlahan vektor: panah u di sepanjang...","unit_type":"figure"},{"canonical_native_record_sha256":"656823f62bc7208751253b14d6027349d578c17d54a18f10d7b1ccf111e3f887","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition-meaning.captionfigure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.addition-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penjumlahan vektor dalam tiga dimensi: u + v sebagai diagonal paralelipiped.","unit_type":"figure"},{"canonical_native_record_sha256":"30dfb0ac3807b2170bd788461926168cd1b162273972111b25e4bba46ff3a2b1","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition-meaning.captionfigure-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.vectors.addition-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sketsa dua dimensi vektor u (biru, ke atas dan ke kanan) serta v (merah, ke bawah dan ke kanan) yang digambar sebagai...","unit_type":"figure"},{"canonical_native_record_sha256":"cafcbdaccd3272e3985447c58b7a79b3337bc04272706bc0da0ff8460bfa214f","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition-meaning.captionfigure-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.vectors.addition-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram vektor dua dimensi u+v yang digambar dengan aturan ujung-ke-pangkal: u berwarna biru dari titik asal ke kanan atas...","unit_type":"figure"},{"canonical_native_record_sha256":"520f05f6cc34428c4c58e8caafbd94f42ef904f0d2b775da98f7f6f17ece9102","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition-meaning.captionfigure-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.vectors.addition-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram vektor dua dimensi u-v: u berwarna biru dari titik asal, -v berwarna merah yang berawal di ujung u dan...","unit_type":"figure"},{"canonical_native_record_sha256":"6b05865a49eef48076314592944f11eed5b463a9548ecbc98f043a3d2654438b","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition-meaning.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.addition-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Geometri Penjumlahan Vektor","unit_type":"definition"},{"canonical_native_record_sha256":"2a5449ba0f26703e8092f8544b7689080c1f93f13691cf6c7522ae41220ab721","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition-meaning.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.addition-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggambar Penjumlahan Vektor","unit_type":"example"},{"canonical_native_record_sha256":"156b05ad9a29f0654cf6362777f0c63d0b82c6044ae3fe92ee04ea5093c6e5c1","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition-meaning.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.addition-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"8b6d59934394606cfa79e8f89d8b7821914bfd3616c3cd08c3763161a9af2c1e","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition-meaning.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.addition-meaning","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Makna Geometris Penjumlahan Vektor","unit_type":"section"},{"canonical_native_record_sha256":"3085820d58d49a42ae8f4a9cbba39bc7aba10e73bd7d9bd58daee93a907524a3","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition-meaning.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.addition-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"a40787898a4606efadc0f2d06c25a3865327d7072680967a893ed31df9d6afec","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.addition.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penjumlahan Vektor dalam $\\mathbb{R}^n$","unit_type":"definition"},{"canonical_native_record_sha256":"84964256c2117a408367dfdee4eb88ec5cf1e9fce556d6acc9ba02ac437f5f18","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition.equation-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.addition.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"4732ec2b3fbce1ec6bc6a5eb039aa4e37fa73ff74045afcf859ba4e0e9ff69aa","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.addition.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.addition","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penjumlahan Vektor dalam \\texorpdfstring{$\\mathbb{R}^n$}{Rn}","unit_type":"subsection"},{"canonical_native_record_sha256":"a83764d3903179674639f1727ad4808b7c86d4472d803aa0fafe3c41d903bf17","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors.algebra","locale":"mul","order":3,"parent_id":"unit.r017.book1.appendix.vectors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"ee2c18b10af028baa6f538e175958aac9ce9040d9f840b9f64a2ee6fcc84185a","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.algebra.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.algebra.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"2de3cc522b0e8f1a11ee93c9329f772e90209cb078d4806e14982baca240c233","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.algebra.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.algebra","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Aljabar dalam \\texorpdfstring{$\\mathbb{R}^{n}$}{Rn}","unit_type":"section"},{"canonical_native_record_sha256":"d707cfcc246731865c23ca311640ba064591c49bf176b4bfd2511e1d317c65ab","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors.controller","locale":"mul","order":1,"parent_id":"unit.r017.book1.appendix.vectors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"ddeb99987ef8ea9c53d6fe2ce70293dc41479c679e3fec491af60b13e69cc9b1","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.controller.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.controller","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"\\texorpdfstring{$\\mathbb{R}^{n}$}{Rn}","unit_type":"chapter"},{"canonical_native_record_sha256":"637166a1c3dcc2d7399bbd7177616c96fdb3bbf3d870ea5b02f557b2e58a1c9d","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors.dot","locale":"mul","order":10,"parent_id":"unit.r017.book1.appendix.vectors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"fb023ff3ac42d31751d412733883b9daef0e8c6367e0d521efc809d39ae8c690","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors.dot-controller","locale":"mul","order":9,"parent_id":"unit.r017.book1.appendix.vectors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"76758b53d3627e77f7b54048995c209786b8a5fb237f100de891073a09fc082b","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-controller.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.dot-controller.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"e2f5189c309da69c804dc61380533ad1c2b48e613a2c2a8aba43c055138c425e","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-controller.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.dot-controller","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Hasil Kali Titik","unit_type":"section"},{"canonical_native_record_sha256":"1ace2721488bc66822066a0a96b00c7bd1cccc4f4e8b47ea2d2171f239aa36b5","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors.dot-significance","locale":"mul","order":11,"parent_id":"unit.r017.book1.appendix.vectors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"c45d4f8adb801c92c0c31f9add9437344c71bc28c6779732bbfd9f2f53c78da9","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-significance.captionfigure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.dot-significance.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sketsa dua dimensi dua vektor yang memancar dari titik asal yang sama: vektor v berwarna biru mengarah ke atas...","unit_type":"figure"},{"canonical_native_record_sha256":"2d932c0f5e32e6e6dfbc9c530064ce8f1787d33465f8c2dac9de8ad171c096e9","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-significance.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.dot-significance.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Sudut antara Dua Vektor","unit_type":"example"},{"canonical_native_record_sha256":"c881d62434b4ab83996eec58f6ace49ff98274a0b425786877563615525f7712","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-significance.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.dot-significance.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Sudut antara Dua Garis","unit_type":"example"},{"canonical_native_record_sha256":"861f9130357064f5499654004034c18b68bd03f809d8ba0a372309fda36668fa","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-significance.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.vectors.dot-significance.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggunakan Uraian Geometris untuk Menentukan Hasil Kali Titik","unit_type":"example"},{"canonical_native_record_sha256":"40edf11a676511b46d86064f206a41999d1fb627be880811e228951856f3f1aa","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-significance.example-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.vectors.dot-significance.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Apakah Dua Vektor Tegak Lurus","unit_type":"example"},{"canonical_native_record_sha256":"b5bbe19b2df56a83721d53012991fb57ec6e0348a4b95c10c2a1f261dc8d79bb","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-significance.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.dot-significance.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for prop:dotproductangle","unit_type":"solution"},{"canonical_native_record_sha256":"b3976187465582a1087d8c8ec663d96990c66b3fddef360b92b388168d120029","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-significance.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.dot-significance.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"5e78e64d76ae629e361a18ed98434f8dd77c50bbda9b195f6ffedbcf82c88350","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-significance.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.vectors.dot-significance.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for prop:dotproductangle","unit_type":"solution"},{"canonical_native_record_sha256":"601e8c75505e76c46e9a003112c3634176437fb90e3577ef31024ae404bbf50a","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-significance.solution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.vectors.dot-significance.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for prop:perpvectors","unit_type":"solution"},{"canonical_native_record_sha256":"e6f0b2e113e43b450f1da329ab0f7d4ccdd86b45866ec895c800386723f7636b","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot-significance.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.dot-significance","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Makna Geometris Hasil Kali Titik","unit_type":"subsection"},{"canonical_native_record_sha256":"c594bb3bf3ae5e8a45b7136d25e44fe40f88a0eff8d8e463d2915523d0a73447","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.dot.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Hasil Kali Titik","unit_type":"definition"},{"canonical_native_record_sha256":"7741ba9a45d699fc23c9a5e5a88a71f10ebdc633a73c0fea1c46c2f6873e8503","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot.equation-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.dot.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"8cf3e6f2fe01108bc880d61bc6a89236b2c3195a2f56115d534d160f35e28995","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot.equation-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.dot.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"3a34f6af4e2a2d5e9c09df234a5c0a3983e7f8a5361f275f62669d7748ab672e","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot.equation-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.vectors.dot.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"8ce2ca2abec4d0fb22bab39735c543f70bf5a2435bf212aa972a5d92cc588d89","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot.equation-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.vectors.dot.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"c748c9f046ef5691ce72d24f3eb9aba8e9fc913430906e7b19d257407babd14d","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot.equation-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.vectors.dot.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"52795b0c8ce9f0dc709ba91e09ae94a74173d1e2e4dfec17add3bf2f0ee7e67c","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.dot.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menghitung Hasil Kali Titik","unit_type":"example"},{"canonical_native_record_sha256":"8fd36615fee371cba166bd9fbaf95dfc6f99391bdfd7e58ad273ce8c4d41a9df","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.dot.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Panjang Vektor","unit_type":"example"},{"canonical_native_record_sha256":"3b5d89d0cce13f9f7dd289b0bed8b7e135efe92c0d0ef52e33f3e970ad770c9f","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.dot.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:dotproductdefn","unit_type":"solution"},{"canonical_native_record_sha256":"74b31968df9e540ad51597f99be0a509a85565f76e172961df88084ed7652e35","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.dot.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for prop:propertiesdotproduct","unit_type":"solution"},{"canonical_native_record_sha256":"dc580242a8ee945713a0449fd6b8ea4b481e66f0848075573aa8dd7283a9691d","concept_ids":["concept.dot-product"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.dot.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.dot","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Hasil Kali Titik","unit_type":"subsection"},{"canonical_native_record_sha256":"b60beba02275dd12d110465a4cd390226cfa4080874baa52a4b80789cbe26ce0","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors.length","locale":"mul","order":7,"parent_id":"unit.r017.book1.appendix.vectors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"362b2270891d9418ee1cfdc190b42c20ebf6303171dd4505c4237dca3345e38f","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.captionfigure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jarak antara dua titik pada bidang.","unit_type":"figure"},{"canonical_native_record_sha256":"3aafb621735f2b752f855df71085f46068d4e592561615858f98620ce92beaff","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.captionfigure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jarak antara dua titik dalam tiga dimensi.","unit_type":"figure"},{"canonical_native_record_sha256":"182f3e0e8d5451d6d2dc153f55f164932fa0468bca9ec23d63b92ea385c3f41a","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jarak antara Titik-Titik","unit_type":"definition"},{"canonical_native_record_sha256":"9b8e164f5c147d00a66b6edee5d2cf654719858e6e350cda32f3742cc951b35a","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.definition-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Panjang Vektor","unit_type":"definition"},{"canonical_native_record_sha256":"8da18edd4db4a8f82f5cc89be0925bfd127d5dfcae0fd4918e9549b091bb9537","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.definition-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Vektor Satuan","unit_type":"definition"},{"canonical_native_record_sha256":"022452a5609d9c119e9e80625de4ab8b640574246e5a6d1b824588a0f133078f","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.equation-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"c7a1533c6d5a2d1f63999f157c07adc2844ab21d08ac2455cc9f5e769186d0cf","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.equation-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"5d1ef0cacda1c3c55e62b1963a00f95391472f7c3ff872d841b52dcaefc2862f","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.equation-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"948c9208e966411d858bffc6a05ef29ed080368ba6292fc126261bbd065ad497","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.equation-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"de27cb94aecaeb1ab6c84bb95a99471512091eba939c33f201e4fa1bf594cc0f","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jarak antara Titik-Titik","unit_type":"example"},{"canonical_native_record_sha256":"c5309d438f04245444450f9aadb0fb493531d3a7ea64c32725c9cb17c581b1bb","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bidang di Antara Dua Titik","unit_type":"example"},{"canonical_native_record_sha256":"7b985cc0b26e3ee8cf1b5bdd7bd50153df99d989e05455b7fa81dd73dcb0060d","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Vektor Satuan","unit_type":"example"},{"canonical_native_record_sha256":"c64df1633a328b46b619f817efe27f6cbe6205c35d7c1448a0345cc0da5e27d4","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"3f1895e8cae0e04a0fd5d2545b4bcb98da422408336d6868aa22ea68bdd3b33f","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.length","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Panjang Vektor","unit_type":"section"},{"canonical_native_record_sha256":"eea0a9a60f85e906212fe1b24f334c2611d5fa4c43ca528f724ee78c7e428286","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:distancebetweenpoints","unit_type":"solution"},{"canonical_native_record_sha256":"df54e107cb7943b4d781dbd4bf01d9e15ddd6840a6beac051682ba9ebe319918","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:distancebetweenpoints","unit_type":"solution"},{"canonical_native_record_sha256":"c8d20f5383e64e8355bfad6ab692f315eb96f180b7cdf51f21eea0de5e4d6184","concept_ids":["concept.vector-norm"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.length.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.vectors.length.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for def:unitvector","unit_type":"solution"},{"canonical_native_record_sha256":"df5bc12b241b8fec0a0f1105e473628afcc5160a4f2af3050b0e56b2325e7e0d","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors.rn","locale":"mul","order":2,"parent_id":"unit.r017.book1.appendix.vectors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"730ff2940f45ef3eefe9de36f931b735b1efa8ec4836e802a7ad5b774604d8ac","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.rn.captionfigure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.rn.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Plot dua dimensi bidang xy yang menunjukkan dua titik P = (2,1) dan Q = (-3,4) yang ditandai dengan warna merah...","unit_type":"figure"},{"canonical_native_record_sha256":"0e583adc32ddfcf6d3de2c6f701b8284df67055e6597d9698b1518d4769b8fb6","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.rn.captionfigure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.rn.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram tiga dimensi vektor posisi 0P: sebuah panah biru tebal dari titik asal sepanjang...","unit_type":"figure"},{"canonical_native_record_sha256":"17972530b7c9b7e7b3f158fad4fe85f3c4fa21b34e3b32d8a0f87dd99d896108","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.rn.captionfigure-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.vectors.rn.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram tiga dimensi dengan dua panah biru sejajar yang sama panjang dan searah: vektor posisi...","unit_type":"figure"},{"canonical_native_record_sha256":"221b22be8ce6bac7728f99952faf361c19a7594f1494fc4e98286fb1ce135c59","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.rn.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.rn.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Vektor Posisi","unit_type":"definition"},{"canonical_native_record_sha256":"21362d90a4c6f52d282d6d36cfe1d9bd8c38e7206dbfa671762acaaac706dbbe","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.rn.definition-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.rn.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Vektor dalam $\\mathbb{R}^n$","unit_type":"definition"},{"canonical_native_record_sha256":"11bfcb86719dc7eb48131c0514eee773e12c519ec52b4a5e5cb0ffadd39bd2e8","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.rn.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.rn.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"c1efb2f194009183952825876e73b4e12922f1326e0a0ce93890a7f7bc29df95","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.rn.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.rn","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Vektor dalam $\\mathbb{R}^n$","unit_type":"section"},{"canonical_native_record_sha256":"4ef0db12538a02b2a5da87bd9ea2cc8b2d36f7178c3f46441c334dbe28d8838d","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors.scalar","locale":"mul","order":5,"parent_id":"unit.r017.book1.appendix.vectors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"e99e07dc73e32b389772d82bd90b85eeb19290837209fa4817cbbaec38e36b20","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.appendix.vectors.scalar-meaning","locale":"mul","order":8,"parent_id":"unit.r017.book1.appendix.vectors","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"eda3b181c767af14c623189b3fa32fad1c8f6bb835972647b9f3dbec2cba41b8","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar-meaning.captionfigure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sketsa dua dimensi vektor u (biru, ke atas dan ke kanan) serta v (merah, ke bawah dan ke kanan) yang digambar sebagai...","unit_type":"figure"},{"canonical_native_record_sha256":"c7d4c3d576c9bd634c1c70c9f11984387452a197846615f147d97c885b777b2d","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar-meaning.captionfigure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram dua dimensi yang menunjukkan kelipatan skalar dua vektor: vektor u berwarna biru dan negatifnya -u...","unit_type":"figure"},{"canonical_native_record_sha256":"016da0cce8a8247045149624870db34910b3108533413e5e36e982b4e8813ffc","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar-meaning.captionfigure-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sketsa dua dimensi vektor u (biru, ke atas dan ke kanan) serta v (merah, ke bawah dan ke kanan) yang digambar sebagai...","unit_type":"figure"},{"canonical_native_record_sha256":"0aa777f492387b3546a2cb3e2d14ed0320414f04cdcf27478c5c76601d44a759","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar-meaning.captionfigure-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram vektor dua dimensi untuk kombinasi linear u + 2v: vektor u berwarna biru dari titik asal, berwarna merah...","unit_type":"figure"},{"canonical_native_record_sha256":"aaf0b596d4acb8ba07c7d16a930d30f234b7c8d678d925d260870f929b005da0","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar-meaning.captionfigure-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram vektor dua dimensi untuk kombinasi linear u - 1/2 v: u berwarna biru dari titik asal, lalu...","unit_type":"figure"},{"canonical_native_record_sha256":"879787052a579d0f0ade98265e97f3838d6b7f4b59545679f86b66c44f3882ab","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar-meaning.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggambar Perkalian Skalar","unit_type":"example"},{"canonical_native_record_sha256":"ac0c02c7339b41ddb17cfdd285f8492fac89fcec52c75b0a7026a622b641ad05","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar-meaning.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggambar Kombinasi Linear Vektor","unit_type":"example"},{"canonical_native_record_sha256":"9146af6cac5f4055df916dcc1579c194378399ed6dc98f90dafa2d98d303af25","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar-meaning.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"68c3929f73a4fe08bf2b65748300e398f8f1a49ddca8f7a50651d92dfe1f0b41","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar-meaning.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Makna Geometris Perkalian Skalar","unit_type":"section"},{"canonical_native_record_sha256":"f891b6917298a2c665dd07215cc6207e672c9c3aa27e02f782cbbd41ad217308","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar-meaning.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"2c9c058d354285d12391115b2a73bb610289643703f723114f661becf48687e9","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar-meaning.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.scalar-meaning.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"3854a471994076de4203c9a64c94497f0269a9d0ca9712b07c87de010dabff7a","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.scalar.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian Skalar Vektor dalam $\\mathbb{R}^n$","unit_type":"definition"},{"canonical_native_record_sha256":"0ced6c6acd9ccf64f0ee36e198088519c88b760116fec970f2fa9b0d7a81e571","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar.definition-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.appendix.vectors.scalar.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kombinasi Linear","unit_type":"definition"},{"canonical_native_record_sha256":"e85a22cbc3c660b2584d5c03ab7a18b9b2033e600ca17db67ed9efca5092b7a5","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.appendix.vectors.scalar.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.appendix.vectors.scalar","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perkalian Skalar Vektor dalam \\texorpdfstring{$\\mathbb{R}^n$}{Rn}","unit_type":"subsection"},{"canonical_native_record_sha256":"56c9c791cfeb6774bda160e0c85f6c1fbc55694fed544779acab2651451604b7","edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.backmatter","locale":"mul","order":20,"parent_id":"unit.r017.book1","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Back matter","title_target":"Materi Akhir","unit_type":"backmatter_collection"},{"canonical_native_record_sha256":"1c3fa3e26bc88ec0b7f5e75eb53d734e83a434cb4e151e783909d59855d73562","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.backmatter.checkpoint-answers","locale":"mul","order":2,"parent_id":"unit.r017.book1.backmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"answer_collection"},{"canonical_native_record_sha256":"a4f3c6e5e27645b6314ef2e9cb495e99f4a0e58dbd58bd5965772b9900dcb302","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jawaban Cek Pemahaman","unit_type":"chapter"},{"canonical_native_record_sha256":"63dbb9a22e50483849484fc4a046e6896711f0676f13c5dd4e2f6e2e74fdadc0","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:lp-assumptions","unit_type":"answer"},{"canonical_native_record_sha256":"cdfb265769f497dd81aa6bd44a0dc77e10f6898f4374aee5e62a9c6d4e14d6e7","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:how-many-optima","unit_type":"answer"},{"canonical_native_record_sha256":"5de08cfcd28cc5d70da8673950734f07b88e3f067a6a33e7c8124a074aee4436","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:missing-index","unit_type":"answer"},{"canonical_native_record_sha256":"83c7097edd867ffb45ff2b7305a67ad44cc8626bba42917826a89d1b2aed3c22","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:bfs-nonzero","unit_type":"answer"},{"canonical_native_record_sha256":"625074ccf5c987535581add7bb79bd04c78ffc25a8aad9f472d50e7ad1e475b5","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:ratio-test","unit_type":"answer"},{"canonical_native_record_sha256":"69cdfc2a4e221111d965e0d09d48fa762dfb53d91c0dd332dff1b001d7916be1","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:artificial-removal","unit_type":"answer"},{"canonical_native_record_sha256":"37f5295c2a5ca7712959351e937572a0e4152fb61c178785f59575bad1a51308","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:shadow-price-b1","unit_type":"answer"},{"canonical_native_record_sha256":"642250b15dc913a64bfe5652d274262f90e19ff058fadfa62bb1d75869f78dee","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:nonbasic-cost","unit_type":"answer"},{"canonical_native_record_sha256":"ed46685b8b0d48040728b60b5b60791daaeb848ab107d0a302f5ca36e3d3b9c6","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:duality-certificate","unit_type":"answer"},{"canonical_native_record_sha256":"86c183b1406df99f251dbc22c3646e9bfa52999a6329fc077fd695d0cc24a139","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:dual-forms","unit_type":"answer"},{"canonical_native_record_sha256":"51e966f0f8f7cce220c34464f31240509d04fb94e46aa50efdd7badad3d66895","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:cs-leftover","unit_type":"answer"},{"canonical_native_record_sha256":"d1d018c5dde6d9b59fab02f47e82d95338cc061e2558600602971819f9dad319","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.checkpoint-answers.checkpointanswer-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.backmatter.checkpoint-answers.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"answer for lc:graph-5cities","unit_type":"answer"},{"canonical_native_record_sha256":"b4a0e5c4be59719d2f5849bdd01abfc6247c218cfbab539d4d77ea815875c1e5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.backmatter.contributors","locale":"mul","order":5,"parent_id":"unit.r017.book1.backmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.foundations","status":"draft","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"5608d911190779265cb7ad0da32e21f3118864c707921407b6187786784d2a8f","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.contributors.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.backmatter.contributors","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.foundations","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tentang Materi Foundations of Applied Mathematics","unit_type":"section"},{"canonical_native_record_sha256":"94baa369e6526d2ada6f1269518d05c6ecbf1fd4a7702920f8f29ebe1fe87358","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.backmatter.further-reading","locale":"mul","order":3,"parent_id":"unit.r017.book1.backmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"resource_list"},{"canonical_native_record_sha256":"fba32b471c64847910e9c730057afb09dbf4bfb462c16c9b355eb50995f742e2","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.further-reading.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.backmatter.further-reading","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bacaan Lanjutan dan Sumber Daya","unit_type":"chapter"},{"canonical_native_record_sha256":"b8a0d201baf8e44712762daa824c234979eeb9e2a77d91eccd2d5e4e4b7e655d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.backmatter.linear-algebra-license","locale":"mul","order":4,"parent_id":"unit.r017.book1.backmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"draft","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"71c84f152f51038c9daa30d830cf3387a4d6488612b43b476db3bb911eb38deb","concept_ids":[],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.linear-algebra-license.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.backmatter.linear-algebra-license","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lyryx-kuttler","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tentang Lampiran Aljabar Linear","unit_type":"section"},{"canonical_native_record_sha256":"4e91f719421c6cbe24d7c8be6b74bda5b2b6e7de30ad85f820cb1fe762f69dae","concept_ids":["concept.open-source-solver"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.backmatter.software-resources","locale":"mul","order":1,"parent_id":"unit.r017.book1.backmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"appendix_text"},{"canonical_native_record_sha256":"1564fca02554dc762edb5466ee4890d691783ebb87c9658fcd70d5de1f0e9735","concept_ids":["concept.open-source-solver"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.software-resources.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.backmatter.software-resources","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sumber Daya Perangkat Lunak Optimisasi","unit_type":"chapter"},{"canonical_native_record_sha256":"1701da8e32ab814db1c8407386de27517b715427010cbf47ab33d583758c73d7","concept_ids":["concept.open-source-solver"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.software-resources.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.backmatter.software-resources.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perangkat Lunak Berdasarkan Jenis Masalah","unit_type":"section"},{"canonical_native_record_sha256":"8152cf7b85028a40c859a46436314b05a8707d579da3e91994ec4f326c136a78","concept_ids":["concept.open-source-solver"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.software-resources.section-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.backmatter.software-resources.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pemecah yang Direkomendasikan untuk Buku Ini","unit_type":"section"},{"canonical_native_record_sha256":"2a560103728727e915aaa317cdd8816b40f4df4ec8444aedcc177641a3fcbc56","concept_ids":["concept.open-source-solver"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.software-resources.section-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.backmatter.software-resources.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bahasa dan Antarmuka Pemodelan","unit_type":"section"},{"canonical_native_record_sha256":"b762860121eb8d66a796c9f4b85082793d5bafe0b201043e0907730c7ad862ea","concept_ids":["concept.open-source-solver"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.software-resources.section-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.backmatter.software-resources.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tutorial dan Sumber Daya Gurobi","unit_type":"section"},{"canonical_native_record_sha256":"67232036d45c5b0ba609b432cc886999a9b3b1fb45f5909de82c5ea123c3a47f","concept_ids":["concept.open-source-solver"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.backmatter.software-resources.table-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.backmatter.software-resources.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"9b63134d65bfc334f7a1a15313d9f971189736748aa0d7611f1549d6e931d86e","edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.bibliography","locale":"id-ID","order":21,"parent_id":"unit.r017.book1","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_target":"Daftar Pustaka","unit_type":"bibliography"},{"canonical_native_record_sha256":"b59666c66d3c3fee846b4bc4ac1fe2458fb5bf5d9d69fc2ce345df30e30bd559","edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01","locale":"mul","order":3,"parent_id":"unit.r017.book1","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Mathematical Programming","title_target":"Pemrograman Matematis","unit_type":"chapter"},{"canonical_native_record_sha256":"7c293cba4c53e6becb2a110901f873d90e787b9da2f6e37cbbe13f899a07807e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"9d468567281e58d98a9830e3f4526d420345badd7e5aa41533beedca6543e417","concept_ids":["concept.computational-complexity","concept.linear-programming","concept.mixed-integer-linear-programming","concept.mixed-integer-nonlinear-programming","concept.nonlinear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.captionfigure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Tree diagram classifying optimization models.","title_target":"Diagram pohon yang mengklasifikasikan model optimisasi.","unit_type":"figure"},{"canonical_native_record_sha256":"08e4638e7417fd298c134be92d3e2fc824c7c5369bed38c91285a4cbeab19548","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Mathematical Programming","title_target":"Pemrograman Matematis","unit_type":"chapter"},{"canonical_native_record_sha256":"66cfe64aaea38ce2922591294988629720227c27d3bff7fb772193d69e00bd1e","concept_ids":["concept.linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"73ec11f56a0214af5d2e9e3fec62ab0784544d5ca669e08a579bf962f17272dd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch01.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"2c945411b2929b253392f28386b4fefacb4216612e883d5e9b9c41389cc672fd","concept_ids":["concept.binary-integer-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch01.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"7ac99b3439ba8cf7ff1ba531e4d2600d197663d90ec070342aef595235bc6911","concept_ids":["concept.integer-linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch01.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"4c0128da8cfa733d784afc32742e280fbadcc9d1411aa0a779504c87fd82c231","concept_ids":["concept.mixed-integer-linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch01.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"b982c91c95bf5ad161cc08ded22b9525ac66363fde4d2566801630ed8f6ddfed","concept_ids":["concept.nonlinear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch01.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"6ea2da323590eaf3ca817ae454c50294e18616c2d0d7f51592551ece8abb23bd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch01.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"296e4524b14994cbe06ff3c1c08d3f71770786d000cf26f6a523ea2f63851312","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch01.text.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"81cb6d7a6234f1ec80385c2f849f72750f2aaa8a1a880922c36a5001e8e1ff98","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch01.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"360536bc56ba114e8ce18b9804d359371fec8db020d22d2c4f410096d709974a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch01.text.subsubsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"4d9b1425208f420dd2cdd3eb0e74cacf431e7cb1e0c56e31bcff5d2f8fc4300f","concept_ids":["concept.mixed-integer-nonlinear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch01.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"fc5b73961a1245b63253e654ed9c4828e4d62b048e923443ef89f76c0c63133c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch01.text.subsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"80fb1c3c1a99973b16288baeb8a7da446d6303bfbe608e2fa23f435128ca667b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.equation-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch01.text.subsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"46ac67833062a8f3492cbc1d54f9b33e1e252e9045deffe8bf7e12918c8113f4","concept_ids":["concept.linear-programming","concept.mixed-integer-linear-programming","concept.mixed-integer-nonlinear-programming","concept.nonlinear-programming","concept.optimization-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.ex-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Classify It: Production Plan","title_target":"Klasifikasikan: Rencana Produksi","unit_type":"exercise"},{"canonical_native_record_sha256":"edf9e89b8fdd67d37d56b5833b09467552afc00953a358c6283fbf7c9b01a434","concept_ids":["concept.linear-programming","concept.mixed-integer-linear-programming","concept.mixed-integer-nonlinear-programming","concept.nonlinear-programming","concept.optimization-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.ex-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Classify It: Choosing Projects","title_target":"Klasifikasikan: Memilih Proyek","unit_type":"exercise"},{"canonical_native_record_sha256":"44edb20d5dc5b5c227c9c42ae1fa1a57092bf2e33bdd920465b9b6e0b4e54b5d","concept_ids":["concept.machine-learning-optimization","concept.nonlinear-programming","concept.optimization-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.ex-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Classify It: Fitting a Line","title_target":"Klasifikasikan: Mencocokkan Garis","unit_type":"exercise"},{"canonical_native_record_sha256":"df17c0138f03618100d9e789599656525bd300996af835d3366ab17fef00b225","concept_ids":["concept.mixed-integer-nonlinear-programming","concept.nonlinear-programming","concept.optimization-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.ex-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Classify It: Warehouses with Congestion","title_target":"Klasifikasikan: Gudang dengan Kemacetan","unit_type":"exercise"},{"canonical_native_record_sha256":"e36e42a171e2c3a82b2c4841230e77bc5b25218bbdfbda70789c46656dceec2f","concept_ids":["concept.constraint","concept.decision-variable"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.ex-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Shirt Store: Variables and One Constraint","title_target":"Toko Kaus: Variabel dan Satu Kendala","unit_type":"exercise"},{"canonical_native_record_sha256":"7307f3882e57005af580507fa914870b436619a3e7d67557df292ff4a07c4fa7","concept_ids":["concept.constraint","concept.decision-variable","concept.objective-function"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.ex-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Spot the Pieces: Food Truck","title_target":"Temukan Unsur-unsurnya: Truk Makanan","unit_type":"exercise"},{"canonical_native_record_sha256":"fdbe49c7d04d43a690424322d397059eddf90c1290c5f4c6d478c62d22c26e52","concept_ids":["concept.constraint","concept.decision-variable","concept.objective-function"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.ex-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Spot the Pieces: Tutoring Center","title_target":"Temukan Unsur-unsurnya: Pusat Bimbingan Belajar","unit_type":"exercise"},{"canonical_native_record_sha256":"6973c843eebd13bfb2be46f83a0c4e095d9974edc6d5a2fd027a795356b18f30","concept_ids":["concept.integer-linear-programming","concept.mixed-integer-linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.ex-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Half a Bus","title_target":"Setengah Bus","unit_type":"exercise"},{"canonical_native_record_sha256":"9d1597d3cda818841c53aa1e95b954ee65de43764b79d148973ddfae3a22cc8d","concept_ids":["concept.mathematical-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.ex-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Why ``Programming''?","title_target":"Mengapa Disebut ``Pemrograman''?","unit_type":"exercise"},{"canonical_native_record_sha256":"bffaac7b8d62a7f29909ef19dd5c6d9f1f29de0e3b5638e69b6fc4b761825936","concept_ids":["concept.operations-research"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.ex-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reading a Success Story","title_target":"Membaca Kisah Keberhasilan","unit_type":"exercise"},{"canonical_native_record_sha256":"17e615eaea6320e26d2d599335a553d4e7b5f1836a45ea4a02344e3a43696871","concept_ids":["concept.constraint","concept.decision-variable","concept.linear-programming","concept.objective-function"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.ex-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Shirt Store: The Full Model","title_target":"Toko Kaus: Model Lengkap","unit_type":"exercise"},{"canonical_native_record_sha256":"b139e209eccae3f0fa187c656458761072038453c0aca2b7fded39b6e0dd72f6","concept_ids":["concept.model-development-cycle"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.figure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"83e8b883dc16c8e1ef6aa93fd97fba7f14c9744be1f7dcffa90ebd5e9891fdf7","concept_ids":["concept.operations-research"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.figure-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch01.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"25654b23a0f68a9a9ff8a16bd8d43903d105127625d0a83c41825307df671fce","concept_ids":["concept.feasible-region","concept.linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.figure-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch01.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"01a4e50044780556e0ad3522f3c46d721a77e2ac7d42d9f04c3c73c86e2acbd0","concept_ids":["concept.feasible-region","concept.integer-linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.figure-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch01.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"70ac67d524ba57006dc080034a16b05a50bc8662d625ec961e98bb203a899ce7","concept_ids":["concept.machine-learning-optimization","concept.nonlinear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.figure-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch01.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"a588ddc4c7ce80e1fcb43459847b37b6f3189bdd1925428c4c5ff489216b24f5","concept_ids":["concept.machine-learning-optimization","concept.nonlinear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.figure-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch01.text.subsubsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"b4acae1698cdafc98f698a061686fca0e1b54b90cc11e95828d5a79c70ea1845","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.general-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear Programming (LP)","title_target":"Pemrograman Linear (LP)","unit_type":"general"},{"canonical_native_record_sha256":"bd253f65dd33a01d08f1bab31a8c6c651dbc3c26ce265815c30058cf8fc7e8f1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.general-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch01.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear Programming (LP) Standard Form","title_target":"Bentuk Standar Pemrograman Linear (LP)","unit_type":"general"},{"canonical_native_record_sha256":"b436c429c030a5795fabbac6461de243c984aa8f5d59bb56f6222fa8f2ee92a8","concept_ids":["concept.binary-integer-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.general-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch01.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Binary Integer programming (BIP)","title_target":"Pemrograman Bilangan Bulat Biner (BIP)","unit_type":"general"},{"canonical_native_record_sha256":"38a6b9207c93f863dc973d558f9b877a8778373a1302e5b783bb6fdc81caf8f3","concept_ids":["concept.integer-linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.general-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch01.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Integer Linear Programming (ILP)","title_target":"Pemrograman Linear Bilangan Bulat (ILP)","unit_type":"general"},{"canonical_native_record_sha256":"fa5f6287144b4e29d0178db1908dd5049488157fef7a0502d95f443cd568c907","concept_ids":["concept.mixed-integer-linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.general-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch01.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Mixed-Integer Linear Programming (MILP)","title_target":"Pemrograman Linear Bilangan Bulat Campuran (MILP)","unit_type":"general"},{"canonical_native_record_sha256":"b99d88d85262d25550e0a515b14738b2801069f2557ac04a8b7ab3a383f486c5","concept_ids":["concept.nonlinear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.general-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch01.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"NLP","title_target":"NLP","unit_type":"general"},{"canonical_native_record_sha256":"7ebc8446c60342a8a93645cc9e7f13b2202ddbf8f380fc92ae8bb66d95102fce","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.general-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch01.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convex Programming","title_target":"Pemrograman Konveks","unit_type":"general"},{"canonical_native_record_sha256":"72a473b52a24558770fe7a1fdaaaa68f6f80ddc898e1c2e4ef023626cacfbad5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.general-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch01.text.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Binary Integer programming (BIP) as a NLP","title_target":"Pemrograman Bilangan Bulat Biner (BIP) sebagai NLP","unit_type":"general"},{"canonical_native_record_sha256":"028950f799e52560141ddc75fc34345e36c87acb6996d8ca5aba7e42237bda06","concept_ids":["concept.mixed-integer-nonlinear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.general-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch01.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"MINLP","title_target":"MINLP","unit_type":"general"},{"canonical_native_record_sha256":"e764a466bd27720c26f5c975626587ae6c922be760d8da294b84adceee2fd7c0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.general-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch01.text.subsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convex MINLP","title_target":"MINLP Konveks","unit_type":"general"},{"canonical_native_record_sha256":"b6d2fe95de4adccf9ae61e997eda50ec633bc15259fa51ec147b6be97e6d51b5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.general-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch01.text.subsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Non-Convex MINLP","title_target":"MINLP Nonkonveks","unit_type":"general"},{"canonical_native_record_sha256":"357545e3ddae8a6ffeccf7322f538071d1d4b4286a36b7ceac8d9185ae43a2a0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.outcome-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"4fc3addeb9a30ccf96a273407f2ad9f96c9fd19379a188b3fea5ec62e42fde52","concept_ids":["concept.constraint","concept.decision-variable","concept.model-development-cycle","concept.objective-function","concept.optimization-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Warm-Up Scenario","title_target":"Skenario Pemanasan","unit_type":"section"},{"canonical_native_record_sha256":"69df9eaa0632c8cfe897a1c0b3a6507ad95cb4daed4d8a1e9f7b3d6413297731","concept_ids":["concept.operations-research"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Why Study Operations Research?","title_target":"Mengapa Mempelajari Riset Operasi?","unit_type":"section"},{"canonical_native_record_sha256":"3fee00daa22aea3bbfc824e7ec7254b96824122f8e768c0e5018d19156216995","concept_ids":["concept.mathematical-programming","concept.optimization-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"What is Mathematical Programming?","title_target":"Apa Itu Pemrograman Matematis?","unit_type":"section"},{"canonical_native_record_sha256":"244d39619503910d65deb2e1e8a678d804e44f35d72724f6de1ffeafcedcf0e3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.section-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Applications","title_target":"Penerapan","unit_type":"section"},{"canonical_native_record_sha256":"bb3a59d6ef5ec43788dd979b55c21fc8d14b5dfa86a90f1eea17fdeebc80a13b","concept_ids":["concept.computational-complexity","concept.linear-programming","concept.mixed-integer-linear-programming","concept.mixed-integer-nonlinear-programming","concept.nonlinear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.section-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Types of Optimization Problems","title_target":"Jenis-Jenis Masalah Optimisasi","unit_type":"section"},{"canonical_native_record_sha256":"3a8d06891646288fcfef91b7ed4ecece557c73d0b3f74109f779d33e761961fb","concept_ids":["concept.feasible-region","concept.linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.section-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear Programming (LP)","title_target":"Pemrograman Linear (LP)","unit_type":"section"},{"canonical_native_record_sha256":"e92094973ef102156ceeae384298e041c86b5e3eb73f517156b8ef5453ab3b6b","concept_ids":["concept.binary-integer-programming","concept.computational-complexity","concept.integer-linear-programming","concept.mixed-integer-linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.section-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Mixed-Integer Linear Programming (MILP)","title_target":"Pemrograman Linear Bilangan Bulat Campuran (MILP)","unit_type":"section"},{"canonical_native_record_sha256":"13e7b617adf0c399ab0a75897b6b5e24b8e83c4fa996190c4eb4254423a93e88","concept_ids":["concept.convex-optimization","concept.machine-learning-optimization","concept.nonconvex-optimization","concept.nonlinear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.section-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Non-Linear Programming (NLP)","title_target":"Pemrograman Nonlinier (NLP)","unit_type":"section"},{"canonical_native_record_sha256":"ee9b7ebf1aa3a958233a49cf24ec9de6ce7c5b01ea46a8105ed532ed31c5fc86","concept_ids":["concept.computational-complexity","concept.mixed-integer-nonlinear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.section-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Mixed-Integer Non-Linear Programming (MINLP)","title_target":"Pemrograman Nonlinier Bilangan Bulat Campuran (MINLP)","unit_type":"section"},{"canonical_native_record_sha256":"6c8dd25897f3877cb1a0eb243dbda3bb2d84538e907646e945f78aeb19b4d35d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.section-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Optimization Under Uncertainty","title_target":"Optimisasi di Bawah Ketidakpastian","unit_type":"section"},{"canonical_native_record_sha256":"e10ade544b4afe0490ae85ed157f71074c820b087adc19b8a322d4d1fac6e651","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.section-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch01.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Exercises","title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"8ef1a79e3be03df19d5045fb3c82368b36bac3b068a94bf5901e5c0f6d7be9cb","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.solution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:classify-projects","title_target":"solution for ex:classify-projects","unit_type":"solution"},{"canonical_native_record_sha256":"1f26eaadfe0f70879b497d6aa8ffe1d648069a856d80011c7726db86265c4cdb","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.solution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch01.text.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:shirt-friday-balance","title_target":"solution for ex:shirt-friday-balance","unit_type":"solution"},{"canonical_native_record_sha256":"efb3281d09d15d47b76655552f7328a274ba86ec5340645c4d39de870b0e20d1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.solution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch01.text.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:programming-term","title_target":"solution for ex:programming-term","unit_type":"solution"},{"canonical_native_record_sha256":"6863751dc38d14279ba175ec032c927633b1596e2a48cc7014d69cf83d798564","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.solution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch01.text.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:shirt-full-lp","title_target":"solution for ex:shirt-full-lp","unit_type":"solution"},{"canonical_native_record_sha256":"caa55e05d3620676cabaa2ba729b49552b3a6207895b4a832fd81b08964dab32","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Model Development Cycle","title_target":"Siklus Pengembangan Model","unit_type":"subsection"},{"canonical_native_record_sha256":"e9a3f08e73af971e32a35ec8b96aeae4170d3d8142ab4b0e15f2b6418edbe0e8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch01.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Further Extensions","title_target":"Pengembangan Lebih Lanjut","unit_type":"subsection"},{"canonical_native_record_sha256":"9e2794bf9b674e25b0f18ade8fe2f1d0b5c855dc67830ef460c9f96c9c309104","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsection-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch01.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convex Programming","title_target":"Pemrograman Konveks","unit_type":"subsection"},{"canonical_native_record_sha256":"abb9964cae200131f4776036cda5ea8a43e57dc94efdb8b6ed5f93fa75d73785","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsection-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch01.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Non-Convex Non-linear Programming","title_target":"Pemrograman Nonlinier Nonkonveks","unit_type":"subsection"},{"canonical_native_record_sha256":"b98113fdafa91a0faa5c51cba61d0efdba9cac6cefed7ce6722a5fa64f108ec1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsection-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch01.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Machine Learning","title_target":"Pembelajaran Mesin","unit_type":"subsection"},{"canonical_native_record_sha256":"1138324bd8e68fcb35a688c6ffcb7b85c0134d264b42350efd20a7bc56b4e4ac","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsection-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch01.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convex MINLP","title_target":"MINLP Konveks","unit_type":"subsection"},{"canonical_native_record_sha256":"72a11300e5f2cc44719ea53e717a0d398110452591dad3e53e56e629967c5893","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsection-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch01.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Non-Convex MINLP","title_target":"MINLP Nonkonveks","unit_type":"subsection"},{"canonical_native_record_sha256":"c85348a257c181789c3fdaec2332583fa929e32af2ac22ec60c943a8edbda33b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsection-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch01.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Complexity and Applications","title_target":"Kompleksitas dan Penerapan","unit_type":"subsection"},{"canonical_native_record_sha256":"84a75d0895af6e018b14b5ea2371ce3a5ef7bb1a0b2152141abd7985a414b512","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsection-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch01.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Stochastic Optimization","title_target":"Optimisasi Stokastik","unit_type":"subsection"},{"canonical_native_record_sha256":"5925369bb6fd63f981007b146963ebfde975a70b4315d936d2bb9f5cc73610ac","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsection-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch01.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Robust Optimization","title_target":"Optimisasi Robust","unit_type":"subsection"},{"canonical_native_record_sha256":"5e833c4548c1496cbd3ad3a4d9e4d735dd2ac9103ec1a760d202f102ce0f6cd6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsection-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch01.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Applications","title_target":"Penerapan","unit_type":"subsection"},{"canonical_native_record_sha256":"63be503445a43618ecae2484f45e0bc566436b96e2fadd77b28f106b194d11a9","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsubsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Loss Function Minimization","title_target":"Peminimuman Fungsi Kerugian","unit_type":"subsubsection"},{"canonical_native_record_sha256":"feed8352a2080175ec18dc20e151c3c8a85d45446e620ae4c1b5bb15514cd4bc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsubsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch01.text.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Clustering Formulation","title_target":"Perumusan Pengelompokan","unit_type":"subsubsection"},{"canonical_native_record_sha256":"653fc01a0d106f7247c35ac7401b1de63a796392e510d9e823e8e91c9a69c3f1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.subsubsection-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch01.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Selected Solutions","title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"efa82142c83aad53b3fc37e0ac2d53608bc66432e43f8015f176012e451e5e5b","concept_ids":["concept.mathematical-programming","concept.optimization-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch01.text.wrapfigure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch01.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"939f456c91339f07d508811dd6fe45d29ec7fa0d33133f9a101150fdb38d0de9","edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02","locale":"mul","order":4,"parent_id":"unit.r017.book1","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Modeling: Linear Programming","title_target":"Pemodelan: Pemrograman Linear","unit_type":"chapter"},{"canonical_native_record_sha256":"164a06ade0eefca51b8ac4854d1d4bdd64d76123f0456ee007ff76b8083ec162","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch02","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"1392da6f111a0349b9189698a8c7fde380e896a12f38250b5727c3731a24feab","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Identify Linear Functions","title_target":"Mengidentifikasi Fungsi Linier","unit_type":"solution"},{"canonical_native_record_sha256":"281217901161a1d2c2340e1a1bfe168bd608d05cab275cfafa1e5274544f1586","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Identify Linear Function","title_target":"Mengidentifikasi Fungsi Linier","unit_type":"solution"},{"canonical_native_record_sha256":"337da10618986bf69e06db6f5f34cf55fdb031efe83cbbf6c4fcc3a89780dbd0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Hoodies and Posters","title_target":"Hoodie dan Poster","unit_type":"solution"},{"canonical_native_record_sha256":"c96917e246fe7bd6640d67f3190962fa7c812483ed1aa47887b4b46a8052ab3b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Smoothie Powders","title_target":"Bubuk Smoothie","unit_type":"solution"},{"canonical_native_record_sha256":"7118c164c3531d3257f3bc6a99d0a69826425bed662bde2a1f062fe26637dacb","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Chemical Manufacturing","title_target":"Pembuatan Bahan Kimia","unit_type":"solution"},{"canonical_native_record_sha256":"1e0e64d0035ec47036d07003f8d11fd7c1ab81ecb050bffdf45d24221c572b6e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"E-Bike Showroom","title_target":"Ruang Pamer Sepeda Listrik","unit_type":"solution"},{"canonical_native_record_sha256":"b60063a896ecbfc9baf933e07fdb9b6d005ed751922eec275287829a0b6938e6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Manufacturing Profit Problem","title_target":"Masalah Laba Manufaktur","unit_type":"solution"},{"canonical_native_record_sha256":"6b5d40dbe91f7eab42280dd7046e8fc907f5439d1ea8089f0b1411294df2a572","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Juice Bottling Plants","title_target":"Pabrik Pembotolan Jus","unit_type":"solution"},{"canonical_native_record_sha256":"e881ad2164b1fcd7f15baa23c4c39bc0c8a1abcb23ba3e4151016607ff181e2f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Quiz Grading Minimization","title_target":"Meminimumkan Waktu Penilaian Kuis","unit_type":"solution"},{"canonical_native_record_sha256":"72944b227575af1d9a8ee106d17f403ed98c85975a8f223fa1fb1177c7d93dda","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Campus Caf\\'e Scheduling","title_target":"Penjadwalan Kaf\\'e Kampus","unit_type":"solution"},{"canonical_native_record_sha256":"7af953884ac8b91c021fee3948b9f050dbc6cb7bcc77acfb619c5fe6ef97c92d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Identify Linear Inequalities","title_target":"Mengidentifikasi Kendala Linier","unit_type":"solution"},{"canonical_native_record_sha256":"a9fa8ebd003985cdef79b015e969d2d6016d477122b3fe4c70ac41f8c39c75d2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Stochastic Objective","title_target":"Biaya Acak dalam Fungsi Tujuan","unit_type":"solution"},{"canonical_native_record_sha256":"3793396edf8f3b4dbefcdf4df36838cae0b5585d49bffe39784dcd9e66045813","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Which Assumption Breaks?","title_target":"Asumsi Mana yang Dilanggar?","unit_type":"solution"},{"canonical_native_record_sha256":"407e6a2c70e6985224dc6d51a4ee63750c61c106d90095fcaa011c9222b1ae3e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.manualsolution-014","locale":"mul","order":14,"parent_id":"unit.r017.book1.ch02.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production with Rented Labor","title_target":"Produksi dengan Tenaga Kerja Sewa","unit_type":"solution"},{"canonical_native_record_sha256":"cbb6c92ef33f1b35a8b1f5cdfcd2abccd368b13cf78f08ca372ea642ce5a759a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.solutions-manual.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Chapter 2: Modeling: Linear Programming","title_target":"Bab 2: Pemodelan: Pemrograman Linear","unit_type":"section"},{"canonical_native_record_sha256":"7b7853ee11f14194168e207e8307227ba8947f5f884aba8108683a3faa526357","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"2a9ad4ebdef91adb447004e795edde751b75cb9640a20a38fd4bb830ece857c1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.captionfigure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Schematic of a two-period production planning network: two gray circles labelled 1 and 2.","title_target":"Skema jaringan perencanaan produksi dua periode: dua lingkaran abu-abu berlabel 1 dan 2.","unit_type":"figure"},{"canonical_native_record_sha256":"558a46d151a100c93f22d581784daccdd073b5f5dd9c58feccfb1c22e63ab5f0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.casestudybox-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Feeding Millions: The World Food Programme's Optimization Engine","title_target":"Memberi Makan Jutaan Orang: Mesin Optimisasi Program Pangan Dunia","unit_type":"casestudybox"},{"canonical_native_record_sha256":"a1f6b0f83e7ef450bcdfb3a0f087dfbf1b09722e86e8ec7663ecb0ec74296403","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Modeling: Linear Programming","title_target":"Pemodelan: Pemrograman Linear","unit_type":"chapter"},{"canonical_native_record_sha256":"b0faf5f3db5ea835747977d7b6bb780a37dc014e6f7ec2dec05a8d03b2e633ab","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.definition-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear Function","title_target":"Fungsi Linier","unit_type":"definition"},{"canonical_native_record_sha256":"ebbc58ffd1143f1d494a930b04e58325146bf294dfb9e78e37ebbf7b2d56caac","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.definition-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Optimization model components","title_target":"Komponen model optimisasi","unit_type":"definition"},{"canonical_native_record_sha256":"c6dcfa7d1d76a5b058d2d362720253cafa3f6762f5851d02da4e6d7de17d9ed0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.equation-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"b739638a00e890a1ac2175472d6a34874cf339a503a893ffeaf978f4a16a2b94","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.equation-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch02.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"f803bb3216dd2635dd1be3749d74200675eb67b64bd5d0b55bb7122785dbf2f7","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.equation-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch02.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"48680d108bb745ea7ed9c761920d8bb3f84918164c7aea2d33f17a8bd442889c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.equation-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch02.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"3e46b2b72529e4965497bc70c468c40e6164b504433fc2c1253649b0d1eabf26","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.equation-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch02.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"dc93694084cb1794d73b730b6661cd947a01e12e6b7808832a942e3ec091e3db","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.equation-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch02.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"d3c0363331c36a7f96a064cf6daf6d66a3982dc69998ca00170e1e1924a97d1f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Identify Linear Functions","title_target":"Mengidentifikasi Fungsi Linier","unit_type":"exercise"},{"canonical_native_record_sha256":"ac497be79ecb2c6a0244ea249eec92f243d641fddeb3bfc5e83466884e859b59","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Identify Linear Function","title_target":"Mengidentifikasi Fungsi Linier","unit_type":"exercise"},{"canonical_native_record_sha256":"7d5b891bd8119827d55ebc9a5ec68c05fdbaf2807a8277a7f0a06f6c7f622463","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Hoodies and Posters","title_target":"Hoodie dan Poster","unit_type":"exercise"},{"canonical_native_record_sha256":"2477f8a290eda5c2cda9a545a0c8743c93ed351337821648a12204aa943c55e1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Smoothie Powders","title_target":"Bubuk Smoothie","unit_type":"exercise"},{"canonical_native_record_sha256":"0f3565220c16b6ce315514a6d704a81bbdbdf9c5df0e52bb21fbb315868dec9f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Chemical Manufacturing","title_target":"Pembuatan Bahan Kimia","unit_type":"exercise"},{"canonical_native_record_sha256":"493665afc7d5a2ca89fd7b5f9c83d34e9cf6b92a70986d8f5e3cf4c982e784cd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"E-Bike Showroom","title_target":"Ruang Pamer Sepeda Listrik","unit_type":"exercise"},{"canonical_native_record_sha256":"ae046b4d4466d12b8a09e44f6bed118ab7e7b78d2caf1455573fa66f5fdd410e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Manufacturing Profit Problem","title_target":"Masalah Laba Manufaktur","unit_type":"exercise"},{"canonical_native_record_sha256":"89c1f5fb5f281fdbfe7b21b4886ff985487e7a945717728424da6a05915f3a0c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Juice Bottling Plants","title_target":"Pabrik Pembotolan Jus","unit_type":"exercise"},{"canonical_native_record_sha256":"9709bf7b028f22d061a1ffb736192100fba581bb3c1023152941ce7dcae0c430","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Quiz Grading Minimization","title_target":"Meminimumkan Waktu Penilaian Kuis","unit_type":"exercise"},{"canonical_native_record_sha256":"4713503fb65a56b06df64c453c36981fd0eab9fd4364be97cb2ddf3da52938bc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Campus Caf\\'e Scheduling","title_target":"Penjadwalan Kaf\\'e Kampus","unit_type":"exercise"},{"canonical_native_record_sha256":"9128eb28f3d68f75d2b3880d2beab022e884c7686807d2d6d0342efa0efe8849","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Identify Linear Inequalities","title_target":"Mengidentifikasi Kendala Linier","unit_type":"exercise"},{"canonical_native_record_sha256":"f7805b2360a62273095c2002fa81d13e514af2daff844b199416f15142ce9c99","concept_ids":["concept.expected-value-objective","concept.stochastic-optimization"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Random Costs in the Objective","title_target":"Biaya Acak dalam Fungsi Tujuan","unit_type":"exercise"},{"canonical_native_record_sha256":"3fca23f56356e99277da43c1adbf16a9dc0a7e23363890d883282594d39aaa6b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Which Assumption Breaks?","title_target":"Asumsi Mana yang Dilanggar?","unit_type":"exercise"},{"canonical_native_record_sha256":"56ea870991392c39e503f0bc0bc82e78498f71dda326b66ad972bc3647dc46ac","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.ex-014","locale":"mul","order":14,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production with Rented Labor","title_target":"Produksi dengan Tenaga Kerja Sewa","unit_type":"exercise"},{"canonical_native_record_sha256":"0e5b335056aeea8f58300801a9bc576614b7184d8cdc47e563edc539bf5f306b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.example-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Example of a Linear Program","title_target":"Contoh Program Linear","unit_type":"example"},{"canonical_native_record_sha256":"2ebd40daec66a75c2a9ffa56dbb5ced694e89c2737e7c1aac24b5d01e97af1f3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Screen Printing Shop","title_target":"Usaha Sablon","unit_type":"example"},{"canonical_native_record_sha256":"e4058f06ba7c6f2030103a43d57f3f5185785b737d58a46399669f84182b5f84","concept_ids":["concept.inventory-balance","concept.linear-programming","concept.production-planning"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production Planning","title_target":"Perencanaan Produksi","unit_type":"example"},{"canonical_native_record_sha256":"c0821ea124f4d6f735906131c9eada1c80cd4606b2371d26165dbf5dd1cccfca","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Bakery Production","title_target":"Produksi Toko Roti","unit_type":"example"},{"canonical_native_record_sha256":"1b8d1243d389ac1fee35da49cd1f8791d6f8b31f7b6f46c5ed8705aa65352050","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch02.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production with welding robot","title_target":"Produksi dengan Robot Las","unit_type":"example"},{"canonical_native_record_sha256":"c12efa81f0179034191176c342fcdc7dec1ed8194c9ab3dc911208de291e7606","concept_ids":["concept.diet-problem","concept.linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch02.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Diet Problem","title_target":"Masalah Diet","unit_type":"example"},{"canonical_native_record_sha256":"2c3c9bd071df7822765f3e5b81ee3ec6b26cab9fccf7f6bfa865954aef6b7fb0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch02.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Next Diet Problem","title_target":"Masalah Diet Berikutnya","unit_type":"example"},{"canonical_native_record_sha256":"6bf86cdd69ac64685ffe62ab872bd851b7549634c380e31608ffe4e80a54a13c","concept_ids":["concept.integer-linear-programming","concept.workforce-scheduling"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch02.text.subsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Work Scheduling Problem","title_target":"Masalah Penjadwalan Kerja","unit_type":"example"},{"canonical_native_record_sha256":"e4f2893d7faa337abed24017cd768f14523a0d3caf6859f8e6d8133d8aaaab8b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch02.text.subsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"LP Burger - extended","title_target":"LP Burger - Versi Diperluas","unit_type":"example"},{"canonical_native_record_sha256":"3690b0b260c3060a80f8391c8d0212c43ee326ca746ad5ef7a923432e442b2b2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch02.text.subsection-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Camping Trip","title_target":"Perjalanan Berkemah","unit_type":"example"},{"canonical_native_record_sha256":"8d1b01dea8c52c5129223276ab5008dce9976d9c9ba6b4055a15cbb0ec888a11","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch02.text.subsection-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Capital Allocation Problem","title_target":"Masalah Alokasi Modal","unit_type":"example"},{"canonical_native_record_sha256":"dcd6563d1c68d9a16d82b8d117cb95a76d3183a3e438b8662d66ec8bfd1b2803","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch02.text.subsection-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solar Panel Shipping","title_target":"Pengiriman Panel Surya","unit_type":"example"},{"canonical_native_record_sha256":"c6033680ae1d079a6585ec84238c14c4a3f17a43a1bc0b6aec74d68869546907","concept_ids":["concept.assignment-model","concept.binary-integer-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.examplewithallcode-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch02.text.subsection-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Hiring for tasks","title_target":"Perekrutan untuk Tugas","unit_type":"example"},{"canonical_native_record_sha256":"902b11a855bdfb9af77d93f520371a0ea5e6f19ca389cde6ffe014e55d9d6675","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.learningcheckpoint-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"6456ecae4ed5bfdef0c40d2ae5245a1931c1b46cbc2f1bd19b38b0448204710b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.outcome-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"e45c3630e428cad39e2b5469c1a8391cfcb956c1b89a050872e30dd7aa1c2b5e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.outcome-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch02.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"1038dc71b305556e323797244345e7bc466f66bc0bb2390190ec24ea7c31fb3f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.outcome-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"675a39b0b82d756ddd4da0d29d5fefd3e495f122851fa1ffecdda131dc22db33","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Introductory LP Example","title_target":"Contoh Pengantar LP","unit_type":"section"},{"canonical_native_record_sha256":"d1aecdcf735baedb2c26fa2415b0311cf739090f67bb081dfb7ae6c5646ef1a2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch02.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Modeling and Assumptions in Linear Programming","title_target":"Pemodelan dan Asumsi dalam Pemrograman Linear","unit_type":"section"},{"canonical_native_record_sha256":"0465ea8383b89574f6ca355a126f556b11ca785075fab9182c8969be3e1def64","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch02.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Examples","title_target":"Contoh-Contoh","unit_type":"section"},{"canonical_native_record_sha256":"03842c35f9b84aede4511505e1e6763ab10f36fab44ed44fd1240907ef570566","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.section-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch02.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Exercises","title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"025730c3cb5451cabe7afa5a62d106dad74c55a46d9fe97d5a0f17cc1c2de78b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"0dcb40c6b881e6f88eda822b1dc1ef7735d0759b367a84fcc7051d7ccad22304","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch02.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"e7d2062aba4d527fb7ef3d77ba6fba49ca7614bf7d41a481d610a19f05d72fc6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch02.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"ca18dcb6c50e9b61a20f9eaaf436d3f5ad7f1f40647e3a18496230424c7bc5cf","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch02.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"ec902c9d9cc5a7fe98f68fffeb58b6354c75f5f9ba5ed6878897e70936cd18bd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch02.text.subsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"96e902cdb25edc0114b4ea54ce97a3c2496fa6ed6f13f293bd0c9b21d8049d79","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch02.text.subsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"b066699f975e66fe898c5c41e05078972193d963f330a59d2096d7fd29161cf2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch02.text.subsection-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"1a6ae3709e07512a0fdf7ea4d2832b38b55e24ab676f734ff666483759d25dbd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch02.text.subsection-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"7622296e08fcc45060269397df4a3f1c9a85ecf290935cd05274acb506898f66","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch02.text.subsection-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"e5e29342c532082a25da10d1a93139df2363aaa35c4d3ef62f143efb3ff29cf9","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch02.text.subsection-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"b7416a605eef26d46c9ca0743ff8d133f351feb567451bfa8b30536c1c927393","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch02.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:ChemicalPlant","title_target":"solution for ex:ChemicalPlant","unit_type":"solution"},{"canonical_native_record_sha256":"9093ba817635648158d864dfce9269a40fdf5315b654ec55e82a67eab3c14eb2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch02.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:linear-inequalities-check","title_target":"solution for ex:linear-inequalities-check","unit_type":"solution"},{"canonical_native_record_sha256":"00fcb1b3d03bcea3e53d12465a115592a9bef02ba874ff432caa6bfb0f176797","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch02.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:two-machine-profit","title_target":"solution for ex:two-machine-profit","unit_type":"solution"},{"canonical_native_record_sha256":"a8bd7b9af281c24345364cd14e51d78db798eafa8cf20692e58a786ad621f15e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-014","locale":"mul","order":14,"parent_id":"unit.r017.book1.ch02.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:factory-days","title_target":"solution for ex:factory-days","unit_type":"solution"},{"canonical_native_record_sha256":"491b31c165655455575b1cd45291fdaef7e6ebcd51123c8bcdfd10f0e8a526f6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-015","locale":"mul","order":15,"parent_id":"unit.r017.book1.ch02.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:HoodiePosters","title_target":"solution for ex:HoodiePosters","unit_type":"solution"},{"canonical_native_record_sha256":"3782bd72626562fbda150cb1df36f6835caa628130755715534bd55c8a00c1e8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.solution-016","locale":"mul","order":16,"parent_id":"unit.r017.book1.ch02.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:rented-labor","title_target":"solution for ex:rented-labor","unit_type":"solution"},{"canonical_native_record_sha256":"40d32ede64eab7e81f06601c4433feb268a9fef2fa94fa326eed6aa661750d66","concept_ids":["concept.linear-programming","concept.lp-modeling-assumptions"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Assumptions","title_target":"Asumsi","unit_type":"subsection"},{"canonical_native_record_sha256":"84c6c8828feb25574c2e8d0dd6bc99f63ef5e740127701cce9ca31e7b8cda7b4","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear Programming Model","title_target":"Relaksasi Pemrograman Linear","unit_type":"subsection"},{"canonical_native_record_sha256":"16d9e4b23330d92b77ff7b0f5826d1a05d47f2cedce930641303058b7fba2e22","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsection-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Challenge","title_target":"Tantangan","unit_type":"subsection"},{"canonical_native_record_sha256":"50462b432fc2428d4372d6d688e60647f8292ae2e830490314d8276eb6c8c539","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsection-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Solution: The Diet Problem Meets Network Flow","title_target":"Solusi: Masalah Diet Bertemu dengan Aliran Jaringan","unit_type":"subsection"},{"canonical_native_record_sha256":"834ea9ad359c5ab171088accbe4dcdb3cb56299cbf07601367fcc215702e99e6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsection-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Assumptions and Simplifications","title_target":"Asumsi dan Penyederhanaan","unit_type":"subsection"},{"canonical_native_record_sha256":"55f46f24650e26fe6eca0ae5946a6c8ebaf52973b64f5f72af301f22d121608f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsection-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Implementation and Results","title_target":"Implementasi dan Hasil","unit_type":"subsection"},{"canonical_native_record_sha256":"0fabcc4145c773f2d57df568dea0d43c6e491c51a174fbc4c439fbc957a9962a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsection-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"References","title_target":"Referensi","unit_type":"subsection"},{"canonical_native_record_sha256":"f8bb996dcbc181c3b58f5f32649379dd379c0b6add71fcc5ff6b162d1190b49e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsection-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Knapsack Problem","title_target":"Masalah Ransel","unit_type":"subsection"},{"canonical_native_record_sha256":"8359e77aa3f9652a9e18b9f4f2b99bc66a4e1cb5138140bb6f26e9eed75493d8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsection-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Capital Investment","title_target":"Investasi Modal","unit_type":"subsection"},{"canonical_native_record_sha256":"cef089e90b952fe5a74f0995fce4fec67f46d1c319cb1cd3b8feb58137c071bc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsection-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Transportation problem","title_target":"Masalah Transportasi","unit_type":"subsection"},{"canonical_native_record_sha256":"a9520e021618dfb9d7235ac2f5cf756efd527e29bf39bd5b651c853c6a6d7308","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsection-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch02.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Assignment Problem","title_target":"Masalah Penugasan","unit_type":"subsection"},{"canonical_native_record_sha256":"7279b258036e93ae7430b8c148deacd676e30d6221defa0ed5dde764c038eed6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.subsubsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Selected Solutions","title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"1d4a0983049da1c12a7a401fc8b7ecd20f8398a273cea982958b3059e0d3e1cd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.table-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"84e841464f530d3dce0e3847edb7e03e3fe7faf9305cc031a4df343c34f82f1c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.table-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch02.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"787c33d973f93d25a0292f87559670a905d4aaf807c9f3cf2aa9301533684b13","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.table-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch02.text.subsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"8836d499ddb97b96def4eff4df88f3fb8bdacf6b9fff383117b5c7314ae6626b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.table-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch02.text.subsection-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"cfe3de883bddfd5bc2a0b32a448f5133c65cac0f44bbe56598653801e5afac50","concept_ids":["concept.binary-integer-programming","concept.capital-allocation","concept.knapsack-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.table-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch02.text.subsection-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"b390232c5af96cc23619c0f6c7d22bebf12ffd9c162dfc5105a8e9f2ddfeab6b","concept_ids":["concept.linear-programming","concept.transportation-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.table-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch02.text.subsection-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"d3ddfcf4bad8ff65192c44d540964ba5803c79f8c456707fb58e21f54f996b3a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch02.text.tryit-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch02.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"8e4ebf8ebcccd20d48fc6c858d025d6cd21c8ec8d040b1bf16071ed33bf3ca8c","concept_ids":["concept.spreadsheet-modeling","concept.excel-solver","concept.sensitivity-analysis"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03","locale":"mul","order":5,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.nonlinear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Using Excel Solver","title_target":"Menggunakan Solver Excel","unit_type":"chapter"},{"canonical_native_record_sha256":"837092edfa2dbf2c82513c5a71dabeb91cda9191cede590a29607062bc41b091","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.interactive","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch03","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","status":"draft","supersedes_id":null,"unit_type":"interactive_source"},{"canonical_native_record_sha256":"7e0d0faa2c7bde584c88267d39691e0f772805def666f9ac95d4a6505021ce7c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch03","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"75be69664dca95c7565bdc62eb0fb3d034f77151e48d6b5b5ccb2129626ebf52","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.solutions-manual.manualsolution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solver Rerun: Minimum-Cost Network Flow","title_target":"Menjalankan Ulang Solver: Aliran Jaringan Berbiaya Minimum","unit_type":"solution"},{"canonical_native_record_sha256":"aaa34b2b5a61da5e09163312bc0599b09d0ccd418964e5123ee4da563ee81e9d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.solutions-manual.manualsolution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch03.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solver Rerun: Production Planning over 10 Periods","title_target":"Menjalankan Ulang Solver: Perencanaan Produksi Selama 10 Periode","unit_type":"solution"},{"canonical_native_record_sha256":"09a56b4492c0e1d2c2a353f2bab9c2984c344663a5379febd19889dc25440021","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.solutions-manual.manualsolution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch03.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Diet Problem in Excel","title_target":"Masalah Diet di Excel","unit_type":"solution"},{"canonical_native_record_sha256":"a78c18af10bba7c95c1e60a67310fe2058574d6a608f3b9d2eb88b0046f6ba3e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.solutions-manual.manualsolution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch03.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production Planning in Excel","title_target":"Perencanaan Produksi di Excel","unit_type":"solution"},{"canonical_native_record_sha256":"614d242976339fccee90b8b38979c499a578ac4ef3018e4e69a8e3d7cc894c6e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.solutions-manual.manualsolution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch03.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Transportation Problem in Excel","title_target":"Masalah Transportasi di Excel","unit_type":"solution"},{"canonical_native_record_sha256":"e6c22812e54a8fb2bf461c1a08f02cffe7a57fc732eb57fa95846139bd264623","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.solutions-manual.manualsolution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch03.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Product Mix with a Sensitivity Report","title_target":"Bauran Produk dengan Laporan Sensitivitas","unit_type":"solution"},{"canonical_native_record_sha256":"6c000cf72f2f83b32b3d5d10b4305544b5983075efa50f1b7281189d429593f5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.solutions-manual.manualsolution-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch03.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Unbalanced Transportation with a Sensitivity Report","title_target":"Transportasi Tak Seimbang dengan Laporan Sensitivitas","unit_type":"solution"},{"canonical_native_record_sha256":"18c71154fd0ebc26c21e50674926d5910cb424d4ef913206af40b20bc09bbd17","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.solutions-manual.manualsolution-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch03.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex LP versus GRG Nonlinear","title_target":"Simplex LP versus GRG Nonlinear","unit_type":"solution"},{"canonical_native_record_sha256":"3c171cebea2933c119786ec2e0f2fc8046d1a77f70fe736b59eaa2a18e841379","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.solutions-manual.manualsolution-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch03.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"When a Variable Must Go Negative","title_target":"Ketika Variabel Harus Bernilai Negatif","unit_type":"solution"},{"canonical_native_record_sha256":"9f652c619cd34de922731ffb1336465f2e375c593ff4d85987fbc564c9cf3a90","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.solutions-manual.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Chapter 3: Software -- Excel","title_target":"Bab 3: Perangkat Lunak -- Excel","unit_type":"section"},{"canonical_native_record_sha256":"2c057ace402522d8e5106596042d0480057fc55b4b87607aa80315c96ee7bd2d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"42721a266cc6555b9ea8ba36a4557795016c4773a2ded3526984e6ceea78bdfa","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.captionfigure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Excel spreadsheet showing the recommended Solver layout: data cells (coefficients, right-hand...","title_target":"Tata letak Solver yang disarankan, dengan kode warna terpisah untuk data, variabel keputusan, dan rumus.","unit_type":"figure"},{"canonical_native_record_sha256":"abb98db7ce5543a737637371fe427502c0f25a2d5fc04f448280866a44014a3a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.captionfigure-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch03.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Screenshot of Excel's Data ribbon with the Solver button highlighted on the right side of the...","title_target":"Tombol \\texttt{Solver} pada pita \\texttt{Data} di Excel.","unit_type":"figure"},{"canonical_native_record_sha256":"9b7ee23a29debb54b8a8c74b5aa47cab09a996aa743ee46ca053b660acff2400","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.captionfigure-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch03.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solver Parameters dialog with fields filled in: Set Objective cell, Max/Min selector, By Changing...","title_target":"Dialog \\texttt{Solver Parameters} dengan fungsi tujuan, sel variabel, kendala, dan opsi ketidaknegatifan.","unit_type":"figure"},{"canonical_native_record_sha256":"9deb55423e9b1c76359b9b5ad4a661c1fd155b1220b86ce00dc537d12c1e0831","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.captionfigure-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch03.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Close-up of the Select a Solving Method dropdown in the Solver Parameters dialog, showing the three...","title_target":"Tiga pilihan pada menu \\texttt{Select a Solving Method}.","unit_type":"figure"},{"canonical_native_record_sha256":"7354ea6f4d97e5cf66a8a0509145672b1e6245482055b3e1166714f77ad15040","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.captionfigure-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch03.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solver Results dialog that appears after solving, offering Keep Solver Solution or Restore Original...","title_target":"Dialog \\texttt{Solver Results} untuk mempertahankan solusi dan memilih laporan hasil.","unit_type":"figure"},{"canonical_native_record_sha256":"a2f387b1566535d5e1f9cc54d038c148e7eaf1e2411b9752b37e128fb5667714","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.captionfigure-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch03.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Excel Answer Report worksheet generated by Solver, listing the objective cell's original and final...","title_target":"\\texttt{Answer Report} yang merangkum fungsi tujuan, variabel, status kendala, dan kelonggaran (\\emph{slack}).","unit_type":"figure"},{"canonical_native_record_sha256":"2b1d5722ef879526d37abf5fb0b68219a9b325b894bbea3ed987faae7307d549","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.captionfigure-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch03.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Excel Sensitivity Report worksheet with a Variable Cells table (final value, reduced cost...","title_target":"\\texttt{Sensitivity Report} dengan biaya tereduksi, harga bayangan, dan rentang perubahan yang diizinkan.","unit_type":"figure"},{"canonical_native_record_sha256":"0d1bc9bb449c10eaa0309b91726b32e9be8208191428322b0f7443ddd7dc3629","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.captionfigure-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch03.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Excel spreadsheet after Solver has run, with the yellow variable cells now populated with optimal...","title_target":"Lembar kerja dengan nilai variabel dan rumus setelah Solver menemukan solusi optimal.","unit_type":"figure"},{"canonical_native_record_sha256":"745a7f1be4ee3e108bf53873fefc8d332f50de370321e0da5a705d8d9a404ed5","concept_ids":["concept.conditional-formatting","concept.data-validation","concept.excel-solver","concept.spreadsheet-formula","concept.spreadsheet-modeling"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Software - Excel","title_target":"Perangkat Lunak - Excel","unit_type":"chapter"},{"canonical_native_record_sha256":"dd2761d63c101ed006dd8ff8d2377b53930e4b5b243395d6d2f06ace8d371487","concept_ids":["concept.excel-solver","concept.network-flow"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.ex-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solver Rerun: Minimum-Cost Network Flow","title_target":"Menjalankan Ulang Solver: Aliran Jaringan Berbiaya Minimum","unit_type":"exercise"},{"canonical_native_record_sha256":"ab0cdef2904e402114131d1a3392d49133dae04443576955c4f24f36d835580a","concept_ids":["concept.excel-solver","concept.inventory-balance","concept.production-planning"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.ex-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch03.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solver Rerun: Production Planning over 10 Periods","title_target":"Menjalankan Ulang Solver: Perencanaan Produksi Selama 10 Periode","unit_type":"exercise"},{"canonical_native_record_sha256":"2239a093cf585b3bfca4b41fa56c9abd8327a40f779420e3b66a8710494f8d96","concept_ids":["concept.diet-problem","concept.excel-solver"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.ex-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch03.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Diet Problem in Excel","title_target":"Masalah Diet di Excel","unit_type":"exercise"},{"canonical_native_record_sha256":"0c90b6eaf469d4270941ede510787fa1367b32df526909489fb2990c3b5405dd","concept_ids":["concept.excel-solver","concept.production-planning"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.ex-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch03.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production Planning in Excel","title_target":"Perencanaan Produksi di Excel","unit_type":"exercise"},{"canonical_native_record_sha256":"09a93e7e78c12054fc0c3d7426d404f6603347fd26f84448e4310289efc9352d","concept_ids":["concept.excel-solver","concept.transportation-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.ex-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch03.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Transportation Problem in Excel","title_target":"Masalah Transportasi di Excel","unit_type":"exercise"},{"canonical_native_record_sha256":"5830b21dc236361b29fd70e7a56be8059d259384a9672c26e166ac1d337a35b8","concept_ids":["concept.excel-solver","concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.ex-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch03.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Product Mix with a Sensitivity Report","title_target":"Bauran Produk dengan Laporan Sensitivitas","unit_type":"exercise"},{"canonical_native_record_sha256":"0e9a1f42d841cfc7a919b18f43523af11369a25570f3a2e9e85d9ba1e1562d0e","concept_ids":["concept.excel-solver","concept.sensitivity-analysis","concept.transportation-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.ex-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch03.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Unbalanced Transportation with a Sensitivity Report","title_target":"Transportasi Tidak Seimbang dengan \\texttt{Sensitivity Report} (Laporan Sensitivitas)","unit_type":"exercise"},{"canonical_native_record_sha256":"7272d2e2ec9e51497db8a6887f2fd58c230c7c95fe939335c304c808e2371e80","concept_ids":["concept.excel-solver","concept.linear-programming","concept.nonlinear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.ex-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch03.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex LP versus GRG Nonlinear","title_target":"Simplex LP dibandingkan dengan GRG Nonlinear","unit_type":"exercise"},{"canonical_native_record_sha256":"57bc78fa1d30f438420600ea2eabe32fa7ec60b1f64b8105b9d478a334d31d71","concept_ids":["concept.excel-solver","concept.short-selling"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.ex-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch03.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"When a Variable Must Go Negative","title_target":"Ketika Suatu Variabel Harus Bernilai Negatif","unit_type":"exercise"},{"canonical_native_record_sha256":"d2a12564d130f36fd039fe9186709a26258f4918ea090db56747af239ce55da2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.outcome-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"7394c902e656e0d434e09b16f8d42f2ab4d18127bdd37a0ed21011797833d48f","concept_ids":["concept.conditional-formatting","concept.data-validation","concept.excel-solver","concept.spreadsheet-formula","concept.spreadsheet-modeling"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Using Excel Solver","title_target":"Menggunakan Excel Solver","unit_type":"section"},{"canonical_native_record_sha256":"0ba929dcced003ac1edda884e25f64fa0628dfbda5e3ff7d72230aedda0e924f","concept_ids":["concept.excel-solver","concept.network-flow"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch03.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Exercises","title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"d9bdc805151df0df24bc0158a02c4434ab982a89ef96ca8bfcb07afcd66af468","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.solution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:excel-production-planning","title_target":"solution for ex:excel-production-planning","unit_type":"solution"},{"canonical_native_record_sha256":"a3345808bbf073a732d25d0414bb827429620e6bad34c8f0b96e4c98a1e7edee","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.solution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch03.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:excel-transportation","title_target":"solution for ex:excel-transportation","unit_type":"solution"},{"canonical_native_record_sha256":"a4e220d0c8024d667ef45817cfaa0988271bc11e6cc49d275979d6d66add704d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.solution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch03.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:excel-short-selling","title_target":"solution for ex:excel-short-selling","unit_type":"solution"},{"canonical_native_record_sha256":"6d416a50370183eccfd6be4ac76ab9f192c0329d03d83ae661b9045ff0c578fc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.subsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Useful Excel Functions and Techniques","title_target":"Fungsi dan Teknik Excel yang Berguna","unit_type":"subsection"},{"canonical_native_record_sha256":"58b86126842b60f0560d2db8f5570bb9254ef5f1851b723e88faf6110dfc9529","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.subsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch03.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"How to Use Excel Solver","title_target":"Cara Menggunakan Excel Solver","unit_type":"subsection"},{"canonical_native_record_sha256":"f766957bf5f0bb410991aafe441cff7533964e57377a86f8ee9dea23bc3160a5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.subsubsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Selected Solutions","title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"35e304d892b4c009c8805772fb7840ae2abc318b17836229e80d59ee951eff6f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch03.text.tryit-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch03.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"d7a284c4ed818062c2d21e4687f4b3001dcfed19b7a18565aed15459e6ba0467","concept_ids":["concept.compact-indexed-modeling","concept.production-planning","concept.assignment-model","concept.network-flow","concept.maximum-flow","concept.multicommodity-flow","concept.transportation-model","concept.multi-period-investment"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04","locale":"mul","order":6,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.linear-programming","concept.integer-linear-programming","concept.spreadsheet-modeling"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Modeling with Compact Notation","title_target":"Pemodelan dengan Notasi Ringkas","unit_type":"chapter"},{"canonical_native_record_sha256":"d50ad160db8db3fef39c74fba9488ce00363180241c2b1c699b667ecc4a2c978","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.interactive","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch04","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.code","status":"draft","supersedes_id":null,"unit_type":"interactive_source"},{"canonical_native_record_sha256":"ce26bb8de52e0487e95fe616881d3bcf927675ab5bbcdebcd4f784ec54df69a4","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"8668b991832cacd44623ae1fc18eef339a32f34a479376e844c78c1006a977b2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production Planning over Five Periods","title_target":"Perencanaan Produksi Selama Lima Periode","unit_type":"solution"},{"canonical_native_record_sha256":"95b75cb70c9bd008519e78b10492b9063b62815522026659718f36631bd26595","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Machine Assignment with New Costs","title_target":"Penugasan Mesin dengan Biaya Baru","unit_type":"solution"},{"canonical_native_record_sha256":"6e54b03cd916b6ff778a893da0dd098c670f52276e6e03a70ded78f483b0200d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Warehouse Shipping with New Data","title_target":"Pengiriman dari Gudang dengan Data Baru","unit_type":"solution"},{"canonical_native_record_sha256":"677332282aa75466650bb9b4f1f59d1e894e8070016252b867062d111ad077d0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Fair Housing Assignment for 12 Families","title_target":"Penugasan Hunian yang Adil bagi 12 Keluarga","unit_type":"solution"},{"canonical_native_record_sha256":"b2c1d292c1a3e1a536439a977fc03de4e2094e29898cc2629de8900534234a1f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Maximum Network Flow to a Single Node","title_target":"Aliran Jaringan Maksimum ke Satu Simpul","unit_type":"solution"},{"canonical_native_record_sha256":"36cfb8c857d114c70555be662c88dc6f7f89babb09f572718473f2265b682848","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Max Flow","title_target":"Aliran Maksimum","unit_type":"solution"},{"canonical_native_record_sha256":"ac07c1c1f107b327696f8d20ccaa5b16247c5896aaef6a04178a2422e6bb624e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Min Cost Network Flow","title_target":"Aliran Jaringan Berbiaya Minimum","unit_type":"solution"},{"canonical_native_record_sha256":"8f66f53c147f3225fb8073345c737d8640bbc5d2e297a156fa0bda255241e791","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Transshipment Through Regional Hubs","title_target":"Transshipment Melalui Hub Regional","unit_type":"solution"},{"canonical_native_record_sha256":"cb69ba073e20d55d5277a9996824efe1e8aecae835d616a3102b9fcaa0b0000d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Assignment with Forbidden Pairs","title_target":"Penugasan dengan Pasangan Terlarang","unit_type":"solution"},{"canonical_native_record_sha256":"d1fdf7ab72b683870224710b9d6d269d5c97b4f1b3c5d02e39c6d28b6b3cfe6c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Multi-Period Inventory with a Production Cap","title_target":"Persediaan Multiperiodik dengan Batas Produksi","unit_type":"solution"},{"canonical_native_record_sha256":"3ca594b0a7ed15d8f54579359392e3c942b061bb8f1f53ccf5c67480d3790096","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Why Everything Ships Somewhere","title_target":"Mengapa Semuanya Harus Dikirim ke Suatu Tempat","unit_type":"solution"},{"canonical_native_record_sha256":"3e6c5df516c862e93bbbe2eeb91e8669e7289fde8fc6609c2289022ac8f2868f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Integer Answers for Free","title_target":"Jawaban Bulat Tanpa Kendala Tambahan","unit_type":"solution"},{"canonical_native_record_sha256":"26591ffdfd72849ae4c02923ac6fa08a99c173aa4ce89eb6076e1ebefa3c8682","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Multicommodity Rerouting Under a Tighter Capacity","title_target":"Perutean Ulang Multikomoditas Akibat Kapasitas yang Lebih Ketat","unit_type":"solution"},{"canonical_native_record_sha256":"8a11819a358d01754a90b9a63735b99a994cf17093c2533abeac05a2d17942d1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.manualsolution-014","locale":"mul","order":14,"parent_id":"unit.r017.book1.ch04.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Max-Min Fair Project Assignment","title_target":"Penugasan Proyek Adil Max--Min","unit_type":"solution"},{"canonical_native_record_sha256":"8d33952151d617b7b5c5c189f560bc7a8aa0fb61e0e7a074db6cfe0c81ce0dc8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.solutions-manual.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Chapter 4: Modeling with Compact Notation","title_target":"Bab 4: Pemodelan dengan Notasi Ringkas","unit_type":"section"},{"canonical_native_record_sha256":"38f9afe2a6d6a9fee61ae657f8caecdf6280a522715cc1e4d278fe8b85fde03d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text_part"},{"canonical_native_record_sha256":"8ad0f4d495ed5aaf127f42c323907a8c935dec9fdd7ddd894fa436b4ed709433","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.captionfigure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-a.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Schematic of a multi-period production network: gray circles labelled 1, 2, ..., T-1, T.","title_target":"Skema jaringan produksi multi-periode: lingkaran abu-abu berlabel 1, 2, ..., T-1, dan T.","unit_type":"figure"},{"canonical_native_record_sha256":"86774b100a41f17127c1b62611e7aa9995694c986f606a5b2971258d16b4e3d5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.captionfigure-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Bipartite assignment diagram: three people P1, P2, P3 drawn as stick-figure icons in blue circles...","title_target":"Diagram penugasan bipartit: tiga orang P1, P2, P3 digambar sebagai ikon manusia dalam lingkaran biru; tiga tugas T1, T2, T3 digambar sebagai papan tugas merah; dan setiap orang dihubungkan ke setiap tugas.","unit_type":"figure"},{"canonical_native_record_sha256":"f558f2d368a871d32c8d83e68a017e6529b50bd9ed2a9b58a2d32b3dc758daa2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.casestudybox-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Preference-Based Housing Assignment in Uruguayan Cooperatives","title_target":"Penugasan Hunian Berbasis Preferensi pada Koperasi di Uruguay","unit_type":"casestudybox"},{"canonical_native_record_sha256":"e3bed4f42be6ac91450b643cb2911468850fa36ba4098c0ca03685ba7757edc2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-a","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Modeling with Compact Notation","title_target":"Pemodelan dengan Notasi Ringkas","unit_type":"chapter"},{"canonical_native_record_sha256":"b36482089d446026e5a61626a59af5c1b228d2947fb4403ba87063bc44848a5e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.example-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-a.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Summing over a set","title_target":"Menjumlahkan atas suatu himpunan","unit_type":"example"},{"canonical_native_record_sha256":"634cbee10d16ab50a89293439ebdb748988d83f556959302082b3bee5d36c7e0","concept_ids":["concept.inventory-balance","concept.production-planning","concept.spreadsheet-modeling"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.examplewithallcode-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-a.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production Planning with 10 Periods (\\(T = 10\\))","title_target":"Perencanaan Produksi dengan 10 Periode (\\(T = 10\\))","unit_type":"example"},{"canonical_native_record_sha256":"f6303b4c500ab5ec26ae6315b351b8c6ccb8f0bbd5959d7efbbd45e3b5655847","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.examplewithallcode-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-a.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production Planning with Overtime (\\(T = 10\\))","title_target":"Perencanaan Produksi dengan Lembur (\\(T = 10\\))","unit_type":"example"},{"canonical_native_record_sha256":"5ed9f6e7c4c2086215b6945b0e24e1b1be8df943709303853357926b1ae05f99","concept_ids":["concept.assignment-model","concept.spreadsheet-modeling"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.examplewithallcode-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Machine Assignment","title_target":"Penugasan Mesin","unit_type":"example"},{"canonical_native_record_sha256":"b0dd0f9cef099d757a46f5ad1168ac145f726eb9e0836b0a397cde4ef30c135b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.examplewithallcode-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"School Bus Routing Problem","title_target":"Masalah Penentuan Rute Bus Sekolah","unit_type":"example"},{"canonical_native_record_sha256":"e02c418d929ff40d05ab72c6d1e28b92fd924e991ea7b56e73f4f0974ca170bd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.examplewithallcode-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Hiring for tasks","title_target":"Merekrut Orang untuk Tugas","unit_type":"example"},{"canonical_native_record_sha256":"de379a7d5429d419360d7bf666df8d4f310293f354ddfee2ca74ad8a5cb17091","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.examplewithallcode-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch04.text-a.subsection-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Minimizing an Absolute Value","title_target":"Meminimalkan Nilai Mutlak","unit_type":"example"},{"canonical_native_record_sha256":"7ee739e0455874ef99177bb4c4b7f0c50e9a6ec58511a9214084c001705baaa7","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.general-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Assignment Problem","title_target":"Masalah Penugasan","unit_type":"general"},{"canonical_native_record_sha256":"02a28febd45a0d1c02318cc822a7687b1354f0cdafd68eef24f5d346c2e94fcb","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.learningcheckpoint-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-a.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"f8576c4d044eb5b7f271380463100f23c9595b8f658c23d8a15f2178802e2c55","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.outcome-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"314246a6059bfc8546bbbc87cd6a08e8d147b2b29e6b21084e57e1fc39c05064","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A Brief Review of Summation Notation and Its Relation to Vector Products","title_target":"Tinjauan Singkat Notasi Penjumlahan dan Kaitannya dengan Perkalian Vektor","unit_type":"section"},{"canonical_native_record_sha256":"ba846138f69886d62122d65fce2530dc5991a34cec9ac53cb17f953387e3911c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Notes on Sets, Indices, and Summation","title_target":"Catatan tentang Himpunan, Indeks, dan Penjumlahan","unit_type":"section"},{"canonical_native_record_sha256":"7fc8db3cd3b1cd8b9797eba46253a1527ab2121e4f19b3c02101352afface56e","concept_ids":["concept.compact-indexed-modeling","concept.inventory-balance","concept.production-planning","concept.summation-notation"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production Planning Models","title_target":"Model Perencanaan Produksi","unit_type":"section"},{"canonical_native_record_sha256":"a2babc4ced9da617edb240ee8d40809022fd7169c51cfeb882253bad6cbb03f5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.section-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch04.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production Planning with Overtime","title_target":"Perencanaan Produksi dengan Lembur","unit_type":"section"},{"canonical_native_record_sha256":"215d8c32377c44ef26005cb2a4989c0cc7ff7702497dcc8fda11ac299d9db9a6","concept_ids":["concept.assignment-model","concept.integer-linear-programming","concept.total-unimodularity"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.section-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch04.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Assignment Problem","title_target":"Masalah Penugasan","unit_type":"section"},{"canonical_native_record_sha256":"7b4e7b1cc608e483526a2fbcc5f0cbd17e02f4677aede72c7e880a0325ded75a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.section-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch04.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Modeling Tricks","title_target":"Kiat Pemodelan","unit_type":"section"},{"canonical_native_record_sha256":"da5568e009245539bbcb4a975e2e1b9abe22b4be1bb8781412330b2aa3dd339c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.subsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-a.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production Planning Model (for \\(T\\) Periods)","title_target":"Model Perencanaan Produksi (untuk \\(T\\) Periode)","unit_type":"subsection"},{"canonical_native_record_sha256":"4653f8d76948efbd93e3a81efec8d17aa51368f60f72d126feaf0014546639d5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.subsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Challenge","title_target":"Tantangan","unit_type":"subsection"},{"canonical_native_record_sha256":"fd5efbf06e07e68714723c35e776b0e57edf5f7be61ef061aae9426a676cd082","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.subsection-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Solution: A Two-Stage Optimization Model","title_target":"Solusi: Model Optimisasi Dua Tahap","unit_type":"subsection"},{"canonical_native_record_sha256":"81d43b77d45a9aa491da9db59e94214975a23c7eedcdf3fa48fc08db6bc146db","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.subsection-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Implementation and Results","title_target":"Penerapan dan Hasil","unit_type":"subsection"},{"canonical_native_record_sha256":"24c548f6ae5865e0a2c6feae7d21395c2713ac6dfe120902b544849415f1658f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.subsection-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Broader Impact","title_target":"Dampak yang Lebih Luas","unit_type":"subsection"},{"canonical_native_record_sha256":"63b5c5f26a5adc6490effdffdd543155c9d90d2d582beb841a7701ef44bc7cd7","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.subsection-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Optimization models","title_target":"Model optimisasi","unit_type":"subsection"},{"canonical_native_record_sha256":"79c22aece23e44710267e67136f3b41d677e549828adc3dc522570ebfa989dfe","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.subsection-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Two-Stage Optimization Approach","title_target":"Pendekatan Optimisasi Dua Tahap","unit_type":"subsection"},{"canonical_native_record_sha256":"b1f08de1455cc57de9b9baeeb8abfea76a729900f3a47dcbb9a86ac4822ee1c8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.subsection-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Implementation Notes","title_target":"Catatan Penerapan","unit_type":"subsection"},{"canonical_native_record_sha256":"83debf66a634d0bc9e01510cf5448d419e623d1d7c2d2ef89398938e0c09c8a6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.subsection-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"References","title_target":"Referensi","unit_type":"subsection"},{"canonical_native_record_sha256":"24c1b5b3f06218fdac38a53e5d2540b5f2097576ca8962feb4455b89b6433623","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.subsection-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch04.text-a.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Maximizing a minimum","title_target":"Memaksimalkan suatu minimum","unit_type":"subsection"},{"canonical_native_record_sha256":"e5a711580c3c4145e1ad961a7a29afef7585a88b06fb69082e3f68902be2d392","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-a.table-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-a.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"43bfdff7eb746643b95d3f7d0ac38470e7b516b2929011785b5ee80cdf868eec","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text_part"},{"canonical_native_record_sha256":"36f2472047d53b019e3715d98fdc5b4ee67929be81aa003e6e2ec8af871c6dc8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.captionfigure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Undirected network with six numbered circular nodes: edges join 6-4, 4-5, 4-3, 5-1, 5-2, 3-2, and 2-1.","title_target":"Jaringan tak berarah dengan enam simpul bundar bernomor: sisi-sisinya menghubungkan 6--4, 4--5, 4--3, 5--1, 5--2, 3--2, dan 2--1.","unit_type":"figure"},{"canonical_native_record_sha256":"8528f23968b8069a6ab0d3238825853fd7360bbb960ef4cb6d625652500f2656","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.captionfigure-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-b.subsubsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Directed version of the same six-node network: curved arrows show arc directions, including a...","title_target":"Versi berarah dari jaringan enam simpul yang sama: panah melengkung menunjukkan arah setiap busur, termasuk dua busur berlawanan arah antara simpul 4 dan 6.","unit_type":"figure"},{"canonical_native_record_sha256":"064e9fb2e3c609d3ae3dd0f3eacd5e66e03c33bcbea972322eec180a8ce1b527","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.captionfigure-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04.text-b.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Transshipment network: supply nodes W1 (+30) and W2 (+20) on the left, transshipment nodes D1 and...","title_target":"Jaringan transshipment: simpul pasokan W1 (+30) dan W2 (+20) di sebelah kiri, simpul transshipment D1 dan D2 di tengah, serta simpul permintaan S1 (-20), S2 (-15), dan S3 (-15) di sebelah kanan.","unit_type":"figure"},{"canonical_native_record_sha256":"7ad1b5b3bd95178267b800925edde016bd7f02f19ffb77932db2dc105d365ddb","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.captionfigure-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch04.text-b.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Directed network with eight nodes labeled a through h arranged left to right.","title_target":"Jaringan berarah dengan delapan simpul berlabel a sampai h yang tersusun dari kiri ke kanan.","unit_type":"figure"},{"canonical_native_record_sha256":"408bcc972492df473fa616fe6099ca2089d3afd509b29cd99af4568f7e35f41d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.captionfigure-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch04.text-b.subsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Data for multi-commodity network flow example: four nodes with paired supplies/demands $(d_{i1}, d_{i2})$ and four arcs labelled with their shared capacities.","title_target":"Data untuk contoh aliran jaringan multikomoditas: empat simpul dengan pasangan pasokan/permintaan $(d_{i1}, d_{i2})$ dan empat busur yang diberi label kapasitas bersamanya.","unit_type":"figure"},{"canonical_native_record_sha256":"4c0013ad01ba3cc2c1ef5a2dc495423c385817ab214b99d9d6cbc59d47a5f9df","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.captionfigure-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch04.text-b.subsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solution to multi-commodity network flow: each arc is labelled with the optimal flow of each commodity $[f_{ij1}, f_{ij2}]$.","title_target":"Solusi aliran jaringan multikomoditas: setiap busur diberi label aliran optimal untuk masing-masing komoditas $[f_{ij1}, f_{ij2}]$.","unit_type":"figure"},{"canonical_native_record_sha256":"8cf5190396b08a9b51fba7314f9da92d1bbad02b33eb7201b30a3336c1508580","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.captionfigure-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Disaster-relief transportation network: warehouse rectangles W1-W5 (inventories 200, 300, 150, 250...","title_target":"Jaringan transportasi bantuan bencana: persegi panjang W1--W5 adalah gudang dengan persediaan 200, 300, 150, 250, dan 180; lingkaran D1--D3 adalah pusat distribusi; belah ketupat adalah hub pusat; dan setiap busur diberi label kapasitas angkutnya.","unit_type":"figure"},{"canonical_native_record_sha256":"855f8589b45e808e9b21925dec10f2a145a18ceb188ad1e81d006cbce8ce8a4d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.captionfigure-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Directed max-flow exercise network: green source s and red sink t with intermediate nodes v1, v2, v3, v4.","title_target":"Jaringan latihan aliran maksimum berarah: sumber hijau s dan tujuan merah t, dengan simpul perantara v1, v2, v3, dan v4.","unit_type":"figure"},{"canonical_native_record_sha256":"25fc542a0eb10b059eedd5ceae6f99b30505585fb253b86677c2f0b759a33f67","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.captionfigure-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Six-node directed network for a min-cost flow exercise: nodes v1 through v6 with blue supply values...","title_target":"Jaringan berarah enam simpul untuk latihan aliran berbiaya minimum: simpul v1 sampai v6 diberi nilai permintaan bersih berwarna biru; setiap busur diberi label kapasitas berwarna hitam dan biaya per unit berwarna merah.","unit_type":"figure"},{"canonical_native_record_sha256":"04ceac40cee0d95a7cd7e16786e7436f9d5c2bd72bc9b98db70625767d14a2d9","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.casestudybox-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Amazon Redraws Its Map: Regionalizing the Fulfillment Network","title_target":"Amazon Menggambar Ulang Petanya: Regionalisasi Jaringan Pemenuhan Pesanan","unit_type":"casestudybox"},{"canonical_native_record_sha256":"919e3b7fc3700ad6ee8abf51cbaa37cb397e9630bed97957aba214dcb22340c8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.definition-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"definition"},{"canonical_native_record_sha256":"c2ef04bcdcfdbaa0f89dc3ad43b04fb1d6fa3dcef1bcb61ec037db82bdc3c1ce","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.definition-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-b.subsubsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"definition"},{"canonical_native_record_sha256":"306321805ddca2b590b7336a81eff409ee53fbddf2906b6f5315551bfb67732a","concept_ids":["concept.compact-indexed-modeling","concept.inventory-balance","concept.production-planning"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Production Planning over Five Periods","title_target":"Perencanaan Produksi Selama Lima Periode","unit_type":"exercise"},{"canonical_native_record_sha256":"82bf37afab563f4969bfe9f18858931e1a872c0e3af902510904d6ae52e22461","concept_ids":["concept.assignment-model","concept.integer-linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Machine Assignment with New Costs","title_target":"Penugasan Mesin dengan Biaya Baru","unit_type":"exercise"},{"canonical_native_record_sha256":"7bd81b87b9da3a7cefb569b1d506d3cc52360987229af2f7aa1630ffa2b8ca51","concept_ids":["concept.flow-conservation","concept.graph-theory"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Warehouse Shipping with New Data","title_target":"Pengiriman Gudang dengan Data Baru","unit_type":"exercise"},{"canonical_native_record_sha256":"9085c787f527824c86bf1351ee5031fa717f45f258e7905e9997751726a94be1","concept_ids":["concept.assignment-fairness","concept.assignment-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Fair Housing Assignment for 12 Families","title_target":"Penugasan Hunian yang Adil untuk 12 Keluarga","unit_type":"exercise"},{"canonical_native_record_sha256":"a1e5c13162554b5a05ab98572311fd3ff067805eeff78f481b6980195051f9e5","concept_ids":["concept.flow-conservation","concept.maximum-flow","concept.minimum-cut"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Maximum Network Flow to a Single Node","title_target":"Aliran Jaringan Maksimum ke Satu Simpul","unit_type":"exercise"},{"canonical_native_record_sha256":"02a3e0df239e12812053a72ae9715d0f0a0ed0da453f815e4e9f62db4d962e33","concept_ids":["concept.maximum-flow","concept.minimum-cut"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Max Flow","title_target":"Aliran Maksimum","unit_type":"exercise"},{"canonical_native_record_sha256":"f02cf52e202148814481146b7df713b629c9bd1099c411fb8fee9867af5ddd30","concept_ids":["concept.flow-balance-sign-convention","concept.network-flow"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Min Cost Network Flow","title_target":"Aliran Jaringan Berbiaya Minimum","unit_type":"exercise"},{"canonical_native_record_sha256":"8bd5aa502e309af8965be452be7692df1d9060035763ab265e36fe8e4a285e30","concept_ids":["concept.flow-conservation","concept.transshipment"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Transshipment Through Regional Hubs","title_target":"Transshipment melalui Hub Regional","unit_type":"exercise"},{"canonical_native_record_sha256":"eb36cd36cb2dab97f59fee6fe00ee01da79796006eb0176c0f986377c70a87c0","concept_ids":["concept.assignment-model","concept.integer-linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Assignment with Forbidden Pairs","title_target":"Penugasan dengan Pasangan Terlarang","unit_type":"exercise"},{"canonical_native_record_sha256":"3adc7adda1910ffcefdcb47688efbff395535250a13045887ea8e8537b923a31","concept_ids":["concept.inventory-balance","concept.production-planning"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Multi-Period Inventory with a Production Cap","title_target":"Persediaan Multiperiodik dengan Batas Produksi","unit_type":"exercise"},{"canonical_native_record_sha256":"ff088e2f290ee8c5b6d4ac8e9fb91fa11a37119721e38dae3a2509f4ce1d8670","concept_ids":["concept.flow-balance-sign-convention","concept.flow-conservation"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Why Everything Ships Somewhere","title_target":"Mengapa Setiap Unit Dikirim ke Suatu Tempat","unit_type":"exercise"},{"canonical_native_record_sha256":"f69695717410129edd779973ec57f478c8371c15175250f4466b941608cf5415","concept_ids":["concept.assignment-model","concept.total-unimodularity"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Integer Answers for Free","title_target":"Jawaban Bulat Tanpa Biaya Tambahan","unit_type":"exercise"},{"canonical_native_record_sha256":"314aa00353b4c008990fdf2df7dc7146322d653691e48386357120bfede2650b","concept_ids":["concept.flow-conservation","concept.multicommodity-flow"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Multicommodity Rerouting Under a Tighter Capacity","title_target":"Perutean Ulang Multikomoditas pada Kapasitas yang Lebih Ketat","unit_type":"exercise"},{"canonical_native_record_sha256":"0691af23c6140ca2092535c0025dc7341a415ff84ba180cf33a292092746ca79","concept_ids":["concept.assignment-fairness","concept.assignment-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.ex-014","locale":"mul","order":14,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Max-Min Fair Project Assignment","title_target":"Penugasan Proyek Adil Maks-Min","unit_type":"exercise"},{"canonical_native_record_sha256":"d5113276ed83c763c509b458110a229693f2d5241eb688d60a9babfa889f3979","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.example-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Amazonian's Distribution Network","title_target":"Jaringan Distribusi Amazonian","unit_type":"example"},{"canonical_native_record_sha256":"4ca952d41334e3601d315aebd9dc8abb1bf496fa001593a0b980ed57af0db020","concept_ids":["concept.flow-conservation","concept.network-flow","concept.transportation-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.examplewithallcode-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Minimum-Cost Network Flow","title_target":"Aliran Jaringan Berbiaya Minimum","unit_type":"example"},{"canonical_native_record_sha256":"b7b5683168baa179f5bf3c1d9e692bc441c1c1384a558e141cd7eb36e4e42dde","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.examplewithallcode-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-b.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Airline Transfer Network: Maximizing Passenger Throughput","title_target":"Jaringan Transit Maskapai: Memaksimalkan Jumlah Penumpang","unit_type":"example"},{"canonical_native_record_sha256":"10cfcb30162ed43d88215a047d1d6b5fed085913a190e1a3a4dfc07c01bcfe25","concept_ids":["concept.flow-conservation","concept.multicommodity-flow"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.examplewithallcode-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04.text-b.subsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Multi-commodity network flow","title_target":"Aliran jaringan multikomoditas","unit_type":"example"},{"canonical_native_record_sha256":"ddd6d71181f71a2c5e72486566c82991ec403cab5a24e7411761e8619004d1c0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.examplewithallcode-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch04.text-b.subsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Source--Sink Multicommodity Flow","title_target":"Aliran Multikomoditas Sumber--Tujuan","unit_type":"example"},{"canonical_native_record_sha256":"23d5a8ea06a6c92713cd91584e1484782b6982d65c5e934a72cd9d90e801c805","concept_ids":["concept.capital-allocation","concept.multi-period-investment"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.examplewithallcode-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch04.text-b.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Multi-Period Capital Investment Problem","title_target":"Masalah Investasi Modal Multiperiodik","unit_type":"example"},{"canonical_native_record_sha256":"d8377410664bd58307f0b09765d4b45f5d0707aeda4575da8dc871b7d4195cce","concept_ids":["concept.flow-balance-sign-convention","concept.flow-conservation","concept.graph-theory"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Network Flow Models and Applications","title_target":"Model dan Aplikasi Aliran Jaringan","unit_type":"section"},{"canonical_native_record_sha256":"cd1d3e158e51340d7afe12a39470d230abb222281c603e7b366f60c338d095f7","concept_ids":["concept.network-flow","concept.transportation-model"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-b","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Transportation Problem","title_target":"Masalah Transportasi","unit_type":"section"},{"canonical_native_record_sha256":"9ba4ede0f50b1b18f4d8b41aa1acfd8489dfe91e2c676634c3eed140e2d3a592","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04.text-b","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Concluding Comments","title_target":"Komentar Penutup","unit_type":"section"},{"canonical_native_record_sha256":"0c6fc90ca83e096b4fd87c4c44e5fd898079bdd656d4446bdba61a6734ef3fb4","concept_ids":["concept.capital-allocation","concept.multi-period-investment"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.section-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch04.text-b","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Multi-Period Capital Investment","title_target":"Investasi Modal Multiperiodik","unit_type":"section"},{"canonical_native_record_sha256":"0ffd25f263828caf955b8292f73dc73a007d81e77a19467c6ebcd06917b68688","concept_ids":["concept.compact-indexed-modeling","concept.inventory-balance","concept.production-planning"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.section-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch04.text-b","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Exercises","title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"a4a9fffff79de3e5aa4f2e516f801ed07320b345305598e654aa1b47573559d5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.solution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"0088a18b86fdce3382e06579828b7f55bb308043e87f0ecfd67b8388faf0a260","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.solution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-b.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:machine-assignment-warmup","title_target":"solution for ex:machine-assignment-warmup","unit_type":"solution"},{"canonical_native_record_sha256":"462bd5faa264d47b63714ed67a59bb2e269467a3edda29360eedd2c952cb509e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.solution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04.text-b.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:relief-max-flow","title_target":"solution for ex:relief-max-flow","unit_type":"solution"},{"canonical_native_record_sha256":"22d32b113532375d6133098ab6dd6319dee92626b297b711b425f12e755c856a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.solution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch04.text-b.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:max-flow-explicit","title_target":"solution for ex:max-flow-explicit","unit_type":"solution"},{"canonical_native_record_sha256":"1026fb385c049743cded82180991f1ad7f93ffd19af8d369675959ab0d2c8977","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.solution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch04.text-b.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:transshipment-hubs","title_target":"solution for ex:transshipment-hubs","unit_type":"solution"},{"canonical_native_record_sha256":"b7141e0bf060e644dd985832cb020bcf7b4501e45370f31ec21f992d95183108","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.solution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch04.text-b.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:maxmin-fair-assignment","title_target":"solution for ex:maxmin-fair-assignment","unit_type":"solution"},{"canonical_native_record_sha256":"3a2d2e8f59d36b61547b7ff9254bc443884e2f190ebe0e09e80d9915dad5bc6b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Graphs","title_target":"Graf","unit_type":"subsection"},{"canonical_native_record_sha256":"25ba2cdd71a77358767a919f64676a05d81a64bf3752e556be4cd6d26ceefc07","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Example: Minimum-Cost Flow in a Transportation Network","title_target":"Contoh: Aliran Berbiaya Minimum dalam Jaringan Transportasi","unit_type":"subsection"},{"canonical_native_record_sha256":"6e58f42b25ecba09b8b5eb600f794d20659677f6b957ac2dc726d6d55cbb800c","concept_ids":["concept.flow-balance-sign-convention","concept.flow-conservation","concept.network-flow","concept.transshipment"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Minimum Cost Network Flow Problem","title_target":"Masalah Aliran Jaringan Berbiaya Minimum","unit_type":"subsection"},{"canonical_native_record_sha256":"711dcdfc8cdc8a34315282039e051c7259543ff98ceb785056305ad536541b2a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch04.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"(Unstructured) Minimum Cost Network Flow Problem","title_target":"Masalah Aliran Jaringan Berbiaya Minimum (Tak Terstruktur)","unit_type":"subsection"},{"canonical_native_record_sha256":"25e8482975d083781095c6124c06fbfc3642c670992b5094fcbfc1e8276cfbbd","concept_ids":["concept.flow-conservation","concept.maximum-flow","concept.minimum-cut"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch04.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Maximum flow","title_target":"Aliran Maksimum","unit_type":"subsection"},{"canonical_native_record_sha256":"14ccd3bf7a55bce5b6093908b62910d6640a6ccd5bc6266b6f90061ce63bea36","concept_ids":["concept.flow-conservation","concept.multicommodity-flow"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch04.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Multi-Commodity Minimum Cost Network Flow with Integrality Constraints","title_target":"Aliran Multikomoditas Berbiaya Minimum dengan Kendala Keutuhan","unit_type":"subsection"},{"canonical_native_record_sha256":"54e4d2c30bbfac2bf5eff70efe107867a19ffaaa2607288f77dbc9d39076ac88","concept_ids":["concept.flow-balance-sign-convention","concept.multicommodity-flow"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch04.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Multicommodity Flow: Source--Sink Formulation","title_target":"Aliran Multikomoditas: Rumusan Sumber--Tujuan","unit_type":"subsection"},{"canonical_native_record_sha256":"c7a347148d49e7b55243b6322ed376a71ec823ec445154e5fc6249af3df740d2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch04.text-b.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solving the Minimum-Cost Network Flow Problem","title_target":"Menyelesaikan Masalah Aliran Jaringan Berbiaya Minimum","unit_type":"subsection"},{"canonical_native_record_sha256":"34d2f96d92c397df9fc9fd564950d44063c026a7a1e9a7e3bfd5708075017bf4","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch04.text-b.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Challenge","title_target":"Tantangan","unit_type":"subsection"},{"canonical_native_record_sha256":"058ab74032bf756b84f7f8a8da14cdbaa95cf352261405eb416037958ecb87f2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch04.text-b.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Solution: A Path-Based Network Design MIP","title_target":"Solusi: MIP Perancangan Jaringan Berbasis Lintasan","unit_type":"subsection"},{"canonical_native_record_sha256":"833ba27b3e191d5f4a6363cfcec70af8425a723c6d2e37c2cf0aeae7877295f6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch04.text-b.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Assumptions and Simplifications","title_target":"Asumsi dan Penyederhanaan","unit_type":"subsection"},{"canonical_native_record_sha256":"84729e9f3ec33446272b9ddb53299526ea60acf8d1566ef8ba33ab2cb1625f0a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch04.text-b.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Implementation and Results","title_target":"Implementasi dan Hasil","unit_type":"subsection"},{"canonical_native_record_sha256":"f46cec4fc642558b14aca2f8fdd3909fc42bdac0e871b8e7303ff0d04705c84d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsection-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch04.text-b.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"References","title_target":"Referensi","unit_type":"subsection"},{"canonical_native_record_sha256":"db1862f2bcae02447979d2eb1c24275963b5d936497b2618b50d79be4590c7cb","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsubsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Undirected Graphs","title_target":"Graf Tak Berarah","unit_type":"subsubsection"},{"canonical_native_record_sha256":"a531d32313cc85474a67472da22aaf6f01174f95ac55c6327a9d1856dda1a2c1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsubsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-b.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Directed Graphs","title_target":"Graf Berarah","unit_type":"subsubsection"},{"canonical_native_record_sha256":"1935e5025d5f1681fc40a4c8d1dc402ba2a9f8c26f8cc4591516b65135005b5f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.subsubsection-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch04.text-b.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Selected Solutions","title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"caf98ea953ed09a4e9ee605314cce7f3f8ce44ab9d97f82734c1490d1491fa6f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.table-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"3b1ce572330ae6d680e1f9665e82ae99cf8fce1aeb4bb372da1d57c254cd8ca5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.table-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch04.text-b.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"537e620a0516a5587dfa8e200dbd3ff44925eac0332b7d4661316404dc3e5eeb","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch04.text-b.tryit-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch04.text-b.subsection-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"d71fa38d8a2f10517f8710cb5bcf61df4cdede82cbc6f2e354e8736e4e84a6a3","concept_ids":["concept.linear-programming","concept.feasible-region","concept.graphical-lp-method","concept.level-curve","concept.extreme-point-optimality","concept.alternate-optima","concept.infeasible-linear-program","concept.unbounded-linear-program","concept.recession-direction"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05","locale":"mul","order":7,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region","concept.objective-function"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Solving Linear Programs Graphically","title_target":"Menyelesaikan Program Linier secara Grafis","unit_type":"chapter"},{"canonical_native_record_sha256":"c62b7f77a089ae10728bc81826a9fc3ee0532882a8dee6b73d8781abb63284a8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch05","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"408284bd2e0ca651c522989a16faf9edb620ffba373e7c50057be425592fc412","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Feasible Region Analysis","title_target":"Analisis Daerah Layak","unit_type":"solution"},{"canonical_native_record_sha256":"6dcb944b9cf7758b6e993d50f1213945a50c06f07f68b11b1186851c72c96498","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Sketch Feasible Region","title_target":"Sketsa Daerah Layak","unit_type":"solution"},{"canonical_native_record_sha256":"098a3340a04891055236ccf8e74687f1cb087a63b52a2fb866baba1f68e7ca15","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Graphical Method 1 Practice","title_target":"Latihan Metode Grafis 1","unit_type":"solution"},{"canonical_native_record_sha256":"aa48c61b5f8ba1f596279ddc593f90e5b227284398c26eb8ac3134e53c44a59f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Graphical Method for Lemonade Vendor","title_target":"Metode Grafis untuk Penjual Limun","unit_type":"solution"},{"canonical_native_record_sha256":"85725124837f7f9a77146139b9cbb848ad4a2b5fc26b944ea095879f17a7d1d9","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Graphical Method","title_target":"Metode Grafis","unit_type":"solution"},{"canonical_native_record_sha256":"f76065d05127baae79674d9a5f8720f838697d9bfc3b063a9af5b015c6eadd62","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Infeasible Region Graph","title_target":"Grafik Daerah Tak Layak","unit_type":"solution"},{"canonical_native_record_sha256":"93edfa2a52b3c252d67de8717735bcc9670b56e9d6bc279afcd0be6fe3f387e8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Determine Optimal Value","title_target":"Menentukan Nilai Optimal","unit_type":"solution"},{"canonical_native_record_sha256":"234a9df615d2d763d2bb389f95036830bccc943181be1403b5ebc3bb0308be7c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Show Unbounded Problem","title_target":"Menunjukkan Masalah Tak Berbatas","unit_type":"solution"},{"canonical_native_record_sha256":"6c2cc59173d23014afb177390e0a47f36294f2247bf153aea31de677dd3a14d0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Bounded Solution on Unbounded Region","title_target":"Berhingga atau Tak Berbatas?","unit_type":"solution"},{"canonical_native_record_sha256":"62369e0376f0724cc1caaab67ac2679e3316c0f95a95a84d174fbcaad38439c9","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Diet Problem","title_target":"Masalah Diet","unit_type":"solution"},{"canonical_native_record_sha256":"f096aa5e55bbdbf490a46f920b759d57f18a681845d82fd60be422e7896ec328","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Why Must an Optimum Be at a Vertex?","title_target":"Mengapa Optimum Harus Berada di Titik Ekstrem?","unit_type":"solution"},{"canonical_native_record_sha256":"5fca089dd4951b3d5650d8c6c1f5efd6fed012ef38ddd0d91f55de9f36582879","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Infinite Optimal Solutions","title_target":"Tak Hingga Banyak Solusi Optimal","unit_type":"solution"},{"canonical_native_record_sha256":"65d6fde37ffb6cdd8b12fe0b86053617a24577c9bb25f45a9e81316a18013d37","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Infinitely Many Optimal Solutions","title_target":"Tak Hingga Banyak Solusi Optimal","unit_type":"solution"},{"canonical_native_record_sha256":"f4cf842fefcbf7e74c58c50c7c529932382d764da12b04179e48a881c4901b83","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-014","locale":"mul","order":14,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Bounded Optimum on Unbounded Region","title_target":"Optimum Berhingga pada Daerah Tak Berbatas","unit_type":"solution"},{"canonical_native_record_sha256":"ff6d60697ae7b6458e748c45f75e535fd3f9d058f17c3453f2b3086aaa6c7799","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-015","locale":"mul","order":15,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Unbounded Objective Direction","title_target":"Arah Fungsi Tujuan Tak Berbatas","unit_type":"solution"},{"canonical_native_record_sha256":"331381f14a8771ec1f970140c21ad94c26a13588d54605b1ffc154d0f5acd5a4","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-016","locale":"mul","order":16,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Bounded and Unbounded Optimization","title_target":"Optimisasi Terbatas dan Tak Berbatas","unit_type":"solution"},{"canonical_native_record_sha256":"da9e23146e040bcc69a151e0d82ab63d3b8c3b0418150c45948480f7669ee7c3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.manualsolution-017","locale":"mul","order":17,"parent_id":"unit.r017.book1.ch05.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"From an Optimal Edge to a Unique Optimum","title_target":"Dari Rusuk Optimal ke Optimum Tunggal","unit_type":"solution"},{"canonical_native_record_sha256":"434eecc221d1121067a50f798e0a93b172a93a378d46ad3753cf042469f1cc9c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.solutions-manual.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Chapter 5: Graphically Solving Linear Programs","title_target":"Bab 5: Menyelesaikan Program Linier secara Grafis","unit_type":"section"},{"canonical_native_record_sha256":"f55ef4b89ca34299623a39fb27312ac9775416b59baae3ea048ba351fde0bffe","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"7487335eda873428018bb8b071767025a699a729b5997f03505ab959c773dde6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.captionfigure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Cone-shaped feasible region on x1-x2 axes: blue shading between the lines s1 = 0 (red, lower...","title_target":"Daerah layak berbentuk kerucut pada sumbu $x_1$--$x_2$: arsiran biru dibatasi oleh garis $s_1=0$ (merah, bawah), $s_3=0$ (jingga, atas), dan $s_2=0$ (hijau kebiruan, kiri atas); ketiga titik ekstrem ditandai dengan titik biru dan kotak merah.","unit_type":"figure"},{"canonical_native_record_sha256":"59f32c93f1001dc27db601067633962894216175efb912e2caaf8ab4d630fb3b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.captionfigure-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch05.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The same cone-shaped region between s1 = 0 and s3 = 0 with s2 = 0 above, shaded blue and marked...","title_target":"Daerah layak berbentuk kerucut yang sama di antara $s_1=0$ dan $s_3=0$, dengan garis $s_2=0$ di atasnya; daerah diarsir biru, dan titik ekstrem $(0,0)$, $(0,1)$, serta $(2,3)$ ditandai dengan titik biru dan kotak merah.","unit_type":"figure"},{"canonical_native_record_sha256":"6218d3fa015f83ee544927ba9526472d6b6220580b5a760d9334ce13f6f520d6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.captionfigure-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch05.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Recession cone plot: shaded blue cone between the lines s1 = 0 (red) and s3 = 0 (orange) with s2 =...","title_target":"Grafik kerucut resesi: kerucut biru berarsir berada di antara garis $s_1=0$ (merah) dan $s_3=0$ (jingga), sedangkan garis $s_2=0$ (hijau kebiruan) berada di atas kerucut dan garis normalisasi $x_1+x_2=1$ melintasinya.","unit_type":"figure"},{"canonical_native_record_sha256":"f0d2e8b3f23dcf10bb03cd79ca72837b90321e77dbf1f1b7c1f43a47da3767a5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.captionfigure-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch05.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The same recession cone between s1 = 0 and s3 = 0 with the line x1 + x2 = 1 crossing it, used to...","title_target":"Kerucut resesi yang sama di antara $s_1=0$ dan $s_3=0$, dengan garis $x_1+x_2=1$ yang memotongnya untuk membentuk ruas normalisasi tempat arah ekstrem ditentukan.","unit_type":"figure"},{"canonical_native_record_sha256":"c77e3d0e1dd5f0204ce46e715399568fcc0376684eb8b80ee519be7ad830a7fc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.captionfigure-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch05.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Zoomed view of the normalization segment: the line x1 + x2 = 1 crosses the shaded cone between s1 =...","title_target":"Tampilan ruas normalisasi yang diperbesar: garis $x_1+x_2=1$ memotong kerucut berarsir di antara $s_1=0$ dan $s_3=0$ pada titik ekstrem $(4/5,1/5)$ dan $(2/3,1/3)$, yang ditandai dengan titik biru dan kotak merah.","unit_type":"figure"},{"canonical_native_record_sha256":"a2826c576c1279857dca903e6a16e34cbf76e0e9f710f267e3c585fb8e8f584c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Graphically Solving Linear Programs","title_target":"Menyelesaikan Program Linier secara Grafis\\texorpdfstring{\\protect\\footnotemark}{}","unit_type":"chapter"},{"canonical_native_record_sha256":"f9ff583e6d37c4963cf9d6392dcbcca3f279cd349c311550fbdadf0535095fdd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.equation-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"f071f4afcad8e7b925be77b5671f72f85024909e138cbe5a905ca2fea6126bde","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.equation-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch05.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"b8ec734ac5a32461e4aa5f296a9e5f9a64478825d06f997bcdf3bb14d5e3057d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.equation-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch05.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"268bdc81863f40dfd04b464792f7f382502573cac612a52f949e2dead8b9b750","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.equation-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch05.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"2f0614a816a0c1e7f7b8ecb8d9e0b8b42dbfe52f0ebf8f528f69867e6d04d625","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.equation-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch05.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"c2c3927640d3a99f3ab1734fe5d4ff45b4489e8b542b1baf722d974cb25ed952","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Feasible Region Analysis","title_target":"Analisis Daerah Layak","unit_type":"exercise"},{"canonical_native_record_sha256":"3929ac60b48111fe3a633028f20fb399949e95a3a734a7926dbe967014e815a3","concept_ids":["concept.feasible-region","concept.graphical-lp-method"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Sketch Feasible Region","title_target":"Menggambar Daerah Layak","unit_type":"exercise"},{"canonical_native_record_sha256":"8b59cdd50ea0d7122cfc1438ee44416b8e27a92cff99bd589325b484fbf9c382","concept_ids":["concept.extreme-point-optimality","concept.graphical-lp-method"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Graphical Method 1 Practice","title_target":"Latihan Metode Grafis 1","unit_type":"exercise"},{"canonical_native_record_sha256":"d269b65be125c259df654468016b0cd3c411743daf116fd4b4a36569982d4e2f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Graphical Method for Lemonade Vendor","title_target":"Metode Grafis untuk Pedagang Limun","unit_type":"exercise"},{"canonical_native_record_sha256":"ce14a955c5c603c6b3a270d08ca3624fe22179e8ce1a083e1019b4b9903bb612","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Graphical Method","title_target":"Metode Grafis","unit_type":"exercise"},{"canonical_native_record_sha256":"79b2ceb62ac0b46005fa83f00ee8d89bb28639dc41253c9e4176bc388e7da2cf","concept_ids":["concept.infeasible-linear-program"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Infeasible Region Graph","title_target":"Grafik Daerah Tak Layak","unit_type":"exercise"},{"canonical_native_record_sha256":"8acf616499651d6bcb5e4625a42a4697a8259f65cb133229d01404964d139f72","concept_ids":["concept.extreme-point-optimality","concept.graphical-lp-method"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Determine Optimal Value","title_target":"Menentukan Nilai Optimal","unit_type":"exercise"},{"canonical_native_record_sha256":"7227b751c8a7157968835e96adbca01e0d8af1e9664f3c97462ec863e11db2c0","concept_ids":["concept.recession-direction","concept.unbounded-linear-program"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Show Unbounded Problem","title_target":"Menunjukkan Masalah Tak Berbatas","unit_type":"exercise"},{"canonical_native_record_sha256":"e731f450d3083fc34eb30be73a738010ecc6047ec9e9c654b79174f4bebc709d","concept_ids":["concept.recession-direction","concept.unbounded-linear-program"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Bounded Solution on Unbounded Region","title_target":"Berhingga atau Tak Berbatas?","unit_type":"exercise"},{"canonical_native_record_sha256":"117c63f787a09817a54fd4546aacd2bcea6f715337a4ee88296a3a0e35ec381c","concept_ids":["concept.diet-problem","concept.linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Diet Problem","title_target":"Masalah Diet","unit_type":"exercise"},{"canonical_native_record_sha256":"9eb9a7ea50a350fbdf75616e5bc8b561f443a54543761e3dc4c2af91584e3a36","concept_ids":["concept.extreme-point-optimality"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Why Must an Optimum Be at a Vertex?","title_target":"Mengapa Optimum Harus Berada pada Titik Ekstrem?","unit_type":"exercise"},{"canonical_native_record_sha256":"131e3e32ac791ddd7c9fa9bafc369d280463a2456d2103ccd23dec921b7a4a5b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Infinite Optimal Solutions","title_target":"Solusi Optimal Tak Terhingga Banyak","unit_type":"exercise"},{"canonical_native_record_sha256":"4104a80a4e0a3684afe3d7796a45691344d04f7438d8d5eb7834182abfd168ef","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Infinitely Many Optimal Solutions","title_target":"Tak Terhingga Banyak Solusi Optimal","unit_type":"exercise"},{"canonical_native_record_sha256":"ce8676a280def48282c8d00be5ff69647b917d6d1066b6ebee3c7e02f16b4c78","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-014","locale":"mul","order":14,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Bounded Optimum on Unbounded Region","title_target":"Optimum Terbatas pada Daerah Tak Berbatas","unit_type":"exercise"},{"canonical_native_record_sha256":"0e0ec89b316202f657951c23d9235af14d5ab741325a1dda12a83711ac3a2e2f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-015","locale":"mul","order":15,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Unbounded Objective Direction","title_target":"Arah Objektif Tak Berbatas","unit_type":"exercise"},{"canonical_native_record_sha256":"b7281ffbef2ec0397dc586dbf0683d1c8e0e5bb738e531c612782fa9d8981449","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-016","locale":"mul","order":16,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Bounded and Unbounded Optimization","title_target":"Optimisasi Terbatas dan Tak Berbatas","unit_type":"exercise"},{"canonical_native_record_sha256":"3e09f6bcf256eaa25cdf800b542e0cc5406f94c958c670e0ee22070243277927","concept_ids":["concept.alternate-optima","concept.extreme-point-optimality"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.ex-017","locale":"mul","order":17,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"From an Optimal Edge to a Unique Optimum","title_target":"Dari Sisi Optimal ke Optimum Tunggal","unit_type":"exercise"},{"canonical_native_record_sha256":"dd5126097db8eba51f25954a7f5f0de866f745ae9d9c04b95e368fd854857fa3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.example-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Furniture Workshop","title_target":"Bengkel Mebel","unit_type":"example"},{"canonical_native_record_sha256":"72fd1d07a964681095d4e1324d01f102b94aa97b893076ff3155b96a5a1462fd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.example-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch05.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Lemonade Vendor","title_target":"Pedagang Limun","unit_type":"example"},{"canonical_native_record_sha256":"46fd423d4ed72603fcf44f016564c5bbc6e22d67a7b6a04b4bfa83a1c3edf5d5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.example-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch05.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Furniture Workshop: Alternative Objective","title_target":"Bengkel Mebel: Objektif Alternatif","unit_type":"example"},{"canonical_native_record_sha256":"c6804046157a86ea5117fc24a2abfa3575996e8c617f9db02fe3204c66eed3ec","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.example-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch05.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Infeasible Problem","title_target":"Masalah Tak Layak","unit_type":"example"},{"canonical_native_record_sha256":"d3ac0a66ef4a0677b3b974fa459a29dbe2cbd393970ef3db9f3342298ac4df23","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.example-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch05.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Unbounded Problem","title_target":"Masalah Tak Berbatas","unit_type":"example"},{"canonical_native_record_sha256":"5a0305108876e50ab6b02e00e72e09f714bc36e1acf6541a17de455e83cb1aea","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.example-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch05.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Finite Optimum with Unbounded Feasible Region","title_target":"Optimum Hingga dengan Daerah Layak Tak Berbatas","unit_type":"example"},{"canonical_native_record_sha256":"04f608eae68092739b6039cced65a57b0789a9dd611943bb294153159dcf0110","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.figure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"6c59e2efb89a34884da38d209a0a613b63e9beb2bd7427bc44e55f43aa22e1df","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.figure-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch05.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"1bb3ab003f73747bdf917c1e5ae8c767d920634c537334c5122b47429f4c36cc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.figure-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch05.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"0f7309c7633e7c34f120f74edeea9718eb3c50b74bf5d71596b55ab8deec3f08","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.figure-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch05.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"bc745a84fe74e47ab5319aa17afa57a7629ccecd94809fa5ea980b90f5db6590","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.figure-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch05.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"c02897a62777648cc5b7dde8c34da8f8eca1b310fdba9093c33933a7aaf99c50","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.figure-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch05.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"65c1aad8d9911218de70f3b0ae167e7ff0b7c55e083c1610e039cf6fdc8e86b2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.figure-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch05.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"60bce1167dd70a4fcfadf7979f408aa13b0f429f8180bc069b3934b9ca66fde0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.figure-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch05.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"f3c40d9376d8a37427d7a2749a2115796ca87bfdb3f34824c4aa4802f663bff4","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.learningcheckpoint-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"a9ac736e26e84c5148990b22fdbe4264a781d570a940ffd408c01c48e44a525b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.outcome-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"949d2b89b7937c7e58de1d1a4361e1a32532032ac82a544028f687b9e162e392","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Nonempty and Bounded Problem","title_target":"Masalah Tak Kosong dan Terbatas","unit_type":"section"},{"canonical_native_record_sha256":"6fbd6923ed9ad9cfba47d32a43d5f41ee5d81f848b362735bfc536f0630bf980","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch05.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Graphical Approach","title_target":"Pendekatan Grafis","unit_type":"section"},{"canonical_native_record_sha256":"1c36e68e835aa120e0c26c9ca04dee07ac918b4a32f11c4c1a66d9688ceb89d3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch05.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Infinitely Many Optimal Solutions","title_target":"Tak Terhingga Banyak Solusi Optimal","unit_type":"section"},{"canonical_native_record_sha256":"a91c9f024ae0f4c765a82baca064e5ecf70ba233921441b56fcf546d396061c5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.section-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch05.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Problems with No Solution","title_target":"Masalah Tanpa Solusi","unit_type":"section"},{"canonical_native_record_sha256":"9ea71d20638d2d8bbe2d697492d8ef0dfe95bf7db6c4b4b9022b53f15a979f31","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.section-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch05.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Problems with Unbounded Feasible Regions","title_target":"Masalah dengan Daerah Layak Tak Berbatas","unit_type":"section"},{"canonical_native_record_sha256":"9663699631dd376a54e459cb4bc952327a300097e5ac656f6cc2fb59b732e26a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.section-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch05.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Exercises","title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"48aaec560692ea955f6ae34f66c4e29706878dfb532ddc6108b6e0bb353f047e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.section-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch05.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Extreme Directions","title_target":"Arah Ekstrem","unit_type":"section"},{"canonical_native_record_sha256":"abda865266588aac0bc222594955aa4470967a45f68e627e0516e99473bc5d18","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for fig:FurnitureWorkshopFeasibleRegion","title_target":"solution for fig:FurnitureWorkshopFeasibleRegion","unit_type":"solution"},{"canonical_native_record_sha256":"9cd2255a58753f49b2154708d630be121858b0a5bd9a361373926f0ddf294593","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch05.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for fig:LemonadeVendorFeasibleRegion","title_target":"solution for fig:LemonadeVendorFeasibleRegion","unit_type":"solution"},{"canonical_native_record_sha256":"7639c4a98a43d3be425f431d8bcbfcd7b0c2097ed6de60ff35293327cb5cdcc7","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch05.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"728e4ff678221221ebb87b398dad55c61e537eee30436eb13969ad8775c2d27a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch05.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for fig:LPInfeasible","title_target":"solution for fig:LPInfeasible","unit_type":"solution"},{"canonical_native_record_sha256":"a970711dc7768c4fd8ef679117550334d392169a26d5b8794c1745625e771d9c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch05.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"8e54e0b629c80bdb0b12c27df02debdca2741b24dce79fa2b36a76e3157cdf32","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch05.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for fig:LPUnboundFeasibleRegion1","title_target":"solution for fig:LPUnboundFeasibleRegion1","unit_type":"solution"},{"canonical_native_record_sha256":"f4b2f5fd4f8bb9653f3142549b8889bcb0fc3d98eabc0c6689035c35aed7b73a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch05.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"f3acc8c66edda04d943936f46f12e8f0671d4122b1ba7c4f51caf73b999d16a7","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch05.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:graphical-method-one","title_target":"solution for ex:graphical-method-one","unit_type":"solution"},{"canonical_native_record_sha256":"9fa20216db48867afbc08eaee4e7c49f384e26b47074ec0f89486f10db20b3e1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch05.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:infeasible","title_target":"solution for ex:infeasible","unit_type":"solution"},{"canonical_native_record_sha256":"30d3469a321597f5a478473354e7cce332351f940a3c8312663d53f0dd405545","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch05.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:feasible-region","title_target":"solution for ex:feasible-region","unit_type":"solution"},{"canonical_native_record_sha256":"3f2460ad42621608f16d5449521d1f1f09d7e33c07fbec2dd3619c6251156f8a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch05.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:lp-optimal-value","title_target":"solution for ex:lp-optimal-value","unit_type":"solution"},{"canonical_native_record_sha256":"a2014f53b3f2b47a5f03392588d95cf9a1ca89ab0741c62bb367b384aec42408","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch05.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:lp-unbounded","title_target":"solution for ex:lp-unbounded","unit_type":"solution"},{"canonical_native_record_sha256":"ff1e84f941291d3aff86ef84297d0511c951bc83518fdf0aeb6185ba2d452cc7","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.solution-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch05.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:lp-diet-problem","title_target":"solution for ex:lp-diet-problem","unit_type":"solution"},{"canonical_native_record_sha256":"c727a615be6328f3d40c7b957d8c504d54653fd276ccf5bfe216038ad4e7052c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.subsubsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Selected Solutions","title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"c56708a681aac7035caaf08c2fb6d4bb285d95d2f1360ebf6f7abf3252ac0386","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.table-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"d8cef53a88481c4c362d09721f3bfe909ba174dd1afb17acce4d3a3a6d0aac38","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch05.text.tryit-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch05.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"f3c5e55e78ea95a6fead11df19ef1083058ae887eb1c94c8b817e901a33dc38a","concept_ids":["concept.vector-operations","concept.linear-combination","concept.linear-independence","concept.matrix-rank","concept.corner-point","concept.convex-combination","concept.convex-set","concept.halfspace","concept.polyhedron","concept.representation-theorem","concept.recession-ray"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06","locale":"mul","order":8,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.linear-programming","concept.feasible-region","concept.extreme-point-optimality"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Formal Mathematical Statements","title_target":"Pernyataan Matematis Formal","unit_type":"chapter"},{"canonical_native_record_sha256":"fc00f12f82a39d415dcb0cfd95786c77be587646e19db762eda123f436dba703","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch06","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"f79c33f1efe0a04f7f6d1bcd7a43ee07213bdbd1acb79cfd10ae44dd5f8ecf9a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Vector Operations","title_target":"Operasi Vektor","unit_type":"solution"},{"canonical_native_record_sha256":"767390773e38aab7b579deb969c2c0642c6505871ad9991b2c2fcee936d004ea","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear and Convex Combinations","title_target":"Kombinasi Linier dan Konveks","unit_type":"solution"},{"canonical_native_record_sha256":"cd22a1aba26444f74b16195c5d4511a673453587568c01af539af39dc435f8f7","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear Independence and Matrix Rank","title_target":"Kebebasan Linier dan Rank Matriks","unit_type":"solution"},{"canonical_native_record_sha256":"02d4af739dabfa0cae26d03942460f8e3d890face2168e4a58bced682576fada","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convex or Not?","title_target":"Konveks atau Tidak?","unit_type":"solution"},{"canonical_native_record_sha256":"24280e741b63bf596cd99e1d663c2fcc67dba38ba7533e103fd03837146d7e43","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Writing an LP in Matrix Notation","title_target":"Menulis Program Linier dalam Notasi Matriks","unit_type":"solution"},{"canonical_native_record_sha256":"2861c322998a0fb5b1a1b452207e74872d91e1763e63681acfc13a1a1a0b2aad","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convex Combinations and Geometry","title_target":"Kombinasi Konveks dan Geometri","unit_type":"solution"},{"canonical_native_record_sha256":"2d79f51b48c7f22a7c3ec2509115e062fc60fb0a041d3cc561896d7e1e7917ba","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Halfspace Geometry and Convexity","title_target":"Geometri dan Konveksitas Setengah Ruang","unit_type":"solution"},{"canonical_native_record_sha256":"fce34028224cbddbbd10d62bbc92120fee36f502910a5f6a26970181e716f16f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Checking an Extreme Point","title_target":"Memeriksa Titik Ekstrem","unit_type":"solution"},{"canonical_native_record_sha256":"274c2c1ddc8fbb95183a1c7cf888762415f7e35b7a3da3fff77dc970c674987b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A Convex Combination of Extreme Points","title_target":"Kombinasi Konveks Titik-Titik Ekstrem","unit_type":"solution"},{"canonical_native_record_sha256":"e2df5e2f9a6a7a663f8bc91240bcd571776c5aaeeba5f9c4b5fc45ddfd831853","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Is the Union of Convex Sets Convex?","title_target":"Apakah Gabungan Himpunan Konveks Bersifat Konveks?","unit_type":"solution"},{"canonical_native_record_sha256":"0faccd6f431ce860272eab71a84d03a6e90ee53c593f0ba049441eb0c81ef6b2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Where Boundedness Enters the Vertex Theorem","title_target":"Letak Penggunaan Keterbatasan dalam Teorema Titik Sudut","unit_type":"solution"},{"canonical_native_record_sha256":"4e80f3230ccf10ba9cf412cad41d31427c338ce74d618a6235abfca9781f8323","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.manualsolution-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch06.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Intersections of Arbitrary Families of Convex Sets","title_target":"Irisan Keluarga Himpunan Konveks Sembarang","unit_type":"solution"},{"canonical_native_record_sha256":"aa646c2413579b4a18515c27f731069eb7afed035151b3a6a198200deea183f8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.solutions-manual.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Chapter 6: Formal Mathematical Statements","title_target":"Bab 6: Pernyataan Matematis Formal","unit_type":"section"},{"canonical_native_record_sha256":"a4fb105ef676a4eede3216af31894fdf0366d5d6f9e6f8629b2f5a2283e7144c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"d37e1d5221e0bd26b6fd3cc82068138925176f1b9aa9068b4471aa3d6da35b8e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.captionfigure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A number line showing that the objective value at z lies between the objective values at x and y.","title_target":"Garis bilangan yang menunjukkan bahwa nilai objektif pada z terletak di antara nilai objektif pada x dan y.","unit_type":"figure"},{"canonical_native_record_sha256":"f3fcb2af20394efff37d37a85b7e60ee4460efe1ad6d05d54e7233e520b709ef","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.captionfigure-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch06.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Two-dimensional plot of a quadrilateral polytope with vertices (0,0), (1,2), (3,2), (4,0).","title_target":"Gambar dua dimensi politop segi empat dengan titik sudut (0,0), (1,2), (3,2), (4,0).","unit_type":"figure"},{"canonical_native_record_sha256":"297f810f579831466acd1a7b0c1eca996361416f61d333a0612de602c2ccec3d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.captionfigure-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch06.text.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Feasible region with the lines s1=0, s2=0, s3=0 marking where each slack variable vanishes; basic...","title_target":"Daerah layak dengan garis s1=0, s2=0, dan s3=0 yang menandai tempat setiap variabel kelonggaran bernilai nol; solusi dasar ditandai oleh titik biru dan kotak merah.","unit_type":"figure"},{"canonical_native_record_sha256":"b9676eed771c4111f8c69c7483e13ed3b0813c10fbda2829a5c976bbb043d73c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Formal Mathematical Statements","title_target":"Pernyataan Matematis Formal","unit_type":"chapter"},{"canonical_native_record_sha256":"92042f0f1470b6ef8c47081095bc2aace678d4d0f66107cec1285e11353dc23a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.definition-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear Independence","title_target":"Kebebasan Linier","unit_type":"definition"},{"canonical_native_record_sha256":"bceaabee460417f0f5a95e3688675efcf4741ccf816f3a0589220fd93ca32c11","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.definition-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch06.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear Independence of Rows or Columns","title_target":"Kebebasan Linier Baris atau Kolom","unit_type":"definition"},{"canonical_native_record_sha256":"7dceb03b0aa8902514fc8b986f8f5bb03dd373e45b8714156b3c7b09a3cb9006","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.definition-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch06.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Rank of a Matrix","title_target":"Rank Matriks","unit_type":"definition"},{"canonical_native_record_sha256":"701fbe49423b686c4e994644f7d317db78d068572167ee3e58402d633d0badb7","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.definition-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch06.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linearly Independent Constraints","title_target":"Kendala yang Bebas Linier","unit_type":"definition"},{"canonical_native_record_sha256":"30233c26a70ed3c305423a370ef82b6eb71663baaf58932c8c5afcbf63840661","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.definition-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch06.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Vertex","title_target":"Titik Sudut","unit_type":"definition"},{"canonical_native_record_sha256":"febaab70be1e8a138a69b648331539596f4e69e41720557feba5dde718b4be85","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.definition-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch06.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convex Combination","title_target":"Kombinasi Konveks","unit_type":"definition"},{"canonical_native_record_sha256":"59399beae54c1111c0a5cbe9f75916d0e1563b4aea8a27996e0503c479240e6b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.definition-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch06.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convex Set","title_target":"Himpunan Konveks","unit_type":"definition"},{"canonical_native_record_sha256":"b29fd66475352c1a93de99243566337b91a7e99ef6296a5c9d6af562e11290ad","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Vector Operations","title_target":"Operasi Vektor","unit_type":"exercise"},{"canonical_native_record_sha256":"dc100f68b66a90c6b74086431834a01f758e5bb2eeb7b634dc234798ff5c8643","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear and Convex Combinations","title_target":"Kombinasi Linier dan Konveks","unit_type":"exercise"},{"canonical_native_record_sha256":"2c6cf6b287d14ec7fd235008a2694a879216d93d11f743d9e061a4903bd5491a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear Independence and Matrix Rank","title_target":"Kebebasan Linier dan Rank Matriks","unit_type":"exercise"},{"canonical_native_record_sha256":"6f6c28e5c4ef0151da5d0c8da8b29d5871332202075075b31867fdf3ce6f544d","concept_ids":["concept.convex-combination","concept.convex-set"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convex or Not?","title_target":"Konveks atau Tidak?","unit_type":"exercise"},{"canonical_native_record_sha256":"efae6afa605ce337c8552a65151b3bbbf9b1c78dbd5c4ab3f5d08af9feadfbeb","concept_ids":["concept.linear-programming","concept.matrix-rank"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Writing an LP in Matrix Notation","title_target":"Menulis Program Linier dalam Notasi Matriks","unit_type":"exercise"},{"canonical_native_record_sha256":"cc5729f596bc5727ea01f91e881f82cd2eaf903989e05f2059208de35f0fd7cb","concept_ids":["concept.convex-combination","concept.convex-set"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convex Combinations and Geometry","title_target":"Kombinasi Konveks dan Geometri","unit_type":"exercise"},{"canonical_native_record_sha256":"e34b1b18fb5f4196d0823475f4c8930edad0b466086d016756e3ca8736835c3b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Halfspace Geometry and Convexity","title_target":"Geometri dan Konveksitas Setengah Ruang","unit_type":"exercise"},{"canonical_native_record_sha256":"4f355e639555a164f562398df3fce4cbd35092cbb0d01fe16c1863df5c3acbcb","concept_ids":["concept.corner-point","concept.extreme-point-optimality"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Checking an Extreme Point","title_target":"Memeriksa Titik Ekstrem","unit_type":"exercise"},{"canonical_native_record_sha256":"9a1321b2f7f4a5c549d4fc7bb6ea0838ede232efd61921be11bf35505ccc386b","concept_ids":["concept.convex-combination","concept.representation-theorem"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A Convex Combination of Extreme Points","title_target":"Kombinasi Konveks Titik-Titik Ekstrem","unit_type":"exercise"},{"canonical_native_record_sha256":"1eae4385180242f2f9503e445e7ea7c5a264a58f0454d88e01900ee763a06eab","concept_ids":["concept.convex-set"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Is the Union of Convex Sets Convex?","title_target":"Apakah Gabungan Himpunan Konveks Bersifat Konveks?","unit_type":"exercise"},{"canonical_native_record_sha256":"a87bd30eb2162353024b027f0f4c933d9970dca184c1350147dfc67a8d9762e4","concept_ids":["concept.extreme-point-optimality","concept.polyhedron"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Where Boundedness Enters the Vertex Theorem","title_target":"Letak Penggunaan Keterbatasan dalam Teorema Titik Sudut","unit_type":"exercise"},{"canonical_native_record_sha256":"0fda48bc09cb5ed8892e9d79eb4b3fd8ceacf0470e2085a887af6b68edd954b4","concept_ids":["concept.convex-set","concept.halfspace"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.ex-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Intersections of Arbitrary Families of Convex Sets","title_target":"Irisan Keluarga Himpunan Konveks Sembarang","unit_type":"exercise"},{"canonical_native_record_sha256":"39e0df731351787aa04320b6f46d34a4ae210378ee7bbcaf52b75ed6418f0bf9","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.figure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"0991e3ff69705b0a467631e7f4f5235a8e67a56b13568a502f5ab432619695ec","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.figure-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch06.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"7a3aba7b25f8e0dd9725afd1cf6594bd92d7b1cf34f0048933e3a1562bc8143d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.figure-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch06.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"3dc1263c9ffe9cd47967a515101daaf29688289514f2dcb4890ebe6434ad0e15","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.figure-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch06.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"5f6002322ebb495670f9a41342c8120f3a5821e26d9e1ca1205c4124f692a3e5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.outcome-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"89f754f7b69b8905964c47909da562c74a39dc2d62de7aae47b4c17cabcf5117","concept_ids":["concept.linear-combination","concept.linear-independence","concept.matrix-rank","concept.vector-operations"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Mathematical Preliminaries","title_target":"Dasar-Dasar Matematika","unit_type":"section"},{"canonical_native_record_sha256":"61901ab79b9dd8c6e2a3f3ec250099a9e99d05d56a6cd71cf712345948aa3868","concept_ids":["concept.corner-point","concept.extreme-point-optimality","concept.linear-independence"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch06.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Algebraic Proof - Exists Optimal Solution at a Vertex","title_target":"Bukti Aljabar -- Solusi Optimal Ada pada Titik Sudut","unit_type":"section"},{"canonical_native_record_sha256":"654afa2d4fe1e7f08f95c2c219043611893b84b941b3e08cabe2bff1e3cb28ec","concept_ids":["concept.convex-combination","concept.convex-set","concept.halfspace","concept.polyhedron"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch06.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convexity","title_target":"Konveksitas","unit_type":"section"},{"canonical_native_record_sha256":"1814ee069cf3f99673e4e1f3db17d0f9266b0581e4dbbab95ba9a5038bc7d332","concept_ids":["concept.vector-operations"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.section-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch06.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Exercises","title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"9ee6d59e754272a1d841a3bde7cc588bbc6ebdee3d58233e23eabdffa754f5e1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.solution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:vector-operations","title_target":"solution for ex:vector-operations","unit_type":"solution"},{"canonical_native_record_sha256":"7644b03359c2799a08ea129028f45a3ce8bcfef71a1371131dd95ae71898411f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.solution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch06.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:convex-combo-triangle","title_target":"solution for ex:convex-combo-triangle","unit_type":"solution"},{"canonical_native_record_sha256":"f868af07bd2c4761be3acb1f9e3ac9430266026283cebdb2deb6f6bcb1c55733","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.solution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch06.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:rep-theorem-combo","title_target":"solution for ex:rep-theorem-combo","unit_type":"solution"},{"canonical_native_record_sha256":"bda9f7c9d26e7e1bbf157ee697b38423dd66c73a3b2846664006d1a912801cb4","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.solution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch06.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:union-convex","title_target":"solution for ex:union-convex","unit_type":"solution"},{"canonical_native_record_sha256":"e64d0d95309644197941194aff85d2833f45b1806601dc3de76ff3c79497e8d6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.subsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Vectors and Their Properties","title_target":"Vektor dan Sifat-Sifatnya","unit_type":"subsection"},{"canonical_native_record_sha256":"70184db4928af62a11396f530cd7329e9026bfd6354679022ee368bfd4189a21","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.subsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch06.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Linear Combinations and Related Concepts","title_target":"Kombinasi Linier dan Konsep Terkait","unit_type":"subsection"},{"canonical_native_record_sha256":"21e721fcd30e854a8f93f859ff4e69a3cf593ad3caba26a4a39e56d55615ccae","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.subsection-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch06.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convex Sets","title_target":"Himpunan Konveks","unit_type":"subsection"},{"canonical_native_record_sha256":"6260b7496bf1b0f6ee77c81680fc2af6c11f2da816d542bdd361ec3e16b421fa","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.subsection-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch06.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Unbounded Sets and Rays","title_target":"Himpunan Tak Berbatas dan Sinar","unit_type":"subsection"},{"canonical_native_record_sha256":"216cdaf11bb99de5ebeba0495f4e97ad227186aec1f77541e930d85d88b04959","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch06.text.subsubsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch06.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Selected Solutions","title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"02b02aefb831f52884f71fc1c9f24fa72fdda7efb1be32691625c7a2d111aca0","concept_ids":["concept.standard-form","concept.basic-feasible-solution","concept.canonical-form","concept.pivot-operation","concept.simplex-algorithm","concept.phase-one","concept.artificial-variable","concept.big-m-method","concept.degeneracy","concept.cycling","concept.bland-rule","concept.unbounded-simplex"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07","locale":"mul","order":9,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.linear-programming","concept.linear-independence","concept.matrix-rank","concept.corner-point"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Simplex Method","title_target":"Metode Simpleks","unit_type":"chapter"},{"canonical_native_record_sha256":"8f3585d0e016438e1bc67034be2cb40f7f15b452668658a2c94a8b2c7655329b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"9f3337923757075d576fdc2bde7d50434d87966a3675536a5ef0a9e9007885d6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Standard form and the first dictionary","title_target":"Bentuk standar dan kamus pertama","unit_type":"solution"},{"canonical_native_record_sha256":"a39ce11ed0e01d920c0b3b346fbda9fc172a8ca06533c33173c2d4c21a463198","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convert to Standard Form","title_target":"Mengonversi ke Bentuk Standar","unit_type":"solution"},{"canonical_native_record_sha256":"63fffb154a19c777130e08975db08f21dd8915d4309730acb4771a0fc0b6ebd3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convert to Standard Form","title_target":"Mengonversi ke Bentuk Standar","unit_type":"solution"},{"canonical_native_record_sha256":"f0b2e3275152172517628374e59f1f66df3a4a828721e993590ced325f224b7e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convert to Standard Form","title_target":"Mengonversi ke Bentuk Standar","unit_type":"solution"},{"canonical_native_record_sha256":"2677b61b7580c027156fbdffdfdf3345b039ec94d76cc15460bab3bdf8c78ce9","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convert to Standard Form","title_target":"Mengonversi ke Bentuk Standar","unit_type":"solution"},{"canonical_native_record_sha256":"59b897ffc5c4af98c5ab5f34f786e2bf501e1938f2b93421a2653722382610f1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convert to Standard Form","title_target":"Mengonversi ke Bentuk Standar","unit_type":"solution"},{"canonical_native_record_sha256":"ef46c87d15dd90f1888a466f6dcbcea3f817bdacd5a0d5473fb0acaccb1d048c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Pivoting in a different direction","title_target":"Pivot ke arah yang berbeda","unit_type":"solution"},{"canonical_native_record_sha256":"4e5be1b354ac777dc38cfc690d0985656e4e969de835094ff230569d476d8628","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice","title_target":"Latihan Metode Simpleks","unit_type":"solution"},{"canonical_native_record_sha256":"56f4c724d42b540f2e25320f6c92903d478edbf716069570e4441fb08c62243d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice","title_target":"Latihan Metode Simpleks","unit_type":"solution"},{"canonical_native_record_sha256":"0f630169a206b238a07d99e9c0e4523fced6ad9943686b879221e273adf2df1e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice","title_target":"Latihan Metode Simpleks","unit_type":"solution"},{"canonical_native_record_sha256":"783df1a714579100ce2357b6065ff0e22380bdf842171eb7902f996c11cfa748","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice","title_target":"Latihan Metode Simpleks","unit_type":"solution"},{"canonical_native_record_sha256":"168bb3e2636751087a18d05cb7765000378dfcf836d41a88f4d5a623f09b78f7","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice (Big-M)","title_target":"Latihan Metode Simpleks (Big-M)","unit_type":"solution"},{"canonical_native_record_sha256":"91b425e80ecd09195cc6e1a73049439e02316b39ed5b80f18998092433f90249","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice (Big-M)","title_target":"Latihan Metode Simpleks (Big-M)","unit_type":"solution"},{"canonical_native_record_sha256":"5c52f6643999c1928a4e2e9b18ebc462c19d52229e0a1285da52c2c7a29e8849","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-014","locale":"mul","order":14,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Dictionary Optimality","title_target":"Optimalitas Kamus","unit_type":"solution"},{"canonical_native_record_sha256":"1a833221c69efa66d1b92881c3b3a0fae8ce50d6d1591ae488624bfa8d6f2a30","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-015","locale":"mul","order":15,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Basic Feasible Solutions","title_target":"Solusi Basis Layak","unit_type":"solution"},{"canonical_native_record_sha256":"b7ed1693dc15b2937ca721837e1db0d3eab6470bfc837fe1272000e0af151721","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-016","locale":"mul","order":16,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"What the ratio test protects","title_target":"Apa yang dilindungi oleh uji rasio","unit_type":"solution"},{"canonical_native_record_sha256":"4efd1a9b9d49f3a1d5af1b5f291b2c7e8a8e7b109ef7d2c2900746a143c502c0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.manualsolution-017","locale":"mul","order":17,"parent_id":"unit.r017.book1.ch07.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A tie in the ratio test forces degeneracy","title_target":"Hasil imbang dalam uji rasio memaksa degenerasi","unit_type":"solution"},{"canonical_native_record_sha256":"45b7e3419827f78bdd619705172866cd77300b801d0adc2391c878b402628af1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.solutions-manual.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Chapter 7: Simplex Method","title_target":"Bab 7: Metode Simpleks","unit_type":"section"},{"canonical_native_record_sha256":"aa3df951a8cb2fd23efbd660722aba38c1be0b72affe4a9f7ab11a78f1072fa8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"629ce4281db348ce08e24b6a82ad3a8e201c0784aa55a0cc7d7411f0c1c0295b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.captionfigure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"When can you use canonical form?","title_target":"Kapan bentuk kanonik dapat digunakan?","unit_type":"figure"},{"canonical_native_record_sha256":"1e6e1845899feab4b13a47e87e711f6ce857c87c9eb5b32d0cd4a17d002c1525","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.captionfigure-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.subsection-014","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The feasible region with the basis and objective value at every vertex; the simplex path leads to...","title_target":"Daerah layak dengan basis dan nilai fungsi objektif pada setiap titik sudut; panah menunjukkan dua lintasan pivot yang menuju titik optimal $(4,5)$.","unit_type":"figure"},{"canonical_native_record_sha256":"59fb9eabff35ebbbcb5136096696e06c8d369d70167723636490dcf018f5505d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.captionfigure-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Feasible region after adding the constraint 2x+y>=5: the pink triangle near the origin becomes infeasible.","title_target":"Daerah layak setelah menambahkan kendala \\(2x+y\\ge 5\\): segitiga merah muda di dekat titik asal menjadi tidak layak.","unit_type":"figure"},{"canonical_native_record_sha256":"a4f848963031e9d49cfb0266947910fafa2a734e6359382bce657f6ac0d6d92c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.captionfigure-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch07.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Desmos plot of the feasible region defined by x1-x2<=1, 2x1-x2<=3, x1,x2>=0: an unbounded region...","title_target":"Plot Desmos dari daerah layak yang didefinisikan oleh x1-x2<=1, 2x1-x2<=3, x1,x2>=0: suatu daerah tak terbatas...","unit_type":"figure"},{"canonical_native_record_sha256":"a52f6780e2b4b90b3631d50f7c4c0cb1b0918cbf5a979012f21d81ee263043e1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.captionfigure-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Desmos graph of a 2-variable LP feasible region with vertices labeled A, B, C, D used to identify...","title_target":"Grafik Desmos dari daerah layak PL 2 variabel dengan titik sudut berlabel A, B, C, D, yang digunakan untuk mengidentifikasi...","unit_type":"figure"},{"canonical_native_record_sha256":"7d3d72df4df041a0c4a68de89b0e519e8b3d97809348958dc87a150d3900bed9","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method","title_target":"Metode Simpleks","unit_type":"chapter"},{"canonical_native_record_sha256":"2f8a6a3db6a7a0ce84bf054dbaf05678550f84f448602eeb17949672a857a233","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.definition-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Standard Form","title_target":"Bentuk Standar","unit_type":"definition"},{"canonical_native_record_sha256":"f26dea5ddee6ef046c8f4428d3bbcf12dd8fef88d1458655864ecc5ea29caf9d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.definition-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Basic Feasible Solution","title_target":"Solusi Basis Layak","unit_type":"definition"},{"canonical_native_record_sha256":"68d7602c450167269ca975f9dab458faba24e2233ec593fc0b9c40b0af269bc1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.definition-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Canonical Form of a Linear Program","title_target":"Bentuk Kanonik Program Linier","unit_type":"definition"},{"canonical_native_record_sha256":"4b18dcf9f933b1677eb819bdb4fb79d7e0e52e929973264d9922988a2960afef","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.definition-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch07.text.subsection-014","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reduced Costs in an Arbitrary Dictionary","title_target":"Biaya Tereduksi dalam Kamus Sembarang","unit_type":"definition"},{"canonical_native_record_sha256":"91b7a137531bb5c0706303b260ad5828a782e3abc3237287c1a42e17928043d5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.definition-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch07.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Degeneracy","title_target":"Degenerasi","unit_type":"definition"},{"canonical_native_record_sha256":"9df517dbc3a861ce68e02025826575a3ae22821034bb26b57bcf601f493922ce","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Standard form and the first dictionary","title_target":"Bentuk standar dan kamus pertama","unit_type":"exercise"},{"canonical_native_record_sha256":"1ad80b45700cc57d114dfd9e1a8f5984d4a8918078d23f2ce6bf54c6628b1a20","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convert to Standard Form","title_target":"Mengonversi ke Bentuk Standar","unit_type":"exercise"},{"canonical_native_record_sha256":"6af864cc7ff6a6debfe85abbf95fe2d40d58c63e9e6b9ed4c7b6db66f7e8716e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convert to Standard Form","title_target":"Mengonversi ke Bentuk Standar","unit_type":"exercise"},{"canonical_native_record_sha256":"9bb733364fdaf281ae36c8f9f0ecda77929bae8195f5bba046b5af865bf7dbb3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convert to Standard Form","title_target":"Mengonversi ke Bentuk Standar","unit_type":"exercise"},{"canonical_native_record_sha256":"23e97bcf5ad18529a5c979858a639eec5506bd4276801de7139e0e5e249d424b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convert to Standard Form","title_target":"Mengonversi ke Bentuk Standar","unit_type":"exercise"},{"canonical_native_record_sha256":"120590a56a319c3dbd8c894c34b86e50db1cefb4fb571fcece752b3d7406eb11","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convert to Standard Form","title_target":"Mengonversi ke Bentuk Standar","unit_type":"exercise"},{"canonical_native_record_sha256":"9fde8d7448b189cf11c81965cc7c287d8db51742aa3a60e2b483d50e1076123d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Pivoting in a different direction","title_target":"Pivot ke arah yang berbeda","unit_type":"exercise"},{"canonical_native_record_sha256":"0f59e057ad7ad9874b994b91a002e1beaea8d0d166db000a48535212d1c0acad","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice","title_target":"Latihan Metode Simpleks","unit_type":"exercise"},{"canonical_native_record_sha256":"3acdb05e6549f905ff181b0fa558277f55dfcf1b92a6bb0707bc93c25329bb25","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice","title_target":"Latihan Metode Simpleks","unit_type":"exercise"},{"canonical_native_record_sha256":"76ece92b32aaf469e274fe43757aa208e11d9a02b5e1e2a8cafc9979862cf795","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice","title_target":"Latihan Metode Simpleks","unit_type":"exercise"},{"canonical_native_record_sha256":"edc789c8da3cf18fb92c489595fd10c42cf71ea98d63002b5967e51b925cbcce","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice","title_target":"Latihan Metode Simpleks","unit_type":"exercise"},{"canonical_native_record_sha256":"0fb4c6aae2367ab5ed2d70134851ddba74064bf7d71c4e58143092d40e376a2c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice","title_target":"Latihan Metode Simpleks","unit_type":"exercise"},{"canonical_native_record_sha256":"f0afb12d420cacf3329e140e6d997d1845b82cd6c804737986410bf151fb4bdc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method Practice","title_target":"Latihan Metode Simpleks","unit_type":"exercise"},{"canonical_native_record_sha256":"e7b825f40e477806dc21b525f6f41a5f474b56f6d9e13e494c8f6ce6c5c79b19","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-014","locale":"mul","order":14,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Dictionary Optimality","title_target":"Optimalitas Kamus","unit_type":"exercise"},{"canonical_native_record_sha256":"b791acdcb8d0c828ff182c6ead76f85362f4d8a822c756f22f90856ce706c01d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-015","locale":"mul","order":15,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Basic Feasible Solutions","title_target":"Solusi Basis Layak","unit_type":"exercise"},{"canonical_native_record_sha256":"4ec1b31fdcda6701244970369b47558aae33f6b4f70115bfefb4cb07b5a1bd85","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-016","locale":"mul","order":16,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"What the ratio test protects","title_target":"Apa yang dilindungi oleh uji rasio","unit_type":"exercise"},{"canonical_native_record_sha256":"9024ae2846fe59d1d352194cdc14682609623092d3fa94f9db6edc6790833318","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.ex-017","locale":"mul","order":17,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A tie in the ratio test forces degeneracy","title_target":"Hasil imbang dalam uji rasio memaksa degenerasi","unit_type":"exercise"},{"canonical_native_record_sha256":"c3a31c0f5f6503d94c48d5033e484b0ead837dc5276164d00ca5db8aab84b2ef","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.example-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Convert Min to Max","title_target":"Mengonversi Min ke Maks","unit_type":"example"},{"canonical_native_record_sha256":"73581ef9a965b652be5a5224f79ca5e2d3bf2f828448125c0d4663a7601ff8e3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.example-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.subsubsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Slack Variable for \\(\\leq\\)","title_target":"Variabel Slack untuk \\(\\leq\\)","unit_type":"example"},{"canonical_native_record_sha256":"ca20d4919e7196b39a020eaf8ce57d99cd3a40fa7ebcc5c66d64925418a21714","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.example-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.text.subsubsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Surplus Variable for \\(\\geq\\)","title_target":"Variabel Surplus untuk \\(\\geq\\)","unit_type":"example"},{"canonical_native_record_sha256":"89088c1a0fc02cc5dfc940cefb7b6bf4dac92b80969089412294a6eb2dc8da2b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.example-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch07.text.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Rename and Negate for \\(\\leq 0\\)","title_target":"Mengganti Nama dan Menegasikan untuk \\(\\leq 0\\)","unit_type":"example"},{"canonical_native_record_sha256":"d1db2fcc9f0f9261ec901250920935f8ec23ba3ad6f61141093952b2defce952","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.example-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch07.text.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Unrestricted Variable to Two Variables","title_target":"Variabel Bebas Menjadi Dua Variabel","unit_type":"example"},{"canonical_native_record_sha256":"2711373e144d020bc9cc5c7d2e4164c61dfdfb21df7dcd0f20eea6a95668f61a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.example-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch07.text.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Complete Conversion to Standard Form","title_target":"Konversi Lengkap ke Bentuk Standar","unit_type":"example"},{"canonical_native_record_sha256":"6c69d88abf1feb283966e0247cf527c405d1fc89c5e42d23ab10bd6052983d10","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.example-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch07.text.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Transformation Preserves Solution Meaning","title_target":"Transformasi Mempertahankan Makna Solusi","unit_type":"example"},{"canonical_native_record_sha256":"9c20bddb925610c086c8ea46df64dbed0c5c93b659cc19b431950bf6d10f0039","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.example-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch07.text.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Example Continued","title_target":"Lanjutan Contoh","unit_type":"example"},{"canonical_native_record_sha256":"901535eb13d47c3a6548296e9e418631474ffce3833b8512b672479dc8e86dee","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.example-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch07.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Basic Feasible Solution","title_target":"Solusi Basis Layak","unit_type":"example"},{"canonical_native_record_sha256":"7d2f80786ae67389ceeb3fcfab44644bebe907412f66181124fac89b87c2d015","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.example-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch07.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Canonical Form from Slack Variables","title_target":"Bentuk Kanonik dari Variabel Slack","unit_type":"example"},{"canonical_native_record_sha256":"f7a24fc4a3dfcb91cf7c5017a08e8fdaddebb15ad8bec6f5c768c16e948e30bd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.example-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch07.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Unbounded Linear Program","title_target":"Program Linier Tak Terbatas","unit_type":"example"},{"canonical_native_record_sha256":"f09efb9a4bb2bf5be621c4bf5e50a42933bfcbc6d92af0517a5d45356eb05db2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.figure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.subsubsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"36ff2c31c18e47056748586a6879e72deb3069505d84c64918bef38c422bddc5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.figure-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"3162d0a99343045b19a5534742396520e229c5926a33812cf47420637ed9de06","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.figure-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.text.subsection-013","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"546d3d6482e1070053778fbf07fbd82e6787acddd77feedebbc14a3394480ebc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.learningcheckpoint-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"ff9d7acf7ae4e29076412e685df59d1d43dfb45ccf853d0859b3689094234d71","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.learningcheckpoint-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"ec7f5ce949bbc25db69763d2f6d5b10868e19ed00854ddc17de00c5c79928afd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.learningcheckpoint-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"f9caedf4c5ff4328f28882223627b1d52b45ef8fe14e492795a76aa9632bc587","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.outcome-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"fbfaf9edd024cc3b584e2a77a55d9e4fbb3bf96112e031df5dddcab9c02a38d1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.outcome-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"1a6cd43be554858c7f1f796d123ac322215ec00c6e13f223eda771a56097e4e3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.outcome-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"bc82196ebc3081ffdb8c5f334e7579f41f3076cb2c584d035fd186d792575356","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Standard Form","title_target":"Bentuk Standar","unit_type":"section"},{"canonical_native_record_sha256":"b1d8cc2ae6c76c5d3a5d7057f028bdd1a9e99aa9fcd87e694dcac64db50bf4f6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Canonical Form","title_target":"Bentuk Kanonik","unit_type":"section"},{"canonical_native_record_sha256":"673722677667f4fc718cd1eac3c5b0c014f14cef8862cef1414c77c55f7c2d79","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Pivoting and the Simplex Algorithm","title_target":"Pivot dan Algoritma Simpleks","unit_type":"section"},{"canonical_native_record_sha256":"3e4e879bd55f1bf127461d68ad90b474aaae6c56e0b09ed633ce9fbc0066fdb4","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.section-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch07.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Simplex Algorithm!","title_target":"Algoritma Simpleks!","unit_type":"section"},{"canonical_native_record_sha256":"a729c3f41794993e8a331f563d8f79d04f249eb768f9198e1116352cc0fe06e4","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.section-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch07.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"No Feasible Initial Basis and the Big-M Method","title_target":"Tidak Ada Basis Awal yang Layak dan Metode Big-M","unit_type":"section"},{"canonical_native_record_sha256":"76175287e5f87b1218e21761444076e9ca178d22855fc50e25addfa218227bfc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.section-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch07.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Degeneracy, Cycling, and Bland's Rule","title_target":"Degenerasi, Siklus, dan Aturan Bland","unit_type":"section"},{"canonical_native_record_sha256":"976bffb191937965d7f5b4ffbe61087cf8734dd02c573f28217bbd570690dbef","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.section-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch07.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Cycling in the Simplex Method","title_target":"Siklus dalam Metode Simpleks","unit_type":"section"},{"canonical_native_record_sha256":"c39f79d5a5dad29b19cf08fbb089459256d7d75d32c4cdaa5c26c76f4b546c9a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.section-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch07.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex and Unbounded LPs","title_target":"Simpleks dan PL Tak Terbatas","unit_type":"section"},{"canonical_native_record_sha256":"60ea5742338dfe6e82dfda884937402e0ff22398262e6a905ddb22765bbe5940","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.section-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch07.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Exercises","title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"33e599a9a46512e326fec7a2aee7533724a6525a1316c7ffaacfea306f6f6cca","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.solution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.subsubsection-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:84","title_target":"solution for ex:84","unit_type":"solution"},{"canonical_native_record_sha256":"08f28d26ee98e1eb66c1c2409653dce9749c7727024196563fb7838a70e9b43d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.solution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.subsubsection-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:85","title_target":"solution for ex:85","unit_type":"solution"},{"canonical_native_record_sha256":"44051c827a180eacbaf38117afe50ac8d96ee871f7b0fcfd73be37e5b9d424e3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.solution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.text.subsubsection-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:alternative-pivot","title_target":"solution for ex:alternative-pivot","unit_type":"solution"},{"canonical_native_record_sha256":"9c3949d5a7281cf9489b9bf068bcbf84b2b7039b5f082cff41e39353906fbe6f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.solution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch07.text.subsubsection-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:simplex-practice-5-3","title_target":"solution for ex:simplex-practice-5-3","unit_type":"solution"},{"canonical_native_record_sha256":"df92f9306c53bce00b029ae4d3926b20803bfc1f0feca83e4df496c14cc6c0aa","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.solution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch07.text.subsubsection-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:simplex-practice-5-8","title_target":"solution for ex:simplex-practice-5-8","unit_type":"solution"},{"canonical_native_record_sha256":"ecadeb61db0d4a9039a106bce900c267f660962c414093829e0e54c7fee31e82","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.solution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch07.text.subsubsection-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:dictionary-optimality-conditions","title_target":"solution for ex:dictionary-optimality-conditions","unit_type":"solution"},{"canonical_native_record_sha256":"ce8bf076b75c5193fab0fa43b65a89b75175be502d22f7ed600c55722d75d2c5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.solution-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch07.text.subsubsection-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:degenerate-tie","title_target":"solution for ex:degenerate-tie","unit_type":"solution"},{"canonical_native_record_sha256":"617194c9d9719ee3d63595cb4ec78d71c12fa339f2db00aeda41cb4fe47f7e72","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Converting to Standard Form","title_target":"Mengonversi ke Bentuk Standar","unit_type":"subsection"},{"canonical_native_record_sha256":"e276856c37964aff32d47bc4e394e3322bbb03ac3d46e9ea4a788e109c0e060c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Basic Feasible Solutions for Standard Form","title_target":"Solusi Basis Layak untuk Bentuk Standar","unit_type":"subsection"},{"canonical_native_record_sha256":"68f4deab2ee9ebc0cc2c9e9144780b90b8b7fc87d4add823281272eed451c203","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Augmenting system and Phase 1","title_target":"Sistem augmentasi dan Fase 1","unit_type":"subsection"},{"canonical_native_record_sha256":"6913e7b39eba442abfb11a54b1e04aee127ebd32d5c712567562794ea58554c0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Transforming the LP to Standard Form","title_target":"Mentransformasikan PL ke Bentuk Standar","unit_type":"subsection"},{"canonical_native_record_sha256":"ee74cbd18aba034995b6aa5dd2969b311a3cd1a7acb88223b267936f771a2f6e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Rewriting the System with \\(\\{s_1,s_2,s_3\\}\\) as the Basis","title_target":"Menulis Ulang Sistem dengan \\(\\{s_1,s_2,s_3\\}\\) sebagai Basis","unit_type":"subsection"},{"canonical_native_record_sha256":"4810b8316b32447752510048ad1bf01331f267bfc5fcd6a7ce9b868e73be8d36","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Assuming Feasible Start","title_target":"Simpleks dengan Asumsi Titik Awal Layak","unit_type":"subsection"},{"canonical_native_record_sha256":"673ee3ded41777bece4edf610d278d47297086c4903c28efb102354afeae2173","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Objective Function in this Basis","title_target":"Fungsi Objektif dalam Basis Ini","unit_type":"subsection"},{"canonical_native_record_sha256":"24a1b20c3ce906514dd77aaf99e6d026c8523ce0e6f5a2744348d572e83f5160","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Choosing the Entering Variable","title_target":"Memilih Variabel Masuk","unit_type":"subsection"},{"canonical_native_record_sha256":"65a06d49f454b506e3532b6c999d7dc7fe1a8af715ce4704b2738d298b9e60a0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Pivoting on the \\(s_3\\)-Equation Solved for \\(y\\)","title_target":"Melakukan Pivot pada Persamaan \\(s_3\\) yang Diselesaikan terhadap \\(y\\)","unit_type":"subsection"},{"canonical_native_record_sha256":"30fc3bd9467a1fcfd22f0fd22010ea64ec347aafcf1270534b4c38e991ba4c1b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Updated Dictionary and Basic Feasible Solution","title_target":"Kamus dan Solusi Basis Layak yang Diperbarui","unit_type":"subsection"},{"canonical_native_record_sha256":"b73d97bf1dcb5d0ed93284ffdb0fe6e37d6edc3a6cf76d81a60f8f150f78358e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Second Iteration","title_target":"Iterasi Kedua","unit_type":"subsection"},{"canonical_native_record_sha256":"5e39877b41bbf5ec7187cfc9e5125209ff33aa84f52416ce0b3b06db2320c3dc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Third Dictionary","title_target":"Kamus Ketiga","unit_type":"subsection"},{"canonical_native_record_sha256":"c622640b507a43c6107a354501ef06a8ca5caf913d2600cc2e7032539f3a3395","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-013","locale":"mul","order":13,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Summarizing the steps taken","title_target":"Merangkum langkah-langkah yang dilakukan","unit_type":"subsection"},{"canonical_native_record_sha256":"e4466cf99044a2e3a3c14ced317f1afb846b46d883b9071990caadae5e4fa838","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-014","locale":"mul","order":14,"parent_id":"unit.r017.book1.ch07.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Algorithm Execution","title_target":"Eksekusi Algoritma Simpleks","unit_type":"subsection"},{"canonical_native_record_sha256":"0d4676a3d1197c2c5f6b18086ff4a1efb45d8fa75aafa1efbe47d8a544f85a35","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-015","locale":"mul","order":15,"parent_id":"unit.r017.book1.ch07.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Big-M Method Algorithm","title_target":"Algoritma Metode Big-M","unit_type":"subsection"},{"canonical_native_record_sha256":"fdda89d6ac988e2095fad1acb1e6b17b993a00116e55034bb448433cc7fd151d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-016","locale":"mul","order":16,"parent_id":"unit.r017.book1.ch07.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Detecting Infeasibility via the Big-M Method","title_target":"Mendeteksi Ketidaklayakan melalui Metode Big-M","unit_type":"subsection"},{"canonical_native_record_sha256":"39aaf4cafd537cdcaf717ed2930bda68b4cb0c5bf973ecf033146d9b81d61f97","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-017","locale":"mul","order":17,"parent_id":"unit.r017.book1.ch07.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Interpreting the Final Dictionary","title_target":"Menafsirkan Kamus Akhir","unit_type":"subsection"},{"canonical_native_record_sha256":"a2c8b0323dbdb8e6e8218bd9ba33f0b33fd975a38fd4414ad6faadfe5d808f5b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-018","locale":"mul","order":18,"parent_id":"unit.r017.book1.ch07.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A second example: two artificial variables","title_target":"Contoh kedua: dua variabel artifisial","unit_type":"subsection"},{"canonical_native_record_sha256":"db96f69f1043ff7f343ed7bc3a06b6b926379205341715e5c00bdb27df1afef3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-019","locale":"mul","order":19,"parent_id":"unit.r017.book1.ch07.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Degeneracy and Unchanged BFS after Pivoting","title_target":"Degenerasi dan BFS yang Tidak Berubah setelah Pivot","unit_type":"subsection"},{"canonical_native_record_sha256":"01eee228e11366e00d620671e90b9c00d09725d714447c7ce6f98942f1262022","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-020","locale":"mul","order":20,"parent_id":"unit.r017.book1.ch07.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Cycling in the Simplex Method","title_target":"Siklus dalam Metode Simpleks","unit_type":"subsection"},{"canonical_native_record_sha256":"62a0fea22993a4721b4e64be7069a43820b52b240b5c21e16844f47c8dae07aa","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsection-021","locale":"mul","order":21,"parent_id":"unit.r017.book1.ch07.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Bland's Rule","title_target":"Aturan Bland","unit_type":"subsection"},{"canonical_native_record_sha256":"267dd4d67eb2c843d312a0e3fef40e90f9362c7a01313665c29f94fd5f09869b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsubsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"1. Objective: Convert Minimization to Maximization","title_target":"1. Fungsi Objektif: Mengonversi Minimisasi ke Maksimisasi","unit_type":"subsubsection"},{"canonical_native_record_sha256":"887ba2a1cf3a68eaecd3e47a15c9e4e34951611048a16d6a85fe8ffebee0bc6d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsubsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"2. Constraints: Convert Inequalities to Equalities","title_target":"2. Kendala: Mengonversi Pertidaksamaan Menjadi Persamaan","unit_type":"subsubsection"},{"canonical_native_record_sha256":"aec0d7d6d805b9507a5393a1c0aa1149a4383e00b90513ffa49ef4b4d02dd85d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsubsection-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch07.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"3. Variable Bounds: Ensure All Variables Are Nonnegative","title_target":"3. Batas Variabel: Memastikan Semua Variabel Nonnegatif","unit_type":"subsubsection"},{"canonical_native_record_sha256":"ccd97956efd8093c79a9a90be66b29ccc1036cb1944f8bffe59288d5b72e9af7","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsubsection-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch07.text.subsection-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"First Iteration. Ratio Test to Determine Who Leaves","title_target":"Iterasi Pertama. Uji Rasio untuk Menentukan Variabel yang Keluar","unit_type":"subsubsection"},{"canonical_native_record_sha256":"0f60fb90815b41733ec8b474bb28c7d1b0fb0b0672b3d007742869a6551c2646","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsubsection-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch07.text.subsection-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Second Iteration. Identify the Entering Variable","title_target":"Iterasi Kedua. Mengidentifikasi Variabel Masuk","unit_type":"subsubsection"},{"canonical_native_record_sha256":"67cc28aa9ed67b70273b14c7d7f6b8783aa813547f2fc6738e8983b70432d27b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsubsection-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch07.text.subsection-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Second Iteration. Ratio Test to Determine Who Leaves","title_target":"Iterasi Kedua. Uji Rasio untuk Menentukan Variabel yang Keluar","unit_type":"subsubsection"},{"canonical_native_record_sha256":"a9236d4f3c2b771594bb0200c6caa65b80500da102aa05a7e83a9dcb32fd4e2c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsubsection-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch07.text.subsection-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The Pivot: Solve the \\(s_1\\) Equation for \\(x\\)","title_target":"Pivot: Menyelesaikan Persamaan \\(s_1\\) terhadap \\(x\\)","unit_type":"subsubsection"},{"canonical_native_record_sha256":"bfe6bfafb006f0984989ece4df96c89699da139cc6bd06fbb129f2e98908890d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsubsection-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch07.text.subsection-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Eliminate \\(x\\) from the Other Rows","title_target":"Mengeliminasi \\(x\\) dari Baris Lain","unit_type":"subsubsection"},{"canonical_native_record_sha256":"c0d93c8e48e72b097eb5cb71d55dd090fcd1fa2df0bea40f8c601742a4ed349f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.subsubsection-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch07.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Selected Solutions","title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"bac78368971f4a4a35becf3ef4a7127f0ade85f36b50d98c809ad7a24cc64225","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.table-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"4007ac03576b02cde951d9ec1ab1629e22a2e14c6f4b94900e1c84c6310c5894","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.tryit-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch07.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"265f982a52bc899d8d5ef19da32725e243744dc3ecba0abe4d55cd33091a4822","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch07.text.tryit-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch07.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"122d93aea58e08447436a6485bc88f83d54626ac3a0f367fb9ecd1f8e1d7206c","concept_ids":["concept.basis-matrix","concept.partitioned-variables","concept.basic-feasible-solution","concept.reduced-cost","concept.simplex-optimality-condition"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08","locale":"mul","order":10,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.simplex-algorithm","concept.matrix-rank","concept.linear-independence"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Simplex - Matrix Calculations","title_target":"Simpleks -- Perhitungan Matriks","unit_type":"chapter"},{"canonical_native_record_sha256":"079672e361f39c461c4a5a2cdd375499d7ae7564439025d46cf34953f68001f8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch08","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"e3d4cc013deaa2e870c545743eabfba0a550b82d0a842249e46ef9617043f478","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.solutions-manual.manualsolution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Basis matrix and basic solution","title_target":"Matriks basis dan solusi basis","unit_type":"solution"},{"canonical_native_record_sha256":"e5e3dfd0ac150b39179df24a1e54360aa158e3f791bffc99182bed92b42989d4","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.solutions-manual.manualsolution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch08.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A basic solution that is not feasible","title_target":"Solusi basis yang tidak layak","unit_type":"solution"},{"canonical_native_record_sha256":"b2b4f3b29392dbaae4978f669f9a026fefa0cea80125617a3a0ab75c4278a7a4","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.solutions-manual.manualsolution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch08.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A fourth basis for the three-bases example","title_target":"Basis keempat untuk contoh tiga basis","unit_type":"solution"},{"canonical_native_record_sha256":"0510c61f0fe99b2e2bf09b65b5b62923127bf6cc2748c7cdb798929ba8d2f0b3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.solutions-manual.manualsolution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch08.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reduced costs at two bases","title_target":"Biaya tereduksi pada dua basis","unit_type":"solution"},{"canonical_native_record_sha256":"58cdc74ee76247cdac767d17806109aeeae98c42d197ce87247a2977478d59cf","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.solutions-manual.manualsolution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch08.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Which bases are feasible?","title_target":"Basis mana yang layak?","unit_type":"solution"},{"canonical_native_record_sha256":"3c7f2980190517d5ed0ed2a8bedd95775bfe028e874317163bd2dda0031b0ca1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.solutions-manual.manualsolution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch08.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Rebuilding a dictionary from the formula","title_target":"Membangun kembali kamus dari rumus","unit_type":"solution"},{"canonical_native_record_sha256":"8613e7e06c490a375874a25ca6f08c079b636ba7a32a0269995613342a82892c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.solutions-manual.manualsolution-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch08.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reduced costs of basic variables","title_target":"Biaya tereduksi variabel basis","unit_type":"solution"},{"canonical_native_record_sha256":"bb1b04395b37b34442c95cfe1e318feb6989318e741abce1b7f20cbb1a937252","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.solutions-manual.manualsolution-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch08.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reduced-cost signs and the entering rule","title_target":"Tanda biaya tereduksi dan aturan masuk","unit_type":"solution"},{"canonical_native_record_sha256":"1f898b9cb9a0479c236ec9abb7a3ef77d22f5497105135c1782cb3e1824b409f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.solutions-manual.manualsolution-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch08.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Strictly negative reduced costs imply a unique optimum","title_target":"Biaya tereduksi yang negatif secara ketat menyiratkan optimum unik","unit_type":"solution"},{"canonical_native_record_sha256":"a421494675b9d1d71fbbc4c20eb1ab576071a130d47d23f9309ee73b63b9ca50","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.solutions-manual.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Chapter 8: Simplex - Matrix Calculations","title_target":"Bab 8: Simpleks -- Perhitungan Matriks","unit_type":"section"},{"canonical_native_record_sha256":"a89c450a6aa2685aed183701fedca90d8140bc4b3b550b4d05107b4cf93f006b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"b75cea88746cd8ada10ef13dd884e84eba07b785a9940c03fa3d58ebbf732c5f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex - Matrix Calculations","title_target":"Simpleks -- Perhitungan Matriks","unit_type":"chapter"},{"canonical_native_record_sha256":"85c488689db12f50219c7e36bc008f7c6478e06d233b35719acb11e65ee1f233","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.definition-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Basis","title_target":"Basis","unit_type":"definition"},{"canonical_native_record_sha256":"7d0834a9eb78d299bc2f4767179c2b724d48263f84cbebddd3c1782797d84814","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.definition-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch08.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Basic solution and Basic Feasible Solution (BFS)","title_target":"Solusi Basis dan Solusi Basis Layak (BFS)","unit_type":"definition"},{"canonical_native_record_sha256":"fa2f5652f95c8247c9d13337dc46726cd3d208deaed9cdb0e41bba49e8e3104b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.definition-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch08.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reduced Costs","title_target":"Biaya Tereduksi","unit_type":"definition"},{"canonical_native_record_sha256":"2837846bfe8b55569cdd0f9c1fffa1d3e66dafc26e9105bd509e83901166b044","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.definition-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch08.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Revised Simplex Dictionary at basis $B$","title_target":"Kamus Simpleks Terevisi pada Basis $B$","unit_type":"definition"},{"canonical_native_record_sha256":"534778c0df4ad122ef03cdb33fdfd10bb7e501351657665009e914bff2c836d9","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.equation-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"d0ee613efeb81e669dc4d5fae9e8794ea66dd08834b4561ddd5cf5e09cf03132","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.equation-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch08.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"1c6379da06d68a3737baa5d6893c2c76e21dcb27b34eff34d2891f09df51e9bc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.equation-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch08.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"4aa2ebba9e19c7e082c4d786d0da51cea2482beeedf917a60abc563d319106d1","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.equation-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch08.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"9daf8db5efbb671fdaaabd3e82f6ca79d27066c3dd6ff079e3d8378b5669ebd3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.equation-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch08.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"f9369ff3997d5ac42e848143416103d0e995212a4b4961ae1b4385dc79b387d0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.equation-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch08.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"eb1394ba1bb08b32e154379311cbcdf44ede95ad7098f2625f379eedd26ea665","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.equation-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch08.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"ec1f981649de6ff92c202c256192ceec9ce2d6d3d0b6e9e3b730771a1b8d3030","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.equation-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch08.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"f1d45bea2d1cc1e812cc4d82c0a801d4fd3b05a7f9ab6aff622cac7222955ec3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.ex-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Basis matrix and basic solution","title_target":"Matriks basis dan solusi basis","unit_type":"exercise"},{"canonical_native_record_sha256":"a3a10c04fed166e702204810d2b06ab6582df7c6bd3ad4e621047c9155d7b180","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.ex-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch08.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A basic solution that is not feasible","title_target":"Solusi basis yang tidak layak","unit_type":"exercise"},{"canonical_native_record_sha256":"bed1d9bce27b119dc82bd1f08c33beddaf98faeac38a682534a5195d0ed643ff","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.ex-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch08.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A fourth basis for the three-bases example","title_target":"Basis keempat untuk contoh tiga basis","unit_type":"exercise"},{"canonical_native_record_sha256":"fc5a0a2581af6abf729b9dd11d4965d8a70c94f925d37bf2ec370fb5b9304bb4","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.ex-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch08.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reduced costs at two bases","title_target":"Biaya tereduksi pada dua basis","unit_type":"exercise"},{"canonical_native_record_sha256":"2745e2ccb07be16d8531e2254dbf5365b1a48bc2a62745814f89e28329aa4ac3","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.ex-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch08.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Which bases are feasible?","title_target":"Basis mana yang layak?","unit_type":"exercise"},{"canonical_native_record_sha256":"ad3a124493fb2ee25eb462de6617f6dcc845ae61e4a8a84db4621e523a60a35d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.ex-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch08.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Rebuilding a dictionary from the formula","title_target":"Membangun kembali kamus dari rumus","unit_type":"exercise"},{"canonical_native_record_sha256":"34a06e1a028dc62596e75978fbc36b6c155903c3513864855f5833a20041d92e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.ex-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch08.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reduced costs of basic variables","title_target":"Biaya tereduksi variabel basis","unit_type":"exercise"},{"canonical_native_record_sha256":"04b98e64fff6e7aacecd15efaa75bf99dcfbc68aa9e39ac2ec2b572014777e87","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.ex-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch08.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reduced-cost signs and the entering rule","title_target":"Tanda biaya tereduksi dan aturan variabel masuk","unit_type":"exercise"},{"canonical_native_record_sha256":"8f105bd96a3e084b0c8b166e94cb497a78ddc9559e3b114b64754d39bd3232b5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.ex-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch08.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Strictly negative reduced costs imply a unique optimum","title_target":"Biaya tereduksi yang negatif secara ketat menyiratkan optimum unik","unit_type":"exercise"},{"canonical_native_record_sha256":"d44a7b9ef5bff2e2031667e45a5083c999d55246ded586ed467715a59fa25cd8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.example-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Verifying Optimality Using Reduced Costs","title_target":"Memverifikasi Optimalitas Menggunakan Biaya Tereduksi","unit_type":"example"},{"canonical_native_record_sha256":"1c967fbefb75bb30928bbd6a29f338e630409668fce245e3409dbb48352091dc","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.figure-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.text.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"4385665213cc5c7c80e191f59da42ef9aa6276ff92b7e390b845fda2c95fe57a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.outcome-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"806ca5bbc08b987f4b20a9e50bda001114f3f174707e660a606637a283e77ec8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.outcome-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch08.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"6f06b48f5afc785f14051e99d04c53294acd3e28a7e7cdd40a013fec6909f260","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solutions to $A\\x = \\b$","title_target":"Solusi untuk $A\\x = \\b$","unit_type":"section"},{"canonical_native_record_sha256":"ee7f86e22a596b5b05e7428a2a307a24a60fc682717b1ebaf0b7850ed64c2bc8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch08.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Optimality Conditions","title_target":"Syarat Optimalitas","unit_type":"section"},{"canonical_native_record_sha256":"7240d452bd6951b197f012f8846cefd683d793fd44fe0c4fea69909e84b9f7fa","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch08.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Exercises","title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"a9b4d40e8a62dfbabd2a38023f782c876f5f732e875ff1fed39aebbdbd8f583f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.solution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"selected solution","title_target":"selected solution","unit_type":"solution"},{"canonical_native_record_sha256":"b0b358e763470ef30861f0e71e118c5e8d860b3932474c12a035d471da32a89c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.solution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch08.text.subsubsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:matrix-basis-warmup","title_target":"solution for ex:matrix-basis-warmup","unit_type":"solution"},{"canonical_native_record_sha256":"54a7f5d70c2c59abe9260eefdab73b8088b320950bd89ed0a94200be8560325a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.solution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch08.text.subsubsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:matrix-reduced-costs","title_target":"solution for ex:matrix-reduced-costs","unit_type":"solution"},{"canonical_native_record_sha256":"967283d1ad238e5607199cae8f1e3d967cabba2b5a98eb7273e9be651c9d224c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.solution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch08.text.subsubsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:matrix-unique-optimum","title_target":"solution for ex:matrix-unique-optimum","unit_type":"solution"},{"canonical_native_record_sha256":"99f3b9a2c2149299036c40bee15926647ae9f84ebdaabe5e943162ebc46b3d6f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.subsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Assumptions on $A$","title_target":"Asumsi tentang $A$","unit_type":"subsection"},{"canonical_native_record_sha256":"d7a8f7831d27209a20710db00a81c68757ca3a148ea30123d53fcb6eb9ccc959","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.subsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch08.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Submatrix Notation","title_target":"Notasi Submatriks","unit_type":"subsection"},{"canonical_native_record_sha256":"e5ca7d6f44025e03903e9f144ba3b47b2118555809ece101b121cddd94e838b8","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.subsection-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch08.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Partitioning the Variables","title_target":"Mempartisi Variabel","unit_type":"subsection"},{"canonical_native_record_sha256":"05619f1b5d14095d05c822fc41cc3a7581dbb17b6ec5c81785727002d1da368c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.subsection-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch08.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Another Example","title_target":"Contoh Lain","unit_type":"subsection"},{"canonical_native_record_sha256":"a68facdb35d2bcfe97a8328cafe1bffc44646a4c73aef5136cbbdd7accd1c0c9","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.subsection-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch08.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Selecting and Evaluating Different Bases","title_target":"Memilih dan Mengevaluasi Basis yang Berbeda","unit_type":"subsection"},{"canonical_native_record_sha256":"c30f174f1b0d4b27f3c0daabbbacca41f4e8e4d98aae5230ec1fd695fde6c570","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.subsubsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch08.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Example Problem - Small Bakery","title_target":"Contoh Masalah -- Toko Roti Kecil","unit_type":"subsubsection"},{"canonical_native_record_sha256":"6f84c9a651fadeedadf1f7eda81f99839497c30f20cd1c294b17cd2cbcb0938f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.subsubsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch08.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Example 1: A 3-variable, 2-equation System","title_target":"Contoh 1: Sistem dengan 3 Variabel dan 2 Persamaan","unit_type":"subsubsection"},{"canonical_native_record_sha256":"f9981d0296e6dccbbbb341d5d6c66fbe6bfcfa2d74fbe4b5dc37750ebc4a27f5","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.subsubsection-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch08.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Example 2: A System with Slack Variables","title_target":"Contoh 2: Sistem dengan Variabel Slack","unit_type":"subsubsection"},{"canonical_native_record_sha256":"6eaab89e7b927db922f0ce0db88774eda4c5765d47a76fea7eba523bb5e1097a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch08.text.subsubsection-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch08.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Selected Solutions","title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"b7f0fd67b2ec1188e32ee260fdfb4c561c4c7982fba66c0bb8103286ef0c87f5","concept_ids":["concept.simplex-tableau","concept.pivot-operation","concept.simplex-optimality-condition","concept.artificial-variable","concept.big-m-method"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09","locale":"mul","order":11,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basic-feasible-solution","concept.canonical-form"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Simplex Method in Tableau Form","title_target":"Metode Simpleks dalam Bentuk Tableau","unit_type":"chapter"},{"canonical_native_record_sha256":"5e6ad2db0ed4723c1b46f31b4eb788e6f6493e5e92b4204aff341be1e0a731bf","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch09","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"1d8b047ce53baabc2878d7d076ec949aafa3fd41078e21717427caa526fcb18b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reading a mid-solve tableau","title_target":"Membaca tableau di tengah proses penyelesaian","unit_type":"solution"},{"canonical_native_record_sha256":"9b2efd3e5fa19cc2347a36aa806d044b3b0b35dacc476ccb2daad903538b3912","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reading a tableau","title_target":"Membaca tableau","unit_type":"solution"},{"canonical_native_record_sha256":"a56df83110870ec97fa34116a3dd0521b5b497f4bd8067307ab6fa06503c2084","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Entering variable, ratio test, and pivot element","title_target":"Variabel masuk, uji rasio, dan elemen pivot","unit_type":"solution"},{"canonical_native_record_sha256":"a624041cef22c5406d0daa129eb65aefb9f9f23b5b08eb6091e5a253a7d49335","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Perform one pivot","title_target":"Melakukan satu pivot","unit_type":"solution"},{"canonical_native_record_sha256":"7a4882fd898c6c7ae088b8a6bce55bed8b4a144c2d26bb3b19a3f9e79ed5f087","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solve a linear program in tableau form","title_target":"Menyelesaikan program linier dalam bentuk tableau","unit_type":"solution"},{"canonical_native_record_sha256":"ce5cebc6fef07e86aa18d9cfdd8c9d116f743feb7558a34c5deeab5447fe3563","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A full two-pivot solve","title_target":"Penyelesaian lengkap dengan dua pivot","unit_type":"solution"},{"canonical_native_record_sha256":"face90a7509554d77516fa0cff2622fe58851aaf042ba8be05dcb0420b660fa9","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Setting up a Big-M tableau","title_target":"Menyusun tableau Big-M","unit_type":"solution"},{"canonical_native_record_sha256":"22bbd94739679af44362fff1302623728562318c55dccce141a77721bf500eda","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The $z$-row sign convention","title_target":"Konvensi tanda pada baris $z$","unit_type":"solution"},{"canonical_native_record_sha256":"9495e13ba64c07c33eb8abbb376f733acc6aa6cd50618f331880ab45313d1270","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"From tableau to dictionary","title_target":"Dari tableau ke kamus","unit_type":"solution"},{"canonical_native_record_sha256":"66703b6af4e16e0064fabd6feddb98701afc4408ce3530fecdb4698688edd493","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Recognizing an unbounded problem","title_target":"Mengenali masalah tak terbatas","unit_type":"solution"},{"canonical_native_record_sha256":"438fa0497a473727eb95165c16564faef57c5b8126e3303539b09260e94378f2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reading off infeasibility","title_target":"Membaca ketaklayakan","unit_type":"solution"},{"canonical_native_record_sha256":"eaf251bdcdc93a8653b6b5e83f4413001ef1f6971a8005f25e264cf4b4f4c026","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.manualsolution-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch09.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Certifying unboundedness from a tableau","title_target":"Menyertifikasi ketakterbatasan dari tableau","unit_type":"solution"},{"canonical_native_record_sha256":"0125a144af0c02862dc93efaebd61d73d15a627abdf856ab183145794a94e236","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.solutions-manual.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch09.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Chapter 9: Simplex Method in Tableau Form","title_target":"Bab 9: Metode Simpleks dalam Bentuk Tableau","unit_type":"section"},{"canonical_native_record_sha256":"122de1d71e3503cdc4519c615572eaa72482eb984bfbe4e9def86f4d88f52998","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch09","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"a7db8b42fd05ab8f25672ce9ca26a32dee5ca30c6ac19dfc41f4b2f3b8d8598b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch09.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Simplex Method in Tableau Form","title_target":"Metode Simpleks dalam Bentuk Tableau","unit_type":"chapter"},{"canonical_native_record_sha256":"47922d49907a11bea8eb753c1e248c3c4b7d9964e3327637ce08f9d0c29177b2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reading a mid-solve tableau","title_target":"Membaca tableau di tengah proses penyelesaian","unit_type":"exercise"},{"canonical_native_record_sha256":"26d9a076bb6cbd8a35028bd62e4ed0f4e06dd838c989ccaf629c17112e277f75","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reading a tableau","title_target":"Membaca tableau","unit_type":"exercise"},{"canonical_native_record_sha256":"c51656ef7e0d2c347c1eb0997a5cf44016569b69545687d8f80bf9e5fd701faa","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Entering variable, ratio test, and pivot element","title_target":"Variabel masuk, uji rasio, dan elemen pivot","unit_type":"exercise"},{"canonical_native_record_sha256":"b304e36ef942825e9c5d05c6348ed9d5ef419c5614d138b6c91f9101a705709b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Perform one pivot","title_target":"Melakukan satu pivot","unit_type":"exercise"},{"canonical_native_record_sha256":"bb5a9df08f7c3414453e18b814ffde9c15245d856b65b3227d0f06ec3135a163","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Solve a linear program in tableau form","title_target":"Menyelesaikan program linier dalam bentuk tableau","unit_type":"exercise"},{"canonical_native_record_sha256":"8bf63a16a04826358e1d2105e8281d1514194bd88d2eaf3949c71f47fc34902f","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A full two-pivot solve","title_target":"Penyelesaian lengkap dengan dua pivot","unit_type":"exercise"},{"canonical_native_record_sha256":"242e725e798ba11cf6d126a9af43cb285a5a9a7bb83b01c24f1d44ffc2f1c8cb","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Setting up a Big-M tableau","title_target":"Menyusun tableau Big-M","unit_type":"exercise"},{"canonical_native_record_sha256":"e66d39eb3172bc4c7bffb02442372955e0eb3be495a9990ee2724fa6e05d337b","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-008","locale":"mul","order":8,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"The $z$-row sign convention","title_target":"Konvensi tanda pada baris $z$","unit_type":"exercise"},{"canonical_native_record_sha256":"44a7ba5ae66c07e3fd54a96533007048c960e6eebe3deca1a66e2d00cbc038ad","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-009","locale":"mul","order":9,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"From tableau to dictionary","title_target":"Dari tableau ke kamus","unit_type":"exercise"},{"canonical_native_record_sha256":"b8e64c0cd1ceb8682c1907e87618456e5bbe9db3c36786c3def0f478510e9c8c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-010","locale":"mul","order":10,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Recognizing an unbounded problem","title_target":"Mengenali masalah tak terbatas","unit_type":"exercise"},{"canonical_native_record_sha256":"129904ec0556f4603b85e879c3883c78a6595da22e21a1eebf16b112f597a989","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-011","locale":"mul","order":11,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Reading off infeasibility","title_target":"Membaca ketaklayakan","unit_type":"exercise"},{"canonical_native_record_sha256":"8fffa00790d9efcd83bf97d6861536b6bee8e28d66e6eb0c8582070217601fbf","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.ex-012","locale":"mul","order":12,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Certifying unboundedness from a tableau","title_target":"Menyertifikasi ketakterbatasan dari tableau","unit_type":"exercise"},{"canonical_native_record_sha256":"82cc0b16177f2fe3dcba210479b9f7db11fec7b2de52a788620510098c9cf859","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.outcome-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch09.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"c825cd6443c899370d9c81d6540444aa53dee22d72d3223116c4b421af72ffa2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch09.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Building the tableau","title_target":"Membangun Tableau","unit_type":"section"},{"canonical_native_record_sha256":"07b28e976531b48799a17ce08a76c7bcf1ac3954663701d8b9449c98650f2bda","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch09.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"One pivot, three colors","title_target":"Satu Pivot, Tiga Warna","unit_type":"section"},{"canonical_native_record_sha256":"35f0ac71aa582a7dd7ce081823f37e6dfc47e159b3d9871142bcc5fb3de79891","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch09.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Optimality and reading the solution","title_target":"Optimalitas dan Membaca Solusi","unit_type":"section"},{"canonical_native_record_sha256":"8797e4fecabfa2074b3dabc2b03f85445ee10af248ce9882f8ec1b7d354b19d0","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.section-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch09.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Artificial Variables and the Big-M Method","title_target":"Variabel Artifisial dan Metode Big-M","unit_type":"section"},{"canonical_native_record_sha256":"48cb36e6d3ddd2d0c61986d045347ede4a23a307690b5e965f70d635c9aeb65e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.section-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.ch09.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Exercises","title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"a8239ec97a2d2f9315cbc208b1e3d8ee23e33f57f12b9cc1e80be0fbe25a9284","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.solution-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch09.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:tableau-reading","title_target":"solution for ex:tableau-reading","unit_type":"solution"},{"canonical_native_record_sha256":"a296ecb1f4339b3a05bf9f7fd31da4cba53afdfc77e93aa3fe1e133b61608ddb","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.solution-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch09.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:tableau-ratio-test","title_target":"solution for ex:tableau-ratio-test","unit_type":"solution"},{"canonical_native_record_sha256":"ae9cda84129d0334bdee37f817c758bbc6e39d7e469cf3896b70113a6fb71f83","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.solution-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch09.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:tableau-solve-lp","title_target":"solution for ex:tableau-solve-lp","unit_type":"solution"},{"canonical_native_record_sha256":"0518593be9b37e9b16f5f57045a2ba9ad59405c4fc97d22fabca4b2bb0a617f2","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.solution-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.ch09.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"solution for ex:tableau-two-pivot-solve","title_target":"solution for ex:tableau-two-pivot-solve","unit_type":"solution"},{"canonical_native_record_sha256":"b6653dd2046a895f71ccd2ac4cd3a2ddc0d368f9a118168c14f31f4f31c4ef30","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.subsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch09.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"A problem with no slack-basis start","title_target":"Masalah tanpa Basis Slack Awal","unit_type":"subsection"},{"canonical_native_record_sha256":"42e80449394a51ed87ade606eb90acd450c40eb338deee2bd66b8500dbdf85f6","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.subsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch09.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Detecting infeasibility in tableau form","title_target":"Mendeteksi Ketaklayakan dalam Bentuk Tableau","unit_type":"subsection"},{"canonical_native_record_sha256":"ec4ce9e5ab6fb9d9325324071c1a654f6865400e4432e449babcd397ec93fa6d","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.subsubsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch09.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Selected Solutions","title_target":"Solusi Pilihan","unit_type":"subsubsection"},{"canonical_native_record_sha256":"32e33e1575abc9028f6164d0823425443c10c9e8f7cbf8be69b64df9bb4ca18c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch09.text.tryit-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch09.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"","title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"9de00a1a7c61cfaead29cc89fd7815e7f5d7ce10c2b74ef1f640c04315179193","concept_ids":["concept.sensitivity-analysis","concept.shadow-price","concept.reduced-cost"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch10","locale":"mul","order":12,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.simplex-algorithm","concept.basis-matrix"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Sensitivity Analysis","title_target":"Analisis Sensitivitas","unit_type":"chapter"},{"canonical_native_record_sha256":"9389b2e78ce4eeecbe2fbdba36dcdcfa8d391e91307a48226198c4a5c6855966","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch10.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch10","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"ab212638ca3703647dadda207a9564f5382711470453470c0434e9751a3c555f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Harga Bayangan dari Kamus Akhir","unit_type":"solution"},{"canonical_native_record_sha256":"242a02b2eef4e26fc10301cf1ea7fdf0095cb2dcaeee5c16d68ecf1aa065bc1b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Rentang Sensitivitas Ruas Kanan","unit_type":"solution"},{"canonical_native_record_sha256":"085bfa153e0e16ad465b9b05556871815d8d2d45b5950adb62d31154ef6a7d74","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sensitivitas Koefisien Objektif","unit_type":"solution"},{"canonical_native_record_sha256":"9fa3658b5bee51a1b0855bf822fe5c98f5bcefa2943e3661363122fe9d9af02f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Analisis Sensitivitas Lengkap","unit_type":"solution"},{"canonical_native_record_sha256":"110bb3c0a3e703102ad6b96285113fb04b679b0d9b5e6c64316b03621a6bb4a7","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Rentang Koefisien Basis dan Nonbasis","unit_type":"solution"},{"canonical_native_record_sha256":"6ed2f75a17f71c4234ff972e4f0313c9b6c382008d428c232b45f58906f9f898","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sensitivitas dari Invers Basis","unit_type":"solution"},{"canonical_native_record_sha256":"d13cee09a19435a0fc2084418d1cc1f8d43fa93295fcf3e2db78270cf6aaed36","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Membaca Laporan Sensitivitas","unit_type":"solution"},{"canonical_native_record_sha256":"453387491ab967ec06ef5087886ceb2e8e729ad2283fdff93dd8723c2bc0341b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penafsiran Harga Bayangan","unit_type":"solution"},{"canonical_native_record_sha256":"14438de6937a89144d424d4176c5d489dc804532a25e1ea6bd2633b4962a3266","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengapa Kendala Berslack Berharga Nol","unit_type":"solution"},{"canonical_native_record_sha256":"490df1a67081645ccc41958b67e943625d76be1be43e725f0eb4efa53afd473f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengapa Rentang Itu Ada","unit_type":"solution"},{"canonical_native_record_sha256":"464375b312ee650d261bb5d039875dc2bfb4c128f4108650c11e52216a32228f","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Ketika Prediksi Harga Bayangan Gagal","unit_type":"solution"},{"canonical_native_record_sha256":"03ff24cb638bd73f9b22353afafb1644d8117a21bedccd8a38cde8b39f26adab","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.manualsolution-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch10.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Melampaui Rentang","unit_type":"solution"},{"canonical_native_record_sha256":"cd7c2ac1952c73059d31f20a574c63998db2d822a1b8b90a95d89da0deeb2ce9","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.solutions-manual.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bab 10: Analisis Sensitivitas","unit_type":"section"},{"canonical_native_record_sha256":"fe008f112379dcc0227a176bff8d48ea571c069eadbdcda269911f48eafc27a9","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch10.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch10","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"0ca4d6ea587067a48e81485f6b67865cd09f4ec32f92b39fbe8280857c5330d2","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.captionfigure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.text.subsection-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Daerah layak pada bidang x-y dengan beberapa kurva aras objektif z = c\\_x x + 3y.","unit_type":"figure"},{"canonical_native_record_sha256":"f918f5a9369b8c3f0f85ce0b4716ab0d3c3644714034d470fa25933b24a3989d","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.captionfigure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch10.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dialog Solver Results di Excel dengan opsi pembuatan laporan Sensitivity.","unit_type":"figure"},{"canonical_native_record_sha256":"a7a505fb3ce6f4d1e782e590b7a359804be8eaf26355128ee54294efca5f08d7","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Analisis Sensitivitas","unit_type":"chapter"},{"canonical_native_record_sha256":"533a8199619f64a7ac119495c8052bf92682924fc2d002e1fb7fb9aeeaeca50c","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Harga Bayangan dari Kamus Akhir","unit_type":"exercise"},{"canonical_native_record_sha256":"75e06318c631cfc1945bda862e8e9704fb6900a3d23ba0027c87bfdbe47019fa","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Rentang Sensitivitas Ruas Kanan","unit_type":"exercise"},{"canonical_native_record_sha256":"6d54229b96e980864c558a5c4f844d815fc0f1226a284259dc1e6f7647085ca4","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sensitivitas Koefisien Objektif","unit_type":"exercise"},{"canonical_native_record_sha256":"2075b6c06e4ea2d62227e142b2c50ae93c7f358133ddc545a23aa33c0aacb1c8","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Analisis Sensitivitas Lengkap","unit_type":"exercise"},{"canonical_native_record_sha256":"7092a352652ec4a3ed1b2383055bd412b3165fee5c3a0ea6e67f5e4c758f21c5","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Rentang Koefisien Basis dan Nonbasis","unit_type":"exercise"},{"canonical_native_record_sha256":"39d0a66762125b66126df5241f3abc08748abb4d1675bd1f002788f16693dbb3","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sensitivitas dari Invers Basis","unit_type":"exercise"},{"canonical_native_record_sha256":"b9cf681adf4f3828a7f24298cabdd7cd0552a65c1aa2aafdd7b364a34e02297d","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Membaca Laporan Sensitivitas","unit_type":"exercise"},{"canonical_native_record_sha256":"96a7f07ab8a12ee11f84cfacf831bbba83fde3d1a0dd7f1f40c6a00bb3f3afd2","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penafsiran Harga Bayangan","unit_type":"exercise"},{"canonical_native_record_sha256":"867889fe176826f034307d329b2937ec0d30e3e4e382e0c38accd7584a4bfcfb","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengapa Kendala Berslack Berharga Nol","unit_type":"exercise"},{"canonical_native_record_sha256":"69ec7a60e63a4974cc91b10787e50abf9ac73d783325ee328b08aebcdcb83059","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengapa Rentang Itu Ada","unit_type":"exercise"},{"canonical_native_record_sha256":"2bdee59784808fa77f7113d3f4011dddc6c9d9ff12f822a5929e0fa47c297fee","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Ketika Prediksi Harga Bayangan Gagal","unit_type":"exercise"},{"canonical_native_record_sha256":"189d86ed9761e28d9e2f9339709fb66ef74f43432a96b30630718e658756514c","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.ex-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Melampaui Rentang","unit_type":"exercise"},{"canonical_native_record_sha256":"6d9bc5213cf7d3cc693b1a2bd52e82f0e2de74596712ed4e30cb79399362ae0d","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.figure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"f1bc51d73ef5387e5e9845b5c13f15e64a51eaab7d55ec2b5054f33abc8bd44a","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.figure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch10.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"c6900f6ba5b905288eb2c7382ac357ebc6d3cec8ec648ab845563db427bbb331","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.learningcheckpoint-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.text.subsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"f36f4906dabc990a9c193817a70f76f088445a3749b00a60d96e0cfe6faf817d","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.learningcheckpoint-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch10.text.subsection-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"cbdb00036d21d479e154ead11774840f08fd172a480c66f76e04fa4a37683064","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"1b0a58138cd8c46ae90152f0b4251fe4519ddf05fea8990bf7e2b12eb051a8c1","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Apa yang dapat berubah dan apa akibatnya","unit_type":"section"},{"canonical_native_record_sha256":"56aa0d2fb363bb520a936fed4061b8bf1951f4fd057120fb4688a9f6090602d9","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.section-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch10.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan rentang ruas kanan","unit_type":"section"},{"canonical_native_record_sha256":"52f7d4c84568130db5dbc0efc9c8f642e7d2f7d2c012a6d8f3cbdae3f9d33c7a","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.section-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch10.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan rentang koefisien objektif","unit_type":"section"},{"canonical_native_record_sha256":"10ced468cd869265c3a278e94f11d6b9be96c1beb0cb7362438c57436bb38301","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.section-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch10.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sensitivitas dengan Notasi Matriks","unit_type":"section"},{"canonical_native_record_sha256":"619267b8429810e61ec489a88c44c2a6269e562c44cdbc5513daa8beffe872ee","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.section-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch10.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Laporan Sensitivitas dalam Perangkat Lunak","unit_type":"section"},{"canonical_native_record_sha256":"120f10c5d673f358956facd1c88e7ebd09ddbc52db7087390d98bf59121f7c40","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.section-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch10.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"66980a0616445063644d818901f6baf385fbbe926468b60deeed0ede9573de35","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:sensitivity-workup-2x2","unit_type":"solution"},{"canonical_native_record_sha256":"7f0f9fa5ab98f75da1bef8a59f7d04afc7bd7ccd46086c46000c3dd678220593","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch10.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:sensitivity-basis-inverse","unit_type":"solution"},{"canonical_native_record_sha256":"69de2b90fd1c96fe14581f8c618873dc2bc0e0617ea7e5cc11033d72d9fcb542","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch10.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:shadow-price-workshop","unit_type":"solution"},{"canonical_native_record_sha256":"0a8e88c370eb9c4d39fc493c2d14d956eb142982e124d75bcbdb5100288ddef2","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.solution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch10.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:sensitivity-range-boundary","unit_type":"solution"},{"canonical_native_record_sha256":"7b3b6e6a2dec619ce215988af42d97cdbb46e71778776e2a2f975e19a578758b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengubah koefisien objektif \\( c_i \\)","unit_type":"subsection"},{"canonical_native_record_sha256":"adca32ef1c32d7af5036df58c2ce4c500a6da9a2813421ffab2547df89f3e4f2","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch10.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengubah ruas kanan \\( b_i \\)","unit_type":"subsection"},{"canonical_native_record_sha256":"b0286b798ddef42fca02d06356cb004baa753253023620d1bd659ec6325207b2","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch10.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengubah koefisien kendala \\( a_{ij} \\)","unit_type":"subsection"},{"canonical_native_record_sha256":"2a1fa8f4a25abbc10ec0710c6eb1197ee3ab78ae6a0c40296c1a1ebda7d9bc46","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch10.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Ringkasan","unit_type":"subsection"},{"canonical_native_record_sha256":"f2613af5c69f145143372ef18db8c1922871a7175adc34d1ed700f16a375220b","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch10.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengusik \\( b_2 \\): Variabel Slack Basis","unit_type":"subsection"},{"canonical_native_record_sha256":"c2eb205b3f9ea72a0ec7fe99ba4a0290b319547bd380637e1ccce0dcbb7f0e37","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch10.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengusik \\( b_1 \\): Variabel Slack Nonbasis","unit_type":"subsection"},{"canonical_native_record_sha256":"09b3a3440540fcfa22e14c0647c22ac74a59c262ef200a5c793492adfb0e89ff","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch10.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengusik \\( b_3 \\): Variabel Slack Nonbasis Lainnya","unit_type":"subsection"},{"canonical_native_record_sha256":"5fdd534c0ee027cc3b0a2936b6c35ecdc49a575886c51d7e89167b2672eadb7a","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch10.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengusik \\( c_1 \\): Koefisien Objektif \\( x \\)","unit_type":"subsection"},{"canonical_native_record_sha256":"a180a3015f8ce4ef7a5113a9d3ac4b92649bff69bb315cc7dc4cc76f860b3e0a","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch10.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengusik \\( c_2 \\): Koefisien Objektif \\( y \\)","unit_type":"subsection"},{"canonical_native_record_sha256":"f0de990de3a13ad88b4d7af7b8cede0f46354c5caeb1ee72823d86286f5e0e76","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch10.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Ringkasan","unit_type":"subsection"},{"canonical_native_record_sha256":"63fcc1f25b42242abb717876f01a5cb5de3c53ccd688dea93469dd694d2fa195","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch10.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan rentang \\( b_1 \\) dengan invers basis","unit_type":"subsection"},{"canonical_native_record_sha256":"7b014d6e3712b234c74924311f5fee13b3bfe7880216147b6ee97dbcaec23be8","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsection-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch10.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan rentang \\( c_x \\) melalui biaya tereduksi","unit_type":"subsection"},{"canonical_native_record_sha256":"bac01b9260f367403268a10cd0c5bc462ebd45d31906f410fc52cc76063fe132","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.subsubsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"95866b00c4e79d5b0dfbf171dff1ae1460b526455c1b5335ed330afb16ec0773","concept_ids":["concept.reduced-cost","concept.sensitivity-analysis","concept.shadow-price"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch10.text.tryit-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch10.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"cbbaa23f620fa62fa0ddf44a7e8baff39f41ebba55153d421ad6642bb19f5ee7","concept_ids":["concept.dual-formulation","concept.weak-duality","concept.strong-duality","concept.complementary-slackness"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch11","locale":"mul","order":13,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.linear-programming","concept.sensitivity-analysis"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Duality","title_target":"Dualitas","unit_type":"chapter"},{"canonical_native_record_sha256":"21916de3648523d0020e46fd79cc997eed345aa3646f48e443792fd205865c53","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch11.solutions-manual","locale":"mul","order":3,"parent_id":"unit.r017.book1.ch11","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"ba54bd8ad63023b3d96c9db553318052f337de80dac8a74f69d94ce5f07c42a1","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Dual Toko Roti Kecil","unit_type":"solution"},{"canonical_native_record_sha256":"242766a48388080010c6aeec853514c78e45c85236a249ce0de1b88ff6d54d1f","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Rumuskan Masalah Dual","unit_type":"solution"},{"canonical_native_record_sha256":"f04e8736f7a24103ac55d67e2e64b506ef70f00d717fb5b8e58996abf188ad4d","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memverifikasi Dualitas Lemah","unit_type":"solution"},{"canonical_native_record_sha256":"350ec2151d56641c38e5f3508b234f5f401f0a7322847419d57663df5280d83c","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Batas Dualitas Lemah","unit_type":"solution"},{"canonical_native_record_sha256":"aa84efbde6332d86959e96638dbd2ae4860837aed192dd7b1caa045e18f1ad2e","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Dual dengan Kendala Campuran","unit_type":"solution"},{"canonical_native_record_sha256":"f3954e9a77f875b796388541f31fa977c286f1b25055c374a3f6448669ec9534","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Harga Bayangan dan Variabel Dual","unit_type":"solution"},{"canonical_native_record_sha256":"122c309d75825b09c53baf713a96abe27e4451f51760c3d87639b6d88ea546f3","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sertifikat dengan Kata-kata Anda Sendiri","unit_type":"solution"},{"canonical_native_record_sha256":"7db6c0c43bf933988bee03d494be265435d104bc11311d08f75b7d1eae8f7410","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dualitas Kuat dan Ketaklayakan","unit_type":"solution"},{"canonical_native_record_sha256":"cc99860b3cf2c34dd9e597d3b3a1ff8150ce91ded5b6175363779e93b0e86ea1","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dual dari Dual adalah Primal","unit_type":"solution"},{"canonical_native_record_sha256":"274970e4a5344e364294b2a06fdd46069e491a56233991f36f4d53860925a1e0","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memeriksa Syarat-syarat","unit_type":"solution"},{"canonical_native_record_sha256":"750fada2509c0e13611ce3528e1c8beadfffeec031904934debf08723828de97","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Produksi Toko Roti dan Interpretasi Dualitas","unit_type":"solution"},{"canonical_native_record_sha256":"b344a428cae793f7844b909835c48b4536e5e5c4b171c1bfc280fea5967ec803","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala Kotak dan Sertifikat Dual","unit_type":"solution"},{"canonical_native_record_sha256":"a29bbab89004ff27f2bd0c766f382f0533e6665e1f4c38958a9872bb05184614","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menurunkan Solusi Primal dari Tebakan Dual","unit_type":"solution"},{"canonical_native_record_sha256":"98d82dce9454450c1b4463ae514104cd17ab1928346a96aa26ee978e5a4eed71","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Harga Positif pada Kendala yang Longgar","unit_type":"solution"},{"canonical_native_record_sha256":"7cca2babe9c5a42580b3771bedfe70fcda230332fe39a9cff099bb99bd187070","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menyangkal Klaim Solusi Optimal","unit_type":"solution"},{"canonical_native_record_sha256":"2014c410a9370583b62e23a544023b3c77163197e4fd5534a672de5f3991cc13","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-016","locale":"id-ID","order":16,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Optimisasi Paket Makanan dan Dualitas","unit_type":"solution"},{"canonical_native_record_sha256":"b325e1215f946af5d19a32dec259c3d294c1e46d16429349bb4fd26e904a716a","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.manualsolution-017","locale":"id-ID","order":17,"parent_id":"unit.r017.book1.ch11.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dualitas dengan Jenis Kendala Campuran: Perusahaan Rintisan Kemasan Ramah Lingkungan","unit_type":"solution"},{"canonical_native_record_sha256":"d90aa933303199db8a31e78b99a1607f9a431b80608bde7f68798f4535023c98","concept_ids":["concept.complementary-slackness","concept.dual-formulation"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.solutions-manual.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bab 11: Dualitas","unit_type":"section"},{"canonical_native_record_sha256":"47207f48b8af5737956364d9e282404d098162d55bd9711ac857b8e7ac02a23f","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch11.text-a","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch11","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"48a12c892ee51e3da584f8f6bf952bf23d76da27726609adc3b92e3d78f88570","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dualitas","unit_type":"chapter"},{"canonical_native_record_sha256":"c70be8ffa7a7909b14828e2c7be7d0a930e329f4edba94b17dc579e81f13b91a","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Harga Bayangan","unit_type":"definition"},{"canonical_native_record_sha256":"10079a3cd2cc480f53273400f9e88520413ee68e6fec90238436b46029cc459d","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.ex-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Dual Toko Roti Kecil","unit_type":"exercise"},{"canonical_native_record_sha256":"246143723be758c428a6249101cb2828a2193d8e27bfc94f80ff496db73602e3","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.ex-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-a.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Rumuskan Masalah Dual","unit_type":"exercise"},{"canonical_native_record_sha256":"f76cb068ffc1a276e583a50f92194b3fd1c16a05fc7a31890950f74405c86a7c","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.ex-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.text-a.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memverifikasi Dualitas Lemah","unit_type":"exercise"},{"canonical_native_record_sha256":"d940b2d3ed46ba6b5a49e19105247322bc2f17ade94754668c4c8d32d6553cd4","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.ex-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch11.text-a.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Batas Dualitas Lemah","unit_type":"exercise"},{"canonical_native_record_sha256":"f9ec9e1e653b809022dd3040eb0952312cae22dc7afb29d67d46bec0c2b96c55","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.ex-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch11.text-a.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Dual dengan Kendala Campuran","unit_type":"exercise"},{"canonical_native_record_sha256":"af37430aea17a13fd25b5df2311bee2c9133fc0131ae5203ae290fc05151a6d3","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.ex-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch11.text-a.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Harga Bayangan dan Variabel Dual","unit_type":"exercise"},{"canonical_native_record_sha256":"002dc1d1eefebd8d5322c92ad6b20179f45ae0b50218fe90776e1091e3c8a1ad","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.ex-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch11.text-a.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sertifikat dengan Kata-kata Anda Sendiri","unit_type":"exercise"},{"canonical_native_record_sha256":"2eddc946541e9ed371f4630aa1d76bd26a13cf814aadd805c59ec093a7357ed3","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.ex-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch11.text-a.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dualitas Kuat dan Ketaklayakan","unit_type":"exercise"},{"canonical_native_record_sha256":"24f887109224037319208a5876d1a81dfeb7ac3d59c6d1313421d862e0c8fd66","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.ex-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch11.text-a.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dual dari Dual adalah Primal","unit_type":"exercise"},{"canonical_native_record_sha256":"05877f6b84cd85d115583726c7f849f3f9256d6a26c716af494719c01ea574e5","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Ketaklayakan Dual akibat Ketakterbatasan Primal","unit_type":"example"},{"canonical_native_record_sha256":"40aec94b5ba281f4f76961d770212cbebf9480f12f54a61f9c487ae9c1c688b3","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-a.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Meninjau Kembali Toko Roti","unit_type":"example"},{"canonical_native_record_sha256":"5fb69a3c9fdd18402338cfdba683a3df8ee106588eb4b8cd9d19da0600435ce6","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.text-a.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh yang Lebih Besar: Toko Roti 2.0","unit_type":"example"},{"canonical_native_record_sha256":"b02944649f3b09272b9d8d61d80aa22a7dd0b10bd1d965db03681cca08e484be","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.example-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch11.text-a.subsubsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh dengan Pertidaksamaan dan Variabel Bebas","unit_type":"example"},{"canonical_native_record_sha256":"ea4c479deff425b0f795e77262aafa1a370d2fab83e853add2e0ce9de577eee5","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.figure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"825e90510d4583ae6cf5b90b153d334f0116645ec876009b5b2dc6084144690a","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.learningcheckpoint-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"556f77e7f3dac32d5dd73bd077b512c226207e19cda60ab556bdcf371a6c5a2e","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.learningcheckpoint-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-a.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"4376016a6114315e00dd9b2f3f9f00368e6867ac68fd83733eb0b6576b147401","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"472b16663c787fb8911ba5668675d21b6c7b61050bb5871e3fd19a5df7450583","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.outcome-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-a.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"470884afb317d69e8e0fb62e5a9f759b800ada18c8a55cc0a047dca837bb89e1","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Teori Dualitas","unit_type":"section"},{"canonical_native_record_sha256":"d64dae1ed9124ab2d82204741f4d98f644d33bf9e9d5e6db9ea17128b895e212","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.section-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pasangan Primal--Dual dan Dualitas Kuat","unit_type":"section"},{"canonical_native_record_sha256":"e53d4f2efca825113441b00531db507739ccba8cbb3b070a261dcc9311ba1dfb","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.section-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Berbagai Bentuk Primal--Dual","unit_type":"section"},{"canonical_native_record_sha256":"dfbf3b7c4907f8cf2a94c59c5c94f9af7f051b8470c2514cf7a639bcf0d897ac","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.section-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch11.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"3446678f395f45cecc1aef50d46a8d19369b893f1db5925a7f169084023bdf6d","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a.subsubsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:formulate-dual","unit_type":"solution"},{"canonical_native_record_sha256":"001033dedd1538521a1bfe6be5af56b282866d1f4f8f92843d36f2e7f54dc2b9","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-a.subsubsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:weak-duality-bound","unit_type":"solution"},{"canonical_native_record_sha256":"45e032383581d45b4688189e25cf9d60d8b580661789a946ba1dac01146f1427","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.text-a.subsubsection-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:dual-of-dual","unit_type":"solution"},{"canonical_native_record_sha256":"5fc896dabbca406a108bd4342154c62eb0d74df55fd5609944d34dd45d3c349c","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh Pemotivasi","unit_type":"subsection"},{"canonical_native_record_sha256":"4cb050cba6b4f5cec27f3dc4bc0d356eb669ec765802f19118e00dacc76f0c11","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsection-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-a.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Intuisi di Balik Dualitas","unit_type":"subsection"},{"canonical_native_record_sha256":"ef0d3e86e714a32c50bff315bbfa6623c244168c603f3a54ed36fa5107bfbdb2","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsection-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.text-a.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penurunan Umum Masalah Dual","unit_type":"subsection"},{"canonical_native_record_sha256":"7243fc9f578b08b3ae2465969ef58047baa8d3ee0a688f6126a8cc0b38dab859","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsection-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch11.text-a.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Interpretasi Ekonomi Masalah Dual","unit_type":"subsection"},{"canonical_native_record_sha256":"0fcba5c452b3c9b34167ef1d300f54f59a6d9b856ad40b778b70e98d22b7da27","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsection-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch11.text-a.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menurunkan Masalah Dual dengan Kendala Persamaan","unit_type":"subsection"},{"canonical_native_record_sha256":"b3436eed01bb60bfbcce2d6bfb65bb22dc2e524be081d08d97ba2cd1fd38df57","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsection-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch11.text-a.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Dual yang Rumit","unit_type":"subsection"},{"canonical_native_record_sha256":"2984ea21cd266de028389d4f8e3f4fe401aac9c3cc1875ae839fa4bcc3ba19f7","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsubsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Dual dari Contoh Berkesinambungan","unit_type":"subsubsection"},{"canonical_native_record_sha256":"55331e44b32ea59b6dc3fd8f9b5880b7c96fcbef5cdae09fa47fa3a95dad3cbd","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsubsection-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-a.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Interpretasi Harga Bayangan","unit_type":"subsubsection"},{"canonical_native_record_sha256":"b234ff30ccf26558bc3faff961dbe2e32bfeb54677b71980484f7f53d9773647","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsubsection-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.text-a.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Verifikasi Kelonggaran Komplementer","unit_type":"subsubsection"},{"canonical_native_record_sha256":"89425bb44aff0e6d68d277a15aaf8e54ba6f1cf5ac922a733a1faaae1928b435","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsubsection-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch11.text-a.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menyusun Batas dengan Kombinasi Persamaan","unit_type":"subsubsection"},{"canonical_native_record_sha256":"ab01f161bc9ba92d77182ebf5abab7b714b723d3546ca5477dd4d6983bc9ee7b","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsubsection-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch11.text-a.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Dual","unit_type":"subsubsection"},{"canonical_native_record_sha256":"aa85e7670a75af6f4f60a479c5fcec711412eeac9123824c10186be5786612af","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsubsection-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch11.text-a.subsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penurunan Masalah Dual yang Rumit: Tinjauan Kedua melalui Agregasi","unit_type":"subsubsection"},{"canonical_native_record_sha256":"9ef768b867843145ba95f15a01fbcc94e5da55667de99fa9148785a4784add95","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.subsubsection-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch11.text-a.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi Pilihan","unit_type":"subsubsection"},{"canonical_native_record_sha256":"bb1d93b8d2f425f0e9bb04988bf8bf3d8b15b5fe41ff93babcb1994bfbf8ef65","concept_ids":["concept.dual-formulation","concept.strong-duality","concept.weak-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-a.tryit-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-a.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"bc10bc8a4a42b57fe82563bc98a70b644b56e57ef32d4093e8b6dc16df9b343e","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch11.text-b","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch11","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"f586b9cf086e75989579e8d63ca9026ad0bdb4fec5a5c576bce2329d8c1644ec","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-b.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kelonggaran Komplementer","unit_type":"definition"},{"canonical_native_record_sha256":"4a187e7256ecd46f83bf854f32c0ad5757d51d981390e0671a4d85aaa8c43a30","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.ex-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-b.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memeriksa Syarat-syarat","unit_type":"exercise"},{"canonical_native_record_sha256":"837f4dec7de44b00a947b749e99e067647d9696bd89838733666d2adc4e83e8a","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.ex-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-b.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Produksi Toko Roti dan Interpretasi Dualitas","unit_type":"exercise"},{"canonical_native_record_sha256":"60ac5deff3af6f81c4ca5d21d08f06bf4beda6cb9f0a605c277763c9959da3a2","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.ex-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.text-b.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala Kotak dan Sertifikat Dual","unit_type":"exercise"},{"canonical_native_record_sha256":"776960abd523fbd713be3e924e75f82a568e7679aba694c351340757bfcff1f7","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.ex-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch11.text-b.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menurunkan Solusi Primal dari Tebakan Dual","unit_type":"exercise"},{"canonical_native_record_sha256":"7143016ad197e2a59531e149349278851bdd98bc7224370419f4269f99fec606","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.ex-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch11.text-b.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Harga Positif pada Kendala yang Longgar","unit_type":"exercise"},{"canonical_native_record_sha256":"90cef43574450feb45c95ef321fa2dffe4b0413e42e95d91687283413562c7b0","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.ex-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch11.text-b.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menyangkal Klaim Solusi Optimal","unit_type":"exercise"},{"canonical_native_record_sha256":"9c54bfaad9fa93fd0c034f58fd4ddfe7983b7a46aed5c02aa79fd3b88cfd1d60","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.ex-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch11.text-b.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Optimisasi Paket Makanan dan Dualitas","unit_type":"exercise"},{"canonical_native_record_sha256":"ecb35c031f7ccec3ce5e2fbde5317c6c633a5281a9bff89663da9152254a07bc","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.ex-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch11.text-b.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dualitas dengan Jenis Kendala Campuran: Perusahaan Rintisan Kemasan Ramah Lingkungan","unit_type":"exercise"},{"canonical_native_record_sha256":"9a5af751cfcffbc1e9330cbf9c5a01e43bffaa32aaa71878529de400bf0b05d6","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-b.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Meninjau Kembali Masalah Toko Roti","unit_type":"example"},{"canonical_native_record_sha256":"5ed9bfe8e7deb2980ef36878492f29094214b644ce511d94cd299fd238a61148","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-b.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menemukan Variabel Dual yang Belum Diketahui","unit_type":"example"},{"canonical_native_record_sha256":"ea9ad46e7a37c7dce2bf376e9445ae5cf7fd0bc88d8a473a0574b3d519c67562","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.text-b.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memverifikasi Keoptimalan dengan Kelonggaran Komplementer","unit_type":"example"},{"canonical_native_record_sha256":"a187df1e1a3d517cab1c250c070c55177296c3ac02a7d0386d2b2794543bcd5e","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.example-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch11.text-b.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memperoleh Kembali Variabel Dual melalui Kelonggaran Komplementer","unit_type":"example"},{"canonical_native_record_sha256":"4b74b70f35e0870ae5d93d099b2f3ffaf6043a2a23139189e5ccd7cce21d8c63","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.learningcheckpoint-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-b.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"55fdd4a0b9e6810dcde55bd9df3c7f9bdb3c7add212df639d9278383bc581025","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-b","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kelonggaran Komplementer","unit_type":"section"},{"canonical_native_record_sha256":"9712fdd9e5523dac8d79cf80cf83312594a1c8832460399d43245113b42c2a6f","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.section-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-b","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"21b5b51751c8f2d1d9e0fe92c139ca300bca2569f0b67b9485b4dc4ff20f5143","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.section-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.text-b","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Ringkasan: Mengapa Mempelajari Dualitas?","unit_type":"section"},{"canonical_native_record_sha256":"a289e5ad5c14d3984fce2e7df05eaf07809882b523f2f32dff984bccb9b1b644","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-b.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:cs-bakery-duality","unit_type":"solution"},{"canonical_native_record_sha256":"74b472142b63cfd6fb514a261d1e22b2c0af290e91684c0102567140a3495196","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-b.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:cs-box-constraints","unit_type":"solution"},{"canonical_native_record_sha256":"ec66431f995206b02a43ac78dcc4c593858a66f0c72eaf8d740f17698d90f5e6","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.text-b.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:cs-claimed-optimal","unit_type":"solution"},{"canonical_native_record_sha256":"b568692d2a51b2f6df64e597fa24ba6363ee9a2c434c202bbf9a2d1aec7846b8","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Definisi Kelonggaran Komplementer","unit_type":"subsection"},{"canonical_native_record_sha256":"44419b19c8d4c28126df1e83ad8b48c3d78841c2a6aa655f14c1d57d6c7c9103","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.subsection-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch11.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menafsirkan Kelonggaran Komplementer","unit_type":"subsection"},{"canonical_native_record_sha256":"e944f7b2f4bf1ff355ff0ff3d16416705cc274a5430f208f6068b094fa67e8e6","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.subsection-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch11.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggunakan Kelonggaran Komplementer untuk Menyelesaikan Masalah","unit_type":"subsection"},{"canonical_native_record_sha256":"50d56f245220a110ac572cb88d9743b3c24f8397b973e7f477953781dd12ae8e","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.subsection-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch11.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Ringkasan Pokok Penting","unit_type":"subsection"},{"canonical_native_record_sha256":"72933ee6a40ac049da965388b02a81c4f776130c39a2c6bc7f1c3389ba898c91","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.subsection-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch11.text-b.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Meninjau Kembali Contoh Toko Roti 2.0","unit_type":"subsection"},{"canonical_native_record_sha256":"c3ad8115d3fb7afe104913fa4048d0090c9562527c429656929e832fc5677ace","concept_ids":["concept.complementary-slackness","concept.strong-duality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch11.text-b.subsubsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch11.text-b.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi Pilihan","unit_type":"subsubsection"},{"canonical_native_record_sha256":"2a3d8ca966044a4ec925eef033a765db17782407a6ccaabfd7e40101fad65f76","concept_ids":["concept.python-optimization-workflow","concept.pyomo-modeling","concept.open-source-solver"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch12","locale":"mul","order":14,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.optimization-model"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Software - Python","title_target":"Perangkat Lunak -- Python","unit_type":"chapter"},{"canonical_native_record_sha256":"2378226322976dfe755a7f38db0e60b93d6e53867cf0b716721fb69234ab9cd7","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch12.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch12","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"11b77819c9ec4bca453a51c2155221e6c095bd126f68b4039da4a51e756074a4","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.solutions-manual.manualsolution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch12.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Margin Laba Baru","unit_type":"solution"},{"canonical_native_record_sha256":"9fa461f4320933b296c147ad9a90de395ba5cfe9eb7184194f20be6935585565","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.solutions-manual.manualsolution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch12.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dari Matematika ke PuLP","unit_type":"solution"},{"canonical_native_record_sha256":"30fb79ce70cd2dd9fea5875f04a3f54dafdcec3e76fc554c393e293de05b9798","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.solutions-manual.manualsolution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch12.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Data Permintaan Baru","unit_type":"solution"},{"canonical_native_record_sha256":"68fb1066bd0b2d20080c5aa926e30ba14e0f6e051a09cc9a36814dae95b893d6","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.solutions-manual.manualsolution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch12.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Model Transportasi Tiga Pabrik","unit_type":"solution"},{"canonical_native_record_sha256":"46a14dca8bb77d211ea8810cb5c9f54b609a267133acea551e87d032ee308c49","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.solutions-manual.manualsolution-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch12.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dual dan Slack dari Model yang Telah Diselesaikan","unit_type":"solution"},{"canonical_native_record_sha256":"e599c1fcbf06038d7da4fc2517a2dd55745179ec678b0acd5b3bc95dab398686","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.solutions-manual.manualsolution-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch12.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sapuan Kendala Epsilon","unit_type":"solution"},{"canonical_native_record_sha256":"a22f1e2151dbe418f5f59d82dde249dc06eaa25931b6c55c8bc20a43ee76a3d9","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.solutions-manual.manualsolution-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch12.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala yang Tidak Ada","unit_type":"solution"},{"canonical_native_record_sha256":"c66da1ed405a6c0ab10a9f59edcda9c5c5b68d9ed82f65cc9042833db770620c","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.solutions-manual.manualsolution-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch12.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Meminimumkan atau Memaksimumkan?","unit_type":"solution"},{"canonical_native_record_sha256":"074a803b4891bd0c444c7080d9c04661f4d2a93c7ad775a17daae12424207764","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.solutions-manual.manualsolution-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch12.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Laba sebagai Fungsi Tenaga Kerja","unit_type":"solution"},{"canonical_native_record_sha256":"9db227f1cd0e6161e4db64621ea50977ef810c7c2cbccb68cc8db4a392906876","concept_ids":["concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.solutions-manual.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch12.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bab 12: Perangkat Lunak -- Python","unit_type":"section"},{"canonical_native_record_sha256":"6ff426693d545d7a53dbd6a277a6c31b6a62d242d26b4bc07a3c5de089ddebb1","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch12.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch12","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"c6b8cf7b8915a24377d91e53f063cac8dd1af94050789b7dba89aadcb59421dc","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch12.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perangkat Lunak -- Python","unit_type":"chapter"},{"canonical_native_record_sha256":"160ef917f10435549b34386351c62fb6a28c30b785e75e7d836eb4c85b0c4d0a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.ex-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch12.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Margin Laba Baru","unit_type":"exercise"},{"canonical_native_record_sha256":"12a20bf841c66a4db16bcb3a4554fca8fb8053ef7114250959324a82a17af306","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.ex-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch12.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dari Matematika ke PuLP","unit_type":"exercise"},{"canonical_native_record_sha256":"612b013f54177b79c63574417d7e447005b36f928dd32ee0ba016440b77ede0d","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.ex-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch12.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Data Permintaan Baru","unit_type":"exercise"},{"canonical_native_record_sha256":"4cd70c64ed07e41c0c70bb659be665a195360d008ec48b08fb40494d4f53db1a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.ex-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch12.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Model Transportasi Tiga Pabrik","unit_type":"exercise"},{"canonical_native_record_sha256":"73fb3c309feae7575cfe60f1d48749100930d77474d8620df01070f8b53479bc","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.ex-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch12.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dual dan Slack dari Model yang Telah Diselesaikan","unit_type":"exercise"},{"canonical_native_record_sha256":"f3c1b61fb4ba36b3924f4c652fbdbd5e78a4aff8ca8d847b5f56ba23ba728f3e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.ex-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch12.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sapuan Kendala Epsilon","unit_type":"exercise"},{"canonical_native_record_sha256":"b0736d5d69d9b99614f7180c17ba135d6063dd0c4f91768ca40d6d173cdb1e68","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.ex-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch12.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala yang Tidak Ada","unit_type":"exercise"},{"canonical_native_record_sha256":"d55f246db877eda8ea942552a6902fb8cadd48a516b705f8018ffdd227baf503","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.ex-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch12.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Meminimumkan atau Memaksimumkan?","unit_type":"exercise"},{"canonical_native_record_sha256":"b287bad81409d546b36468b94a5fb851a85bd850de792325281fef6fc45b1a59","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.ex-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch12.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Laba sebagai Fungsi Tenaga Kerja","unit_type":"exercise"},{"canonical_native_record_sha256":"aac66e6b318f75be380ef5d61ee0b867df165c9eba4d17b939ac622f46b44289","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"9a94f05431fdb12ec86157f27da8ba35a437e8cb1aebe50be519a770effd7458","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengapa Python untuk Optimisasi?","unit_type":"section"},{"canonical_native_record_sha256":"7a5dac0d067dd6a339bc55f7262f3e5625c72201032441f9b8b9566c7ef77c63","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memulai","unit_type":"section"},{"canonical_native_record_sha256":"5bf986b7582c708a658008a0a16ae1e2e5f36717109aa6582bf29f83faf89507","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dasar-Dasar Python","unit_type":"section"},{"canonical_native_record_sha256":"1661e74ad646d9ce79a726fea2055bb6b25d1d5b2fafa67c03b877dbf6c50d20","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pokok-Pokok Python untuk Optimisasi","unit_type":"section"},{"canonical_native_record_sha256":"78d73d50ba0b1871a6aae1e6b608b976ff87ba2f815fba2d667af917c5a3b02b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"NumPy: Komputasi Numerik","unit_type":"section"},{"canonical_native_record_sha256":"227c49b71479fdfbd3752289f0ce7f79d6957ebcdf31e9ca218ece982a2f645b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pandas: Pengelolaan Data","unit_type":"section"},{"canonical_native_record_sha256":"2a77c14769dfedd14ff6651245aebe8b61b80be79d531400222f10f8a6ca5ab8","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Matplotlib: Visualisasi","unit_type":"section"},{"canonical_native_record_sha256":"1afd9cd2b7ea5b3b195590e99e1f749f185ca91158d9fef123d2fc9287793d87","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"NetworkX: Analisis Graf","unit_type":"section"},{"canonical_native_record_sha256":"6ba18baff9a4c0289bd082bd9de88ed3e58d41b4a73101ad3cd712cfa8271283","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"GeoPandas: Visualisasi Geografis","unit_type":"section"},{"canonical_native_record_sha256":"087fc32a3794f2648192c30b4dc6b18821f07f6f74ab16bf056eae86e963b936","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"PuLP: Pemodelan Optimisasi","unit_type":"section"},{"canonical_native_record_sha256":"714bb79ccd0db864bb1aed232a5154ccef948bcd447023ccb7463f87007bed91","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memadukan Semuanya","unit_type":"section"},{"canonical_native_record_sha256":"828cd631102d4d929e265b5f2cd63c32d7be9ef5cdd5ae9e332247b3f95a9e56","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.section-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch12.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"9189d866ae9d8e98b899df6581db3cdf396fffb9f3c9fc76d0238c22c02e8e39","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch12.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:pulp-translate","unit_type":"solution"},{"canonical_native_record_sha256":"7e2257e14b7df9bf7ff7c8155992536ba05bc29c705246916ef0a34ad4cd3bd4","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch12.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:pulp-duals","unit_type":"solution"},{"canonical_native_record_sha256":"7f173aa4995ccbaac39a77e3dc2154adf5a117d86b580ddb9af54ec55e3c39f7","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch12.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:pulp-rhs-sweep","unit_type":"solution"},{"canonical_native_record_sha256":"31d395ae328230c0f2187e022739a3cd372ae0a85591c9cb118409677baa2aad","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch12.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kekuatan Python","unit_type":"subsection"},{"canonical_native_record_sha256":"3bb3ac9f03d25df00b6ca947e5956800b7f976a71a0e288ae4163b35e7115cae","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch12.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jupyter Notebook: Sahabat Terbaik Analis Data","unit_type":"subsection"},{"canonical_native_record_sha256":"e2f06fa37da5c0ee8e7562becf48f72ee214ab351366e7b301d6eb70b983bc0c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch12.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pilihan untuk Menjalankan Python","unit_type":"subsection"},{"canonical_native_record_sha256":"6deec24ef6d2f4552c4bde40ccec2ca73939906eef388107dc5481b3cd598e88","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch12.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memasang Paket","unit_type":"subsection"},{"canonical_native_record_sha256":"5eb6644b5b386cbecf7b1162fa28351c401abf021a7723dafca13eda540d9e23","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch12.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Variabel dan Tipe Data","unit_type":"subsection"},{"canonical_native_record_sha256":"ae9370a1ef6c11d94a8cc6bac3d3f17bd7795fb032986be336cd29e6a36499ae","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch12.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Operasi Aritmetika","unit_type":"subsection"},{"canonical_native_record_sha256":"306cc4887854ac6529bd669459d12d4330cb6ce6373e6b13808d4e53c7025581","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch12.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Koleksi: List, Tuple, Dictionary, dan Set","unit_type":"subsection"},{"canonical_native_record_sha256":"ca730680d0f24ef478c07f378f989ad5bcc9f40805e88515f7cefc3c40e29a8a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch12.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pengindeksan dan Pengirisan","unit_type":"subsection"},{"canonical_native_record_sha256":"d8eeee29452664993222f38c27903bf74423523f820d04e8f01926e6d09e8d27","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch12.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Alur Kendali: Percabangan","unit_type":"subsection"},{"canonical_native_record_sha256":"582a91e8cc7a585750db068b38d0f15bc006e197ffa39c514e5f6224f8a5067c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch12.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Alur Kendali: Perulangan","unit_type":"subsection"},{"canonical_native_record_sha256":"4aa3a6c1948ffedc96f2f7f3ad631c5b7c261ebfc1a0ccef7b5bc0e373b4ebcc","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch12.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Fungsi","unit_type":"subsection"},{"canonical_native_record_sha256":"a63c4e0d472f7cfc0cff55076ebe93c498464b311d175e8dfc9e303cf2393149","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch12.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"List: Koleksi Terurut","unit_type":"subsection"},{"canonical_native_record_sha256":"930e7a2692f643a114b4ba49c5702aa82d26b966ae332aadc56b7204f9cb5d52","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch12.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dictionary: Pemetaan Kunci--Nilai","unit_type":"subsection"},{"canonical_native_record_sha256":"6d3233a10040d09a52867acaf2bd50d0c34eec6be47c8a1bf5777cc62003edef","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.ch12.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perulangan \\texttt{for}: Iterasi","unit_type":"subsection"},{"canonical_native_record_sha256":"ec94be2d25ef0af08e357ac78b56315dbf77e01c413b607fa8bffe0c5a67cd33","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.ch12.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Komprehensi List: Pembuatan List yang Ringkas","unit_type":"subsection"},{"canonical_native_record_sha256":"a9210f833b74a6e25c32d410f1f60de19c62b4a4cbfeefa2991a6f9f1544499b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-016","locale":"id-ID","order":16,"parent_id":"unit.r017.book1.ch12.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Fungsi: Kode yang Dapat Digunakan Kembali","unit_type":"subsection"},{"canonical_native_record_sha256":"d1b4e9458c3598f993356df1afde4e2730e5f5e6b71f83dab0de8078c4a27ff8","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-017","locale":"id-ID","order":17,"parent_id":"unit.r017.book1.ch12.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Membuat Larik","unit_type":"subsection"},{"canonical_native_record_sha256":"bca3ff78d5a312ec5b29ffa287c555e9f7d5747400edd72423875b6d059ee0e5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-018","locale":"id-ID","order":18,"parent_id":"unit.r017.book1.ch12.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Operasi Larik","unit_type":"subsection"},{"canonical_native_record_sha256":"41f747d7d26ff9da8e8b6200e87200993f9171f111c32f904277e6524a4945b7","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-019","locale":"id-ID","order":19,"parent_id":"unit.r017.book1.ch12.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Aljabar Linear","unit_type":"subsection"},{"canonical_native_record_sha256":"588857ff1d168f319d7782ec72df85c3ed16b407dbcf39091d4f31522f60d7ef","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-020","locale":"id-ID","order":20,"parent_id":"unit.r017.book1.ch12.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memvisualisasikan Operasi Larik","unit_type":"subsection"},{"canonical_native_record_sha256":"c2206d07e870ab99492c744131cb7b0f9ef0e099f4fbe7fb18ab6c27ae30ff81","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-021","locale":"id-ID","order":21,"parent_id":"unit.r017.book1.ch12.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"DataFrame: Tabel Data","unit_type":"subsection"},{"canonical_native_record_sha256":"747b3e5776e8968938de5b3a50b47239c435695a8cdd426f19db1f7592132384","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-022","locale":"id-ID","order":22,"parent_id":"unit.r017.book1.ch12.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Membaca Data dari Berkas","unit_type":"subsection"},{"canonical_native_record_sha256":"756477fd7e23556305b1a9246ad6be17cfb67e154e5f29083b03d738c5ef54f5","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-023","locale":"id-ID","order":23,"parent_id":"unit.r017.book1.ch12.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengakses dan Memfilter Data","unit_type":"subsection"},{"canonical_native_record_sha256":"ee4a1df79ebda5c07304736f414b4c45e54d72ec536ccd88601c99cc2dc49013","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-024","locale":"id-ID","order":24,"parent_id":"unit.r017.book1.ch12.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dari DataFrame ke Data Optimisasi","unit_type":"subsection"},{"canonical_native_record_sha256":"01619fe18ed10de1a3868f443753be41ec0a6a583edef1f1ffd1c54a86f90924","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-025","locale":"id-ID","order":25,"parent_id":"unit.r017.book1.ch12.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menganalisis Hasil","unit_type":"subsection"},{"canonical_native_record_sha256":"25eff6777f12d8020eae4a18f76972b60370bdf1ed01356126f796fee3e6695a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-026","locale":"id-ID","order":26,"parent_id":"unit.r017.book1.ch12.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram Batang: Membandingkan Kategori","unit_type":"subsection"},{"canonical_native_record_sha256":"1a3be21c6ace8a5c527209e88a4297bc0aa8acd34f5f145d670e12b745c3003a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-027","locale":"id-ID","order":27,"parent_id":"unit.r017.book1.ch12.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram Batang Berkelompok: Membandingkan Beberapa Deret","unit_type":"subsection"},{"canonical_native_record_sha256":"3e92bcd4e8d9bc400899b3dffba7181823ca401f2fdb64fb225747b5c81773ff","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-028","locale":"id-ID","order":28,"parent_id":"unit.r017.book1.ch12.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Peta Panas: Memvisualisasikan Matriks","unit_type":"subsection"},{"canonical_native_record_sha256":"586fa1734789e6425f75927ba00cfeac8739e9acbf4b745c110398f41af0252e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-029","locale":"id-ID","order":29,"parent_id":"unit.r017.book1.ch12.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Rujukan Penyesuaian Plot","unit_type":"subsection"},{"canonical_native_record_sha256":"84e75e938d501bedb6d0a0d5164668d545df16516fd22cf55acea5d34d55487c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-030","locale":"id-ID","order":30,"parent_id":"unit.r017.book1.ch12.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengapa Graf Penting bagi Optimisasi","unit_type":"subsection"},{"canonical_native_record_sha256":"4e3d402808428699d64a706abad58db13986270ba8f1e43a2b0f13b3ad94c159","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-031","locale":"id-ID","order":31,"parent_id":"unit.r017.book1.ch12.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Membuat Graf","unit_type":"subsection"},{"canonical_native_record_sha256":"bbaa08baa83ab17461c16020759e7d66774703721cf68b0fd9688a269c8404bf","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-032","locale":"id-ID","order":32,"parent_id":"unit.r017.book1.ch12.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengakses Data Graf","unit_type":"subsection"},{"canonical_native_record_sha256":"8bd18b2283b4181139efd9addd99590366c545255558ca3f7a2a0ef05e873ea2","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-033","locale":"id-ID","order":33,"parent_id":"unit.r017.book1.ch12.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Algoritma Graf","unit_type":"subsection"},{"canonical_native_record_sha256":"5bc8d2d2cd762cbfeda418a041dd1af5a756f138a962c43125582d998135c21e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-034","locale":"id-ID","order":34,"parent_id":"unit.r017.book1.ch12.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Visualisasi","unit_type":"subsection"},{"canonical_native_record_sha256":"716b28bcca4ef5749e19feca0869625f0e6698d0fb798bdd1d260228b2f1ce1e","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-035","locale":"id-ID","order":35,"parent_id":"unit.r017.book1.ch12.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengapa Visualisasi Geografis?","unit_type":"subsection"},{"canonical_native_record_sha256":"eac73bef7c17b4db2209783277721902e38a233872793a8d1570d0078336d6c1","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-036","locale":"id-ID","order":36,"parent_id":"unit.r017.book1.ch12.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Membuat Data Geografis","unit_type":"subsection"},{"canonical_native_record_sha256":"2bff3ddfceb9fef91fd089906c5773ce84c3011bea70af72f426ac52d33febd6","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-037","locale":"id-ID","order":37,"parent_id":"unit.r017.book1.ch12.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Visualisasi Peta","unit_type":"subsection"},{"canonical_native_record_sha256":"71eff3fc30aba1690c8a5a6998761d418d37f2f666fec8e2f6e432a89704bf9a","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-038","locale":"id-ID","order":38,"parent_id":"unit.r017.book1.ch12.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memasang PuLP","unit_type":"subsection"},{"canonical_native_record_sha256":"4ede4841e379d7f447f13745f64a3668e06376e3381cf7fce218c905c56e18d9","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-039","locale":"id-ID","order":39,"parent_id":"unit.r017.book1.ch12.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pola Pemodelan PuLP","unit_type":"subsection"},{"canonical_native_record_sha256":"1a19be0d0e5f424a802362da5603f6ff9d8d9d658e890d23c02e2bfb29ec058b","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-040","locale":"id-ID","order":40,"parent_id":"unit.r017.book1.ch12.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh: Masalah Bauran Produk","unit_type":"subsection"},{"canonical_native_record_sha256":"f94166ca06cd6175d805580621e6fd8348ab2554aa07a092f7b1551353dcfec7","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-041","locale":"id-ID","order":41,"parent_id":"unit.r017.book1.ch12.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jenis Variabel","unit_type":"subsection"},{"canonical_native_record_sha256":"6260d14854adf67ae1c7893028453613d04d31fd2a7d84aface0bd89c093b6cb","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-042","locale":"id-ID","order":42,"parent_id":"unit.r017.book1.ch12.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Membuat Banyak Variabel","unit_type":"subsection"},{"canonical_native_record_sha256":"fa72603859fd110e098a9e08985d2887ed01af9e87f3e8e5ea76b48327fa862c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-043","locale":"id-ID","order":43,"parent_id":"unit.r017.book1.ch12.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Fungsi \\texttt{lpSum}","unit_type":"subsection"},{"canonical_native_record_sha256":"cdedb7a10011dbc3b9f8dfd76197580eea768ba1d1e724608f6d90efad4baec1","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsection-044","locale":"id-ID","order":44,"parent_id":"unit.r017.book1.ch12.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh Transportasi Lengkap","unit_type":"subsection"},{"canonical_native_record_sha256":"8421f2757bc8a78afe62092e7b4fdecfa7db56a2d987a4d2f316a795af49156c","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.subsubsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch12.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"a543ca90bd6edf20e3c36d1d699a31f4cd9a17504af5bd5ab3a2bbd4e00d8612","concept_ids":["concept.open-source-solver","concept.pyomo-modeling","concept.python-optimization-workflow"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch12.text.tryit-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch12.text.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"8ea97f12941e87fdd68d35c60058bf1ffd2686b660bd33db00a21861d98bafab","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method","concept.epsilon-constraint-method","concept.lexicographic-optimization"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch13","locale":"mul","order":15,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Multi-Objective Optimization","title_target":"Optimisasi Multiobjektif","unit_type":"chapter"},{"canonical_native_record_sha256":"29d518c6627102d1c9a95d75789971419aef196458ee1e43121c7f79b7d38f10","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch13.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch13","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"e0a3479f19348a7a3f88063e77e0c6a8b77702170a220dc58640aecfe56d13c4","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.solutions-manual.manualsolution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mendefinisikan Optimalitas Pareto","unit_type":"solution"},{"canonical_native_record_sha256":"65124e4cdc89fb67c80378281a38d0aa2f5e8e5482af70c7943f056cff1143ab","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.solutions-manual.manualsolution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch13.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menemukan Desain Terdominasi","unit_type":"solution"},{"canonical_native_record_sha256":"bd6de8c494c9c97dbd6b114dd25f3cbaee6b2d080df1792987dee9326c59237a","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.solutions-manual.manualsolution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch13.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menghitung Skor Jumlah Berbobot","unit_type":"solution"},{"canonical_native_record_sha256":"dafd8bde6c7a40b4442df78e021e7c8eac06599c01af633f5d65bab9093af1fb","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.solutions-manual.manualsolution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch13.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Batas Pareto, Jumlah Berbobot, dan Kendala-$\\varepsilon$","unit_type":"solution"},{"canonical_native_record_sha256":"1f9137dfd7ac8f122867b3fb15401f9fc47a946f2f93915c4b0eba52389b4069","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.solutions-manual.manualsolution-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch13.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Metode Jumlah Berbobot","unit_type":"solution"},{"canonical_native_record_sha256":"0edd353cf2c611f68ed36e04fc86b6211ebbb048d9b6aaee3fca6fb93320ddf8","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.solutions-manual.manualsolution-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch13.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Metode Kendala-Epsilon","unit_type":"solution"},{"canonical_native_record_sha256":"d99aa9b00ee96865b755fdd510cd6253f919c76cd0193846e79444b822d2fbd6","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.solutions-manual.manualsolution-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch13.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala-Epsilon secara Manual","unit_type":"solution"},{"canonical_native_record_sha256":"290afd45f6d4d329053fa615c0ff36d0bf2be8569838059c8dda9c46e1ce78ec","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.solutions-manual.manualsolution-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch13.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Analisis Kompromi","unit_type":"solution"},{"canonical_native_record_sha256":"8b534c78fb67f9b193b092b4b56cf926d232644fe22e1d767c1752a812fea826","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.solutions-manual.manualsolution-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch13.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Hal yang Tidak Dapat Dilihat oleh Jumlah Berbobot","unit_type":"solution"},{"canonical_native_record_sha256":"1da584db971b20053d4eb2cc14e8d5fba15135c0949c8db4baf83b8bbe235587","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.solutions-manual.manualsolution-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch13.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bobot yang Memilih Setiap Titik Sudut","unit_type":"solution"},{"canonical_native_record_sha256":"5ff7426f397a7c74c6de45ab37538e680027b054f4f80173d3414ad44264ff8d","concept_ids":["concept.multiobjective-optimization","concept.pareto-optimality"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.solutions-manual.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bab 13: Optimisasi Multiobjektif","unit_type":"section"},{"canonical_native_record_sha256":"e4c697c0985ce2f2a27d6cbc698237f11265abde2b831dd939baed952968d5ba","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch13.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch13","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"195867484599f8d2a7ec54b4976c8ccc5ddf86e093728d2e3bd5d0c41dadb99d","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Optimisasi Multiobjektif","unit_type":"chapter"},{"canonical_native_record_sha256":"093372d105a9f9aa5cac3405e4a26732f7e081a9715a97f0725d4ce8fd7ccf74","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Optimal Pareto","unit_type":"definition"},{"canonical_native_record_sha256":"133e1d4c992cdbf58b0cac22fe83e103ff9fdc0858f39faf31379fa470e85123","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.ex-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mendefinisikan Optimalitas Pareto","unit_type":"exercise"},{"canonical_native_record_sha256":"524e6a33350afced2e4060929186471a06a613958e2fa39a1654c2564c48cab6","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.ex-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menemukan Desain Terdominasi","unit_type":"exercise"},{"canonical_native_record_sha256":"9583507687090729545118b90dca18c33053c0631561f5494653a92728e49242","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.ex-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menghitung Skor Jumlah Berbobot","unit_type":"exercise"},{"canonical_native_record_sha256":"51511e26b042d9c324eee9245f11f73f3b904eb24293a61071beba7e6143cad4","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.ex-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Batas Pareto, Jumlah Berbobot, dan Kendala-$\\varepsilon$","unit_type":"exercise"},{"canonical_native_record_sha256":"a8f3629b3331d537e69d205aea060eb19818577ab181bc18ee5ada953982aedd","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.ex-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Metode Jumlah Berbobot","unit_type":"exercise"},{"canonical_native_record_sha256":"9a1a647b79474c3789dfe62023adc021d81780aa072ca7a810e48e39afa40e1c","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.ex-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Metode Kendala-Epsilon","unit_type":"exercise"},{"canonical_native_record_sha256":"b68f698a89a1ecc498c61befda104f77b5f946fe4eda28920d3a77698c18a061","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.ex-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala-Epsilon secara Manual","unit_type":"exercise"},{"canonical_native_record_sha256":"1e7789c7ad4c53ca9e22873e9051f16dcfdee07c4b355381f53b4cb29a0e8b4f","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.ex-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Analisis Kompromi","unit_type":"exercise"},{"canonical_native_record_sha256":"5e4556e295f13c5307c649a8f7b7a65ff0775f3a43acf0561bc505c5d08633fc","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.ex-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Hal yang Tidak Dapat Dilihat oleh Jumlah Berbobot","unit_type":"exercise"},{"canonical_native_record_sha256":"c2bb6e357c93dbffae87220d1bf037a6a777c4d5adb83603b6537ac5c2cd299d","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.ex-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Leksikografis versus Jumlah Berbobot","unit_type":"exercise"},{"canonical_native_record_sha256":"cd5f9ce5e5e2892794f97f974819cf67e9e85a8e6b5865b178d60d2eaad2dcd5","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.ex-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bobot yang Memilih Setiap Titik Sudut","unit_type":"exercise"},{"canonical_native_record_sha256":"32644d6d884264768ce88e89fe2d170e0301184635a21462a1ffc361ac4e2d11","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.figure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"9cc60a24b025cf7c553c5d99930c35e558162dde8d596aeea0d619734aac7d9d","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.figure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch13.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"730465f2ba3c46a15aadee42cde5e7f0ba189819c1bbd8f08852fc895c43e0f4","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.figure-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch13.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"386e6a5a2c8d1c632e0eed1219d48bc8734bf0ada25152cfaee7b9db74788cf4","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.figure-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch13.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"b7c69b9e7e3930150d5a6477985c81fdecf38e3240600659131f4c36e0820647","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.figure-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch13.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"449ecbdfbbcd243dedcf21d3906b9a21eab02b6678f1ea126fbe6737ab6de2da","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"fee14f37134a89bcd864eeb3ebb4ea1f4bd0aac65f04b2d58e82cf9fc5606a7b","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pengantar Optimisasi Multiobjektif","unit_type":"section"},{"canonical_native_record_sha256":"f3c111d8126dc0527bd67e4ec52db6ba3721cf8dca9dd8f515230cfa1d9b6cf1","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.section-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch13.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Optimisasi Multiobjektif dan Batas Pareto","unit_type":"section"},{"canonical_native_record_sha256":"70ecdab460d2997819fbfd05a32e46baa37c1c62a87c076ed7641656c93e5efd","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.section-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch13.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Perangkat Komputasi untuk Optimisasi Multiobjektif","unit_type":"section"},{"canonical_native_record_sha256":"a9265c33b8fad064df32e31f256fb2afe17c592a2368a7dd4d1ab532a6734622","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.section-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch13.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"b9c03b8db2bfdc5fa49d1985b335d78d2bf307e404e07826759572411044537a","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.text.subsubsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:pareto-def","unit_type":"solution"},{"canonical_native_record_sha256":"56ac2579d9b305e81aa84b8492201d1b55ddfb338b96e502ff6e62f8c39bee61","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch13.text.subsubsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:pareto-table","unit_type":"solution"},{"canonical_native_record_sha256":"45da41d805d5e2c5c9f0e5399f8d52b53445b310a7e919ab799d618f9075e15f","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch13.text.subsubsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:eps-triangle","unit_type":"solution"},{"canonical_native_record_sha256":"5058c130e6cfd3f320ed76e5df00027ff48b8c2fe70e1766bf9b0a8b50cb4e75","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.solution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch13.text.subsubsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:furniture-weights","unit_type":"solution"},{"canonical_native_record_sha256":"5f9054b11c111cbb07689ce9a0fd9d839baa9c104d014e2c2ebfdafca2039f6f","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penerapan Batas Pareto","unit_type":"subsection"},{"canonical_native_record_sha256":"6b2a7b6a0882c6e1f509304e7c1ea505707d059859c8fd6b11db79fb40e068c6","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.subsubsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Optimisasi Portofolio","unit_type":"subsubsection"},{"canonical_native_record_sha256":"9221d84e11d6a2528f4a29757f734c8d70002375468fedf3391b87d306fff571","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.subsubsection-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch13.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Desain Rekayasa","unit_type":"subsubsection"},{"canonical_native_record_sha256":"da4ad4d86e7d911ec04add82005d530766f4762fb1331bd2dbc2b1a4e807b75a","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.subsubsection-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch13.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penjadwalan Staf Layanan Kesehatan","unit_type":"subsubsection"},{"canonical_native_record_sha256":"f99791bbc67217cd3232c84a19b2653557d7cba29573c1c616ea6aa0474c9d6e","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.subsubsection-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch13.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Rantai Pasok dan Keberlanjutan","unit_type":"subsubsection"},{"canonical_native_record_sha256":"de88474008e30d3503d7828993556b199edfca2d298be3a3530154f84ccbd457","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.subsubsection-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch13.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"21ee55b059b52e8d2a77c70f0e6d3e681b8ae1a751968865eaec97d14f12f951","concept_ids":["concept.epsilon-constraint-method","concept.lexicographic-optimization","concept.multiobjective-optimization","concept.pareto-optimality","concept.weighted-sum-method"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch13.text.table-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch13.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"873344982ee60e5c8f42c306ee5f078d87dadc75294c5ee83b45bfe2d319d8f8","concept_ids":["concept.graph-theory","concept.shortest-path","concept.dijkstra-algorithm","concept.minimum-spanning-tree","concept.kruskal-algorithm","concept.prim-algorithm","concept.euler-circuit","concept.hamilton-circuit","concept.traveling-salesperson"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch14","locale":"mul","order":16,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.graph-theory"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Graph Algorithms","title_target":"Algoritme Graf","unit_type":"chapter"},{"canonical_native_record_sha256":"780c3808bb788aa3edf4c9ea354f5c807c0b167c3b1cd9f6dfb6e8f7796b3b0a","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch14.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch14","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"cd9b3421e9584407aabe5ec20d5d8df6bcf47d0d612635283d4ef737a5b47009","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bab 14: Algoritme Graf","unit_type":"section"},{"canonical_native_record_sha256":"aba8f09fdcd44cd159f6f114798fbae6e1908ec1c212587d3e420cc36049a232","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Cek pembelajaran (graf harga tiket pesawat lima kota)","unit_type":"subsection"},{"canonical_native_record_sha256":"7822e7776530557b003e8a24bdee170cbb74d40242e1601108d920388a570231","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan 14.1: Pohon Merentang Biaya Minimum (Kruskal)","unit_type":"subsection"},{"canonical_native_record_sha256":"fae1114e5bf986e40a317d96fa870135a328966fd76c1427eb60d4d0af5625a9","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan 14.2: NetworkX","unit_type":"subsection"},{"canonical_native_record_sha256":"1a4a19cc961162dbadc959cf8a9204b86eae6acecaa03f7a84fa1772917681af","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan 14.3: Algoritme Prim","unit_type":"subsection"},{"canonical_native_record_sha256":"3a3edcef945d72ddf3f115df9ee0e61e9aae5b5045b2adf3f5071b2427488c82","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan 14.4: Masalah Lintasan Terpendek (A ke G)","unit_type":"subsection"},{"canonical_native_record_sha256":"f2ba70d6aa3e581d94848cb02db06d01b1d6349f404bad6dac702a06ba95da8c","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 1: Graf petugas pos (menggambar)","unit_type":"subsection"},{"canonical_native_record_sha256":"cf279957f4bdf0daf4ae76edc0272cb540f891172fd97c3cade8b8b440409d12","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 2: Graf tujuh jembatan (menggambar)","unit_type":"subsection"},{"canonical_native_record_sha256":"099609dc44ce390a10942995544d897937150ab93da2f02842d644c6c04bdc94","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 3: Graf waktu berkendara Dallas (menggambar)","unit_type":"subsection"},{"canonical_native_record_sha256":"6c01434b1be89d93088bb31b9e863fcc45af04086e3da242b96e3d4802eb5ec7","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 4: Graf harga tiket pesawat (menggambar)","unit_type":"subsection"},{"canonical_native_record_sha256":"889314cf19d9cd2b8e48c32c519ee9efe8a34b0ec0f0c7953a51ad8e85b2bf5c","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 5: Derajat pada graf pertama","unit_type":"subsection"},{"canonical_native_record_sha256":"7fad6cdf1065649843b438325530d8c68163e7314827313e8a9af94403d50d07","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 6: Derajat pada graf kedua","unit_type":"subsection"},{"canonical_native_record_sha256":"35cb7f4252dbdc8e04a9e0e8cfa90ea71c64da2c0a07e5afa69d9a0475b7e752","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 7: Graf mana yang terhubung (lima simpul)","unit_type":"subsection"},{"canonical_native_record_sha256":"ccb0ca809982bda892b73cb73009b2714d63d899a73bc9bffd1deba08e68758e","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 8: Graf mana yang terhubung (delapan simpul)","unit_type":"subsection"},{"canonical_native_record_sha256":"112e2defef5b79c8160515b533c4d49da1b5005dbd0fa15e8018a78980117999","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 9: Eurail, Bern ke Berlin (Dijkstra)","unit_type":"subsection"},{"canonical_native_record_sha256":"4b59a05f3f8a0538eb57a830ad1e3097dbaf90ea342550db05614510abfaaadf","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 10: Eurail, Paris ke M\\\"unchen","unit_type":"subsection"},{"canonical_native_record_sha256":"bc12c8cb29556338367e02b5e8f4e2caf70efc76a5de99ad82a6b73f1c4d9809","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-016","locale":"id-ID","order":16,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 11: MST graf Dallas","unit_type":"subsection"},{"canonical_native_record_sha256":"f46e8b2a1ca8e9311b5b3b95545d3b119d2a35564af5d9cc8b152c86cbbc63b4","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-017","locale":"id-ID","order":17,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 12: MST untuk lima bangunan","unit_type":"subsection"},{"canonical_native_record_sha256":"20c5c8e56eb5b7abb8bf81e070bbac7d69e7731d83e0ab7384766b553b020658","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-018","locale":"id-ID","order":18,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 13: Kereta Virginia, Bristol ke Washington (Dijkstra)","unit_type":"subsection"},{"canonical_native_record_sha256":"e936383c30c35e134467517412f426d4e54a60ffecdebe92298aeaa72ba065cd","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-019","locale":"id-ID","order":19,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keterampilan 14: Kruskal pada graf harga tiket pesawat","unit_type":"subsection"},{"canonical_native_record_sha256":"cde44816612d860189c3b81643a747d7cc72f3bb9123773801dc1bbfa96a261c","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-020","locale":"id-ID","order":20,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Konsep 15: Simpul berderajat ganjil","unit_type":"subsection"},{"canonical_native_record_sha256":"8c3e51a94a1a4be779ad01a5be25679b01bb5a563eaff7cdfdaeb4560f11b6cd","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-021","locale":"id-ID","order":21,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Konsep 16: Mengapa sifat rakus berhasil untuk pohon merentang","unit_type":"subsection"},{"canonical_native_record_sha256":"8fa5e483d57548a01d2097642cd93f63cc9743da134ac23e2ef1310c9243199b","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-022","locale":"id-ID","order":22,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Konsep 17: Mengapa Dijkstra memerlukan bobot tak negatif","unit_type":"subsection"},{"canonical_native_record_sha256":"72abcd6675b25f7fe14792cf33b3122802ea2f8f5f85c0b20083056c4407ee56","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-023","locale":"id-ID","order":23,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Eksplorasi 18: Jejaring sosial (panduan dan rubrik)","unit_type":"subsection"},{"canonical_native_record_sha256":"543539180edab6b40b7dee4713a3252aeb8ee6b59a73071d3713cc806cf01920","concept_ids":["concept.graph-theory","concept.minimum-spanning-tree","concept.shortest-path"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.solutions-manual.subsection-024","locale":"id-ID","order":24,"parent_id":"unit.r017.book1.ch14.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Eksplorasi 19: Jarak Levenshtein (panduan dan rubrik)","unit_type":"subsection"},{"canonical_native_record_sha256":"21221129c2a7e6e143398be7653c0a4f8e4df92125f37d250322fa0ffe7518f2","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch14.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch14","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"e33c6fb28773d0f0f08a8dc46d473aad14be22efd96df872cc9ca43f3e852638","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Foto udara sebuah kawasan perumahan di Missoula, Montana, yang memperlihatkan beberapa blok rumah...","unit_type":"figure"},{"canonical_native_record_sha256":"db1364ba5c43f73b28a9fa94e32b0fca70d53aee618592ba4c5b2933c50a0ed3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch14.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Berdampingan: pada foto udara kawasan perumahan ditambahkan titik merah di persimpangan dan garis merah di sepanjang jalan...","unit_type":"figure"},{"canonical_native_record_sha256":"d4347f6b9a65bb792588c7c12d7677a98e652c4ece7cb707a1fce582b2c90491","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch14.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf kawasan perumahan dengan delapan belas simpul A sampai R yang ditata kurang lebih menyerupai kisi...","unit_type":"figure"},{"canonical_native_record_sha256":"08d108edbe781c5cb3b79ca742e351ee5d0267efb39ede17529bb1155cfb7304","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch14.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf G dengan 18 simpul yang sama (simpul A sampai R), digambar ulang dengan simpul-simpul tersebar dalam tata letak nonkisi.","unit_type":"figure"},{"canonical_native_record_sha256":"2df75a545ea3c347c9b3ef2beaf280058b6cba25ded85b43f1949638f977b35b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch14.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Peta historis kota K\\\"onigsberg di Prusia dengan sungai yang ditandai biru dan ketujuh...","unit_type":"figure"},{"canonical_native_record_sha256":"fa98bbc7da54213019b433899d4a73c73963cbd48374f7929cc97dfc2f13da0b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch14.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Skema empat daratan K\\\"onigsberg yang digambar sebagai elips berlabel (North Bank, Island, East...","unit_type":"figure"},{"canonical_native_record_sha256":"3066db6def8ee82c7e4af1bd43b7ad74dadaf9a722cdb79a6973661407d3cd77","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch14.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Abstraksi graf jembatan K\\\"onigsberg: empat simpul bundar berlabel NB, I, EB, dan SB dengan...","unit_type":"figure"},{"canonical_native_record_sha256":"e81d6b3ec7fd98cca11e05daaad50522ae5f782b76c8f1046a3ce5f2910d0b21","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf kecil yang mengilustrasikan sebuah gelang: tiga simpul berupa titik penuh membentuk segitiga dan sebuah gelang merah...","unit_type":"figure"},{"canonical_native_record_sha256":"5279dea97452f4adae94e0ffe29cec5e7846473ad31c5284cde3caf9f676f1eb","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh simpul berderajat 0 sampai 4.","unit_type":"figure"},{"canonical_native_record_sha256":"e9b54ddbf2581859b6db53ceb5a35146a3eaae0c733d22351fdc326d160bfa77","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf kisi 3 kali 4 dengan 12 simpul berlabel A--D (atas), E--H (tengah), dan J--M (bawah).","unit_type":"figure"},{"canonical_native_record_sha256":"120093eef28083a29d7084bac669dd8454ebf32c11f9f7f2a4aff0448a5c2b8a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf kisi 3 kali 4 yang sama (simpul A--D, E--H, J--M) dengan sebuah sirkuit yang disorot merah tebal...","unit_type":"figure"},{"canonical_native_record_sha256":"9106033d669c7d38eb258654573ffa18c8f704cab705e779ad596d7d71ac5006","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf kisi 3 kali 4 dengan simpul A--D, E--H, J--M, tetapi sisi horizontal pada kolom A dihapus sehingga...","unit_type":"figure"},{"canonical_native_record_sha256":"90b9ca632148c61fb891ea6cc97e4e535b06084d9789b914313ce9aefe98fce0","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf berbobot lima kota di A.S. (LA, Seattle, Chicago, Atlanta, Dallas) yang diperlihatkan sebagai titik-titik penuh...","unit_type":"figure"},{"canonical_native_record_sha256":"237171575946facb071bbbb0b901a889128b4fd3241a5749fbcf4bc4c0756a73","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram keadaan awal algoritme Dijkstra: tujuh simpul bundar biru T, E, A, NB, MR, P, Y...","unit_type":"figure"},{"canonical_native_record_sha256":"3d58682cca252c3a8d90c022101e97c4d8774256661d784b5ac1d5a8ad173c3e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jaringan jalan berbobot untuk contoh Yakima-ke-Tacoma: tujuh simpul berupa titik penuh T (Tacoma), E...","unit_type":"figure"},{"canonical_native_record_sha256":"98068379c3fe76292b26fdfb7d5247e5c497527d3b61e97f68cae7252b47959a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-016","locale":"id-ID","order":16,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jaringan jalan Yakima-ke-Tacoma seperti sebelumnya, kini dengan tujuan Y diberi anotasi [0] berwarna merah untuk menandainya...","unit_type":"figure"},{"canonical_native_record_sha256":"d29c3286ea0e806a15bf10b1d8ab3b18e623c9e0d0ffdb0797158376d542a60f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-017","locale":"id-ID","order":17,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh Yakima setelah langkah 2 Dijkstra: jarak sementara [104] di NB, [96] di MR, [76] di P...","unit_type":"figure"},{"canonical_native_record_sha256":"05a80fa638449f47722259c5f6437679f3afd5e624c90d9deb5cc47e6a558693","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-018","locale":"id-ID","order":18,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh Yakima setelah iterasi kedua: P merupakan simpul aktif; E kini memiliki jarak sementara...","unit_type":"figure"},{"canonical_native_record_sha256":"e6fc37939dab564eae0590899ae3a6565617500592d15d1c1f5bf77c6de9f943","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-019","locale":"id-ID","order":19,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh Yakima setelah iterasi ketiga: A memiliki jarak sementara [175] (melalui MR); P dan Y tampak...","unit_type":"figure"},{"canonical_native_record_sha256":"35ec5dd6e014e6c0a3d0427181fab5fbb1231f81880b99b0fa8bc0a1e69641ee","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-020","locale":"id-ID","order":20,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh Yakima setelah iterasi keempat: jarak A diperbarui menjadi [140] melalui NB; NB, MR, P, Y...","unit_type":"figure"},{"canonical_native_record_sha256":"9ea444f0f8cb54a6c1acfcf900734201393e1444c23d6d7a9b01ccbab09d6194","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-021","locale":"id-ID","order":21,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh Yakima setelah iterasi kelima: T menerima jarak sementara [160] melalui A; A, NB, MR, P...","unit_type":"figure"},{"canonical_native_record_sha256":"83faa320574a52cb19769118f5ceec4bd6be72c60807a9cc4d57b2cf92f63568","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-022","locale":"id-ID","order":22,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf tak berarah berbobot untuk contoh Dijkstra.","unit_type":"figure"},{"canonical_native_record_sha256":"b5362ed0aac038ae9f730e11fbd8112970b009f790b11544964ff31cb8587fdd","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-023","locale":"id-ID","order":23,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Langkah 1 Dijkstra: simpul awal a disorot merah dan diberi label jarak sementara 0.","unit_type":"figure"},{"canonical_native_record_sha256":"2978767a8726264a5666c6480a06c62394d23618db189ddac777aac36844754c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-024","locale":"id-ID","order":24,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Langkah 2 Dijkstra: simpul b kini ditandai telah dikunjungi dengan jarak permanen 2 dan sisi a-b...","unit_type":"figure"},{"canonical_native_record_sha256":"20bc4fcb11074b77f7b080c7e754c292b195c0b071374ec72dfe2c1444d7a77d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-025","locale":"id-ID","order":25,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Langkah 3 Dijkstra: simpul c ditandai telah dikunjungi dengan jarak 6 dan sisi a-c disorot.","unit_type":"figure"},{"canonical_native_record_sha256":"c6389f6218872c02cc8318cc21947b5072a72fc5cabdcec4ede7975f59bb19e3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-026","locale":"id-ID","order":26,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Langkah 4 Dijkstra: simpul d ditandai telah dikunjungi dengan jarak 7 dan lintasan a-b-d disorot merah.","unit_type":"figure"},{"canonical_native_record_sha256":"4c868df3bcf869f98b9c084909776f6041ff6cec6f9d05bad2f6aabfd0981990","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-027","locale":"id-ID","order":27,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Langkah 5 Dijkstra: simpul e ditandai telah dikunjungi dengan jarak 17 dan sisi d-e ditambahkan ke...","unit_type":"figure"},{"canonical_native_record_sha256":"6b15d24e31969ad1a882f0ad392b97fbe8489263777c8a4bd18ed76d43a16970","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-028","locale":"id-ID","order":28,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Langkah 6 Dijkstra: simpul g ditandai telah dikunjungi dengan jarak 19 dan sisi e-g disorot...","unit_type":"figure"},{"canonical_native_record_sha256":"639f25673b20359c3628aa9eae401d63a0722fc847664a5433167bd935932981","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-029","locale":"id-ID","order":29,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Langkah 7 Dijkstra: simpul f ditandai telah dikunjungi dengan jarak 22 dan sisi d-f disorot bersama...","unit_type":"figure"},{"canonical_native_record_sha256":"dd534c348cf4a90543869adbdd2e3cdb4f8dcc0aa59098e9134d3ceec7aba206","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-030","locale":"id-ID","order":30,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Keadaan akhir contoh Dijkstra: setiap simpul memuat jarak lintasan terpendeknya dari a (a=0...","unit_type":"figure"},{"canonical_native_record_sha256":"37eba4180266d2b3d12e060de3e4093e738a33c54b772abb4d2d81b281996088","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-031","locale":"id-ID","order":31,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf berbobot tujuh simpul yang sama dengan lintasan terpendek dari a ke g disorot merah...","unit_type":"figure"},{"canonical_native_record_sha256":"6c33454b1b20a882c0500cb665a9a4594b011727fe7d769d6a66274dd320aa86","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-032","locale":"id-ID","order":32,"parent_id":"unit.r017.book1.ch14.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pohon merentang 4 simpul yang digambar sebagai titik penuh di sudut-sudut wilayah kecil dan dihubungkan oleh tiga...","unit_type":"figure"},{"canonical_native_record_sha256":"b713c30f777d4596b6ed5f97f6c44f9fb58b385a37dea34540f63e3b1d7300e6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-033","locale":"id-ID","order":33,"parent_id":"unit.r017.book1.ch14.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Lima contoh pohon merentang pada graf dengan empat simpul.","unit_type":"figure"},{"canonical_native_record_sha256":"dca901192e5f24fd733afc511235c529a571d4d3a7506f6101108c0145540ea5","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-034","locale":"id-ID","order":34,"parent_id":"unit.r017.book1.ch14.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kasus dasar: Satu simpul tanpa sisi","unit_type":"figure"},{"canonical_native_record_sha256":"b04b90bd332809334d54f7bbd7680ff60302a8a2670f8aecaed4b01d0d34867b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-035","locale":"id-ID","order":35,"parent_id":"unit.r017.book1.ch14.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Langkah induksi: Menghapus daun \\( L \\) dan sisi putus-putusnya menyusutkan pohon menjadi 4 simpul dan 3 sisi","unit_type":"figure"},{"canonical_native_record_sha256":"e885bc915f32a875ec04201735012641802235f1933f08409a46dfed6b38a26f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-036","locale":"id-ID","order":36,"parent_id":"unit.r017.book1.ch14.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf lima simpul dengan kota A, B, C, D, E sebagai titik hitam, terhubung lengkap oleh sisi berbiaya dolar...","unit_type":"figure"},{"canonical_native_record_sha256":"710c38726494d5c26bac912bde613494a5150a543a8d9b6de67910462fb43a09","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-037","locale":"id-ID","order":37,"parent_id":"unit.r017.book1.ch14.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sebuah subgraf merentang dari graf kota-kota Oregon.","unit_type":"figure"},{"canonical_native_record_sha256":"f5a4cac067a71749a3e555804b07a71b2c5b80abeaab940999a7c0350bb043d3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-038","locale":"id-ID","order":38,"parent_id":"unit.r017.book1.ch14.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Subgraf lain dari graf kota-kota Oregon.","unit_type":"figure"},{"canonical_native_record_sha256":"1057b94d4f38343d4c6cb635e65fe67ba17dfba1d8cb81727e8fccdc2387ea08","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-039","locale":"id-ID","order":39,"parent_id":"unit.r017.book1.ch14.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf tak berarah berbobot dengan enam simpul bundar kuning A, B, C, E, F, G yang ditata membentuk segi enam.","unit_type":"figure"},{"canonical_native_record_sha256":"e2be5395b5c74ee8edbc80e4b160989a26031ae17ae1b96aafb9731e6be3123c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-040","locale":"id-ID","order":40,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Gambar berbingkai untuk algoritme Prim: graf 7 simpul dengan simpul a, b, c, d, e, f, g berupa lingkaran merah.","unit_type":"figure"},{"canonical_native_record_sha256":"403ce52af506afc9ec7867991e77b41f83f3be25ed693444696a94433b161d9c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-041","locale":"id-ID","order":41,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram latihan: lingkungan bergaya yang diperlihatkan sebagai enam blok persegi panjang dalam dua baris, masing-masing tiga blok.","unit_type":"figure"},{"canonical_native_record_sha256":"c7906080ef4fefd0a909e0db7f33ce5a270621f825dfb03038c17c8c9d6fc78e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-042","locale":"id-ID","order":42,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Peta latihan sebuah kota fiktif: sungai biru kehijauan membagi wilayah menjadi beberapa daratan, dengan...","unit_type":"figure"},{"canonical_native_record_sha256":"f0d91c1e3f0ca64964ca313eeebb8a5342b6e0e97dffa0add7cd36946a7deffb","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-043","locale":"id-ID","order":43,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf berbobot tujuh simpul untuk latihan lintasan terpendek.","unit_type":"figure"},{"canonical_native_record_sha256":"08d3626f1da236a83bc9e4522e23d3ed3890bc2412cf05689b9e0c185c0b83d0","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-044","locale":"id-ID","order":44,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tabel harga tiket pesawat yang memuat harga sekali jalan dalam dolar antara Seattle, Honolulu, London, Moskwa, dan Kairo (mis.","unit_type":"figure"},{"canonical_native_record_sha256":"e9d75a4faab7445fb987fc3f7a6553489f294b3d87d47ebaa5dc6bbbd214b104","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-045","locale":"id-ID","order":45,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tiga graf lima simpul untuk latihan keterhubungan.","unit_type":"figure"},{"canonical_native_record_sha256":"8a103329232ee9162b641920b1efd369845e4c87a389a0e21f883fb5b7ce3f46","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-046","locale":"id-ID","order":46,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tiga graf lain untuk latihan keterhubungan.","unit_type":"figure"},{"canonical_native_record_sha256":"617b9e228e9fdfe8b9c910496ab01330b71c8cce1e1e2e112af9b714b19e0817","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-047","locale":"id-ID","order":47,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jaringan kereta Eropa dengan waktu tempuh antarkota.","unit_type":"figure"},{"canonical_native_record_sha256":"735ccd2e4fe91816a08def8312d10829a8ae478d10b47a11df74b4c644433ce0","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-048","locale":"id-ID","order":48,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf berbobot pada lima simpul berlabel A, B, C, D, E dalam tata letak segi lima, terhubung lengkap oleh...","unit_type":"figure"},{"canonical_native_record_sha256":"cb2d4867c346de03b08b83c4c2e70685da339ce59d217b016330d88cd0fdb72b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.captionfigure-049","locale":"id-ID","order":49,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jaringan jalan kota-kota Virginia dengan jarak.","unit_type":"figure"},{"canonical_native_record_sha256":"c59672a39ab8ebd0fdbd4dcdea319a023beca8e0cbdf519d8da2b6e7c751e6b7","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Algoritme Graf","unit_type":"chapter"},{"canonical_native_record_sha256":"dd16c99842746f4bedd609c2d5a9db22dc13e2a090e224e1d8e8e26455f60538","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf, Simpul, dan Sisi","unit_type":"definition"},{"canonical_native_record_sha256":"c26c86bb4ef939ea9141f84cfd384b194ac4c8241e8a11736412f1a1bc5dd92e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Simpul","unit_type":"definition"},{"canonical_native_record_sha256":"984cb58f9ee292d098c485f3844e904d75546409b47ef97f53fd58de4b4d747a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sisi","unit_type":"definition"},{"canonical_native_record_sha256":"27c1ba0e0b8b511b25440c5be557be5a6d10b48cb72c77d14838f05a650cd809","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Gelang","unit_type":"definition"},{"canonical_native_record_sha256":"6578550173d270e18dbbcf0d3f14187a587f139fa04b78764ee8e4df338f5fd4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Derajat sebuah simpul","unit_type":"definition"},{"canonical_native_record_sha256":"3ea83dfd38870c3fdd316ec08ac3fa38c71d4201edadbbbb975222c94362f806","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Lintasan","unit_type":"definition"},{"canonical_native_record_sha256":"f62e986876358ed67aac04adcf70e31327d58b7e968bfc4f02cf0ba32528da3a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sirkuit (disebut juga siklus)","unit_type":"definition"},{"canonical_native_record_sha256":"8efaf870cca355d63e6975c876c518c0d83dde71086bad2dc8e3541a062cda09","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Terhubung","unit_type":"definition"},{"canonical_native_record_sha256":"4b060a1dddfe7a61c97f1d1d3341d3ce126da5608d68aa6a45c5722b6f0bb28e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bobot","unit_type":"definition"},{"canonical_native_record_sha256":"eb7263b152790d837ecca35ef9b09ee51f89ea5185b91b360d0ad9fd188343fd","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch14.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pohon Merentang","unit_type":"definition"},{"canonical_native_record_sha256":"022670c69c0e677af59852900f1c4ee9de0802f0cf07cd3d9b69bb80253e2bd4","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch14.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pohon Merentang Biaya Minimum (MCST)","unit_type":"definition"},{"canonical_native_record_sha256":"06a58d92ed801756eb2f0baf621fb663845ed885694593e5747210bdae5ad0d0","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch14.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Lintasan Euler","unit_type":"definition"},{"canonical_native_record_sha256":"de752a39c7a660b8d1b13b6cd9917cc93dd328b7c409f7f487894244a708b5e9","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch14.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sirkuit Euler","unit_type":"definition"},{"canonical_native_record_sha256":"a33a09f306ce4a343dee3b791974957a2d4269aa790864a420b08072abc06997","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.ch14.text.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Eulerisasi","unit_type":"definition"},{"canonical_native_record_sha256":"262e1af284a48f2bbcb9ab140b90df7e1518ccec197e10a98d9031019ce0910d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.definition-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sirkuit dan Lintasan Hamilton","unit_type":"definition"},{"canonical_native_record_sha256":"0f30985e9626c1f78a3122e680a4f5d133d098d7d8b139cfddfbb28545ae2693","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.ex-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pohon Merentang Biaya Minimum","unit_type":"exercise"},{"canonical_native_record_sha256":"bae4fc97f0f95d4833b4fd7fc1fc81f828455be95e74a7ed5c840fa9414270df","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.ex-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch14.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"NetworkX","unit_type":"exercise"},{"canonical_native_record_sha256":"3192a514694e8d855b76b634ddc4270d5286f1ef978a5e0d24764042e2c2057d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.ex-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch14.text.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Algoritme Prim","unit_type":"exercise"},{"canonical_native_record_sha256":"9d47cb695dfb4a5d4bf87c654f480bb2c56074af64d034134101095f15a8d4da","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.ex-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Lintasan Terpendek","unit_type":"exercise"},{"canonical_native_record_sha256":"f744bbae46b66fa3dfcdebeec18e45c48d36bc90af0d9416ee1694ad41b53c62","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.ex-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch14.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sirkuit Euler","unit_type":"exercise"},{"canonical_native_record_sha256":"bc4b906097387a2fe03ab2e806c5013a81b31f4e5dbe22081c1bdfb72e554f8f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.ex-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch14.text.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Eulerisasi","unit_type":"exercise"},{"canonical_native_record_sha256":"1696d9bd07f15fd126ed14044996a5124218814dfc7a24c5d4c6a2c564489b19","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.ex-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Wiraniaga Keliling","unit_type":"exercise"},{"canonical_native_record_sha256":"a979323cc2f47f3966fca156742815052e7a7c66eea60f6dcf16e4e0c7e79808","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.ex-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Algoritme Sisi Terurut","unit_type":"exercise"},{"canonical_native_record_sha256":"e73dff9045eb028eab1212e1ea0f005d5599bb39afcb825987eac38c6e9628aa","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"413a7df55215a75f0ffdff2e6ba95fe1ed013664986f23a3c22ca57f1db1f1d8","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch14.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"8b122ec3ad45ba0e78685c14b799d81c053401f67cd33fe7f19f3b71a42ee381","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"979a27baabc5e482b47375eeaa099d32699951d98e19634ffa8e5d5871dbde1f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh algoritme Dijkstra","unit_type":"example"},{"canonical_native_record_sha256":"d8c52f5347872f29721ac3e6dd1a3a6330b34a6825538f59a235dff138d36766","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"e9c5a2f6403be02443dc450d49506f7bfd30d03370e07907ab0fa84b1456e61c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch14.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"a82ef2ca52ffd23e017a9052934ac39f59d41b6cbd1bf12abbcdeca41a96aec6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch14.text.subsection-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"cb9304bc15c19870a6c28feff4deef3f24500a51388b6cd47cea494d173505d8","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch14.text.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"a8244b87c69acfd06710bbff0660b46c7a5887a35d8b9f3b208a885d5dd411c3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch14.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"eb1a9903e453398cd6d7ff59d6ff514ede5c5f2665eed53a72d66fba27d08a02","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch14.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"a6beb207bbdb85d69aa292b8b13478d8da256705114b17a2196171d31e544e1e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch14.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"45c668b59c74b77eecec880bb5cec52082dd9e510d309494c6499ef54957a87c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch14.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"minipage","unit_type":"example"},{"canonical_native_record_sha256":"3b83f75760f1d47fa4cfc765ed03f5848e767cc2c50e5098eb7ed9d933065005","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch14.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"120d6cf07ecf618a29863576f0e5b9a1754337cfe8a156795067a3e8aa07bf3d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.ch14.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"66e38afc334bf61ccc0d995ae736f95231f358ea8defe8c303f760bafff6f977","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.ch14.text.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"9af53430cfbbcf69670a48274370f91ce057a2718101e4543cd2386d250221b3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-016","locale":"id-ID","order":16,"parent_id":"unit.r017.book1.ch14.text.subsection-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"68d18717f75d12cbb481c26a13235194846cc3f6333e621298b55a8d47254301","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-017","locale":"id-ID","order":17,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"56c2322e50cdff38e27060ca67860cd0de51d38cc7f967b3ee18c4421dc77e2e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-018","locale":"id-ID","order":18,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"9e974c704306dba8a38463eb6ca9c1bb383dead07231bc4adc4103b4252c1886","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-019","locale":"id-ID","order":19,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"3de584cb8353852ad25a3e7b92b87653d93053ef3acd3aa228d6d334a000714d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-020","locale":"id-ID","order":20,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"43d2198c180c3ddfe716ba064305c47168cd5160ba7004f4becf50e87718216d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-021","locale":"id-ID","order":21,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"graph17_ex","unit_type":"example"},{"canonical_native_record_sha256":"9d800cb61d2e2cd63a640ddce8910a280cab698c0d53c04ec85fe8bacef3668c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-022","locale":"id-ID","order":22,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"9413cbd242ec96aa9f28640718bdf4b5b765564c8e06d464518330cf231cd6a7","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-023","locale":"id-ID","order":23,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"4d5b1fa0e751eb73bb765680fa35a6c6b1c9ad8fb9114799459079c6caa4141d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-024","locale":"id-ID","order":24,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"minipage","unit_type":"example"},{"canonical_native_record_sha256":"c56bb2ddcf6d7ff0bfe7d34e7c777e12a2dbf0de0a0059eca6294ddf68e5fe6c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.example-025","locale":"id-ID","order":25,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"example"},{"canonical_native_record_sha256":"f4e275108df7ff1d92bd3bd8dfe001e0956b22015f2efcae6295230cb0b59def","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.figure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"521ec02a6f3aec346b1c2f749a55bd8afbe8d2828ca3c904a0f3a675c7b4f14b","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.figure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch14.text.subsection-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"fcec69dbb484f90da350a0536cd780aa235ae6ad66c13e0e4542cf2726263ee8","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.itemexercise-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Waktu perjalanan kereta untuk suatu segmen sistem Eurail diperlihatkan di bawah ini dalam jam dan menit. Temukan lintasan dengan waktu tempuh terpendek dari Bern ke Berlin dengan menerapkan algoritme Dijkstra.\\\\ \\begin{tikzpicture} \\draw[fi","unit_type":"exercise"},{"canonical_native_record_sha256":"59433ea372e9b849b2ddcdd95807d02bb776e926c43013f6443f57dab684f76e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.itemexercise-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sebuah perusahaan ingin menghubungkan 5 bangunannya dengan kabel serat optik. Biaya (dalam ribuan dolar) untuk memasang kabel di antara pasangan bangunan diperlihatkan di bawah ini. Temukan pohon merentang biaya minimum yang menghubungkan b","unit_type":"exercise"},{"canonical_native_record_sha256":"8dba09882843b17dab44ce473cac62d86063755c897e8aed54852485425d2f4d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.itemexercise-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Waktu perjalanan kereta penumpang dalam menit di antara lima kota di Virginia dan Washington, D.C., diperlihatkan di bawah ini. Terapkan algoritme Dijkstra, tepat seperti pada contoh yang dikerjakan di \\S\\ref{sec:gt-shortest-path} dan dalam","unit_type":"exercise"},{"canonical_native_record_sha256":"deac6f9553312956376e845a66775263945460537928bda9d58a576950857ecc","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.itemexercise-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dengan menggunakan algoritme Kruskal, temukan pohon merentang biaya minimum untuk graf harga tiket pesawat yang Anda buat dalam soal \\#4. Daftarkan sisi menurut urutan pertimbangannya oleh algoritme, dan catat setiap sisi yang ditolak karen","unit_type":"exercise"},{"canonical_native_record_sha256":"4482c3d7a6977ff92dcfff151c8c6cad2268e87819b5c7b75a4b6644c31a0a39","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.itemexercise-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Algoritme Kruskal bersifat \\emph{rakus}: pada setiap langkah, algoritme mengambil sisi termurah yang tersedia tanpa mempertimbangkan apa yang akan terjadi kemudian. Jelaskan secara informal mengapa pandangan jangka pendek ini tidak pernah m","unit_type":"exercise"},{"canonical_native_record_sha256":"41ba50a9cf82d606bd230daaa2a4596edaec3edc186820a83f05d3b121494f4c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.itemexercise-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Algoritme Dijkstra menandai secara permanen simpul belum dikunjungi dengan jarak tercatat paling kecil dan tidak pernah mengunjunginya kembali. Jelaskan mengapa langkah ini dapat dibenarkan ketika semua bobot sisi tidak negatif. Kemudian bu","unit_type":"exercise"},{"canonical_native_record_sha256":"e3f370c34310dbae2fa9ace4d4ef00a6505143c4ad482ca7ded1107fb993de1f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.learningcheckpoint-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.section-003","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"learningcheckpoint"},{"canonical_native_record_sha256":"217c03585525426ad9313d211a16d6bd9ca254e01d1dfa0fa46a781b54fd372f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"24b32ede63adf6c35a2346b584c6f664b865f910dae4ae70b0cb946c42c1b5cf","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.outcome-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch14.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"3cac15d1aa5c5585d159e250e03e3ba92b947b4b9df3dea5c3d2cc145e4465c6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Teori Graf","unit_type":"section"},{"canonical_native_record_sha256":"cb6861c822300599fc0a18556bf49c456361e8ad7502e4aeb4778320bd9306b9","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.section-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch14.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Graf","unit_type":"section"},{"canonical_native_record_sha256":"a68f593e60a9f2fc98337a9a3002d4505f2e28c0622dd6f517f96289328bc28d","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.section-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch14.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Definisi","unit_type":"section"},{"canonical_native_record_sha256":"3937831e5778f40acd3246c6717a4f675f80f45b0a4e613b484c2b712dba83b6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.section-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch14.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Lintasan Terpendek","unit_type":"section"},{"canonical_native_record_sha256":"e0a086876bd813efe26ed0e8116ca519bdc3cc7a20f2eb7b47f64b1aeb8cda05","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.section-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch14.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pohon Merentang","unit_type":"section"},{"canonical_native_record_sha256":"1920e0f85bfee1e259d8d906d46562429ac72c6e660e4539bd429a4c56091a19","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.section-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch14.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jawaban Latihan","unit_type":"section"},{"canonical_native_record_sha256":"e30898a0df29701b3214b26315c5fe5e8612c547bb38cfaa0679e3ed0dcd3fb9","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.section-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch14.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"e74864a92d23126c41a2c18ec8438625dd4649187671e233433e0c3f60f684e1","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.section-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch14.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sirkuit Euler dan Masalah Tukang Pos Tiongkok","unit_type":"section"},{"canonical_native_record_sha256":"7cbaea18e944425894c8d9ca3684e894a5c49a61b839ceab46110218b487b02c","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.section-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch14.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Sirkuit Hamilton dan Masalah Wiraniaga Keliling","unit_type":"section"},{"canonical_native_record_sha256":"5de8c10c3588e559c8b6d704700d5df7246d45b2213cf03e951300bda62b3bc3","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.section-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch14.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pustaka Graf dalam Python","unit_type":"section"},{"canonical_native_record_sha256":"b1b4527c10b098df5906c110625106ffda143250eed7a7cfbe755d9469afbcda","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:dijkstra-eurail","unit_type":"solution"},{"canonical_native_record_sha256":"4fa92becde6e2fec10798e16c0f02e836843b3824acf840714a701f758055675","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch14.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:mst-sonet-ring","unit_type":"solution"},{"canonical_native_record_sha256":"b9a4b693a46d30c27388ccc4f56c76996a427a7865e3060ec4e062d6637a1e0a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch14.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:dijkstra-warmup-rail","unit_type":"solution"},{"canonical_native_record_sha256":"b5e2311ff83ac0c8c97473c797d61c99028fa98ad4424fba227796d44bdd6b4e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.solution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch14.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:kruskal-airfare","unit_type":"solution"},{"canonical_native_record_sha256":"4f47598d5d3815b6ef1c07cf4e0b6f74cfc53367944fdef9ebabdf379dcfee69","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.solution-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch14.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:mst-greedy","unit_type":"solution"},{"canonical_native_record_sha256":"158e6d740f9d992b1b92b0ebd873f6603585b65e6797bc949edf1323014e2f89","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menggambar Graf","unit_type":"subsection"},{"canonical_native_record_sha256":"d86487902d06f1a8f6a7abd89185e74144d0d731f2eedae01411b8a29cf9cfa6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.subsection-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch14.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Peningkatan waktu eksekusi","unit_type":"subsection"},{"canonical_native_record_sha256":"7b8202f3cf35e495dafd7c8438e1f7ea1288da7f2211028844fbacdbfb74cbcb","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.subsection-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch14.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Algoritme Kruskal untuk Pohon Merentang Biaya Minimum","unit_type":"subsection"},{"canonical_native_record_sha256":"6e899aff371d907f25f168765e61ccd744f171bb5184cecb841223dbffd422be","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.subsection-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch14.text.section-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Algoritme Prim untuk Pohon Merentang Biaya Minimum","unit_type":"subsection"},{"canonical_native_record_sha256":"10b7806e36b46111fdec61e535941f87afea4a72679d7f6320b600b7c9cd9f5e","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.subsection-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch14.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Eulerisasi dan Masalah Tukang Pos Tiongkok","unit_type":"subsection"},{"canonical_native_record_sha256":"9a246b3cbe047a2cc4f0252233f7494724eaaec5a5710110a69df5e716d7f5d6","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.subsection-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Catatan","unit_type":"subsection"},{"canonical_native_record_sha256":"1de2961c108a27241dd69057845f7bf7a6c585465d1100ae652d100a87b3bf6a","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.subsection-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch14.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Catatan, Referensi, dan Sumber Daya","unit_type":"subsection"},{"canonical_native_record_sha256":"18e779e30210fbf61925d6f35d0381609f57bfd30fd4434872988e8214c62938","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.subsubsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"227af2b4a96a180019510051de06693a740fcfd19c20df3bdee6f5f00b42562f","concept_ids":["concept.dijkstra-algorithm","concept.euler-circuit","concept.graph-theory","concept.hamilton-circuit","concept.kruskal-algorithm","concept.minimum-spanning-tree","concept.prim-algorithm","concept.shortest-path","concept.traveling-salesperson"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch14.text.table-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch14.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.thirdparty.lippman","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"97d055df5af44e0a588ea08c17a9c320146ce6e74df25aa3eca4f7fe40617c24","concept_ids":["concept.integer-linear-programming","concept.binary-integer-programming","concept.facility-location","concept.set-cover","concept.graph-coloring","concept.big-m-modeling","concept.job-shop-scheduling","concept.fixed-charge-model","concept.logical-binary-constraints"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch15","locale":"mul","order":17,"parent_id":"unit.r017.book1","prerequisite_concept_ids":["concept.linear-programming"],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Introduction to Integer Programming Formulations","title_target":"Pengantar Formulasi Pemrograman Bilangan Bulat","unit_type":"chapter"},{"canonical_native_record_sha256":"2d7f24abe5420565e6502ef8ffbd845d97bd06b4d9d198a36cfe20cfdec6e27f","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch15.solutions-manual","locale":"mul","order":2,"parent_id":"unit.r017.book1.ch15","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"solutions_manual"},{"canonical_native_record_sha256":"b09a4ccd7a581700b703daf42a25a7e5bbd41c319297bdbf35e7d3c39709aa0f","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Ransel","unit_type":"solution"},{"canonical_native_record_sha256":"c6522a54d320d0d0c0138e728ed34d5aaa972c8eff667e387e84f038925d5bed","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Ransel Mobil Kurir","unit_type":"solution"},{"canonical_native_record_sha256":"ccfa8f9e2bd4dad361e2c0e799b6e66bbf6bfb2bf7b9564e89d3b7229505d90c","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mencakup Sebuah Kota Kecil","unit_type":"solution"},{"canonical_native_record_sha256":"ac2fb0015815b873cf79634b6782ae043e0ab416c2907276733c11cc7922201a","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan Aktivasi Big-M","unit_type":"solution"},{"canonical_native_record_sha256":"34e55bbd4d198d09bb56aba5e8600369170045da35b5d5209a6dbbc945d0914c","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Lokasi Terminal Distribusi","unit_type":"solution"},{"canonical_native_record_sha256":"1de5ed78bc544d02fc76da02019ca4591f734827420673056f3946899bdb248f","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Lokasi Gudang","unit_type":"solution"},{"canonical_native_record_sha256":"15c1b8f6ecaa9c40a88c767e00102470211033daae6475c5200a128b2edaa9c5","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penganggaran Modal dengan Kebergantungan","unit_type":"solution"},{"canonical_native_record_sha256":"884614e176702105b508f8b4314e5c37474fb9c2e184e556e27d92e31171654d","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Lokasi Fasilitas: Dua Pusat Distribusi","unit_type":"solution"},{"canonical_native_record_sha256":"a5112abfe27525d7fc50d124ae38df22b011f8cb346c34d15b1e853adb28efa7","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mewarnai Graf Lima Simpul","unit_type":"solution"},{"canonical_native_record_sha256":"f3194c52598670d949462e57dd6668e3a8fa35d03b0939d45f66c202ecc90f84","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala Salah Satu","unit_type":"solution"},{"canonical_native_record_sha256":"91ec5d8c64e0918a3c723fb4b8898d8dd1054f5735621d499decf421d033f155","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Produksi dengan Biaya Tetap","unit_type":"solution"},{"canonical_native_record_sha256":"5eade08cba2ea990081aefe3e8071d7cbef9c4991b7bdc833520a80eb90990fe","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengapa Pembulatan Relaksasi Gagal","unit_type":"solution"},{"canonical_native_record_sha256":"be8879d7c98d8d1c1503dded31bcf172a53e08c804af1576ae2e870e33e0ca10","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kapan Big-M Terlalu Besar?","unit_type":"solution"},{"canonical_native_record_sha256":"edc7bda9a2797fceda539d40b067c2449b7d1b4bcbf49cc2700ef5441a667761","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Membaca Model Pertukaran Ginjal","unit_type":"solution"},{"canonical_native_record_sha256":"9ece0ee3dd338c4e8573f2bfbfced16e9c259f653d1937a81fd91ae6f1b4fadb","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Biaya Produksi Linier Sepenggal","unit_type":"solution"},{"canonical_native_record_sha256":"99248a552c39cf5d296f8c9b149b4258e054c63dc1736ca781c76f40b9a75195","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.manualsolution-016","locale":"id-ID","order":16,"parent_id":"unit.r017.book1.ch15.solutions-manual.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dua Pekerjaan, Tiga Mesin","unit_type":"solution"},{"canonical_native_record_sha256":"1ce59ec5f980811aea911da84152ab9787c0a005869eb912baed53dc26d61e2a","concept_ids":["concept.binary-integer-programming","concept.integer-linear-programming"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.solutions-manual.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.solutions-manual","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bab 15: Pengantar Formulasi Pemrograman Bilangan Bulat","unit_type":"section"},{"canonical_native_record_sha256":"626206732d66173c5c1f2d2769183f2900acc689e88f7e103a69dd304787c464","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.ch15.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.ch15","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"chapter_text"},{"canonical_native_record_sha256":"c81fe1396dc26363b589f04d59249458d0abd031afeb34d9288444a840ab0578","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.captionfigure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diagram jaringan untuk penentuan lokasi fasilitas: tiga calon pusat distribusi yang terhubung ke toko-toko.","unit_type":"figure"},{"canonical_native_record_sha256":"1492f5850137f93d1edea7dc62f505bf67e18155e394c0fb2e359d0fa8095b16","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.captionfigure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.subsection-025","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Fungsi linier sepenggal.","unit_type":"figure"},{"canonical_native_record_sha256":"d8088042defeba7e84ee9c844bed277fb03cc21a39b8c37e8a2348b31db1c7f5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.captionfigure-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.subsection-030","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bagan Gantt solusi penjadwalan job shop Duplo dengan tiga mesin dan empat pekerjaan berkode warna.","unit_type":"figure"},{"canonical_native_record_sha256":"93ce4779125e57a8eb835baf781a0ef4d5489257805ef0e6e3c61a1c77d981f6","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.captionfigure-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch15.text.subsection-030","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Foto balok susun Duplo yang diatur sebagai peragaan fisik jadwal job shop.","unit_type":"figure"},{"canonical_native_record_sha256":"7d6c90219734155dc577ac4319e36dd3927c41b43dc4895d84d14f203f30ee2d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.casestudybox-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Di Mana Pesawat Pengebom Air Harus Bermalam? Penentuan Pangkalan Pesawat Tanker di Ontario","unit_type":"casestudybox"},{"canonical_native_record_sha256":"7a6c7a96b978923ae7f61fc7d260ef8773546267fb7676be951294c3edda5dc3","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.casestudybox-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.subsection-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pertukaran Ginjal: Pemrograman Bilangan Bulat yang Menyelamatkan Nyawa","unit_type":"casestudybox"},{"canonical_native_record_sha256":"e0c2265c284ccd9f0de299302e6085e907825590082506320cf10f5964672f63","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.casestudybox-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"108{,}\n\\label{case:walmart-loads}000 Rute Truk Lebih Sedikit: Perencanaan Muatan Walmart","unit_type":"casestudybox"},{"canonical_native_record_sha256":"323ca279e0bb0d5da0a0d198996e81b15ea5cfc32e4e75b2ebdda3399a888b1b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.chapter-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pengantar Formulasi Pemrograman Bilangan Bulat","unit_type":"chapter"},{"canonical_native_record_sha256":"9af70862db695ae42d6059ce95babe56714c59c4705d29785a4e7c49ed072eb0","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.definition-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.subsection-023","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Himpunan Terurut Khusus Tipe 1 (SOS1)","unit_type":"definition"},{"canonical_native_record_sha256":"b0a4a4ca0977a5aa5eefc11df3e9d3501cb22f422a8cc9a4ee3945b702a581d4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.definition-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.subsection-024","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Himpunan Terurut Khusus Tipe 2 (SOS2)","unit_type":"definition"},{"canonical_native_record_sha256":"d23bfad67345bb9aaa417ba51f661b8559040eebec79f1a047545cce7d389076","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"6492c6b62ed0f92aa7ba2ab0ae2bf7b0a505cf8738f8476d77ed7b8d93ec5201","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"8f5a66c8cf2d0f165867038133f5e77b5d5511adcc704b928de92fedadcd6dc8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"5fa456ead806b8d3f6aa9c4e0bf4a49f571bd5163c838a6c30b67957ba5cd638","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch15.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"9e79922eda401aa4092b2c67267226329ad8049c04740b22be3371af49fe8a88","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch15.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"774be933f6c64c02596355fc00d8b3993dc92198381dcecc0a15f4c99a04babf","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch15.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"a067bd766966ace8c4a726947075b1bb914da1df015f198f089e91f868fa2610","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch15.text.subsection-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"4b4bf7ee3d8339f8f89cb17eefb86220b076d4a18943cec34c2ea27cdba1c833","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"e0e316ee28f4cdee4a394f6bbfdf6b9708030663bb63c03381b6d9d5467821d0","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"e7afe50f75aab74335543d01c8741e32272050d313d6c315dcd1f70888c48349","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"9053540c2402eb4737fd6ee3e4aa2fabf6a64a38c8d4f7852e9265e0d2c76c2b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"4e8b4ad83367aa994eebb617acf29c400499663f5fff291d5c9e9ee6353e7edf","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"1d7701a9a64979ac10af733f2551bea949fdc0d792cec5225f38533f984aaea7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"b4231344c100f2c430e5d1a9afee90a8d668455e12085738234cd685874a75e9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"fbc076b09603930961973df52ce46bd35981b5a0173b14bc9d3be22a25c3be78","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"3faefd0d443357d0c0c2f17ebb9ace1938870fb2b7f791d7cb293341cc8ee8a6","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-016","locale":"id-ID","order":16,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"25e4c4e9731104bc05bca9b3fe269bf34b4079a94205795ed792255da52e2e42","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-017","locale":"id-ID","order":17,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"453e3016bd33c40bb75511aa344b4f91ad05dd4cea13088a7432a0fa54e299f7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-018","locale":"id-ID","order":18,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"f6ffa1264a5cb4714e1141fe8616cbaa506c615dc23d1114ca0cd2809ab685a0","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-019","locale":"id-ID","order":19,"parent_id":"unit.r017.book1.ch15.text.subsection-014","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"899d2b0f5f9d7e520f49d88cb1bfb25f2aa455fe02a9240127f163f6684d1356","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-020","locale":"id-ID","order":20,"parent_id":"unit.r017.book1.ch15.text.subsection-014","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"ab1bbcd52b5be0f922948de1d4e683bd58f3d0f918b696aca74d5e492e025c51","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-021","locale":"id-ID","order":21,"parent_id":"unit.r017.book1.ch15.text.subsection-014","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"ff08b4fc235f3c2d6586fb9699b9097f2fafd5e68b1fffc57aa7a295dd490932","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-022","locale":"id-ID","order":22,"parent_id":"unit.r017.book1.ch15.text.subsection-020","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"3e36db712db4b4dd98096cd29231064b83a56378fe000ffb671dfd27cf52add5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-023","locale":"id-ID","order":23,"parent_id":"unit.r017.book1.ch15.text.subsection-020","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"fa3773714047c38691c538cd88291018884a34b59ba2fd730d87f8bae1de278f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-024","locale":"id-ID","order":24,"parent_id":"unit.r017.book1.ch15.text.subsection-020","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"1867868c88377e274f90562b09830a40d76ef37dfb87d50ec9132ce6702ba358","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-025","locale":"id-ID","order":25,"parent_id":"unit.r017.book1.ch15.text.subsection-021","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"6a486f9180a07b89f688b3ab06bf34eda6263dda067c3314866f4fd42792abfc","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-026","locale":"id-ID","order":26,"parent_id":"unit.r017.book1.ch15.text.subsection-021","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"73b189fc41490662c0be29531243345dcee6e63efc7e0aca885a7977834170e1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-027","locale":"id-ID","order":27,"parent_id":"unit.r017.book1.ch15.text.subsection-021","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"2a46660c8cf6fbc33b87f857db79d6848948c0525baa11472c18e9643e02d9a7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-028","locale":"id-ID","order":28,"parent_id":"unit.r017.book1.ch15.text.subsection-021","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"61b090529300519bc171499bed816ca72d217a12eb63894ea68bbbc9b8609d10","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-029","locale":"id-ID","order":29,"parent_id":"unit.r017.book1.ch15.text.subsection-025","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"5afcf2330230a919c9522dbbc815a2fc200254c3659d18f2a90473c41293e984","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-030","locale":"id-ID","order":30,"parent_id":"unit.r017.book1.ch15.text.subsection-030","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"982ada2ee1112fbf3b1132a8da3e7271af437e4b91ca20e80bf68111d56ea40b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-031","locale":"id-ID","order":31,"parent_id":"unit.r017.book1.ch15.text.subsection-034","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"d03b1689a0833cff7848d4d49ae884dfa277344875e3c7bf429bd16230cefc8a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-032","locale":"id-ID","order":32,"parent_id":"unit.r017.book1.ch15.text.subsection-034","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"83e96fcb81a56b69f3da9dd651370aee8ca09ba24c64bbfe081540fd5e8d4229","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-033","locale":"id-ID","order":33,"parent_id":"unit.r017.book1.ch15.text.subsection-034","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"580113178c86a85dfa91e060ac8aa1976b4862ee2cda156d12c9d1cbb14ca112","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.equation-034","locale":"id-ID","order":34,"parent_id":"unit.r017.book1.ch15.text.subsection-034","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"equation"},{"canonical_native_record_sha256":"2cfebc5aaff8bbd93134ba6004e72d726d1b39991e8c12b44e05683d66681998","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Ransel","unit_type":"exercise"},{"canonical_native_record_sha256":"f77cbd854bc7ad082693180c830def1c91d78f5ca69c3a4feaf77aefc3a3c01c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Ransel Mobil Kurir","unit_type":"exercise"},{"canonical_native_record_sha256":"4311ffe45e38e592e0f1a10d99b0f4c03537694bcd932b9c61c0b9cfe364e071","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mencakup Sebuah Kota Kecil","unit_type":"exercise"},{"canonical_native_record_sha256":"d403ccc14ee54fc7555f259608a67c5dbc349ab7fe54d35c176af3bc7dbbe7e5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan Aktivasi Big-M","unit_type":"exercise"},{"canonical_native_record_sha256":"c15c1ca2d5e1dbfb5695b46d1639ee3dcb7f30644000d5c8b15453316c9d1b5b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Menentukan Lokasi Terminal Distribusi","unit_type":"exercise"},{"canonical_native_record_sha256":"141f15fa70f499b5a21d5c359b30849d60568767cdb94a8cd0d0a55c9f2d4f7c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Lokasi Gudang","unit_type":"exercise"},{"canonical_native_record_sha256":"c80c3f548ff223a2982f3f5167c564d217af7ee07a608d49b013cf2f8cc5aa9c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penganggaran Modal dengan Kebergantungan","unit_type":"exercise"},{"canonical_native_record_sha256":"5fea77bfeab18b23a2a7a34bffc19d3ac8ae734ac673c0d4f5e53d325c1a6406","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Lokasi Fasilitas: Dua Pusat Distribusi","unit_type":"exercise"},{"canonical_native_record_sha256":"47a11894b39fda23fbc5509e6d6fb2f09b66a6c5bc9d3c8440ca963566036908","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mewarnai Graf Lima Simpul","unit_type":"exercise"},{"canonical_native_record_sha256":"926bea94a4a4cb8a2a3fc40402a7f806e56bbd0b2d7856648f6f6f7bc775ff63","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala Salah Satu","unit_type":"exercise"},{"canonical_native_record_sha256":"853a8ed4d05f5149681670a1a078df63121911c4147e390396edbd553bb172b6","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Produksi dengan Biaya Tetap","unit_type":"exercise"},{"canonical_native_record_sha256":"4c1de35657cce9665e6cf3e08ea0f3d3e6f4288a5c33d15ef2141b29eef732f2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Mengapa Pembulatan Relaksasi Gagal","unit_type":"exercise"},{"canonical_native_record_sha256":"17e46b5e9946de13ec7d4322851490aa538b0970290cf894fd41ad0299cfb14d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kapan Big-M Terlalu Besar?","unit_type":"exercise"},{"canonical_native_record_sha256":"9872a51720fb92e9b22a4fba78751f555d3ce54b65072fb9f00cd20724e1e449","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Membaca Model Pertukaran Ginjal","unit_type":"exercise"},{"canonical_native_record_sha256":"41a3fcbc73f95a839f99092720ecde3050110416fcfb86dbbda4abc20a71dd4d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Biaya Produksi Linier Sepenggal","unit_type":"exercise"},{"canonical_native_record_sha256":"3504423e37b718c3583d121f016f076c1caec1d6be6ee8fbd071f156cf1f1567","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.ex-016","locale":"id-ID","order":16,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dua Pekerjaan, Tiga Mesin","unit_type":"exercise"},{"canonical_native_record_sha256":"bcf0423ed4490ddd577a0b253983b7ce34465318367642d4bd42693b3b4d4c7c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.example-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Variabel mengambil satu dari tiga nilai","unit_type":"example"},{"canonical_native_record_sha256":"ec9554a807d11a980544e05ed77b54a70e1b2900ca444743bddcb52f2641ffa5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.example-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Diskon untuk pembelian lebih banyak","unit_type":"example"},{"canonical_native_record_sha256":"749b2878e5f5950cb887dd09fd903ab0a1de6dbf0df258c9e1778d4e6fcc8fc9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.example-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.subsection-014","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Aliran Jaringan dengan Tarif Tol Menggunakan Kendala Big-M","unit_type":"example"},{"canonical_native_record_sha256":"56422191d883a197c948068caccce1fbcec00aa10c4461b0d11d0e5e757d0788","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.example-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch15.text.subsection-020","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Bus atau Mobil","unit_type":"example"},{"canonical_native_record_sha256":"a938d2f710a3595adc7a82f585ffd80958505ac8e5db89be3aff50444a2b23ba","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.example-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch15.text.subsection-029","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Data Masukan Masalah Penjadwalan Job Shop","unit_type":"example"},{"canonical_native_record_sha256":"e2d5f61d358a29dd6a79ebaa712368c73a835abe89f5373532a654bc828e113b","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.example-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch15.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tata Letak Rumah Sakit","unit_type":"example"},{"canonical_native_record_sha256":"b7c5b6038a3a4ff66b801e58c2f98444b8b49c0292641c056655987c10a85368","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.examplewithallcode-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Ransel","unit_type":"example"},{"canonical_native_record_sha256":"d4c766966b885bfbc6cf49bf7e112a4e77d6d5577a72441f6f7e937e5383f8c1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.examplewithallcode-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jumlah Koin Minimum","unit_type":"example"},{"canonical_native_record_sha256":"99a2ab897459f886ac61ed0ee1e92d24296c01f8b4c8818dab5acdbc57f71711","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.examplewithallcode-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.subsection-030","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penjadwalan Duplo","unit_type":"example"},{"canonical_native_record_sha256":"bb12d02e88f0176f6dc983aa1e950a5216377fb66807d822e5fc028201960ee3","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.figure-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.subsubsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"b3de436ee6e47b4d384c325b04e633de2a6547bde1477b2111e15edcf5480944","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.figure-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.subsubsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"6fa93bddaa1bccd5507018d3271c919e5ed7b490d0e13848595eda7a4c2aa0d1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.figure-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.subsubsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"ee69bcc32a77b92965f2f71a5490e94482335dea282ff1625f9ad7c10dd283de","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.figure-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch15.text.subsection-029","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"figure"},{"canonical_native_record_sha256":"eb73f7e577b5b6f5a61971e27b25fa9fc90322768db25f51658afe677b76c6be","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Ransel Biner","unit_type":"general"},{"canonical_native_record_sha256":"38c20f742cef895dadf78d64e17305bf29a69a78eb1b9cc9e4ab354e949f93d3","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Ransel Bilangan Bulat","unit_type":"general"},{"canonical_native_record_sha256":"40715fbb62270eb7f57fe754a6cc01e74cae5f2deb466eef79d526ea5faccf27","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.section-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Ransel Bilangan Bulat dengan Kendala Kesamaan","unit_type":"general"},{"canonical_native_record_sha256":"aa2a74187566c466084682df813139358e1af12028ec2c5f11c8ef566004f19d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch15.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penentuan Lokasi Fasilitas Berkapasitas 1","unit_type":"general"},{"canonical_native_record_sha256":"ffbfbebbc0eeabd2994fdcd0922efd7ff26853ff40a10a0d85c44adff276e7d8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch15.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penentuan Lokasi Fasilitas Berkapasitas 2","unit_type":"general"},{"canonical_native_record_sha256":"4b1aa367f53ce6cb51caffe68af76825badd455f69ddc2b5642ae9eaee879281","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch15.text.subsection-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penentuan Lokasi Fasilitas Tanpa Kapasitas","unit_type":"general"},{"canonical_native_record_sha256":"91538b2ba2e1b605441b86b90722bcaa1f17e7b74b5d986f8b3eb8952c108cc8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch15.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penutupan Himpunan","unit_type":"general"},{"canonical_native_record_sha256":"b690e32e639e046d9793d242d2b6a7acaac0a255b6a95df0211ad7e18f7d1b56","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch15.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Contoh: Penutup Simpul","unit_type":"general"},{"canonical_native_record_sha256":"34828f03467313aff10a8c26d8edd77d08ad31e1aa844a6a8c7428203f1c639f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch15.text.subsection-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penutupan","unit_type":"general"},{"canonical_native_record_sha256":"8d777441caf8c205814b3b482b057ee16f38eda980f0d07404252b38ca0b10df","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch15.text.subsection-014","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Big-M: Jika--maka","unit_type":"general"},{"canonical_native_record_sha256":"f0d0d9322152d5fffdf749f23eee5b646e307fb60c927109487bff21a622aecb","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch15.text.subsection-020","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Salah Satu","unit_type":"general"},{"canonical_native_record_sha256":"2b8e8f4095b0da5f2352befdac67e060f082c48a456c92d74fa96b36b65ecaee","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch15.text.subsection-021","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Jika pertidaksamaan, maka indikator","unit_type":"general"},{"canonical_native_record_sha256":"6530ad2d1f5128a6f1c02738a893009be901c1ef74f231418029e94dc9ccf9d8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch15.text.section-009","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Penugasan Kuadratik","unit_type":"general"},{"canonical_native_record_sha256":"39d10d038ebb59f25b166bca0854c6c91e7e5ade7b4f6bc6baad9c28f21154e6","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.ch15.text.subsection-034","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Reformulasi penuh","unit_type":"general"},{"canonical_native_record_sha256":"fccca0d00e566fa6cd6d6296453aeca13e85713d8ac347442866b23b93cab78e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.general-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.ch15.text.subsection-034","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Reformulasi biner","unit_type":"general"},{"canonical_native_record_sha256":"b977ba62acad1915bfe444af3d0477b04b6caf435795e34d2eff37818cbfa200","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.outcome-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"outcome"},{"canonical_native_record_sha256":"ff238289fbe778c4d47409a91d8a4047578a4bac23142e04d372851f2b90586e","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Ransel","unit_type":"section"},{"canonical_native_record_sha256":"72b6aea051cd085e14d345da84d6c7a940959d76b63ff432af77f324ed7d4df7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penganggaran Modal","unit_type":"section"},{"canonical_native_record_sha256":"70a176eba6ee7e170b8d229dbd6286ac860a0f745743c97003a6bc0661afa804","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Penentuan Ukuran Lot Berkapasitas (CLSP)","unit_type":"section"},{"canonical_native_record_sha256":"8297e1f922358b9759901eb271912ce26a98c47f13a6ac578a5e1500a0cf1d0c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penentuan Lokasi Fasilitas","unit_type":"section"},{"canonical_native_record_sha256":"26be1c611d56229f0724eb0e67e74b52a4502dedea7efd7a535f72c6ca8d5c81","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penutupan Himpunan","unit_type":"section"},{"canonical_native_record_sha256":"d376f6c12a042fe9c70f64bd939400b63573d483f84d4775262dacdab1e94ac0","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Pewarnaan Graf","unit_type":"section"},{"canonical_native_record_sha256":"0cb5559d0222976dab1e6c5975531a8002f42f55b925bd75b11905593ffc1c16","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Trik Dasar Pemodelan - Menggunakan Variabel Biner","unit_type":"section"},{"canonical_native_record_sha256":"420a214f2e81af5c83e2d699ef9fb79864568aa2e356372891024b5212ad75d5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penjadwalan Job Shop","unit_type":"section"},{"canonical_native_record_sha256":"80b2887bf4fe8d4b214594e0d473ffd920e52eb929173fdf82aba2ce86e1d5c4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Penugasan Kuadratik (QAP)","unit_type":"section"},{"canonical_native_record_sha256":"740150c30a9a04e44f84edcb82e4fd4fa772bc0772a00de63eea7a0214f92a1c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Penugasan Terampat (GAP)","unit_type":"section"},{"canonical_native_record_sha256":"b940d8b74fb2b85d0f5148e3bfe83d6124f09a5f1620d6767b50ffffb0bcf84d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Materi Lain","unit_type":"section"},{"canonical_native_record_sha256":"23d5d4fe192e06d873d2e39b4d95491cab08dd39c154fe856af114cfc71776df","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Latihan","unit_type":"section"},{"canonical_native_record_sha256":"405f44ab74cc8115cd8ddc4c2dea52776febff590049ce479cb01e00970d65f7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.section-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch15.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Literatur dan Sumber Daya","unit_type":"section"},{"canonical_native_record_sha256":"c62e3d69809f6833dc808064f6c07293f67130f96fc90026ea99d3fbb2c8ee96","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.solution-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.subsubsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:knapsack-warmup","unit_type":"solution"},{"canonical_native_record_sha256":"403638470d00cd57f39f3c25f6e1b4a6dc9a82397ea23427fe811b12fe4985ce","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.solution-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.subsubsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:fire-warmup","unit_type":"solution"},{"canonical_native_record_sha256":"be9633d7ed7c6f9eded71fbdba7a6a585ca35f2627263e889077eb70bfcae3b5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.solution-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.subsubsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:facility-small","unit_type":"solution"},{"canonical_native_record_sha256":"ea562233e04f9686d4f07a24bac607ee67cde065a4a9774d1d2e56bd9adeadc7","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.solution-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch15.text.subsubsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:graph-coloring-5","unit_type":"solution"},{"canonical_native_record_sha256":"53eeed366ffe31116d53ebe2df3bfd202e160b167c642f1b03c855bdd3011fec","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.solution-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch15.text.subsubsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:either-or-modes","unit_type":"solution"},{"canonical_native_record_sha256":"16dd1850a99342e8853ec29c2c916c68b55b6b94932271b937f4fc55ece51698","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.solution-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch15.text.subsubsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"solution for ex:fixed-charge","unit_type":"solution"},{"canonical_native_record_sha256":"59d3443cbfdbf531e3dee46836e47fb7d29bdea80aa7e2661d19ca6bbba742b5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penentuan Lokasi Fasilitas Berkapasitas","unit_type":"subsection"},{"canonical_native_record_sha256":"b1df16ada73b57a91279a7d8b8f45f980b09d28bb939768f4d8cb4ba92be598f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penentuan Lokasi Fasilitas Tanpa Kapasitas","unit_type":"subsection"},{"canonical_native_record_sha256":"44460243126a138812651fe4f2135571e2593f53cf275da7615243666243e345","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tantangan","unit_type":"subsection"},{"canonical_native_record_sha256":"22504b5298b438f240f41662ce6ad13d7c97ec9f83800154238edc1a35ecb701","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch15.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi: Model Lokasi Cakupan","unit_type":"subsection"},{"canonical_native_record_sha256":"4eca8299b718c40ee2a421907960026a3a10f509a737f99f8171f3fe663fdc81","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch15.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Asumsi dan Penyederhanaan","unit_type":"subsection"},{"canonical_native_record_sha256":"5880da58924a93f916e49c4f150f35e4e8bde75c2815a1f6b1a26d1fcfe379f8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch15.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Implementasi dan Hasil","unit_type":"subsection"},{"canonical_native_record_sha256":"cb71bc8ca2951aca6e1bccb9e11af143bedd01f4e71bd47d3a93b4aff1695c41","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-007","locale":"id-ID","order":7,"parent_id":"unit.r017.book1.ch15.text.section-004","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Referensi","unit_type":"subsection"},{"canonical_native_record_sha256":"6cbb0bd93f1be5fff61dc486119ceb69795eb27ffdf05f1b6c414c1593dce4b8","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-008","locale":"id-ID","order":8,"parent_id":"unit.r017.book1.ch15.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penutupan (Perampatan Penutupan Himpunan)","unit_type":"subsection"},{"canonical_native_record_sha256":"1b44fa715bf0bcf0a7a79b2fed4383a46e23944507f52472b3f8676e87aa1e20","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-009","locale":"id-ID","order":9,"parent_id":"unit.r017.book1.ch15.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tantangan","unit_type":"subsection"},{"canonical_native_record_sha256":"fa877d59c7e537aff679a6c2679028c363dbdd41733b85aa0a5096c24def0ef5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-010","locale":"id-ID","order":10,"parent_id":"unit.r017.book1.ch15.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi: Program Bilangan Bulat Pemilihan Siklus","unit_type":"subsection"},{"canonical_native_record_sha256":"e8d7989c7b9a93e5f26030a5f166c6deed4c57fadea4eaf83228063ef0e24133","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-011","locale":"id-ID","order":11,"parent_id":"unit.r017.book1.ch15.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Asumsi dan Penyederhanaan","unit_type":"subsection"},{"canonical_native_record_sha256":"1dfd7c5a7f7dc48c1ccf2b2f406d7a270d90e1a40ee3738f8f5a58afe1a679f5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-012","locale":"id-ID","order":12,"parent_id":"unit.r017.book1.ch15.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Implementasi dan Hasil","unit_type":"subsection"},{"canonical_native_record_sha256":"87abbfdd07efdf22a003a6d6b91abd7d972530b0e54e755d01a70c9d417b9728","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-013","locale":"id-ID","order":13,"parent_id":"unit.r017.book1.ch15.text.section-005","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Referensi","unit_type":"subsection"},{"canonical_native_record_sha256":"d3cbe52e3425ae6f20bef4da6107edf53a144b1c14e30fd759fe76b040fac736","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-014","locale":"id-ID","order":14,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala Big-M - Mengaktifkan/Menonaktifkan Pertidaksamaan","unit_type":"subsection"},{"canonical_native_record_sha256":"3c681d8e62dedc7867b50121cc41ac32c70dd4140512fe7832b40b33d5fad5f1","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-015","locale":"id-ID","order":15,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Tantangan","unit_type":"subsection"},{"canonical_native_record_sha256":"5dcac428037685c6eea6ac4f56aa1512a1986a3e09d1c28fe198e56ec9d8d26f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-016","locale":"id-ID","order":16,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi: Program Bilangan Bulat Pengepakan/Konsolidasi","unit_type":"subsection"},{"canonical_native_record_sha256":"c93cf4dcc130e06ec68c8abff796b326b8b7f3f10a24eee2951c2e77fe404e83","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-017","locale":"id-ID","order":17,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Asumsi dan Penyederhanaan","unit_type":"subsection"},{"canonical_native_record_sha256":"2c297ebb46907c21c1e1b13c2f04fe2c06758d4e5a770ab96b427f3389f704c9","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-018","locale":"id-ID","order":18,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Implementasi dan Hasil","unit_type":"subsection"},{"canonical_native_record_sha256":"a862a100cf08ccfc1e2927303736b85dc9af1524b269de71c3983936c04dff34","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-019","locale":"id-ID","order":19,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Referensi","unit_type":"subsection"},{"canonical_native_record_sha256":"9e4301606334ae3548ec98b4ffbef7791360a259d7964efbee6f671e9463ad88","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-020","locale":"id-ID","order":20,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala Salah Satu","unit_type":"subsection"},{"canonical_native_record_sha256":"2d3631de9dc512a76742814382ba0fad9d4460516ca0cda7937f17977f289d4a","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-021","locale":"id-ID","order":21,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Implikasi Jika--maka - Arah Sebaliknya","unit_type":"subsection"},{"canonical_native_record_sha256":"9436181d6b9f0cb232c1cfe242a90fb5e81340b16bec57f3451d7e2e647bed76","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-022","locale":"id-ID","order":22,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Disjungsi Multisuku dengan Penerapan pada Pengepakan 2D","unit_type":"subsection"},{"canonical_native_record_sha256":"e331ccf0f8516e8166ede59e9cb25b6cd3b22d74db7d17abeed6cecd12e2fc11","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-023","locale":"id-ID","order":23,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala SOS1","unit_type":"subsection"},{"canonical_native_record_sha256":"e6daa99cc15781e5e219fd99b1ef84e46b6aa7f18f98029e7794984508de7a96","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-024","locale":"id-ID","order":24,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Kendala SOS2","unit_type":"subsection"},{"canonical_native_record_sha256":"64b83c0f1b2ca9bb8021ac357b8c6cf4e6c121692d9b5e64904bd617b77eae05","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-025","locale":"id-ID","order":25,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Fungsi Linier Sepenggal dengan Kendala SOS2","unit_type":"subsection"},{"canonical_native_record_sha256":"f86d01e642524cd32a7101fec6c3a65675595aee15b6b079ee73691e4b3b54f2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-026","locale":"id-ID","order":26,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memaksimumkan Nilai Minimum","unit_type":"subsection"},{"canonical_native_record_sha256":"babda7c1479d631830a07966ee3e07d252c2ee7ac0993df46ba3a64ee1841849","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-027","locale":"id-ID","order":27,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Merelaksasi Kendala Kesamaan (Nonlinier)","unit_type":"subsection"},{"canonical_native_record_sha256":"4f32a629f4a1427c99ed91ac275553de0a9268b179261c3f69dcd37bb8d46706","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-028","locale":"id-ID","order":28,"parent_id":"unit.r017.book1.ch15.text.section-007","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memodelkan Nilai Mutlak Eksak","unit_type":"subsection"},{"canonical_native_record_sha256":"fdd03b22965336e987733e6057c7bdb04449ec28545a515a65f9ca17b8b35d09","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-029","locale":"id-ID","order":29,"parent_id":"unit.r017.book1.ch15.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Komponen JSSP","unit_type":"subsection"},{"canonical_native_record_sha256":"b5a58a0c69207b73152634be648ef5a078285ed0f89165bdd05418dfa90d6c44","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-030","locale":"id-ID","order":30,"parent_id":"unit.r017.book1.ch15.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Model Matematis","unit_type":"subsection"},{"canonical_native_record_sha256":"0d6b6eb10c0c3fe396f65052f9a3d2c675af747fa1726c54013cf672990c4af4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-031","locale":"id-ID","order":31,"parent_id":"unit.r017.book1.ch15.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Variasi Penjadwalan Job Shop","unit_type":"subsection"},{"canonical_native_record_sha256":"aabab4737ec23650e87db4088d81956d6b67c96f3b1b8ee0d23f76a94f720691","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-032","locale":"id-ID","order":32,"parent_id":"unit.r017.book1.ch15.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Dalam kasus khusus","unit_type":"subsection"},{"canonical_native_record_sha256":"a162ca1aec7a9bc68e996559ef7abd6eebd0c3cf98a9672e53ef2c575c11df22","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-033","locale":"id-ID","order":33,"parent_id":"unit.r017.book1.ch15.text.section-010","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penjelasan definisi","unit_type":"subsection"},{"canonical_native_record_sha256":"3ac3e7bbf409bd99c613b300806e37aa717d295299e0380f24f65d01fdd09321","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsection-034","locale":"id-ID","order":34,"parent_id":"unit.r017.book1.ch15.text.section-011","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Reformulasi Biner Variabel Bilangan Bulat","unit_type":"subsection"},{"canonical_native_record_sha256":"62b681d373010f6f1612923b993431a863fe4f7d51c4f957f1774fbc4bc20b5f","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsubsection-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.subsection-014","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Penerapan: Jaringan Transportasi Kota New York dengan Tol","unit_type":"subsubsection"},{"canonical_native_record_sha256":"a7349fd0a3748a2a85bcc47bf8effcd82c8d330dbcdc8c7c3d57273b90feb1df","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsubsection-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.subsection-022","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Masalah Pengepakan Strip","unit_type":"subsubsection"},{"canonical_native_record_sha256":"70907c72cbf8b67a53f65b2bcfdb3ed4505a0dd67b4f55bc26dc4c37e77fe48d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsubsection-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.subsection-025","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"SOS2 dengan Variabel Biner","unit_type":"subsubsection"},{"canonical_native_record_sha256":"c555f3a734e185695f3e4bd30d7374433268f3bd738e8767597f43a113f38aea","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsubsection-004","locale":"id-ID","order":4,"parent_id":"unit.r017.book1.ch15.text.subsection-028","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Norma $\\ell_1$ Eksak","unit_type":"subsubsection"},{"canonical_native_record_sha256":"74baa2da85cf198cf60bb790fe591f6baa1ce30aacf2fcc477dc3f3b36235a2c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsubsection-005","locale":"id-ID","order":5,"parent_id":"unit.r017.book1.ch15.text.subsection-028","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Memodelkan Maksimum Eksak","unit_type":"subsubsection"},{"canonical_native_record_sha256":"c972a516f6068a4456e06e3118b8d2f572bac0d25cff82aaa8c078166165c0b5","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.subsubsection-006","locale":"id-ID","order":6,"parent_id":"unit.r017.book1.ch15.text.section-012","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"Solusi Terpilih","unit_type":"subsubsection"},{"canonical_native_record_sha256":"fe0c700a9f396656ca49ff6d767e96caf4ef8d8099983f382384805aeb03d1a4","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.table-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.subsection-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"790b014fb03a144a799ce0751381e7325b896d366fb89b7083e9d691e9a8262c","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.table-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.subsection-021","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"5745aac5c84b041b5210209398b22005fb5aa09f1c87e2a871da8c5da7439a1d","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.table-003","locale":"id-ID","order":3,"parent_id":"unit.r017.book1.ch15.text.subsection-021","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"table"},{"canonical_native_record_sha256":"86f506615b633613a01d7e9894eb187554060831cc06e642fe27de55f8d861e2","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.tryit-001","locale":"id-ID","order":1,"parent_id":"unit.r017.book1.ch15.text.section-008","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"4e9ca43d73a2357455fda30fca15f63e4c2473e225958bdb28500276697118d3","concept_ids":["concept.big-m-modeling","concept.binary-integer-programming","concept.facility-location","concept.fixed-charge-model","concept.graph-coloring","concept.integer-linear-programming","concept.job-shop-scheduling","concept.logical-binary-constraints","concept.set-cover"],"edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.ch15.text.tryit-002","locale":"id-ID","order":2,"parent_id":"unit.r017.book1.ch15.text.subsubsection-006","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":null,"title_target":"","unit_type":"tryit"},{"canonical_native_record_sha256":"fa8c034f0fb1ca80b0089d47bb900dec6955d6288c514f363b10a776f7b61c01","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.cover","locale":"mul","order":2,"parent_id":"unit.r017.book1.frontmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"cover"},{"canonical_native_record_sha256":"730043a13dc0c59bc0bec097366a1e063b2f5acc47690428ceb2fceb0f92ab3e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.frontispiece","locale":"mul","order":3,"parent_id":"unit.r017.book1.frontmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"frontispiece"},{"canonical_native_record_sha256":"e16e9f2d4d8e18f331ca04df27c2605d3c9cdfc0948fc068b93bf7910c54d767","edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.frontmatter","locale":"mul","order":1,"parent_id":"unit.r017.book1","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Front matter","title_target":"Bagian awal","unit_type":"frontmatter"},{"canonical_native_record_sha256":"c7016cee9228d0f8b5614e87105b44e714b43412f10f552857132e1ba5c40156","edition_id":"edition.r017.id-id.draft","id":"unit.r017.book1.index","locale":"id-ID","order":22,"parent_id":"unit.r017.book1","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_target":"Indeks","unit_type":"index"},{"canonical_native_record_sha256":"f1daca10b671e5b19ee25c7141c6246dcbbdd607330360b36a7d9b286a60a14d","edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.introduction","locale":"mul","order":2,"parent_id":"unit.r017.book1","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Introduction","title_target":"Pendahuluan","unit_type":"introduction"},{"canonical_native_record_sha256":"a578ce5311023f0abc4f6ae3ccce9050958a1042f4f9451275071f3b08ab2650","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.introduction.text","locale":"mul","order":1,"parent_id":"unit.r017.book1.introduction","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"introduction_text"},{"canonical_native_record_sha256":"891e910da96689e414c279194aa6e058d5b81cb100f5c0e704a847310d38e166","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.introduction.text.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.introduction.text","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Introduction","title_target":"Pendahuluan","unit_type":"chapter"},{"canonical_native_record_sha256":"2edf43f9543fb5b9f7b6d9f4489f29608270f1faa6035339e26ca3db1453d722","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.introduction.text.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.introduction.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Letter to instructors","title_target":"Surat kepada pengajar","unit_type":"section"},{"canonical_native_record_sha256":"0c7c75f43021237d8a411edc8311971ad344457c436d65b177394e92ed3fe672","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.introduction.text.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.introduction.text.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Letter to students","title_target":"Surat kepada mahasiswa","unit_type":"section"},{"canonical_native_record_sha256":"fe34df4bccf6dd9cc8d6a96245bc9196429ece86f83299d2fd4860a5e33eba61","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.introduction.text.subsubsection-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.introduction.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"How to use this book","title_target":"Cara menggunakan buku ini","unit_type":"subsubsection"},{"canonical_native_record_sha256":"67bd2408dfe3fb2ae22a0e0103bc165373168c64a085e76c7acf87064009ccaa","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.introduction.text.subsubsection-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.introduction.text.section-002","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Outline of this book","title_target":"Garis besar buku ini","unit_type":"subsubsection"},{"canonical_native_record_sha256":"8e210ad73eb57b6f5b1edfcaefcc242f1f8f25021404bc2fc655d37dd8ea174e","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.notation","locale":"mul","order":7,"parent_id":"unit.r017.book1.frontmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"notation"},{"canonical_native_record_sha256":"5465ac17e0004999787fc5ce7b51ad94a8f4a8fd4e719ca0f96ed1561c38f444","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.notation.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.notation","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Notation","title_target":"Notasi","unit_type":"chapter"},{"canonical_native_record_sha256":"4bc7c5d8051bcf4fe81ad94f8229e93cada1c6573a5a45b9d54d1c8ce12b7bdb","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.notation.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.notation.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Sets and Number Systems","title_target":"Himpunan dan Sistem Bilangan","unit_type":"section"},{"canonical_native_record_sha256":"6a0113098b51ba3d3bcbbc0668b287abd355405e820f453bb2024d1494767557","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.notation.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.notation.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Vectors and Matrices","title_target":"Vektor dan Matriks","unit_type":"section"},{"canonical_native_record_sha256":"2ffd817e867d14efa66ad34b7a7e335ddbb46d4daad5063c949219e3e0e27896","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.notation.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.notation.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Optimization Problems","title_target":"Masalah Optimisasi","unit_type":"section"},{"canonical_native_record_sha256":"c15d519e4f8f5d45f315e616579c273f05d6d2716b2158ed1befae92edf84086","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.notation.section-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.notation.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Summation and Indexing","title_target":"Penjumlahan dan Pengindeksan","unit_type":"section"},{"canonical_native_record_sha256":"bb902ea96c398dce1f86f9c29ab35de6caee0f44b16dec56aedf3ae5a8a2b99a","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.notation.section-005","locale":"mul","order":5,"parent_id":"unit.r017.book1.notation.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Functions and Operators","title_target":"Fungsi dan Operator","unit_type":"section"},{"canonical_native_record_sha256":"74ebf3bbd886b87c6e3cdb53042b67be8a02169e37f5a0ececbd8dd98534debf","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.notation.section-006","locale":"mul","order":6,"parent_id":"unit.r017.book1.notation.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Complexity Classes","title_target":"Kelas Kompleksitas","unit_type":"section"},{"canonical_native_record_sha256":"a489af45aa430a100f9ed52ec4852aa49e6016a1190abb96cea27c2a6cf50600","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.notation.section-007","locale":"mul","order":7,"parent_id":"unit.r017.book1.notation.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Common Abbreviations","title_target":"Singkatan Umum","unit_type":"section"},{"canonical_native_record_sha256":"6a7cae228d189e4ff86012c6b3ccb553ad341442c2e5c769122c2d93f34ed3fd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.preface","locale":"mul","order":4,"parent_id":"unit.r017.book1.frontmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"preface"},{"canonical_native_record_sha256":"32fe158c581926215949e41b7fbd161be87e6b025530be7f44119b13866a4e0c","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.preface.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.preface","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Preface","title_target":"Prakata","unit_type":"chapter"},{"canonical_native_record_sha256":"c975bbcc849f35dd47924c0898020f9021b41ca2a98346c3575532c8129c20cc","edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.solutions-manual","locale":"mul","order":18,"parent_id":"unit.r017.book1","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"verified","supersedes_id":null,"title_source":"Solutions Manual","title_target":"Manual Solusi","unit_type":"solutions_manual_collection"},{"canonical_native_record_sha256":"64581c0f42f522cc545f65b0f2ad4f51b296b08b6702ad8c4dc219db092b7e61","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.sources","locale":"mul","order":5,"parent_id":"unit.r017.book1.frontmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"attribution"},{"canonical_native_record_sha256":"9c159ac9483ba7121bf3952531c5866c30a02f1b7c52d9750aabbdfe7455a886","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.sources.chapter-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.sources","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Sources and Attribution","title_target":"Sumber dan Atribusi","unit_type":"chapter"},{"canonical_native_record_sha256":"d626f813b3b1fbf9c7ebcace8b8b50c8e1aa0c68a51f714c2871313a70198a19","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.sources.section-001","locale":"mul","order":1,"parent_id":"unit.r017.book1.sources.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Adapted Open-Source Textbooks and Notes","title_target":"Buku Teks dan Catatan Sumber Terbuka yang Diadaptasi","unit_type":"section"},{"canonical_native_record_sha256":"e1c9568cf20a8a2556c113101730111db14c10dd1906da028025d65d64655a74","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.sources.section-002","locale":"mul","order":2,"parent_id":"unit.r017.book1.sources.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Image Attributions","title_target":"Atribusi Gambar","unit_type":"section"},{"canonical_native_record_sha256":"c0fecbe61c4c097dacdb0b2287768af9db0afc364debf0a551b297d8110f0cdf","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.sources.section-003","locale":"mul","order":3,"parent_id":"unit.r017.book1.sources.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"Other Acknowledgements","title_target":"Ucapan Terima Kasih Lainnya","unit_type":"section"},{"canonical_native_record_sha256":"5d2fe7a8c316fb643e66b1cbd595e21935082a6ae6b61eade528604ba4f64716","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.sources.section-004","locale":"mul","order":4,"parent_id":"unit.r017.book1.sources.chapter-001","resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"translated","supersedes_id":null,"title_source":"License Compatibility Summary","title_target":"Ringkasan Kompatibilitas Lisensi","unit_type":"section"},{"canonical_native_record_sha256":"71918741900f1ee54ba5945cb5a2d91d8c70684f74a4771340cf5c8626ef2ebd","concept_ids":[],"edition_id":"edition.r017.upstream.1745df89","id":"unit.r017.book1.title","locale":"mul","order":1,"parent_id":"unit.r017.book1.frontmatter","prerequisite_concept_ids":[],"resource_id":"resource.r017.open-optimization-book","rights_component_id":"rights.r017.content","status":"draft","supersedes_id":null,"unit_type":"title"}]}